The purpose of this study was to explore the potential of agricultural heritage as a sustainable agricultural and rural paradigm with a focus on the “Argan-based agro-sylvo-pastoral system in the area of Ait Souab-Ait Mansour”, a Globally Important Agricultural Heritage Systems (GIAHS) site in Morocco. Based on the inscription criteria of the GIAHS, we analyzed the economic-industrial, sociocultural, and ecological-environmental perspectives and presented strategies for revitalizing agricultural and rural development cooperation through the Moroccan Argan GIAHS. The argan tree has been a source of economic, cultural, and environmental stability for the Berber people for centuries, but today it is exposed to many threats. In particular, the declining consumption of argan oil by Berbers, the lack of financial independence of women's cooperatives, and the over-exploitation of the tree suggest that it is time to balance the three pillars of environmental, economic, and social sustainability that development has sought to achieve. Agricultural heritage can be preserved when local people take ownership of their heritage and utilize it to generate economic activities. Only a symbiotic way of life between humans and agricultural heritage can overcome the possibilities and limitations of the ecological environment and generate local value through the accumulation of knowledge, technology, and culture. Only on these premises, can local self-sustaining development based on the pluralistic values and public functions of the world's important agricultural heritage be possible.

본 연구에서는 도로의 증가와 더불어 급속히 증가하고 있는 터널에서 차량이 터널에 진입할 때의 속도편차를 분석하여 터널입구부의 안전성을 증진할 수 있는 방안에 대하여 연구하였다. 터널의 존재는 운전자에게 그 자체만으로서 단순한 오르막 경사보다 더 큰 속도 감소를 유발하며, 터널 입구부에서 발생하는 차량 충돌사고는 다른 도로구간에서 발생하는 사고와 비교해 볼 때 피해가 더 크다. 따라서 사고로 인한 피해를 경감시키기 위해 터널 입구부에 PE방호벽이나 가드레일 등의 안전시설을 설치하고 있지만, 운전자에게 이것은 또 다른 장애물로 인식될 수 있다. 터널 입구부에 설치되어 있는 안전시설물의 형태는 크게 PE방호벽, 가드레일, PE 드럼 등이 있으나, 본 연구에서는 고속도로터널 입구에 일반적으로 가장 많이 설치되어 있는PE방호벽과 운전자에게 장애물로 인식될 수 있는 이러한 안전시설물이 설치되어 있지 않은 경우로 크게 구분하였다. 또한 터널 내부로 진입 할 때 갓길을 포함 우측방여유폭의 차이가 큰 경우와 작은 경우로 구분하였다. 4가지 형태의 터널 입구부에서의 차량속도와 일반도로구간에서의 YDS(차량검지체계)로 수집된 속도의 차이를 분석에 사용하였다. 통계적 검증을 통하여 안전시설물 설치 형태와 우측방여유폭의 차이에 따른 각 Case별 유의성을 검토하여 터널 입구부 안전성 증진을 위한 대안을 제시하고자 한다.

The purpose of this study is to inspect the possibility of changing teacher-centered language learning into learner-centered one emphasizing learner’s interaction with self-directed learning contents available on-line for high school students. This study is to develop onㆍoff blended contents and apply them into classroom environment. It also discusses the kind of contents teachers and learners want to use. Reading parts for each lesson are usually dealt for three class hours in high schools. So it is designed that the first and the third period are done through off-line classroom and the second, on-line. Well-linked with the first and third period, on-line contents for the second period were designed, developed and applied into educational environment. More than expected number of teachers and learners were pleased with on-line contents reaching 80~90% of high level in satisfaction and also showed 65% reaching learners’ interaction rate in off-line classroom. If on？off blended learning model is well structured based on enough researches, it will realize its strong potential as a desirable learning model for reading.

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.

2차원 평면에 원형 장애물들이 주어져 있을 때, 주어진 시작점과 끝점을 잇는 최단 경로를 구하는 문제를 다룬다. 이 때, 원형 장애물들은 서로 교차하지 않으며, 반지름이 각기 다르다고 가정한다. 최단 경로를 효율적으로 구하기 위해서, 본 논문에서는 두 가지의 필터를 제안한다. 첫 번째는 타원 필터이고, 두 번째는 컨벡스-헐 필터이다. 장애물들을 피하면서 주어진 두 점을 연결하는 최단 경로를 구하기 위해서는, 주어진 2차원 공간을 탐색하여야 하는데, 위의 두 필터는 최단 경로와 만나지 않게 되는 원형 장애물들을 미리 걸러냄으로써, 탐색 공간을 효율적으로 줄여준다. 또한 보로노이 다이어그램을 이용하면, 장애물들 간의 인접 정보를 효과적으로 활용할 수 있다. 필터링을 한 후에는 다익스트라 알고리즘을 이용하여 최단 거리를 구한다.

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 coor-dinates of vertices and

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.

Presented in this paper is an algorithm to compute a Voronoi diagram of circles in a circle, where circles are located in a large circle. Given circles in a large circle, the region in the plane is divided into regions associated with the given circles. The proposed algorithm uses point Voronoi diagram, and then some topological remedies are applied so that we obtain proper initial topology including enclosing circle. From this initial topology, we can obtain the correct topology by a series of edge-flip operations. After getting the correct topology, the equations of edges are computed and represented in a rational quadratic Bézier curve form.

This research explains visualization of diagnostic system of 3D CAD data, IGES (Initial Graphics Exchange Specification), by using JNI(Java Native Interface) to connect between C++ and Java programming. The diagnostic system is to analyze IGES clearly by