• 방송공학회논문지
• /
• 제10권1호
• /
• pp.83-102
• /
• 2005

The problem of video scheduling is analyzed in the framework of divisible load scheduling. A divisible load can be divided into any number of fractions (parts) and can be processed/computed independently on the processors in a distributed computing system/network, as there are no precedence relationships. In the video scheduling, a frame can be split into any number of fractions (tiles) and can be processed independently on the processors in the network, and then the results are collected to recompose the single processed frame. The divisible load arrives at one of the processors in the network (root processor) and the results of the computation are collected and stored in the same processor. In this problem communication delay plays an important role. Communication delay is the time to send/distribute the load fractions to other processors in the network. and the time to collect the results of computation from other processors by the root processors. The objective in this scheduling problem is that of obtaining the load fractions assigned to each processor in the network such that the processing time of the entire load is a minimum. We derive closed-form expression for the processing time by taking Into consideration the communication delay in the load distribution process and the communication delay In the result collection process. Using this closed-form expression, we also obtain the optimal number of processors that are required to solve this scheduling problem. This scheduling problem is formulated as a linear pro-gramming problem and its solution using neural network is also presented. Numerical examples are presented for ease of understanding.

• 한국해양공학회지
• /
• 제12권1호
• /
• pp.10-22
• /
• 1998

In the present work the elastic-plastic FE formulations using dynamic explicit time integration schemes are used for numerical analysis of a large auto-body panel stamping processes. For analyses of more complex cases with larger and more refined meshes, the explicit method is more time effective than implicit method, and has no convergency problem and has the robust nature of contact and friction algorithms while implicit method is widely used because of excellent accuracy and reliability. The elastic-plastic scheme is more reliable and rigorous while the rigid-plastic scheme require small computation time. In finite element simulation of auto-body panel stamping processes, the roobustness and stability of computation are important requirements since the computation time and convergency become major points of consideration besides the solution accuracy due to the complexity of geometry conditions. The performnce of the dynamic explicit algorithms are investigated by comparing the simulation results of formaing of complicate shaped autobody parts, such as a fuel tank and a rear hinge, with the experimental results. It has been shown that the proposed dynamic explicit elastic-plastic finite element method enables an effective computation for complicated auto-body panel stamping processes.

• 전자공학회논문지B
• /
• 제31B권11호
• /
• pp.1-10
• /
• 1994

문제의 병행처리를 위한 모델링 방법과 문제의 병행성을 동적 환경에서 자동으로 검출하기 위하여 병행 연산모델 두레를 설계하고 두레언어 DL로 구현하였다. 두레모델은 문제의 모델링과 연산수행을 위해 단순하고 일관된 개념의 객체 정의와 메시지 전송개념을 지원한다. 문제의 병행처리를 프로그램에 명시하지 않고도 암시적으로 지원할 수 있도록 병행성의 검출 기준을 제안하였으며, 동적 환경에서 병행객체를 생성하여 최대한의 병행성을 보장하도록 하였다. 또한 객체의 연산 진행을 효율적으로 보장해 줄 수 있도록 Waiting Variable의 개념을 제안하였다.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2009년도 학술대회
• /
• pp.685-689
• /
• 2009

진화연산은 최적화와 기계학습에 널리 사용되지만 또한 창조적이고 새로운 것을 만드는 데에도 사용될 수 있다. 본 논문에서는 지식을 표현하는 유연한 구조인 토픽맵에 주목하여, 새롭고 창의적인 토픽맵을 생성하는 토픽맵의 진화 시스템을 제안한다. 여기서는 만들어진 토픽맵이 유효한지에 대한 사람의 평가를 활용하는 대화형 진화 연산 방법(Interactive Evolutionary Computation)이 사용된다. 본 진화하는 토픽맵 시스템은 창의성을 도모하는 도구로서, 사용자들에게 새롭고 창의적인 지식을 떠올릴 수 있도록 도울 수 있을 것이다. 앞으로는 이 시스템에 보다 토픽맵에 정교한 사용자 인터페이스와 시각화 방법을 도입하고 기계학습을 활용하여 시스템의 진화 중에 나타나는 사용자의 피로를 크게 줄이는 방법을 연구할 것이다.

• 한국IT서비스학회지
• /
• 제9권4호
• /
• pp.219-229
• /
• 2010

The Green's equivalence relations have played a fundamental role in the development of semigroup theory. They are concerned with mutual divisibility of various kinds, and all of them reduce to the universal equivalence in a group. Boolean matrices have been successfully used in various areas, and many researches have been performed on them. Studying Green's relations on a monoid of boolean matrices will reveal important characteristics about boolean matrices, which may be useful in diverse applications. Although there are known algorithms that can compute Green relations, most of them are concerned with finding one equivalence class in a specific Green's relation and only a few algorithms have been appeared quite recently to deal with the problem of finding the whole D or J equivalence relations on the monoid of all $n{\times}n$ Boolean matrices. However, their results are far from satisfaction since their computational complexity is exponential-their computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices and the size of the monoid of all $n{\times}n$ Boolean matrices grows exponentially as n increases. As an effort to reduce the execution time, this paper shows an isomorphism between the R relation and L relation on the monoid of all $n{\times}n$ Boolean matrices in terms of transposition. introduces theorems based on it discusses an improved algorithm for the J relation computation whose design reflects those theorems and gives its execution results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4329-4348
• /
• 2019

Mobile cloud computing (MCC) can offload heavy computation from mobile devices onto nearby cloudlets or remote cloud to improve the performance as well as to save energy for these devices. Therefore, it is essential to consider how to achieve efficient computation offloading with constraints for multiple users. However, there are few works that aim at multi-objective problem for multiple users. Most existing works concentrate on only single objective optimization or aim to obtain a tradeoff solution for multiple objectives by simply setting weight values. In this paper, a multi-objective optimization model is built to minimize the average energy consumption, time and cost while satisfying the constraint of bandwidth. Furthermore, an improved multi-objective optimization algorithm called D-NSGA-II-ELS is presented to get Pareto solutions with better convergence and diversity. Compared to other existing works, the simulation results show that the proposed algorithm can achieve better performance in terms of energy consumption, time and cost while satisfying the constraint of the bandwidth.

• Structural Engineering and Mechanics
• /
• 제64권6권
• /
• pp.695-701
• /
• 2017

This paper investigates some general properties in the degenerate scale problem of antiplane elasticity or Laplace equation. For a given configuration, the degenerate scale problem is solved by using conformal mapping technique, or by using the null field BIE (boundary integral equation) numerically. After solving the problem, we can define and evaluate the degenerate area which is defined by the area enclosed by the contour in the degenerate configuration. It is found that the degenerate area is an important parameter in the problem. After using the conformal mapping, the degenerate area can be easily evaluated. The degenerate area for many configurations, from triangle, quadrilles and N-gon configuration are evaluated numerically. Most properties studied can only be found by numerical computation. The investigated properties provide a deeper understanding for the degenerate scale problem.

• 정보보호학회논문지
• /
• 제27권3호
• /
• pp.477-487
• /
• 2017

MPC(multiparty computation) 프로토콜이란 다수의 사용자가 각각 데이터를 제공하고, 이를 이용하여 협력적으로 연산을 수행하는 기법이다. 기존의 MPC 프로토콜은 사용자 사이의 상호작용에 의존했기 때문에, 연산이 끝날 때까지 모든 사용자가 온라인 상태를 유지해야 했다. 이를 개선하기 위한 연구 중 하나로서, 공모하지 않은 두 서버에 연산을 위임하는 기법이 연구되고 있다. 사용자의 참여를 완전히 배제한 최초의 기법이 Peter 등에 의해 제안되었으나, 서버 간 통신량이 매우 높다는 단점이 있다. 본 논문에서는 Peter 등의 기법에서 문제가 되었던 서버 간 통신량을 PRE(proxy re-encryption)를 이용하여 개선하였다. 제안하는 기법과 유사한 기법이 두 차례 제안되었으나, 복호화 과정에서 이산대수 문제를 해결해야 하거나, 서버와 사용자 사이의 공모공격에 취약한 등 다양한 문제점이 존재한다. 본 논문에서는 기존 기법의 문제점을 분석하고 이를 바탕으로 안전하고 효율적인 MPC 프로토콜을 제안한다. 제안하는 기법은 PRE를 이용하여 서버 간 통신량을 낮추었으며, 연산과정에서 사용자의 참여를 완전히 배제하였고, 복호화 과정에서 이산대수문제를 풀지 않고도 연산결과를 얻을 수 있다.

• Industrial Engineering and Management Systems
• /
• 제10권1호
• /
• pp.24-33
• /
• 2011

In this paper, we consider the Location-Routing Problem with simultaneous pickup and delivery (LRPSPD) which is a general case of the location-routing problem. The LRPSPD is defined as finding locations of the depots and designing vehicle routes in such a way that pickup and delivery demands of each customer must be performed with same vehicle and the overall cost is minimized. Since the LRPSPD is an NP-hard problem, we propose a hybrid heuristic approach based on genetic algorithms (GA) and simulated annealing (SA) to solve the problem. To evaluate the performance of the proposed approach, we conduct an experimental study and compare its results with those obtained by a branch-and-cut algorithm on a set of instances derived from the literature. Computational results indicate that the proposed hybrid algorithm is able to find optimal or very good quality solutions in a reasonable computation time.

• 전기학회논문지
• /
• 제56권10호
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.