• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권1호
• /
• pp.281-298
• /
• 2020

Fog computing has become a popular concept in the application of internet of things (IoT). With the superiority in better service providing, the edge cloud has become an attractive solution to IoT networks. The data outsourcing scheme of IoT devices demands privacy protection as well as computation verification since the lightweight devices not only outsource their data but also their computation. Existing solutions mainly deal with the operations over encrypted data, but cannot support the computation verification in the same time. In this paper, we propose a data outsourcing scheme based on an encrypted database system with linear computation as well as efficient query ability, and enhance the interlayer program in the original system with homomorphic message authenticators so that the system could perform computational verifying. The tools we use to construct our scheme have been proven secure and valid. With our scheme, the system could check if the cloud provides the correct service as the system asks. The experiment also shows that our scheme could be as effective as the original version, and the extra load in time is neglectable.

• 대한조선학회논문집
• /
• 제53권1호
• /
• pp.1-9
• /
• 2016

It is important to research and understand the physical phenomenon around a semi-submersible offshore structure on waves and currents because the wave run-up and load occurs owing to the waves and currents. In this study, the numerical simulations are performed about flow around a fixed semi-submersible offshore structure. The Modified Marker-density method is adopted in the present computation procedure, this method is one of the various methods to define the free-surface. The present computation results are compared with existing experimental and numerical simulation(VOF method) results. And, the computation results are relatively coincident with the existing results of model test and numerical simulation by VOF method.

• 대한전기학회논문지
• /
• 제31권7호
• /
• pp.1-10
• /
• 1982

This paper derives the algorithm to estimate the operating cost, its marginal cost, and the reliability indices for the long term planning of power system. Treating the load duration curve and the system in the stochastic sense takes the place of the inverted load duration curve, effective load duration curve, and the numerical integration in the conventional methods. The time and accuracy of computation are substantially improved due to the fact that all expressions are represented by simple analytic form instead of the existing recursive form.

• Computers and Concrete
• /
• 제7권4호
• /
• pp.303-315
• /
• 2010

In this paper, we present a new finite Timoshenko beam element with a model for ultimate load computation of reinforced concrete frames. The proposed model combines the descriptions of the diffuse plastic failure in the beam-column followed by the creation of plastic hinges due to the failure or collapse of the concrete and or the re-bars. A modified multi-scale analysis is performed in order to identify the parameters for stress-resultant-based macro model, which is used to described the behavior of the Timoshenko beam element. The micro-scale is described by using the multi-fiber elements with embedded strain discontinuities in mode 1, which would typically be triggered by bending failure mode. A special attention is paid to the influence of the axial force on the bending moment - rotation response, especially for the columns behavior computation.

• Journal of international Conference on Electrical Machines and Systems
• /
• 제1권2호
• /
• pp.10-17
• /
• 2012

This paper presents an improved iron loss model, for the computation of the no load iron loss in the stator core of the in-wheel permanent magnet synchronous motors (PMSM), for the cases of with and without stator skew. 2-D analytical model is used for the computation of tooth and yoke flux densities of the in-wheel PMSM. The no load iron loss computed by the improved iron loss model, for the cases of with and without skew is compared with the finite element method (FEM) and the results show good consistency.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제4권10호
• /
• pp.337-342
• /
• 2015

이 논문에서는 소수 추출 방법인 Sieve of Eratosthenes 알고리즘을 병렬화하여 실행 시간과 에너지 소모 면에서 개선된 효과를 얻고자 실험을 진행하였다. 성능 개선을 위해 부하 균등화를 정교하게 조절하도록 파이프라인 작업 방식을 도입하였고, 멀티코어 컴퓨터 클러스터에 하이브리드 병렬 프로그래밍 모델을 활용하여 효과를 높였다. 소규모 컴퓨터 클러스터와 저전력 컴퓨터에서 구현, 실험한 결과 이전 방식보다 연산 속도가 향상되었고, 에너지 사용량도 감소함을 확인하였다.

• 대한전기학회논문지:전력기술부문A
• /
• 제53권9호
• /
• pp.494-499
• /
• 2004

This paper presents to compute the power economic dispatch, an optimal power flow (OPF) computation algorithm, considering the load power factor limits constraint in developed. Efficient reactive power planning enhances economic operation as well as system security. Accordingly, an adequate level of power factor limits for the load busesshould be evaluated for economic operation. In this paper, the ranges of acceptable load power factors are portrayed as bandwidths of load power factor expressed as a function of load level. The load power factor limits are included and described into the OPF's objective function. The method Proposed is applied to IEEE 26 bus system.

• Journal of information and communication convergence engineering
• /
• 제7권1호
• /
• pp.19-23
• /
• 2009

In this paper, we propose a general idea about an RFID system which provides lighted weight algorithm. We discuss how RFID could be applied for this kind of system, especially, compact protocol. We evaluate a few protocols that have been suggested for use in passive RFID tagged systems. We can reduce security computation without losing security features by message integration and pre-computation in this paper. And the proposed protocol can be used in low-cost RFID systems that require a small computational load for both the back-end database and the tags.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2009년도 정보통신설비 학술대회
• /
• pp.131-135
• /
• 2009

This paper is the introduction of our work on distributed load scheduling in single-level tree network. In this paper, we derive a new calculation model in single-level tree network and show a closed-form formulation of the time for computation system. There are so many examples of the application of this technology such as distributed database, biology computation on genus, grid computing, numerical computing, video and audio signal processing, etc.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권6호
• /
• pp.2282-2303
• /
• 2021

To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.