• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.45-58
• /
• 2020

In the current trend of increasing network traffic due to the popularization of cloud service and mobile devices, WAN bandwidth is very low compared to LAN bandwidth. In a WAN environment, a WAN optimizer is needed to overcome performance problems caused by transmission protocol, packet loss, and network bandwidth limitations. In this paper, we analyze the data deduplication algorithm of WANProxy, an open source WAN optimizer, and evaluate its performance in terms of network latency and WAN bandwidth. Also, we evaluate the performance of the two-stage compression method of WANProxy and Zstandard. We propose a new method to improve the performance of WANProxy by revising its data deduplication algorithm and evaluate its performance improvement. We perform experiments using 12 data files of Silesia with a data segment size of 2048 bytes. Experimental results show that the average compression rate by WANProxy is 150.6, and the average network latency reduction rates by WANProxy are 95.2% for a 10 Mbps WAN environment and 60.7% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, the two-stage compression of WANProxy and Zstandard increases the average compression rate by 33%. However, it increases the average network latency by 2.1% for a 10 Mbps WAN environment and 5.27% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, our proposed method increases the average compression rate by 34.8% and reduces the average network latency by 13.8% for a 10 Mbps WAN and 12.9% for a 100 Mbps WAN, respectively. Performance analysis results of WANProxy show that its performance improvement in terms of network latency and WAN bandwidth is excellent in a 10Mbps or less WAN environment while superior in a 100 Mbps WAN environment.

• Journal of the Institute of Convergence Signal Processing
• /
• v.17 no.2
• /
• pp.53-60
• /
• 2016

In this paper, we introduce the implementation and test results of a new method of correlated result storage to achieve the full performance of the Daejeon hardware correlator. Recently, the observation of 8 Gbps speed, which is the maximum observational standard of KVN(Korean VLBI Network), has been performed. The correlation processing using the Daejeon hardware correlator is also required. Therefore, a new correlation result storage introduction has become necessary. The maximum correlation result output speed of the Daejeon hardware correlator is 1.4 GB/sec per 25.6 ms integration time. The conventional correlation result storage system can not cope with the maximum correlation output speed of the Daejeon hardware correlator, and the output speed is limited to 1/4. That is, among the four input ports of the Daejeon hardware correlator, the three inputs are limited to correspond to the observation rate of 1 Gbps. This new storage system uses the Gluster file system among many of the latest technologies used in storage systems. In tests that meet the maximum output rate of 1.4 GB/sec for the Daejeon hardware correlator, 350 MB/sec for each of the four optical outputs, resulting in 1.4 GB/sec in total.

• Restorative Dentistry and Endodontics
• /
• v.24 no.2
• /
• pp.337-345
• /
• 1999

The purpose of this study was to compare the shape of root canal after instrumentation with some engine driven NiTi files. Thirty narrow and curved canals(15-35 degree) of mesial canals of extracted human mandibular first molars were divided into three groups. Group 1: After radicular access with Gates Glidden drill, apical shaping using step back method with Flexo file Group 2: After radicular access with Gates Glidden drill, apical shaping with Profile .04 Group 3: Canal shaping with GT file and Profile .04. Using modified Bramante technique, the root was sectioned at 2 mm from apical foramen, height of curvature, 2 mm from canal orifice. Canal centering ratio, amount of transport, amount of dentin removed, shape of canal were measured and statistical analysis is done using SPSS Program V 7.5. The results were as follows: 1. Canal centering ratio of group 3 was the lowest at coronal part, but there was no statistical difference. Centering ratio of group 2 was the lowest at curve part, and there was statistical difference between group 1(P<0.05). Centering ratio of group 2 was the lowest at apical part, but there was no statistic difference. 2. Amount of transport of group 3 was the lowest at coronal part, but there was no statistical difference. Amount of transport of group 2 was the lowest at curve part, and there was statistical difference between group 1(P<0.05). Amount of transport of group 3 was the lowest at apical part, and there was statistical difference between group 1 and group 2, group 1 and group 3(P<0.05). 3. Amount of dentin removed of group 3 was the lowest at coronal part, bur there was no statistical difference. Amount of dentin removed of group 2 was the lowest at curve part, but there was no statistical difference. Amount of dentin removed or group 2 was the lowest at apical part, and there was statistical difference between group 1 and group 2, group 1 and group 3(P<0.05). 4. The shape of the canals after instrumentation varied among the groups. The majority of canals at coronal and curve part for group 1 were round in shape(7 in 10), those at apical part were oval(8 in 10). The majority of canals at coronal part for group 2 were round in shape(7 in 10) and there was no difference in the number of shape at other part. There was no difference in the number of shape at every part for group 3. As above results, NiTi rotary instrumentation showed a trend to remain more centered in the canal than SS file instrumentation. At using NiTi file, coronal shaping with Gates Glidden drill was not statistically different from shaping with GT file. But shaping with GT file showed tapered canals, so it may be said that shaping with GT file is a safe and valuable instrumentation method.

• Journal of Intelligence and Information Systems
• /
• v.13 no.1
• /
• pp.59-79
• /
• 2007

P2P (Peer to Peer) techniques have been well applied to file sharing due to its cost-effectiveness and convenience. Dynamic network evolution is another good thing for P2P according to addition and deletion of nodes and change of files a node has. Our research proposes a P2P-based KMS (Knowledge Management System). Knowledge of enterprises spreads all over sub-organizations like oversea factories and sales departments and is changed in dynamic manner. P2P techniques are, therefore well matched with knowledge management domain. In order to increase search efficiency, we introduce social network theory into P2P-based KMS. Social network technique makes the most similar nodes (in KMS domain, nodes which has the most similar knowledge) its own neighbors, which makes eventually search efficiency increase. We developed our prototype system P2P-SN-KMS and evaluated by simulation.

• Journal of Pharmacopuncture
• /
• v.18 no.2
• /
• pp.7-18
• /
• 2015

Objectives: Lawsone (1,4 naphthoquinone) is a non redox cycling compound that can be catalyzed by DT diaphorase (DTD) into 1,2,4-trihydroxynaphthalene (THN), which can generate reactive oxygen species by auto oxidation. The purpose of this study was to evaluate the toxicity of the phytomarker 1,4 naphthoquinone and its metabolite THN by using the molecular docking program AutoDock 4. Methods: The 3D structure of ligands such as hydrogen peroxide ($H_2O_2$), nitric oxide synthase (NOS), catalase (CAT), glutathione (GSH), glutathione reductase (GR), glucose 6-phosphate dehydrogenase (G6PDH) and nicotinamide adenine dinucleotide phosphate hydrogen (NADPH) were drawn using hyperchem drawing tools and minimizing the energy of all pdb files with the help of hyperchem by $MM^+$ followed by a semi-empirical (PM3) method. The docking process was studied with ligand molecules to identify suitable dockings at protein binding sites through annealing and genetic simulation algorithms. The program auto dock tools (ADT) was released as an extension suite to the python molecular viewer used to prepare proteins and ligands. Grids centered on active sites were obtained with spacings of $54{\times}55{\times}56$, and a grid spacing of 0.503 was calculated. Comparisons of Global and Local Search Methods in Drug Docking were adopted to determine parameters; a maximum number of 250,000 energy evaluations, a maximum number of generations of 27,000, and mutation and crossover rates of 0.02 and 0.8 were used. The number of docking runs was set to 10. Results: Lawsone and THN can be considered to efficiently bind with NOS, CAT, GSH, GR, G6PDH and NADPH, which has been confirmed through hydrogen bond affinity with the respective amino acids. Conclusion: Naphthoquinone derivatives of lawsone, which can be metabolized into THN by a catalyst DTD, were examined. Lawsone and THN were found to be identically potent molecules for their affinities for selected proteins.

• Journal of the Korean association of regional geographers
• /
• v.17 no.5
• /
• pp.600-616
• /
• 2011

Since the Shimane Prefecture government in Japan enacted "Takeshima Day" in March 2005, it has held commemorative ceremonies with Japanese politicians present each year on February 22. Japan has marked Dokdo as its territory in elementary and middle high school textbooks, and the number of such references has been increasing in recent years. Shimane Prefecture, which is the area nearest to Dokdo is strengthening Dokdo education in its geography classes at elementary and middle schools as part of regional studies. The study and education on Dokdo was begun by social studies teachers in the Oki Islands in Shimane Prefecture, but now extends throughout the prefecture. The auxiliary educational materials regarding Dokdo produced in Shimane Prefecture include teaching guidelines for teachers, worksheets for students, CDs containing statistics and picture files, and two kinds of DVD movie clips for each grade. In particular, schools teach the damage to the Japanese fishery industry caused by Korea's illegal occupation of Dokdo. This will likely form anti-Korean sentiments among Japanese students. It is hoped that Korean and Japanese scholars will work together to develop Dokdo auxiliary textbooks in order to improve the correct historical understanding of Dokdo.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.19 no.4
• /
• pp.246-251
• /
• 2017

Crop models have been used to predict a heading date for efficient management of fertilizer application. Recently, the ORYZA (v3) model was developed to improve the ORYZA2000 model, which has been used for simulation of rice growth in Korea. Still, little effort has been made to assess applicability of the ORYZA (v3) model to rice farms in Korea. The objective of this study was to evaluate reliability of heading dates predicted using the the ORYZA (v3) model, which would indicate applicability of the model to a decision support system for fertilizer application. Field experiments were conducted from 2015-2016 at the Rural Development Administration (RDA) to obtain rice phenology data. Shindongjin cultivar which is mid-late maturity type was grown under a conventional fertilizer management, e.g., application of fertilizer at the rate of 11 Kg N/10a. Another set of heading dates was obtained from annual reports at experiment farms operated by the National Institute of Crop Science and Agricultural Technology Centers in each province. The input files for the ORYZA (v3) model were prepared using weather and soil data collected from the Korean Meteorology Administration (KMA) and the Korean Soil Information System, respectively. Input parameters for crop management, e.g., transplanting date and planting density, were set to represent management used for the field experiment. The ORYZA (v3) model predicted heading date within 1 day for two seasons. The crop model also had a relatively small error in prediction of heading date for three ecotypes of rice cultivars at experiment farms where weather input data were obtained from a near-by weather station. Those results suggested that the ORYZA (v3) model would be useful for development of a decision support system for fertilizer application when reliable input data for weather variables become available.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.641-649
• /
• 2004

The relationship between chemical structures and biological activities is researched briskly in the area of 'Medicinal Chemistry' At the base of these structure-based drug design tries, medicinal chemists search the existing drugs of similar chemical structure to target drug for the development of a new drug. Therefore, it is such necessary that an automatic system selects drug files that have a set of chemical moieties matching a user-defined query moiety. Substructure searching is the process of identifying a set of chemical moieties that match a specific query moiety. Testing for substructure searching was developed in the late 1950s. In graph theoretical terms, this problem corresponds to determining which graphs in a set are subgraph isomorphic to a specified query moiety. Testing for subgraph isomorphism has been proved, in the general case, to be an NP- complete problem. For the purpose of overcoming this difficulty, there were computational approaches. On the 1990s, a US patent has been granted on an atom-centered indexing scheme, used by the RS3 system; this has the virtue that the indexes generated can be searched by direct text comparison. This system is commercially used(http://www.acelrys.com/rs3). We define the RS3 system's drawback and present a new indexing scheme. The RS3 system treats substructure searching with substring matching by means of expressing chemical structure aspredefined strings. However, it has insufficient 'rerall' and 'precision‘ because it is impossible to index structures uniquely for same atom and same bond. To resolve this problem, we make the minimum-cost- spanning tree for one centered atom and describe a structure with paths per levels. Expressing 2D chemical structure into 1D a string has limit. Therefore, we break 2D chemical structure into 1D structure fragments. We present in this paper a new index technique to improve recall and precision surprisingly.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.2
• /
• pp.86-100
• /
• 2015

Cloud computing is a computing term that evolved in the late 2000s, based on utility and consumption of computer resources. Google say that "Cloud computing involves deploying groups of remote servers and software networks that allow different kinds of data sources be uploaded for real time processing to generate computing results without the need to store processed data on the cloud. Cloud computing relies on sharing of resources to achieve coherence and economies of scale, similar to a utility (like the electricity grid) over a network. At the foundation of cloud computing is the broader concept of converged infrastructure and shared services. Cloud computing, or in simpler shorthand just "the cloud", also focuses on maximizing the effectiveness of the shared resources." The cloud service is a smart and/or intelligent service to save private files in any device, anytime, anywhere. Dropbox, OAuth, PAClous are required that the accumulated user's data are archives with cloud service. Currently we suggest an implementation technique to process many tasks to the cloud server with a thread pooling. Thread pooling is one of efficient implementating technique for client and service environment. In this paper, to present the implementation technique we suggest three diagrams in the consideration of software engineering.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.5
• /
• pp.1013-1022
• /
• 2017

Windows hibernation is a function that stores data of physical memory on a non-volatile media and then restores the memory data from the non-volatile media to the physical memory when the system is powered on. Since the hibernation file has memory data in a static state, when the attacker collects it, key information in the system's physical memory may be leaked. Because Windows does not support protection for hibernation files only, we need to protect the memory that is written to the hibernate file. In this paper, we propose a method to encrypt the physical memory data in the hibernation file to protect the memory data of the processes recorded in the hibernation file. Hibernating procedure is analyzed to encrypt the memory data at the hibernating and the encryption process for hibernation memory is implemented to operate transparently for each process. Experimental results show that the hibernation process memory encryption tool showed about 2.7 times overhead due to the crypt cost. This overhead is necessary to prevent the attacker from exposing the plaintext memory data of the process.