본 연구는 아미노산 스포츠 음료를 개발하기 위하여 음료 베이스로 영지버섯, 차가버섯, 상황버섯복합버섯 균사 체 추출물을 사용하여 제조하였다. 차가버섯, 상황버섯. 영지버섯은 베타글루칸 다량 함유하여 면역증강작용과 같 은 인체에 유용한 성분을 다량 함유하고 있다고 다수의 연구에서 보고하고 있다. 선행연구에 의하면 3종의 버섯 균사체 추출물의 항산화 활성을 비교한 결과, 매우 높은 활성을 보여 스포츠 음료나 건강 음료의 재료로 적합할 것으로 판단되어 본 연구에 사용하였다. 3종의 버섯 균사체를 배양한 후 80℃, 60min 가열 추출하여 아미노산 음료 베이스로 사용하였고, 아르기닌을 포함한 필수 아미노산과 레몬, 자몽, 다크체리 농축액을 혼합하여 각각 3, 5, 7% 로 첨가하여 스포츠 음료를 제조하고 그 특성을 비교하였다. 개발 스포츠 음료의 고형분 함량은 농도에 비례해서 약 3.0~7.2brix로 측정되었고, pH도 3.94~4.37범위였다. 이들 스포츠 음료의 항산화 활성을 비교한 결과는 다음과 같다. 총 페놀 함량은 레몬·자몽(LG)첨가 음료가 약 726.74~798.87mg/L로 높게 측정되었고, 체리(C)첨가 음료는 585.03~794.73mg/L이었다. DPPH 라디칼 소거능을 비교한 결과, LG7이 71.57%로 체리 첨가 음료보다 가장 높게 측 정되었다. 반면, 총 플라보노이드 함량을 비교한 결과, C7이 53.35mg/L로 높았으나, 다른 시료들도 유의적으로 높아, 총 플라보노이드 함량은 과일농축액의 종류와 농도에 크게 영향을 받지 않은 것으로 관찰되었다. 따라서 본 연 구에서 개발된 스포츠 음료는 생리활성이 높게 규명된 재료를 사용하였고, 필수 아미노산을 첨가하여 제조한 제품으로 스포츠 활동을 한 후 단백질 보충용 음료로써의 기능을 할 수 있을 것으로 예상된다.

Euclidean Voronoi diagram of spheres in 3D has not been explored as much as it deserves even though it has significant potential impacts on diverse applications in both science and engineering. In addition, studies on the data structure for its topology have not been reported yet. Presented in this paper is the topological representation for Euclidean Voronoi diagram of spheres which is represented as a cell structure as one of typical non-manifold models. The topological representation is a variation of radial edge data structure with a consideration on the topological characteristics of Euclidean Voronoi diagram of spheres distinguished from general non-manifold models and Euclidean Voronoi diagram of points. Various topological queries in the Voronoi diagram are also presented and analyzed.

It is known that Voronoi diagrams have many important applications in science and engineering as a useful tool for analyzing spatial properties among geometric objects. In this paper, we propose an algorithm to construct Euclidean Voronoi diagram for spheres in 3-dimensional space. Starting from the ordinary Voronoi diagram of centers of spheres, the proposed region-expansion algorithm constructs the desired diagram by expanding Voronoi regions for one sphere after another via a series of topology operations. While the worst-case time complexity is O(n3 log n) for the whole diagram, its expected time complexity can be much smaller.

Being in an internet era, the rapid transmission of 3D mesh models is getting more important and efforts toward the compression of various aspects of mesh models have been provided. Even though a mesh model usually consists of coordinates of vertices and properties such as colors and normals, topology plays the most important part in the compression of other information in the models. Despite the extensive studies on Edgebreaker, the most frequently used and rigorously evaluated topology compressor, the probability distribution of its five op-codes, C, R, E, S, and L, has never been rigorously analyzed yet. In this paper, we present probability distribution of the op-codes which is useful for both the optimization of the compression performance and a priori estimation of compressed file size.

STEP is the international standard for the computer-interpretable representation and exchange of product data. STEP physical file as the implementation method of STEP generally has a large file size which may be an obstacle of efficient use and seamless transition through network. Therefore, the compression of STEP physical file has been interested recently. In this paper, we present the compression algorithm of STEP physical file. STEP physical file is compressed by LZ77 with an appropriate search buffer size for STEP physical file and Huffman coding is applied to the result of LZ77. The proposed algorithm obtains the significant compression ratio.

Since transmitting various files around Internet is one of common activities in everyday life, the compression is important technical issue in these days. Shape models are also frequently transmitted and therefore its compression has also been studied. Considering the large portion of shape model can be normal vectors, a new scheme was recently presented to compress normal vectors using clustering and mixed indexing scheme. Presented in this paper is a mathematical investigation of the scheme to analyze the probability distribution of normal index distances in Normal Index array which is critical for the compression. The probability distribution is formulated so that the values can be easily calculated once the relative probabilities of C, R, E, S, and L op-codes in Edgebreaker are known. It can be shown that the distribution of index distances can be easily transformed into a few measures for the compression performance of the proposed algorithm.

The problems of various research fields such as molecular modeling may be represented as circles with inclusion relations. Given n circles in the plane, the recognition of inclusion relations for a set of circles can be a tool to reason about geometric problems on 2D. In this paper, we introduce O(nlogn) algorithm to find these relations for the circles and this algorithm make possible maintaining the geometric data hierarchy in the geometric data processing aspect.

We propose a new algorithm for a classical problem in the planer computational geometry: computing a shortest path between two points in the presence of circular obstacles. Proposed algorithm actually computes a path tree that encodes a shortest path between given two points. Types of path are defined as a tangent line segment between circles, between point and circle, or as an arc. Using circle set voronoi diagram, geometric information that is very useful to search circles is obtained. The key of proposed algorithm is the reduction of the number of circles to need for constructing path tree. The main advantages of our algorithm are its robustness, speed, and the simplicity in implementation.