• Journal of Conservation Science
• /
• v.5 no.2 s.6
• /
• pp.51-56
• /
• 1996

This paper deals with the restoration of ancient wooden bridge foundation which excavated in Seta river Shiga Prefecture, Japan. Shiga Archeological Research started a marine archeological investigation of the bridge foundation in 1987. The bridge foundation stricture excavated and have since then recovered about a lots of woods and another materials. The bridge foundation structure constructed log, timbers and stones. The species of those waterlogged wood were identified as two types, hardwood and softwood. Hardwood(log : Cyclobalanopsis) was used for below foundation and softwood (timber' Chamaecyparis obtusa Endl. Cupreessaceae) was used for base structure. One of those timber sample dated by dendrochronology, we asked Dr. Misutani*. The softwood gave a felling date of 567 A.D. In result, the ancient Seta bridge foundation structure had constructed between Asuka and Nara period. We healed the news that ancient bridge foundation excavated at Woljyongyo site in Kyongju, Korea 1987. The bridge foundation Setakarahashi is similar in plane and structure to Woljyongyo structures. The Woljyongyo site report had be of value for reference. We had planning to restore those woods. Hardwood log was got serious damage. The water content varies from 400 to $600\%$. The other timbers water content varies about $200\%$. In the Shiga Center for Archaeological Operations and the Azuchi Castle Archaeological Museum, we set up the PEG impregnation tank. Those wooden objects treated by PEG method. PEG with a molecular weight of 4000. The treatment results may be considered satisfactory. The ancient wooden Seta bridge was reconstructed in Biwako Museum which established in Oct. 1996. We must take care of indoor exhibition environments. (*Nara National Cultual Properties Research Institute).

• Journal of applied mathematics & informatics
• /
• v.5 no.1
• /
• pp.141-152
• /
• 1998

Based on the geometric representation an efficient al-gorithm is designed to find all articulation points of a permutation graph. The proposed algorithm takes only O(n log n) time and O(n) space where n represents the number of vertices. The proposed se-quential algorithm can easily be implemented in parallel which takes O(log n) time and O(n) processors on an EREW PRAM. These are the first known algorithms for the problem on this class of graph.

• Journal of Korea Multimedia Society
• /
• v.11 no.11
• /
• pp.1601-1614
• /
• 2008

The number of web service users has been increased rapidly as existing services are changed into the web-based internet applications. Therefore, it is necessary for us to use web log pre-processing technique to detect attacks on diverse web service transactions and it is also possible to extract web mining information. However, existing mechanisms did not provide efficient pre-processing procedures for a huge volume of web log data. In this paper, we proposed both a field based parsing and a high-speed log indexing mechanism based on the suggested B-tree Index Vector structure for performance enhancement. In experiments, the proposed mechanism provides an efficient web log pre-processing and search functions with a session classification. Therefore it is useful to enhance web attack detection function.

• Journal of Korea Multimedia Society
• /
• v.24 no.4
• /
• pp.558-568
• /
• 2021

The digital image to be accepted as legal evidence, it is important to verify the authentication of the digital image. This study proposes a method of authenticating digital images through three steps of comparing the file structure of digital images taken with iPhone, analyzing the encoding information as well as media logs of the iPhone storing the digital images. For the experiment, digital image samples were acquired from nine iPhones through a camera application built into the iPhone. And the characteristics of file structure and media log were compared between digital images generated on the iPhone and digital images edited through a variety of image editing tools. As a result of examining those registered during the digital image creation process, it was confirmed that differences from the original characteristics occurred in file structure and media logs when manipulating digital images on the iPhone, and digital images take with the iPhone. In this way, it shows that it can prove its forensic authentication in iPhone.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.11
• /
• pp.613-619
• /
• 2001

The IP address lookup problem is to find the longest matching IP prefix for a given IP address from the routing table and has been a central bottleneck in speeding up the Internet. In this paper, we propose a new algorithm for this problem based on the segment tree data structure. Given n IP prefixes, our algorithm can do IP address in Ο(log n) time. It also handles the insertion and deletion of IP prefixes efficiently without rebuilding the total data structure.

• Korean Journal of Soil Science and Fertilizer
• /
• v.40 no.3
• /
• pp.189-195
• /
• 2007

Using fractal dimensionality theory proposed by Riew and Sposito (1991), we attempted to analyze quantitatively the characteristics of porous distribution for built-in soils in the mini-lysimeter and artificial seed-bed media. The 2" stainless core soil samples were taken from lysimeter soils. Artificial seed-bed media were compacted in the acrylic core filled with raw materials consisted of cocopeat, zeolite and perlite. N (Constant number of partitioned group size smaller media volumes) and r (Self-similarity ratio) parameters consisting of fractal dimension D=log(N)/log(1/r) were obtained by Excel Programme using the Riew and Sposito's fractal model. The pore distribution of tested media was screened in pore size and its occurring frequency. The results reveal that the distribution range of pores is wider in the lysimeter soils than in the seed-bed media, while average size of pores in the media is smaller in lysimeter core soils than in seed-bed media.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.11 no.3
• /
• pp.11-18
• /
• 1991

Volatile organic compounds(VOC) present in or generated by many sources, can be toxic, mutagenic or even carcinogenic, so that control of such emissions is significant. The 6 chlorinated organic chemicals as VOC were examined in this study. Prediction of the behavior of VOC on activated carbon beds is an important part of control system design. The objective of this study was to predict gas phase sorption isotherms from physical properties and liquid phase isotherms obtained with the same adsorbent and adsorbate. One of the techniques that was investigated was quantitative structure-activity relationships(QSAR) for the predicition procedures. It was possible to estimate sorption isotherms in the gas phase($a_g$) using either connectivity index, $^2{\chi}$, and the Henry's law coefficient ($H_a$) or the solubility and the equilibrium concentration in the gas phase. As a result of study, the predictive equation based on Freundlich model for $a_g$ was ${\log}\;a_g=0.238\;^2{\chi}+0.573\;{\log}\;H_a+4.330(r^2=0.94)$. Finally, this would provide a potentially useful tool to describe and predict sorption capacity without time-consuming tests.

• Korean Management Science Review
• /
• v.11 no.3
• /
• pp.1-11
• /
• 1994

Recent advances in linear programming solution methodology have focused on interior point methods. This powerful new class of methods achieves significant reductions in computer time for large linear programs and solves problems significantly larger than previously possible. These methods can be examined from points of Fiacco and McCormick's barrier method, Lagrangian duality, Newton's method, and others. This study presents a primal-dual log barrier algorithm of interior point methods for linear programming. The primal-dual log barrier method is currently the most efficient and successful variant of interior point methods. This paper also addresses a Cholesky factorization method of symmetric positive definite matrices arising in interior point methods. A special structure of the matrices, called supernode, is exploited to use computational techniques such as direct addressing and loop-unrolling. Two dense matrix handling techniques are also presented to handle dense columns of the original matrix A. The two techniques may minimize storage requirement for factor matrix L and a smaller number of arithmetic operations in the matrix L computation.

• The Korean Journal of Applied Statistics
• /
• v.18 no.2
• /
• pp.395-410
• /
• 2005

For the analysis of large tables formed by many categorical variables, we suggest a method to group the variables into several disjoint groups in which the variables are completely associated within the groups. We use a simple function of Kullback-Leibler divergence as a similarity measure to find the groups. Since the groups are complete hierarchical sets, we can identify the association structure of the large tables by the marginal log-linear models. Examples are introduced to illustrate the suggested method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.303-309
• /
• 2006

By combining the space-time diversity technique and iterative turbo codes, space-time turbo codes(STTCS) are able to provide powerful error correction capability. However, the multi-path transmission and iterative decoding structure of STTCS make the decoder very complex. In this paper, we propose a low complexity decoder, which can be used to decode STTCS as well as general iterative codes such as turbo codes. The efficient implementation of the backward recursion and the log-likelihood ratio(LLR) update in the proposed algorithm improves the computational efficiency. In addition, if we approximate the calculation of the joint LLR by using the approximate ratio(AR) algorithm, the computational complexity can be reduced even further. A complexity analysis and computer simulations over the Rayleigh fading channel show that the proposed algorithm necessitates less than 40% of the additions required by the conventional Max-Log-MAP algorithm, while providing the same overall performance.