• Proceedings of the KSR Conference
• /
• 2004.10a
• /
• pp.1725-1730
• /
• 2004

The railroad station building is a public facility that many people use. The disabled persons cannot move as freely as the ordinary persons do, so the facility shall be considered on this matter. We reviewed on the features of the retarded, visually handicapped and mentally retarded persons upon moving, and calculated the minimum space required in their move, access and use of the reachable space, and we also analyzed the design factors so that the prior guidance can be considered for the visually handicapped such as installation of guidance facility, change of finishing material and Braille points block handrail to avoid obstacles for the use of senses of touch, hearing and remained eyesight of the visually handicapped. In addition, we also analyzed the requests of general design totally to analyze and arrange the design factors with the thought that the facility for the handicapped shall be useful for the ordinary people as well as the handicapped.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2A
• /
• pp.146-156
• /
• 2002

This paper presents an adaptive H.263+ rate control algorithm for streaming video applications under the networks supporting bandwidth renegotiation, which can communicate with end-users to accommodate their time-varying bandwidth requests during the data transmission. That is, the requests of end-users can be supported adaptively according to the availability of the network resources, and thus the overall network utilization can be improved simultaneously. They are especially suitable for the transmission of non-stationary video traffics. The proposed rate control algorithm communicates with the network to renegotiate the required bandwidth fort the underlying video which are measured based on the motion change information, and choose their control strategies according to the renegotiation results. Unlike most conventional algorithms that control only the spatial quality by adjusting quantization parameters, the proposed algorithm treats both the spatial and temporal qualities at the same time to enhance human visual perceptual quality. Experimental results are provided to demonstrate that the proposed rate control algorithm can achieve superior performance to the conventional ones with low computational complexity under the networks supporting bandwidth renegotiation.

• International Journal of CAD/CAM
• /
• v.3 no.1_2
• /
• pp.43-50
• /
• 2003

This paper presents a methodology in which the knowledge of design intents and change requests is communicated unambiguously cross collaboration partners through features. The domain of application is focused on the plastic part design for enabling effective collaboration between the product design and plastic mold making. The methodology takes the feature-based design approach and allows design features and knowledge to be reused in plastic injection mold design. It shortens the mold design lead-time, reduces mold design efforts, and enables unambiguous and fast design change management between product and mold designers. These contribute to the reduction of product development cycle time.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.23-28
• /
• 1996

In this series of two papers, adaptive code rate change schemes in DS-SSMA systems are proposed. In the proposed schemes the error correcting code rate is changed according to the channel states. Two channel states having significant effects on the bit error probability are considered: one is the effective number of users considered in Part 1, and the other is the fading environment considered in Part 2. These channel states are estimated based on retransmission requests. The criterion for the change of the code rate is to maximize the throughput under given error bound. Simulation results show that we can transmit maximum amount of information if we change the code rate based on the channel states.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.17-22
• /
• 1996

Adaptive code rate change schemes in DS-SSMA systems are proposed. In the proposed schemes, the error correcting code rate is changed according to the channel states. Two channel states having significant effects on the bit error probability are considered: one is the effective number of users, and the other is the fading environment. These channel states are estimated based on retransmission requests. The criterion for the change of the code rate is to maximize the throughput under given error bound.

• Journal of Korea Game Society
• /
• v.3 no.1
• /
• pp.67-73
• /
• 2003

Most web caches save documents temporarily into themselves on the basis of those documents. And when a corresponding document exists within the cache on wei s request, web cache sends the document to corresponding user. On the contrary, when there is not any document within the cache, web cache requests a new document to the related server to copy the document into the cache and then rum it back to user. Here, web cache uses a replacement policy to change existing document into a new one due to exceeded capacity of cache. Typical replacement policy includes document-based LRU or LFU technique and other various replacement policies are used to replace the documents within cache effectively. However, these replacement policies function only with regard to the time and frequency of document request, not considering the popularity of each web site. Based on replacement policies with regard to documents on frequent requests and the popularity of each web site, this paper aims to present the document replacement policies with regard to the popularity of each web site, which are suitable for latest network environments to enhance the hit-ratio of cache and efficiently manage the contents of cache by effectively replacing documents on intermittent requests by new ones.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.1
• /
• pp.227-232
• /
• 2008

General web caches save documents temporarily into themselves on the basis of those documents. And when a corresponding document exists within the cache on user's request. web cache sends the document to corresponding user. On the contrary. when there is not any document within the cache, web cache requests a new document to the related server to copy the document into the cache and then turn it back to user. Here, web cache uses a replacement policy to change existing document into a new one due to exceeded capacity of cache. Typical replacement policy includes document-based LRU or LFU technique and other various replacement policies are used to replace the documents within cache effectively. However. these replacement policies function only with regard to the time and frequency of document request. not considering the popularity of each web site. Based on replacement policies with regard to documents on frequent requests and the popularity of each web site, this paper aims to present the document replacement policies with regard to the popularity of each web site, which are suitable for latest network environments to enhance the hit-ratio of cache and efficiently manage the contents of cache by effectively replacing documents on intermittent requests by new ones.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.8
• /
• pp.1336-1345
• /
• 2002

Materialized views in data warehouse play important roles in rapidly answering to users's requests for information Processing. More views in data warehouse, can respond to the users more rapidly because the user's requests may be processed by using only the materialized views with higher probabilities rather than accessing base relations. The limited duration, during which the materialized views are updated due to base relations's changes, limits the number of materialized views in data warehouse. In this paper, we propose efficient policy for updating the materialized views, which can save the update duration of views although MIN/MAX values frequently change in base relation. The policy updates the materialized views by distinguishing whether MIN/MAX values's changes in the base relation are insert value or delete value. Then, the number of accesses to the base relation is descreased when updating the MIN/MAX values in the materialized views.

• Journal of Ecology and Environment
• /
• v.47 no.4
• /
• pp.219-227
• /
• 2023

The US National Science Foundation's National Ecological Observatory Network (NEON) is a continental-scale program intended to provide open data, samples, and infrastructure to understand changing ecosystems for a period of 30 years. NEON collects co-located measurements of drivers of environmental change and biological responses, using standardized methods at 81 field sites to systematically sample variability and trends to enable inferences at regional to continental scales. Alongside key atmospheric and environmental variables, NEON measures the biodiversity of many taxa, including microbes, plants, and animals, and collects samples from these organisms for long-term archiving and research use. Here we review the composition and use of NEON resources to date as a whole and specific to biodiversity as an exemplar of the potential of national research infrastructure to contribute to globally relevant outcomes. Since NEON initiated full operations in 2019, NEON has produced, on average, 1.4 M records and over 32 TB of data per year across more than 180 data products, with 85 products that include taxonomic or other organismal information relevant to biodiversity science. NEON has also collected and curated more than 503,000 samples and specimens spanning all taxonomic domains of life, with up to 100,000 more to be added annually. Various metrics of use, including web portal visitation, data download and sample use requests, and scientific publications, reveal substantial interest from the global community in NEON. More than 47,000 unique IP addresses from around the world visit NEON's web portals each month, requesting on average 1.8 TB of data, and over 200 researchers have engaged in sample use requests from the NEON Biorepository. Through its many global partnerships, particularly with the Global Biodiversity Information Facility, NEON resources have been used in more than 900 scientific publications to date, with many using biodiversity data and samples. These outcomes demonstrate that the data and samples provided by NEON, situated in a broader network of national research infrastructures, are critical to scientists, conservation practitioners, and policy makers. They enable effective approaches to meeting global targets, such as those captured in the Kunming-Montreal Global Biodiversity Framework.

• Journal of Korean Society of Forest Science
• /
• v.102 no.2
• /
• pp.189-197
• /
• 2013

The Cancun Agreements under the United Nations Framework Convention on Climate Change require developing countries aiming to undertake REDD+ activities to develop a national strategy or action plan, addressing the drivers of deforestation and forest degradation, a measurement, reporting and verifying (MRV) system including forest monitoring system, and safeguards to ensure equity and co-benefits for local communities and indigenous peoples, and biodiversity. The Government of Indonesia and the Government of Norway established REDD+ cooperation through signing a 'Letter of Intent' in May, 2010. Indonesia agreed on 'a two year suspension on all new concessions for conversion of peat and natural forest'. In turn, Norway agreed to support Indonesia's REDD+ implementation efforts up to one billion United States dollars. Indonesia's REDD+ national strategy (June, 2012) accepted most of the requests included in the 'Letter of Intent'. The REDD+ national strategy, however, does not reflect requests of the Cancun Agreements which noted identification of the drivers of deforestation and forest degradation and guarantee of real greenhouse gas emissions reductions. Indonesia lays emphasis on Norwegian requests which includes expected financial support rather than the Cancun Agreements which have a weak legally-binding requirements.