• 융합보안논문지
• /
• 제22권1호
• /
• pp.71-79
• /
• 2022

정보기술과 전력 공급 시스템을 결합하여 전력 공급자와 소비자 간의 실시간 정보 교환을 통해 에너지 효율을 극대화하는 스마트 그리드 시스템이 등장했다. 중앙 클라우드 서버와 스마트 그리드 IoT 기기 사이에서 전력 관련 정보 수집 및 데이터저장 처리하는 엣지 서버를 활용하여 스마트 그리드 시스템을 위한 블록체인 기반의 사용자 인증 기법이 제안되고 있다. 최근, 스마트 그리드 환경에서 보안을 강화하기 위해 인증 방식이 제안되고 있지만 여전히 많은 취약점이 보고되고 있다. 본 논문은 블록체인을 이용한 엣지 컴퓨팅 기반의 스마트 그리드에서 사용자의 프라이버시와 익명성을 보장하기 위한 새로운 상호 인증 기법을 제시한다. 제안된 방식에서는 키 자료 업데이트 및 폐기와 같은 키 관리의 효율성을 위해 스마트 계약을 사용합니다. 마지막으로 제안하는 기법이 사용자의 스마트 그리드-IoT 기기와 에지 서버 간의 세션 키를 안전하게 설정함과 동시에 익명성을 보장함을 증명한다.

• ETRI Journal
• /
• 제34권6호
• /
• pp.869-878
• /
• 2012

A beam design method based on signal-to-leakage-plus-noise ratio (SLNR) has been recently proposed as an effective scheme for multiuser multiple-input multiple-output downlink channels. It is shown that its solution, which maximizes the SLNR at a transmitter, can be simply obtained by the generalized eigenvectors corresponding to the dominant generalized eigenvalues of a pair of covariance matrices of a desired signal and interference leakage plus noise. Under time-varying channels, however, generalized eigendecomposition is required at each time step to design the optimal beam, and its level of complexity is too high to implement in practical systems. To overcome this problem, a predictive beam design method updating the beams according to channel variation is proposed. To this end, the perturbed generalized eigenvectors, which can be obtained by a perturbation theory without any iteration, are used. The performance of the method in terms of SLNR is analyzed and verified using numerical results.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집C
• /
• pp.392-397
• /
• 2001

Topology optimization is applied to determine the layout of a structure whose eigenfrequency coincides with a specified frequency. The topology optimization problem is formulated to minimize the difference between the structural frequency and a given frequency using the homogenization method and the modified optimality criteria method. It turns out that the value of a weighting factor in the updating scheme plays an important role to achieve both a suitable speed and a stable convergence of an algorithm. Unlike a constant weighting factor in previous works, it is suggested that a weight factor is varied during the iteration to control the amount of the frequency change. To substantiate the proposed approach two-dimensional structural design problems are presented and the resulted topology layouts for the specified eigenfrequency are compared to layouts for maximizing the corresponding eigenfrequency.

• 한국경영과학회지
• /
• 제30권3호
• /
• pp.137-149
• /
• 2005

This study proposes a framework enhancing the accuracy of estimation for project duration by combining linear Bayesian updating scheme with the learning curve effect. Activities in a particular project might share resources in various forms and might be affected by risk factors such as weather Statistical dependence stemming from such resource or risk sharing might help us learn about the duration of upcoming activities in the Bayesian model. We illustrate, using a Monte Carlo simulation, that for partially repetitive projects a higher degree of statistical dependence among activity duration results in more variation in estimating the project duration in total, although more accurate forecasting Is achievable for the duration of an individual activity.

• 해양환경안전학회지
• /
• 제9권2호
• /
• pp.23-30
• /
• 2003

최근 개발 도입되고 있는 첨단항해계기와 관련된 새로운 기술, 관련 국제기준과 세계주요해양대학의 항해계기 관련 교육현황을 분석하였다. 그리고, 분석결과를 바탕으로 새로운 전자항해교육을 위한 교과목의 세부 요목을 제시하였다. 이것은 시대적 흐름을 반영한 해기교육과정의 편성과 해기면허시험의 세부요목을 설정하는데 참고 자료로서 충분히 활용할 수 있을 것이다.

• 한국IT서비스학회지
• /
• 제10권2호
• /
• pp.247-257
• /
• 2011

In this paper, we propose a multiple-disseminators determining mechanism for Efficient Code Dissemination with low-delay(ECoDi) for wireless sensor networks (WSN). Code dissemination is in the spotlight as an important research issue since sensor nodes are necessary for updating new software remotely or fixing bugs dynamically. In particular, the time factor for code dissemination is the most important factor in order that the normal operation of nodes can be continuously performed as soon as finishing the dissemination. For this factor, ECoDi determines the set of disseminators through regression analysis based on the size of distributed code and the time of past unicasts and broadcasts. Then it transmits the entire code as a unicast to multiple disseminators, and the disseminators broadcast the code to the remaining neighbor nodes. Performance results on a testbed show that ECoDi reduces dissemination time significantly compared to a conventional scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1265-1278
• /
• 2017

Dynamic task scheduling is one of the most popular research topics in the cloud computing field. The cloud scheduler dynamically provides VM resources to variable cloud tasks with different scheduling strategies in cloud computing. In this study, we utilized a valid model to describe the dynamic changes of both computing facilities (such as hardware updating) and request task queuing. We built a novel approach called Policy Iteration Scheduling (PIS) to globally optimize the independent task scheduling scheme and minimize the total execution time of priority tasks. We performed experiments with randomly generated cloud task sets and varied the performance of VM resources using Poisson distributions. The results show that PIS outperforms other popular schedulers in a typical cloud computing environment.

• The Journal of the Acoustical Society of Korea
• /
• 제15권1E호
• /
• pp.89-94
• /
• 1996

This paper deals with the application of the LMS algorithm as a decision-directed adaptive equalizer in a communication receiver which also employs a sophisticated decoding scheme such as the Viterbi algorithm, in which the desired signal, hence the error, is not available until several symbol intervals later because of decoding delay. In such applications the implemented weight updating algorithm becomes DLMS and major penalty is reduced convergence speed. Therefore, every effort should by made to keep the delay as small as possible if it is not avoidable. In this paper we present a modified implementation in which the effects of the decoding delay can be avioded and perform some computer simulations to check the validity and the performance of the new implementation.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.269-272
• /
• 2001

Since Multi-way Search Tree reduces the number of the memory access by increasing the branch factor, it is considered a method to archive the high-speed IP address lookup. Using the combination of initial 16 bit may and Multi-way Search Tree, it also reduces the search time of If address lookup. Multi-way Search Tree consists of K keys and K＋1 key pointers. This paper shows how the E update of Multi-way Search Tree which consists of the one pointer within a node can be performed. Using the one pointer within a node, it increases the number of keys within a node and reduces the search time of IP lookup. We also describes IP updating methods such as modification, Insertion and Deletion of address entries. Our update scheme performs better than the method which rebuilds the entire IP routing table when IP update processes.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 제39회 하계학술대회
• /
• pp.653-654
• /
• 2008

This paper presents a topological shape optimization for electromagnetic system using a level set method. The optimization is progressed by updating the implicit level set function from the Hamilton-Jacobi equation. The up-wind scheme is used for numerical implementation of the Hamilton-Jacobi equation. In order to validate the proposed optimization, the core part of a C-core actuator is optimized by three cases using different materials; (single steel), (two steels), and (steel and magnet).