• Journal of the Korean Association of Geographic Information Studies
• /
• v.12 no.3
• /
• pp.76-87
• /
• 2009

Most distributed models have been developed for data interchange between model for hydrological analysis and GIS(Geographic Information System). And some interface systems between them have been developed to operate the model conveniently. This study is about developing integrated system between model and GIS not coupled system based on file interchange or interface system. In this study, HyGIS-GRM which is integrated system between GRM(Grid based Rainfall-runoff Model) which is physically based distributed rainfall-runoff model and HyGIS(Hydro Geographic Information System) have been developed. HyGIS-GRM can carry out all the processes from preparing input data to appling them to model in the same system, and this operation environment can improve the efficiency of running the model and analyzing modeling results. HyGIS-GRM can provide objective modeling environment through establishing the process of integrated operation of GIS and distributed model, and we can obtain fundamental technologies for developing integrated system between GIS and water resources model.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.4
• /
• pp.278-289
• /
• 2013

Up-to-date market dynamics and intense competition have forced a production system to be more widely distributed and decentralized than ever, and the production system itself can be regarded as a collaborative network of autonomous production resources in which the responsibility of decision making is also decentralized into individual autonomous entities. The conventional resource management models, however, are not suitable for the distributed and decentralized environment because of their centralized nature. In this paper, an agent-based resource management model is proposed. The proposed model applies employment relation-driven fractal organization (FrOrg) into organizational model for distributed production resources and presents a resource management framework based on employment contracts. The fractal organization is a structured association in which a self-similar pattern recursively appears, and employment relations between production resources are recursively constructed throughout the entire production system.

• Journal of Information Processing Systems
• /
• v.12 no.1
• /
• pp.149-168
• /
• 2016

The Active Appearance Model (AAM) is a class of deformable models, which, in the segmentation process, integrates the priori knowledge on the shape and the texture and deformation of the structures studied. This model in its sequential form is computationally intensive and operates on large data sets. This paper presents another framework to implement the standard version of the AAM model. We suggest a distributed and parallel approach justified by the characteristics of the model and their potentialities. We introduce a schema for the representation of the overall model and we study of operations that can be parallelized. This approach is intended to exploit the benefits build in the area of advanced image processing.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2012.05a
• /
• pp.976-976
• /
• 2012

The applicability of a distributed rainfall-runoff model for large river basin flood forecasts is analyzed by applying the model to the Nakdong River basin. The spatially explicit hydrologic model was constructed and calibrated by the several storm events. The assimilation of the large scale Nakdong River basin were conducted by calibrating the sub-basin channel outflow, dam discharge in the basin rainfall-runoff model. The applicability of automatic and semi-automatic calibration methods was analyzed for real time calibrations. Further an ensemble distributed rainfall runoff model has been developed to measure the runoff hydrograph generated for any temporally-spatially varied rainfall events, also the runoff of basin can be forecast at any location as well. The results of distributed rainfall-runoff model are very useful for flood managements on the large scale basins. That offer facile, realistic management method for the avoiding the potential flooding impacts and provide a reference for the construct and developing of flood control facilities.

• Journal of Korea Water Resources Association
• /
• v.37 no.11
• /
• pp.969-978
• /
• 2004

According to the report of hydrologic modeling study, from a quantitative point of view, a lumped model is more efficient than a distributed model. A distributed model has to simplify geospatial characteristics for the shake of restricted application on computer calculation and field observation. In this reason, a distributed model can not help having some errors of water quantity modelling. However, considering a distribution of rainfall-runoff reflected spatial characteristics, a distributed model is more efficient to simulate a flow of surface water, The purpose of this study is modeling of spatial rainfall-runoff of surface water using grid based distributed model, which is consisted of storage function model and essential basin-channel parameters( slope, flow direction & accumulation), and that procedure is able to be executed at a personal computer. The prototype of this model is developed in Heongseong Multipunose Dam basin and adapted in Hapchon Multipurpose Dam basin, which is larger than the former about five times. The efficiency coefficients in result of two dam basin simulations are more than about 0.9, but ones at the upstream water level gauge station meet with bad result owing to overestimated rating curves in high water level. As a result of this study, it is easily implemented that spatially distributed rainfall-runoff model using GIS, and geophysical characteristics of the catchment, hereafter it is anticipated that this model is easily able to apply rainfall data by real time.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1433-1442
• /
• 1996

Data distribution of SPMD(Single Program Multiple Data) pattern is one of main features of HPF (High Performance Fortran). This paper describes design is sues for such data distribution and its efficient execution model on TICOM IV computer, named SPAX(Scalable Parallel Architecture computer based on X-bar network). SPAX has a hierarchical clustering structure that uses distributed shared memory(DSM). In such memory structure, it cannot make a full system utilization to apply unanimously either SMDD(shared Memory Data Distribution) or DMDD(Distributed Memory Data Distribution). Here we propose another data distribution model, called DSMDD(Distributed Shared Memory Data Distribution), a data distribution model based on hierarchical masters-slaves scheme. In this model, a remote master and slaves are designated in each node, shared address scheme is used within a node and message passing scheme between nodes. In our simulation, assuming a node size in which system performance degradation is minimized,DSMDD is more effective than SMDD and DMDD. Especially,the larger number of logical processors and the less data dependency between distributed data,the better performace is obtained.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.2
• /
• pp.147-154
• /
• 2012

In this paper, we revise the JDL data fusion model to have an ability of distributed data fusion(DDF). Data fusion is a function that produces valuable information using data from multiple sources. After the network centric warfare concept was introduced, the data fusion was required to be expanded to DDF. We identify the data transfer and control between nodes is the core function of DDF. The previous data fusion models can not be used for DDF because they don't include that function. Therefore, we revise the previous JDL data fusion model by adding the core function of DDF and propose this new model as a model for DDF. We show that our model is adequate and useful for DDF by using several examples.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.199-205
• /
• 2008

The centralized conference model has advantage of conference management and control. however it's scalability has been limited as performance degrades largely with increasing number of conference users. So new distributed conference models which improve scalability of centralized conference model have been suggested recently. In the distributed conference model. as conference users exceed a predefined maximum number, a new conference server is added to the conference dynamically. In this paper, We have proposed a new method which increases efficiency of conference event package processing that primary conference server should charge in the distributed conference environment. The primary conference server exchanges informations with each secondary conference servers and conference users by using conference event package. And from the conference information database it selects SIP(Session Initiation Protocol) UA(User Agent) which will share notification to the conference users, and transfers lists to each conference servers. The conference servers make the selected UAs share processing of conference event package, so loads of SIP signal processing decrease, and improve scalability of distributed conference model. The performance of our proposed model is evaluated by experiments.

• International Journal of Computer Science & Network Security
• /
• v.24 no.4
• /
• pp.192-196
• /
• 2024

The memory coherence problem occurs while mapping shared virtual memory in a loosely coupled multiprocessors setup. Memory is considered coherent if a read operation provides same data written in the last write operation. The problem is addressed in the literature using different algorithms. The big question is on the correctness of such a distributed algorithm. Formal verification is the principal term for a group of techniques that routinely use an analysis that is established on mathematical transformations to conclude the rightness of hardware or software behavior in divergence to dynamic verification techniques. This paper uses UPPAAL model checker to model the dynamic distributed algorithm for shared virtual memory given by K.Li and P.Hudak. We analyse the mechanism to keep the coherence of memory in every read and write operation by using a dynamic distributed algorithm. Our results show that the dynamic distributed algorithm for shared virtual memory partially fulfils its functional requirements.

• Journal of KIISE:Software and Applications
• /
• v.27 no.8
• /
• pp.795-803
• /
• 2000

This paper presents a shared data decomposition model for improving concurrency in multi-user, distributed software developments. In our model, the target software system is decomposed into the independent components based on project roles to be distributed over clients. The distributed components are decomposed into view objects and core objects to replicate only view objects in a distributed collaboration session. The core objects are kept in only one client and the locking is used to prevent inconsistencies. The grain size of a lock is a role instead of a class which is commonly used as the locking granularity in the existing systems. The experimental result shows that our model reduces response time by 12${\sim}$18% and gives good scalability.