• Title/Summary/Keyword: Subregion

Search Result 74, Processing Time 0.024 seconds

A Digital Thesaurus of the Traditional Common Culture of the Greater Mekong Subregion

  • Suwannee Hoaihongthong;Kanyarat Kwiecien
    • Journal of Information Science Theory and Practice
    • /
    • v.12 no.3
    • /
    • pp.63-74
    • /
    • 2024
  • This study aimed to develop a digital thesaurus dedicated to cataloging the traditional common culture of the Greater Mekong Subregion. The process followed a meticulous seven-step methodology, including scoping, vocabulary collection, knowledge structure analysis, relationship delineation, related word adjustments, list validation, and evaluation. Leveraging principles from knowledge organization, thesaurus construction, and digital platform development, the TemaTres web application emerged as the primary tool for constructing this thesaurus. The study's results showed that 2,042 principal words related to the traditional common culture of the Greater Mekong Subregion were compiled and classified into terms for each of the seven deep levels. Each term was accompanied by essential metadata, including broader and narrower terms, related terms, cross-references, and scope notes. This rich dataset empowered semantic search capabilities across diverse applications and web services, providing access to knowledge pertaining to the traditional common culture of the Greater Mekong Subregion and contributing to a deeper understanding of this cultural domain.

A variationally coupled Element-Free Galerkin Method(EFGM) -Boundary Element Method(BEM) (무요소법과 경계요소법의 변분적 조합)

  • 이상호;김명원
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2001.10a
    • /
    • pp.11-18
    • /
    • 2001
  • In this paper, a new algorithm of coupling Element-Free Galerkin Method(EFGM) and Boundary Element Method(BEM) using the variational formulation is presented. A global variational coupling formulation of EFGM-BEM is achieved by combining the variational form on each subregion. In the formulation, Lagrange multiplier method is introduced to satisfy the compatibility conditions between EFGM subregion and BEM subregion. Some numerical examples are studied to verify accuracy and efficiency of the proposed method, in which numerical performance of the method is compared with that of conventional method such as EFGM-BEM direct coupling method, EFGM and BEM. The proposed method incorporating the merits of EFGM and BEM is expected to be applied to special engineering problems such as the crack propogation problems in very large domain, and underground structures with joints.

  • PDF

Regional Identifiability of Spatially-Varying Parameters in Distributed Parameter Systems of Hyperbolic Type

  • Nakagiri, Shin-ichi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1998.10a
    • /
    • pp.423-428
    • /
    • 1998
  • This paper studies the regional identifiability of spatially-varying parameters in distributed parameter systems of hyperbolic type. Let Ω be a bounded domain of R$^n$and let Ωo be a subregion of the closed domain Ω. The distributed parameter systems having unknown parameters defined on Ω are described by the second order evolution equations in the filbert space L$^2$(Ω) and the observations are made on the subregion Ωo ⊂ Ω. The regional identifiability is formulated as the uniqueness of parameters by the identity of solutions on the subregion. Several regional identifiability results of the spatially-varying parameters of hyperbolic distributed parameter systems are established by means of the Riesz spectral representations.

  • PDF

A Cosmetic Surgery Simulation System using Bilinear Warping and Bilinear Interpolation (쌍선형 워핑 및 쌍선형 보간을 이용한 성형 시스템)

  • 박천주;이재협;전병민
    • The Journal of the Korea Contents Association
    • /
    • v.2 no.2
    • /
    • pp.27-35
    • /
    • 2002
  • This paper describes the implementation of cosmetic surgery simulation system by means of the bilinear warping and interpolation using a pair of control points in order to get the information which can be used to compare the before and the after the surgery. If an user provides a pair of control points, first of all, the system determines warping egion using the points and divides the whole region into four subregions which includes the control points as a corner ones. Then, for each subregion, it calculates warping coefficients for backward mapping using the four known comer points of each subregion. Using those calculated coefficients, the system gets the corresponding position of each pixel on the subregion of original image which matches the subregion of resulting image. Finally, a new pixel value is calculated by bilinear interpolation using the closest four pixel values of the position. The same process is applied to the remaining subregions. Through the experiments, we could find natural aesthetic results without any side effects which unnatural aesthetic results without any side effects which unnaturally distort the boundary of warping region.

  • PDF

A Novel Random Scheduling Algorithm based on Subregions Coverage for SET K-Cover Problem in Wireless Sensor Networks

  • Muhammad, Zahid;Roy, Abhishek;Ahn, Chang Wook;Sachan, Ruchi;Saxena, Navrati
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2658-2679
    • /
    • 2018
  • This paper proposes a novel Random Scheduling Algorithm based on Subregion Coverage (RSASC), to solve the SET K-cover problem (an NP-complete problem). SET K-cover problem distributes the set of sensors into the maximum number of mutually exclusive subsets (MESSs) in such a way that each of them can be scheduled for lifetime extension of WSN. Sensor coverage divides the target region into different subregions. RSASC first sorts the subregions in the ascending order concerning their sensor coverage. Then, it forms the subregion groups according to their similar sensor coverage. Lastly, RSASC ensures the K-coverage of each subregion from every group by randomly scheduling the sensors. We consider the target-coverage and area-coverage applications of WSN to analyze the usefulness of our proposed RSASC algorithm. The distinct quality of RSASC is that it utilizes less number of deployed sensors (33% less) to form the optimum number of MESSs with the higher computational speed (saves more than 93% of the time) as compared to the existing three algorithms.

Classification of Subregions in Yeongnam Region (영남지역 내 하위지역 구분)

  • Son, Myoung Won
    • Journal of the Korean association of regional geographers
    • /
    • v.22 no.1
    • /
    • pp.25-35
    • /
    • 2016
  • This paper is to classify subregions of Yeongnam region, to realize their core area, and to provide the basis on studying inherent cultural characteristics in Yeongnam region. To do so, I made a overlay human factors of administrative district and dialect with physical factors of drainage basin and climate area. The limit of subregion is the range of possessing environmental factors similar to provincial center. The parcels possessing a equivalent combination of environmental factors are 27, the size of parcel is various from one-city/county to six-city/county. These parcels are classified to six subregions(Andong, Sangju, Kyeongju, Daegu, Kimhae, Jinju). The boundary of subregion is high mountains and large river which are obstacle to communication between subregions, and in case of little obstacle exists transitional zone.

  • PDF

The Analysis of Hydropower Development and the Mekong Power Grid on Regional Cooperation : Focus on the Greater Mekong Subregion Program

  • Nayeon Shin;Seungho Lee
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2023.05a
    • /
    • pp.245-245
    • /
    • 2023
  • This paper examines the extent to which the Mekong River Basin countries have achieved socioeconomic benefits based on regional cooperation through the Greater Mekong Subregion (GMS) Program, focusing on hydropower development and the Mekong Power Grid. This study pays attention to the time period from 2012 to 2022. The benefit sharing approach is employed to evaluate the extent to which hydropower development and the Mekong Power Grid have contributed to the regional energy trade in the GMS program. The GMS program was launched by the Asian Development Bank (ADB) in 1992, and the Chinese provinces of Yunnan and Guangxi, Myanmar, Lao PDR, Thailand, Cambodia, and Vietnam have taken an active part in the program. The goals of the GMS program are to achieve poverty alleviation, economic development, and regional cooperation in various sectors, including energy, tourism, and transportation. The GMS Economic Cooperation Program Strategic Framework 2030 (GMS-2030), in 2021, provides a new framework for prosperous and sustainable development in the river basin. In the energy sector, the GMS program has been instrumental in facilitating hydropower development and creating the Mekong Power Grid with the Regional Grid Code (RGC), contributing to economic benefits and promoting regional trade of hydroelectricity. It is argued that the GMS program has enhanced regional cooperation between the riparian countries. Despite such achievements, the GMS program has faced challenges, including the gap of economic development between the riparian countries, socioeconomic and environmental concerns regarding hydropower development between the Upper and Lower Mekong countries, and geopolitical tensions from the US-China rivalry. These challenges should adequately be addressed within the program, which can guarantee the sustainability of the program for the river basin.

  • PDF

Management Techniques of Interest Area Utilizing Subregions in MMORPG based on Cloud and P2P Architecture (클라우드와 P2P 구조 기반의 MMORPG에서 소영역을 활용하는 관심 구역의 관리 기법)

  • Jin-Hwan Kim
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.3
    • /
    • pp.99-106
    • /
    • 2023
  • In this paper, we propose subregion-based area of interest management techniques for MMORPG(massively multiplayer online role playing games) integrating P2P(peer-to-peer) networking and cloud computing. For the crowded region, the proposed techniques partition it into several subregions and assign a player to manage each subregion as a coordinator. These techniques include a load balancing mechanism which regulates communication and computation overhead of such player below the specified threshold. We also provide a mechanism for satisfying the criterion, where subregions overlapped with each player's view must be switched quickly and seamlessly as the view moves around in the game world. In the proposed techniques where an efficient provisioning of resources is realized, they relieve a lot of computational power and network traffic, the load on the servers in the cloud by exploiting the capacity of the players effectively. Simulation results show that the MMORPG based on cloud and P2P architecture can reduce the considerable bandwidth at the server compared to the client server architecture as the available resources grow with the number of players in crowding or hotspots.

Feature Classification of Hanguel Patterns by Distance Transformation method (거리변환법에 의한 한글패턴의 특징분류)

  • Koh, Chan;Lee, Dai-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.6
    • /
    • pp.650-662
    • /
    • 1989
  • In this paper, a new algorithm for feature extraction and classification of recognizing Hanguel patterns is proposed. Inputed patterns classify into six basic formal patterns and divided into subregion of Hanguel phoneme and extract the crook feature from position information of the each subregion. Hanguel patterns are defined and are made of the indexed-sequence file using these crook features points. Hanguel patterns are recognized by retrievignt ehses two files such as feature indexed-sequence file and standard dictionary file. Thi paper show that the algorithm is very simple and easily construct the software system. Experimental result presents the output of feature extraction and grouping of input patterns. Proposed algorithm extract the crooked feature using distance transformation method within the rectangle of enclosure the characters. That uses the informationof relative position feature. It represents the 97% of recognition ratio.

  • PDF

Implementation of a Feature Extraction Chip for High Speed OCR (고속 문자 인식을 위한 특정 추출용 칩의 구현)

  • 김형구;강선미;김덕진
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.6
    • /
    • pp.104-110
    • /
    • 1994
  • We proposed a high speed feature extraction algorithm and developed a feature vector extraction chip for high speed character recognition. It is hard to implement a high speed OCR by software alone with statistical method . Thus, the whole recognition process is divided into functional steps, then pipeline processed so that high speed processing is possible with temporal parallelism of the steps. In this paper we discuss the feature extraction step of the functional steps. To extract feature vector, a character image is normalized to 40$\times$40 pixels. Then, it is divided into 5$\times$5 subregions and 4x4 subregions to construct 41 overlapped subregions(10x10 pixels). It requires to execute more than 500 commands to extract a feature vector of a subregion by software. The proposed algorithm, however, requires only 10 cycles since it can extract a feature vector of a columm of subregion in one cycle with array structure. Thus, it is possible to process 12.000 characters per second with the proposed algorithm. The chip is implemented using EPLD and the effectiveness is proved by developing an OCR using it.

  • PDF