• Title/Summary/Keyword: Algorithm #3

Search Result 15,404, Processing Time 0.04 seconds

Vegetation Cover Type Mapping Over The Korean Peninsula Using Multitemporal AVHRR Data (시계열(時系列) AVHRR 위성자료(衛星資料)를 이용한 한반도 식생분포(植生分布) 구분(區分))

  • Lee, Kyu-Sung
    • Journal of Korean Society of Forest Science
    • /
    • v.83 no.4
    • /
    • pp.441-449
    • /
    • 1994
  • The two reflective channels(red and near infrared spectrum) of advanced very high resolution radiometer(AVHRR) data were used to classify primary vegetation cover types in the Korean Peninsula. From the NOAA-11 satellite data archive of 1991, 27 daytime scenes of relatively minimum cloud coverage were obtained. After the initial radiometric calibration, normalized difference vegetation index(NDVI) was calculated for each of the 27 data sets. Four or five daily NDVI data were then overlaid for each of the six months starting from February to November and the maximum value of NDVI was retained for every pixel location to make a monthly composite. The six bands of monthly NDVI composite were nearly cloud free and used for the computer classification of vegetation cover. Based on the temporal signatures of different vegetation cover types, which were generated by an unsupervised block clustering algorithm, every pixel was classified into one of the six cover type categories. The classification result was evaluated by both qualitative interpretation and quantitative comparison with existing forest statistics. Considering frequent data acquisition, low data cost and volume, and large area coverage, it is believed that AVHRR data are effective for vegetation cover type mapping at regional scale.

  • PDF

Semantic Query Expansion based on Concept Coverage of a Deep Question Category in QA systems (질의 응답 시스템에서 심층적 질의 카테고리의 개념 커버리지에 기반한 의미적 질의 확장)

  • Kim Hae-Jung;Kang Bo-Yeong;Lee Sang-Jo
    • Journal of KIISE:Databases
    • /
    • v.32 no.3
    • /
    • pp.297-303
    • /
    • 2005
  • When confronted with a query, question answering systems endeavor to extract the most exact answers possible by determining the answer type that fits with the key terms used in the query. However, the efficacy of such systems is limited by the fact that the terms used in a query may be in a syntactic form different to that of the same words in a document. In this paper, we present an efficient semantic query expansion methodology based on a question category concept list comprised of terms that are semantically close to terms used in a query. The semantically close terms of a term in a query may be hypernyms, synonyms, or terms in a different syntactic category. The proposed system constructs a concept list for each question type and then builds the concept list for each question category using a learning algorithm. In the question answering experiments on 42,654 Wall Street Journal documents of the TREC collection, the traditional system showed in 0.223 in MRR and the proposed system showed 0.50 superior to the traditional question answering system. The results of the present experiments suggest the promise of the proposed method.

Fast Generation of Elliptic Curve Base Points Using Efficient Exponentiation over $GF(p^m)$) (효율적인 $GF(p^m)$ 멱승 연산을 이용한 타원곡선 기저점의 고속 생성)

  • Lee, Mun-Kyu
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.3
    • /
    • pp.93-100
    • /
    • 2007
  • Since Koblitz and Miller suggested the use of elliptic curves in cryptography, there has been an extensive literature on elliptic curve cryptosystem (ECC). The use of ECC is based on the observation that the points on an elliptic curve form an additive group under point addition operation. To realize secure cryptosystems using these groups, it is very important to find an elliptic curve whose group order is divisible by a large prime, and also to find a base point whose order equals this prime. While there have been many dramatic improvements on finding an elliptic curve and computing its group order efficiently, there are not many results on finding an adequate base point for a given curve. In this paper, we propose an efficient method to find a random base point on an elliptic curve defined over $GF(p^m)$. We first show that the critical operation in finding a base point is exponentiation. Then we present efficient algorithms to accelerate exponentiation in $GF(p^m)$. Finally, we implement our algorithms and give experimental results on various practical elliptic curves, which show that the new algorithms make the process of searching for a base point 1.62-6.55 times faster, compared to the searching algorithm based on the binary exponentiation.

A Dynamic Allocation Scheme for Improving Memory Utilization in Xen (Xen에서 메모리 이용률 향상을 위한 동적 할당 기법)

  • Lee, Kwon-Yong;Park, Sung-Yong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.3
    • /
    • pp.147-160
    • /
    • 2010
  • The system virtualization shows interest in the consolidation of servers for the efficient utilization of system resources. There are many various researches to utilize a server machine more efficiently through the system virtualization technique, and improve performance of the virtualization software. These researches have studied with the activity to control the resource allocation of virtual machines dynamically focused on CPU, or to manage resources in the cross-machine using the migration. However, the researches of the memory management have been wholly lacking. In this respect, the use of memory is limited to allocate the memory statically to virtual machine in server consolidation. Unfortunately, the static allocation of the memory causes a great quantity of the idle memory and decreases the memory utilization. The underutilization of the memory makes other side effects such as the load of other system resources or the performance degradation of services in virtual machines. In this paper, we suggest the dynamic allocation of the memory in Xen to control the memory allocation of virtual machines for the utilization without the performance degradation. Using AR model for the prediction of the memory usage and ACO (Ant Colony Optimization) algorithm for optimizing the memory utilization, the system operates more virtual machines without the performance degradation of servers. Accordingly, we have obtained 1.4 times better utilization than the static allocation.

A Study on Reliability Based Design Criteria for Reinforced Concrete Columns (철근(鐵筋)콘크리트기둥의 신뢰성(信賴性) 설계규준(設計規準)에 관한 연구(研究))

  • Cho, Hyo Nam;Min, Kyung Ju
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.3 no.1
    • /
    • pp.25-33
    • /
    • 1983
  • This study is directed to propose a set of reliability based design provisions which gives more rational design for R.C. columns than the current WSD or USD standard design codes. Cornell's MFOSM theory is used for the derivation of the algorithm for the evaluation of uncertainties associated with resistances, whereas the magnitude of the uncertainties associated with load effects are chosen primarily by considering our level of practice. And thus the uncertainties so obtained are applied for the reliability analysis and the derivation of reliability based design criteria. A target reliability(${\beta}_0=4.0$) is selected as an appropriate value by comparing the values used in foreign countries and by analyzing the reliability levels of our current USD and WSD design standars. Then, a set of load and resistance factors corresponding to the target reliability is proposed as a reliability based design provision, and furthermoere a set of allowable stresses for reinforcing steel and concrete having same level of relibity with the corresponding LRFD criteria is also propared for the current WSD design provision. It may be concluded that the proposed LRFD reliability based design provisions and the corresponding allowable stresses give more rational design than the current code for R.C. columns and may be desirable to introdue into the current WSD and USD provision of R.C. column design.

  • PDF

Automatic Calibration of Storage-Function Rainfall-Runoff Model Using an Optimization Technique (최적화(最適化) 기법(技法)에 의한 저유함수(貯留函數) 유출(流出) 모형(模型)의 자동보정(自動補正))

  • Shim, Soon Bo;Kim, Sun Koo;Ko, Seok Ku
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.12 no.3
    • /
    • pp.127-137
    • /
    • 1992
  • For the real-time control of a multi-purpose reservoir in case of a storm, it is absolutely necessary to forecast accurate flood inflows through a good rainfall-runoff model by calibrating the parameters with the on-line rainfall and water level data transmitted by the telemetering systems. To calibrate the parameters of a runoff model. the trial and error method of manual calibration has been adopted from the subjective view point of a model user. The object of this study is to develop a automatic calibration method using an optimization technique. The pattern-search algorithm was applied as an optimization technique because of the stability of the solution under various conditions. The object function was selected as the sum of the squares of differences between observed and fitted ordinates of the hydrograph. Two historical flood events were applied to verify the developed technique for the automatic calibration of the parameters of the storage-function rainfall-runoff model which has been used for the flood control of the Soyanggang multi-purpose reservoir by the Korea Water Resources Corporation. The developed method was verified to be much more suitable than the manual method in flood forecasting and real-time reservoir controlling because it saves calibration time and efforts in addition to the better flood forecasting capability.

  • PDF

Community Patterning of Bethic Macroinvertebrates in Streams of South Korea by Utilizing an Artificial Neural Network (인공신경망을 이용한 남한의 저서성 대형 무척추동물 군집 유형)

  • Kwak, Inn-Sil;Liu, Guangchun;Park, Young-Seuk;Chon, Tae-Soo
    • Korean Journal of Ecology and Environment
    • /
    • v.33 no.3 s.91
    • /
    • pp.230-243
    • /
    • 2000
  • A large-scale community data were patterned by utilizing an unsupervised learning algorithm in artificial neural networks. Data for benthic macroinvertebrates in streams of South Korea reported in publications for 12 years from 1984 to 1995 were provided as inputs for training with the Kohonen network. Taxa included for the training were 5 phylum, 10 class, 26 order, 108 family and 571 species in 27 streams. Abundant groups were Diptera, Ephemeroptera, Trichoptera, Plecoptera, Coleoptera, Odonata, Oligochaeta, and Physidae. A wide spectrum of community compositions was observed: a few tolerant taxa were collected at polluted sites while a high species richness was observed at relatively clean sites. The trained mapping by the Kohonen network effectively showed patterns of communities from different river systems, followed by patterns of communities from different environmental disturbances. The training by the proposed artificial neural network could be an alternative for organizing community data in a large-scale ecological survey.

  • PDF

development of a Depth Control System for Model Midwater Trawl Gear Using Fuzzy Logic (퍼지 논리를 이용한 모형 증층트롤 어구의 수심제어시스템 개발)

  • 이춘우
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.36 no.1
    • /
    • pp.54-59
    • /
    • 2000
  • This paper presents a control system that uses a fuzzy algorithm in controlling the depth of a model midwater trawl net, and experimental results carried out in the circulating water channel by using a model trawl winch system.The fuzzy controller calculates the length of the warp to be changed, based on the depth error between the desired depth and actual depth of the model trawl net and the ratio of change in the depth error. The error and the error change are calculated every sampling time. Then the control input, i.e. desirable length of the warp, is determined by inference from the linguistic control rules which an experienced captain or navigator uses in controlling the depth of the trawl winch controller and the length of the warp is changed. Two kinds of fuzzy control rules were tested, one was obtained from the actual operations used by a skilled skipper or navigator, and the other was a modified from the former by considering the hydrodynamic characteristics of the model trawl system.Two kinds of fuzzy control were tested, one was obtained fro the actual operations used by a skilled skipper or navigator, and the other was a modified from the former by considering the hydrodynamic characteristics of the model trawl system.The results of these model experiments indicate that the proposed fuzzy controllers rapidly follow the desired depth without steady-state error although the desired depth was given in one step, and show robustness properties against changes in the parameters such as the change of the towing sped. Especially, a modified rule shows smaller depth fluctuations and faster setting times than those obtained by a field oriented rule.

  • PDF

A Study on the Structural Behavior of an Underground Radwaste Repository within a Granitic Rock Mass with a Fault Passing through the Cavern Roof (화장암반내 단층지역에 위치한 지하 방사성폐기물 처분장 구조거동연구)

  • 김진웅;강철형;배대석
    • Tunnel and Underground Space
    • /
    • v.11 no.3
    • /
    • pp.257-269
    • /
    • 2001
  • Numerical simulation is performed to understand the structural behavior of an underground radwaste repository, assumed to be located at the depth of 500 m, in a granitic rock mats, in which a fault intersects the roof of the repository cavern. Two dimensional universal distinct element code, UDEC is used in the analysis. The numerical model includes a granitic rock mass, a canister with PWR spent fuels surrounded by the compacted bentonite inside the deposition hole, and the mixed bentonite backfilled in the rest of the space within the repository cavern. The structural behavior of three different cases, each case with a fault of an angle of $33^{\circ},\;45^{\circ},\;and\;58^{\circ}$ passing through the cavern roof-wall intersection, has been compared. And then fro the case with the $45^{\circ}$ fault, the hydro-mechanical, thermo-mechanical, and thermo-hydro-mechanical interaction behavior have been studied. The effect of the time-dependent decaying heat, from the radioactive materials in PWR spent fuels, on the repository and its surroundings has been studied. The groundwater table is assumed to be located 10m below the ground surface, and a steady state flow algorithm is used.

  • PDF

Reviews of Bus Transit Route Network Design Problem (버스 노선망 설계 문제(BTRNDP)의 고찰)

  • Han, Jong-Hak;Lee, Seung-Jae;Lim, Seong-Su;Kim, Jong-Hyung
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.3 s.81
    • /
    • pp.35-47
    • /
    • 2005
  • This paper is to review a literature concerning Bus Transit Route Network Design(BTRNDP), to describe a future study direction for a systematic application for the BTRNDP. Since a bus transit uses a fixed route, schedule, stop, therefore an approach methodology is different from that of auto network design problem. An approach methodology for BTRNDP is classified by 8 categories: manual & guideline, market analysis, system analytic model. heuristic model. hybrid model. experienced-based model. simulation-based model. mathematical optimization model. In most previous BTRNDP, objective function is to minimize user and operator costs, and constraints on the total operator cost, fleet size and service frequency are common to several previous approach. Transit trip assignment mostly use multi-path trip assignment. Since the search for optimal solution from a large search space of BTRNDP made up by all possible solutions, the mixed combinatorial problem are usually NP-hard. Therefore, previous researches for the BTRNDP use a sequential design process, which is composed of several design steps as follows: the generation of a candidate route set, the route analysis and evaluation process, the selection process of a optimal route set Future study will focus on a development of detailed OD trip table based on bus stop, systematic transit route network evaluation model. updated transit trip assignment technique and advanced solution search algorithm for BTRNDP.