• Journal of Forest and Environmental Science
• /
• v.36 no.1
• /
• pp.47-54
• /
• 2020

A "Scenic Site" is an official heritage category legally defined as a "scenic site of outstanding artistic value with excellent scenic views." However, the subjective interpretation of the term causes several problems. This study suggested a systematic, organized process of designating a listed area as a scenic site after careful and detailed quantitative and qualitative analysis. Indicators were identified for each of the two analyses, and then scored and weighted. Quantitative indicators were distributed within 5 points for each indicator. Water, which is a natural indicator, based on distance from river boundaries. Forest landscapes were assigned in consideration of forest physiognomy and age class. Land use was allocated in consideration of land cover type and, in case of development site, '-' score was assigned. Cultural heritage conservation area, which is historical and cultural indicator, was distributed by distance within a maximum of 500 meters. Visibility, an indicator of landscape value, was assigned according to the frequency of visibility. The weight of each indicator was calculated by considering the value of each item. The weight of distribution of cultural resources is relatively high, while other items were set the same. In case of land use, however, '-' score was given according to the grade. Qualitative indicators, on the other hand, were considered terrain, landscape zone, ownership, intellectual boundary, and land category. The applicability of the proposed process and method was examined by applying the existing methods and criteria used for designating scenic spots. Opinions of subject-matter experts were incorporated in the identification of the indicators and in the result review stage. In the future, it is necessary to apply this method while designating scenic sites so as to establish an objective, scientific designation process.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1A
• /
• pp.1-10
• /
• 2006

The Home Phoneline Networking Alliance(HomePNA) 2.0 technology can establish a home network using existing in-home phone lines, which provides a channel rate of 4-32 Mbps. HomePNA 2.0 Medium Access Control(MAC) protocol adopts an IEEE 802.3 Carrier Sense Multiple Access with Collision Detection(CSMA/CD) access method, Quality of Service(QoS) algorithm, and Distributed Fair Priority Queuing(DFPQ) collision resolution algorithm. In this paper, we describe some performance analysis results of HomePNA 2.0 MAC protocol and the requirements of HomePNA 2.0 MAC controller. Then, we propose the architecture of HomePNA 2.0 MAC controller circuit, show the simulation result of each block included in HomePNA 2.0 MAC controller, and present the HomePNA 2.0 transceiver chip that we have implemented.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.53-58
• /
• 2008

This paper designs sigma-delta D/A Converter with a high resolution and low power consumption. It reorganizes the input data along LJ, RJ, I2S mode and bit mode to the output data of A/D converter. The D/A converter decodes the original analog signal through HBF, Hold and 5th CIFB(Cascaded Integrators with distributed Feedback as well as distributed input coupling) sigma-delta modulation blocks. It uses repeatedly the addition operation in instead of the multiply operation for the chip area and the performance. Also, the half band filters of similar architecture composed the one block and it used the sample-hold block instead of the sinc filter. We supposed simple D/A Converter decreased in area. The filters of the block analyzed using the matlab tool. The top block designed using the top-down method by verilog language. The designed block is fabricated using Samsung 0.35um CMOS standard cell library. The chip area is 1500*1500um.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11B
• /
• pp.707-721
• /
• 2005

Recently, there has been a dramatic increase in data traffic, driven primarily by the explosive growth of the Internet. Optical networking is believed as a key solution to keep up with the growth, thus, the most pressing issue is how to manage and control large optical networks. Currently, provisioning end-to-end connections across the transport network has involved the network operator, leading to long provisioning times in an era when customers are demanding shorter provisioning time. To address this critical issue, new control intelligence is being studied for use within optical networks to shorten provisioning time. Both the IETF and the ITU-T have been aggressively defining many aspects of a control plane for the next generation convergence transport network. Basically, they are based on the distributed control scheme. In this Paper, we suey the applicability of the centralized control scheme for the provisioning control of optical transport network to utilize its inherent advantages over the distributed control scheme. We discuss new central control architecture, and control procedure. Also, we examine the applicability of the existing IETF routing and signaling protocols to the new control concepts, and then, we propose the additional routing and signaling information elements.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.15 no.6
• /
• pp.17-27
• /
• 2012

Climate is generally accepted as one of the major determinants of plants distribution. Plants are sensitive to bioclimates, and local variations of climate determine habitats of plants. The purpose of this paper is to identify the factors affecting the distribution of narrow-range plants in South Korea using National Survey of Natural Environment data. We developed species distribution models for 6 plant species using climate, topographic and soil factors. All 6 plants were most sensitive to climatic factors but less other factors at national scale. Meliosma myriantha, Stewartia koreana and Eurya japonica, distributed at southern and coast region in Korea, were most sensitive to precipitation and temperature. Meliosma myriantha was mostly effected by annual precipitation and precipitation of driest quarter, Stewartia koreana was effected by annual precipitation and elevation, and Eurya japonica was affected by temperature seasonality and precipitation of driest quarter. On the other hand, Spiraea salicifolia, Rhododendron micranthum and Acer tegmentosum, distributed at central and northern inland in Korea, were most sensitive to temperature and elevation. Spiraea salicifolia was affected by mean temperature of coldest quarter and annual mean temperature, Rhododendron micranthum and Acer tegmentosum were affected by mean temperature of warmest quarter and elevation. We can apply this result to future plant habitat distribution under climate change.

• The Journal of the Korea Contents Association
• /
• v.10 no.3
• /
• pp.141-148
• /
• 2010

The aim of this paper is to propose a communication middleware which makes it possible to easily and efficiently develop the networking support for multi-user applications. Even though existing middleware and development tools provides lots of functionalities to realize distributed applications, they are purely low-level services passing the most development efforts to developers, or too specialized for a specific application. It brings a challenging issue of how the middleware supports general and efficient high-level mechanisms. To meet different networking and interaction requirements of multi-user applications, we propose various schemes to provide the communication architecture, the user membership management, the content transmission mechanism and the event management. Our middleware provides developers with application-level APIs and configuration files so that the different interaction requirements of a multi-user application can be easily handled in the developers' point of view.

• The Journal of Society for e-Business Studies
• /
• v.8 no.2
• /
• pp.63-76
• /
• 2003

The fundamental technology to the b2b e-commerce framework is Registry. Although Registries have developed, it is yet difficult to apply in actual e-business . That is, the e-business information was stored in physically and/or logically distributed and heterogeneous Registries. And Registry uses the keyword-based search to discovery the information stored. But, the keyword-based search technology can't provide the discovery the business information necessary for parties and trading partners. As spreading the understand of this problem, it requires the technologies for the integration of distributed and various Registries and the systematic definition and intelligent discovery of the e-business information. In this paper we propose the architecture of intelligent and integrated e-business registry system for solving these problems . This system composed of the Registry Integration Query Manager for integrating various registries and the Intelligent Registry Agent providing the systematic organization and discovery of e-business information.

• Journal of Korea Multimedia Society
• /
• v.20 no.9
• /
• pp.1541-1550
• /
• 2017

The increasing number of multimedia content offered to the user demands content recommendation. In this paper, we propose a system for recommending content related to the content that user is watching. In the proposed system, relationship information between content is generated using relationship information between representative keywords of content. Relationship information between keywords is generated by analyzing keyword collocation frequencies in Internet news corpus. In order to handle big corpus data, we design an architecture that consists of a distributed search engine and a distributed data processing engine. Furthermore, we store relationship information between keywords and relationship information between keywords and content in NoSQL to handle big relationship data. Because the query optimizer of NoSQL is not as well developed as RDBMS, we propose query optimization techniques to efficiently process complex queries for recommendation. Experimental results show that the performance is improved by up to 69 times by using the proposed techniques, especially when the number of requested related keywords is small.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.373-376
• /
• 2003

This paper presents a new, three-dimensional round-robin scheduler that provides high throughput and fair across in an advanced input-queued packet switch using shared input buffers. We consider an architecture in which each input port group shares a common buffer and maintains a separate queue for each output, which is ratted the distributed common input buffer switch. In an NxN switch, our scheduler determines which queue in the total MxN input queues is served during each time slot where M is the number of common buffers. We suppose that each common buffer has K input ports and K output ports, and manages N output queues. The 3DRR scheduler determines MxK queues in every K(M) cycle when $K\geq$M (K$\leq$M), and provides massively parallel processing for the applications of high-speed switches with a large number of ports. The 3-DRR scheduler can be implemented using duplicated simple logic components allowing very high-speed implementation.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.923-930
• /
• 2004

Wireless sensor networks is a core technology of ubiquitous computing which enables the network to aware the different kind of context by integrating exiting wired/wireless infranet with various sensor devices and connecting collected environmental data with applications. However it needs an energy-efficient approach in network layer to maintain the dynamic ad hoc network and to maximize the network lifetime by using energy constrained node. Cluster-based data aggregation and routing are energy-efficient solution judging from architecture of sensor networks and characteristics of data. In this paper. we propose a new distributed clustering algorithm in using distance from the sink. This algorithm shows that it can balance energy dissipation among nodes while minimizing the overhead. We verify that our clustering is more en-ergy-efficient and thus prolongs the network lifetime in comparing our proposed clustering to existing probabilistic clustering for sensor network via simulation.