• 한국수자원학회논문집
• /
• 제53권8호
• /
• pp.597-604
• /
• 2020

하도홍수추적을 위한 수문학적 방법인 머스킹검 방법은 유입량, 유출량 그리고 저류량의 관계를 활용하여 유출량을 예측하는 방법이다. 머스킹검 방법에 관한 많은 연구가 진행되면서 필요한 매개변수들은 점점 늘어나게 되었고, 많은 매개변수로 인해 계산과정이 복잡해졌다. 이러한 문제를 해결하기 위해 최적화 알고리즘을 머스킹검 방법의 매개변수 산정에 적용하였다. 본 연구는 Advanced Nonlinear Muskingum Model considering continuous flow (ANLMM-L)를 Wilson 홍수자료와 Sutculer 홍수자료에 적용하여 Linear Munsingum Model incorporating Lateral flow (LMM-L)과 Kinematic Wave Model (KWM)의 결과와 비교하였다. 관측 유출량과 모의 유출량과의 비교를 위한 지표로 Sum of Squares (SSQ)를 사용하였다. Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS)가 ANLMM-L의 매개변수 산정에 적용되었다. Wilson 홍수자료에 적용한 결과 LMM-L보다 ANLMM-L이 정확한 결과를 나타냈다. Sutculer 홍수자료에서는 ANLMM-L이 KWM보다 좋은 결과를 보이긴 했으나, Sutculer 홍수자료의 유량이 크기 때문에 Wilson 홍수자료의 경우에 비해 SSQ가 크게 나타났다. EBHS-CGS는 본 연구에서 적용한 머스킹검 홍수추적뿐만 아니라 다양한 수자원 공학 문제에 적용할 수 있을 것이다.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.123-131
• /
• 2006

Several distributed architectures, incorporating mobile agent technology, have been recently proposed to answer the scalability limitations of their centralized counterparts. However, these architectures fail to address scalability problems, when distributed tasks requiring the employment of itinerant agents is considered. This is because they lack mechanisms that guarantee optimization of agents' itineraries so as to minimize the total migration cost in terms of the round-trip latency and the incurred traffic. This is of particular importance when MAs itineraries span multiple subnets. The work presented herein aspires to address these issues. To that end, we have designed and implemented an algorithm that adapts methods usually applied for addressing network design problems in the specific area of mobile agent itinerary planning. The algorithm not only suggests the optimal number of mobile agents that minimize the overall cost but also constructs optimal itineraries for each of them. The algorithm implementation has been integrated into our mobile agent framework research prototype and tested in real network environments, demonstrating significant cost savings.

• 전기전자학회논문지
• /
• 제6권1호
• /
• pp.87-93
• /
• 2002

본 논문에서는 n 차원의 하이퍼큐브(hypercube) 구조의 분산 시스템에서 새로운 부하분산 알고리즘을 제안하였다. 제안된 알고리즘은 인접노드에게만 과부하 노드의 부하를 전송하여 발생되었던 blocking phenomenon을 억제하였으며 processor thrashing을 방지하기 위하여 한 프로세서에 모든 프로세서의 정보를 모아 실행하는 중앙집중형 알고리즘의 장점을 응용하였다. 제안된 알고리즘의 성능 평가를 위하여 컴퓨터 모의실험을 수행하고 다른 알고리즘과 비교하였다. 2차원 하이퍼큐브 분산 시스템의 경우에는 각 알고리즘의 부하분산 결과가 큰 차이를 보이지 않았으나 3차원과 4차원의 경우에는 제안된 알고리즘이 보다 나은 결과를 보여주었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.153-154
• /
• 2006

We propose the dynamic channel allocation (DCA) algorithm for multi-cell OFDMA systems to avoid co-channel interference (CCI). The proposed algorithm is utilized not in a centralized, but in a distributed manner which reduces complexity. The simulation results confirm that the number of overlapping allocated subcarriers is reduced and the average SINR of a sub-carrier is increased by this algorithm.

• 한국컴퓨터정보학회논문지
• /
• 제24권2호
• /
• pp.67-74
• /
• 2019

Since the announcement of bitcoin, new cryptocurrencies have been launched steadily and blockchain technology is also evolving with cryptocurrcies. In particular, security-related technologies such as consensus algorithm and hash algorithm have been improved and transaction processing speed has also been drastically improved to a level that can replace a centralized system. In addition, the advent of smart contract technology and the DApp platform also provides a means for cryptocurrency to decentralize social services beyond just payment. In this paper, we first describe the technologies for implementing cryptocurrency. And the major cryptocurrencies are described with a focus on the technical characteristics. In addition, the development of cryptocurrency technology is expanding the scope of use, so we tried to introduce various cryptocurrencies.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2022년도 추계학술대회
• /
• pp.459-461
• /
• 2022

Network-on-Chip (NoC) 이 오프칩 네트워크 기반의 기존 병렬처리 시스템과 가장 크게 다른 점은 데이터 패킷 라우팅을 중앙 제어 방식(Centralized control scheme)으로 수행한다는 점이다. 이러한 환경에서 Best-effort 패킷 라우팅 문제는 데이터 패킷이 해당 코어에 도달 및 처리되는 시간을 Cost 로 하는 실시간 최소화 할당 문제(Assignment problem)가 된다. 본 논문에서는 할당 문제의 선형 대수 방정식에 대한 대표적인 연산 복잡도 저감 알고리즘인 헝가리안 알고리즘을 하드웨어 가속기 형태로 구현하였다. TSMC 0.18um 표준 셀라이브러리를 이용하여 논리 합성한 결과 헝가리안 알고리즘의 연산과정을 그대로 구현한 하드웨어 회로보다 Cost 분포에 대한 Case 분석을 통하여 구현한 것이 면적은 약 16%, Propagation delay는 약 52% 감소한 것으로 나타났다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1982-1985
• /
• 2003

Future cellular networks will mainly be driven by, high quality channels, high band with utilization, low power consumption and efficient network management. For a given channel allocation, the capacity and quality of communication of cellular radio systems using CDMA(Code Division Multiple Access) can be increased by using a transmitter power control scheme to combat the near-far problem. Centralized power control schemes or distributed ones to maximize the minimum signal-to-interference in each user of CDMA wireless network have been investigated. This paper has proposed a distributed power control algorithm, which employs an adaptive search scheme, in order to solve quickly the linear systems of equations for power update in CDMA cellular radio systems. The simulation results show that the proposed scheme has faster convergence rate than the typical bang-bang type of distributed power control algorithm, which has been much used as a reference algorithm in IS-95A and W-CDMA communication network.

• 산업경영시스템학회지
• /
• 제32권1호
• /
• pp.72-78
• /
• 2009

This paper considers a multiagent scheduling problem under public information where a machine is shared by multiple agents. Each agent has a local objective among the minimization of total completion time and the minimization of maximum. In this problem, it is assumed that scheduling information is public. Therefore an agent can access to complete information of other agents and pursue efficient schedules in a centralized manner. We propose an enumeration scheme to find Pareto optimal schedules and a multiobjective genetic algorithm as a heuristic approach. Experimental results indicate that the proposed genetic algorithm yields close-to Pareto optimal solution under a variety of experimental conditions.

• 한국통신학회논문지
• /
• 제34권12B호
• /
• pp.1498-1505
• /
• 2009

In centralized control sensor network, tree-based multi-channel communication overcomes the recurrent channel switching and makes possible to transfer data simultaneously from different sources. In our paper, we propose a greedy algorithm named as NIT (Non-Intersecting Tree) that the trees can avoid inter-tree interference. We also propose channel switching technique by which trees can avoid link failure or area blocking due to external interference locally without rerunningthe algorithm and without interrupting the whole network. At first we applied our algorithm for a random topology and then we evaluate the performance of the network using NS-2 simulator. The results show that with the increasing of channel the throughputand delivery ratio are increased significantly. We got better performance than a using a recent proposed Tree-based Multi-Channel Protocol (TMCP).

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2019년도 전력전자학술대회
• /
• pp.416-417
• /
• 2019

In this paper, an effective power flow control strategy (PFCS) based on the centralized control approach and a DC-link (DCV) restoration algorithm for DC microgrid (DCMG) are presented. By investigating the statuses of system power units, eleven operating modes are given to ensure the system power balance under various conditions. To avoid the system power imbalance caused by the delay of grid fault detection, a reliable DCV restoration algorithm is proposed. In the proposed scheme, when an abnormal variation of the DCV is detected, the battery instantly starts a local emergency control mode to restore the DCV to the nominal value regardless of the control mode from the central controller. The simulations and experiments are carried out to prove the effectiveness of the PFCS and the proposed DCV restoration algorithm.