• 제목/요약/키워드: Benchmark Problem

검색결과 460건 처리시간 0.031초

Application of Coupled Reactor Kinetics Method to a CANDU Reactor Kinetics Problem.

  • Kim, Hyun-Dae-;Yeom, Choong-Sub;Park, Kyung-Seok-
    • 한국에너지공학회:학술대회논문집
    • /
    • 한국에너지공학회 1994년도 추계학술발표회 초록집
    • /
    • pp.141-145
    • /
    • 1994
  • A computer code for solving the 3-D time-dependent multigroup neutron diffusion equation by a coupled reactor kinetics method recently developed has been developed and for evaluating its applicability in CANDU transient analysis applied to a 3-D kinetics benchmark problem which reveals non-uniform loss of coolant accident followed by an asymmetric insertion of shutdown devices. The performance of the method and code has been compared with the CANDU design code, CERBERUS, employing a finite difference improved quasistatic method.

  • PDF

CLB-ECC: Certificateless Blind Signature Using ECC

  • Nayak, Sanjeet Kumar;Mohanty, Sujata;Majhi, Banshidhar
    • Journal of Information Processing Systems
    • /
    • 제13권4호
    • /
    • pp.970-986
    • /
    • 2017
  • Certificateless public key cryptography (CL-PKC) is a new benchmark in modern cryptography. It not only simplifies the certificate management problem of PKC, but also avoids the key escrow problem of the identity based cryptosystem (ID-PKC). In this article, we propose a certificateless blind signature protocol which is based on elliptic curve cryptography (CLB-ECC). The scheme is suitable for the wireless communication environment because of smaller parameter size. The proposed scheme is proven to be secure against attacks by two different kinds of adversaries. CLB-ECC is efficient in terms of computation compared to the other existing conventional schemes. CLB-ECC can withstand forgery attack, key only attack, and known message attack. An e-cash framework, which is based on CLB-ECC, has also been proposed. As a result, the proposed CLB-ECC scheme seems to be more effective for applying to real life applications like e-shopping, e-voting, etc., in handheld devices.

전력손실을 고려한 분산전원의 최적 위치 및 용량 선정 (Selection of Optimal Location and Size of Distributed Generation Considering Power Loss)

  • 이수형;박정욱
    • 전기학회논문지
    • /
    • 제57권4호
    • /
    • pp.551-559
    • /
    • 2008
  • Increase in power consumption can cause a serious stability problem of an electric power system without construction of new power plants or transmission lines. Also, it can generate large power loss of the system. In costly and environmentally effective manner to avoid constructing the new infrastructures such as power plants and transmission lines, etc, the distributed generation(DG) has paid great attentions so far as a solution for the above problem. Selection of optimal location and size of the DG is the necessary process to maintain the stability and reliability of existing system effectively. However, the systematic and cardinal rule for this issue is still open question. In this paper, the method to determine optimal location of the DG is proposed by considering power loss when the DG is connected to an electric power grid. Also, optimal size of not only the corresponding single DG but also the multi-DGs is determined with the proposed systematic approach. The IEEE benchmark 30-bus test system is analyzed to evaluate the feasibility and effectiveness of the proposed method.

Cooperative Coevolution Differential Evolution Based on Spark for Large-Scale Optimization Problems

  • Tan, Xujie;Lee, Hyun-Ae;Shin, Seong-Yoon
    • Journal of information and communication convergence engineering
    • /
    • 제19권3호
    • /
    • pp.155-160
    • /
    • 2021
  • Differential evolution is an efficient algorithm for solving continuous optimization problems. However, its performance deteriorates rapidly, and the runtime increases exponentially when differential evolution is applied for solving large-scale optimization problems. Hence, a novel cooperative coevolution differential evolution based on Spark (known as SparkDECC) is proposed. The divide-and-conquer strategy is used in SparkDECC. First, the large-scale problem is decomposed into several low-dimensional subproblems using the random grouping strategy. Subsequently, each subproblem can be addressed in a parallel manner by exploiting the parallel computation capability of the resilient distributed datasets model in Spark. Finally, the optimal solution of the entire problem is obtained using the cooperation mechanism. The experimental results on 13 high-benchmark functions show that the new algorithm performs well in terms of speedup and scalability. The effectiveness and applicability of the proposed algorithm are verified.

Isogeometric analysis of gradient-enhanced damaged plasticity model for concrete

  • Xu, Jun;Yuan, Shuai;Chen, Weizhen
    • Computers and Concrete
    • /
    • 제23권3호
    • /
    • pp.171-188
    • /
    • 2019
  • This study proposed a new and efficient 2D damage-plasticity model within the framework of Isogeometric analysis (IGA) for the geometrically nonlinear damage analysis of concrete. Since concrete exhibits complicated material properties, two internal variables are introduced to measure the hardening/softening behavior of concrete in tension and compression, and an implicit gradient-enhanced formulation is adopted to restore the well-posedness of the boundary value problem. The numerical results calculated by the model is compared with the experimental data of three benchmark problems of plain concrete (three-point and four-point bending single-notched beams and four-point bending double-notched beam) to illustrate the geometrical flexibility, accuracy, and robustness of the proposed approach. In addition, the influence of the characteristic length on the numerical results of each problem is investigated.

Optimal Two-Section Layouts for the Two-Dimensional Cutting Problem

  • Ji, Jun;Huang, Dun-hua;Xing, Fei-fei;Cui, Yao-dong
    • Journal of Information Processing Systems
    • /
    • 제17권2호
    • /
    • pp.271-283
    • /
    • 2021
  • When generating layout schemes, both the material usage and practicality of the cutting process should be considered. This paper presents a two-section algorithm for generating guillotine-cutting schemes of rectangular blanks. It simplifies the cutting process by allowing only one size of blanks to appear in any rectangular block. The algorithm uses an implicit enumeration and a linear programming optimal cutting scheme to maximize the material usage. The algorithm was tested on some benchmark problems in the literature, and compared with the three types of layout scheme algorithm. The experimental results show that the algorithm is effective both in computation time and in material usage.

동적 도시 환경에서 의미론적 시각적 장소 인식 (Semantic Visual Place Recognition in Dynamic Urban Environment)

  • 사바 아르샤드;김곤우
    • 로봇학회논문지
    • /
    • 제17권3호
    • /
    • pp.334-338
    • /
    • 2022
  • In visual simultaneous localization and mapping (vSLAM), the correct recognition of a place benefits in relocalization and improved map accuracy. However, its performance is significantly affected by the environmental conditions such as variation in light, viewpoints, seasons, and presence of dynamic objects. This research addresses the problem of feature occlusion caused by interference of dynamic objects leading to the poor performance of visual place recognition algorithm. To overcome the aforementioned problem, this research analyzes the role of scene semantics in correct detection of a place in challenging environments and presents a semantics aided visual place recognition method. Semantics being invariant to viewpoint changes and dynamic environment can improve the overall performance of the place matching method. The proposed method is evaluated on the two benchmark datasets with dynamic environment and seasonal changes. Experimental results show the improved performance of the visual place recognition method for vSLAM.

Optimal Power Allocation for NOMA-based Cellular Two-Way Relaying

  • Guosheng, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권1호
    • /
    • pp.202-215
    • /
    • 2023
  • This paper proposes a non-orthogonal multiple access (NOMA) based low-complexity relaying approach for multiuser cellular two-way relay channels (CTWRCs). In the proposed scheme, the relay detects the signal using successive interference cancellation (SIC) and re-generates the transmit signal with zero-forcing (ZF) transmit precoding. The achievable data rates of the NOMA-based multiuser two-way relaying (TWR) approach is analyzed. We further study the power allocation among different data streams to maximize the weighted sum-rate (WSR). We re-form the resultant non-convex problem into a standard monotonic program. Then, we design a polyblock outer approximation algorithm to sovle the WSR problem.The proposed optimal power allocation algorithm converges fast and it is shown that the NOMA-TWR-OPA scheme outperforms a NOMA benchmark scheme and conventional TWR schemes.

법용 연합 처리 시스템에서의 전역배선 병렬화 기법 (Parallel algorithm of global routing for general purpose associative processign system)

  • 박태근
    • 전자공학회논문지A
    • /
    • 제32A권4호
    • /
    • pp.93-102
    • /
    • 1995
  • This paper introduces a general purpose Associative Processor(AP) which is very efficient for search-oriented applications. The proposed architecture consists of three main functional blocks: Content-Addressable Memory(CAM) arry, row logic, and control section. The proposed AP is a Single-Instruction, Multiple-Data(SIMD) device based on a CAM core and an array of high speed processors. As an application for the proposed hardware, we present a parallel algorithm to solve a global routing problem in the layout process utilizing the processing capabilities of a rudimentary logic and the selective matching and writing capability of CAMs, along with basic algorithms such a minimum(maximum) search, less(greater) than search and parallel arithmetic. We have focused on the simultaneous minimization of the desity of the channels and the wire length by sedking a less crowded channel with shorter wire distance. We present an efficient mapping technique of the problem into the CAM structure. Experimental results on difficult examples, on randomly generated data, and on benchmark problems from MCNC are included.

  • PDF

최신 중력 자료의 획득을 통한 우리나라 지오이드 모델 업데이트 (The Update of Korean Geoid Model based on Newly Obtained Gravity Data)

  • 이지선;권재현;금영민;문지영
    • 한국측량학회지
    • /
    • 제29권1호
    • /
    • pp.81-89
    • /
    • 2011
  • 기존의 우리나라의 지상중력 자료는 지역적으로 편향된 분포를 나타내며, 특히 산악지역에서는 그 분포가 현저히 떨어진다는 문제점이 존재하였다. 이러한 문제점은 GPS/Levelling 자료에서도 나타나며 이로 인하여 지오이드 정확도 향상에 한계가 있었다. 그러나 2008년부터 국토지리정보원에서 수행하고 있는 통합기준점 및 수준점 중력측량사업에서 새로운 중력 자료 및 GPS/Levelling 자료를 획득하였으며, 특히 이러한 자료들은 기존의 중력 및 GPS/Levelling 자료에 비해 월등한 분포와 정밀도를 나타내기 때문에 우리나라 지오이드 모델의 정밀도를 개선하는 기본 자료로 활용될 수 있다. 본 연구에서는 품질이 검증된 기존 자료와 새롭게 획득된 중력 자료를 포함하여 지오이드 모델을 구축하였다. 구축된 지오이드 모델의 정밀도는 새롭게 획득된 927점의 GPS/Levelling 자료와 비교한 결과 약 5.29cm로 나타났으며, 합성지오이드의 적합도 및 정밀도는 각각 약 2.99cm와 3.67cm로 산출되었다. 본 연구를 통하여 산출된 최신 지오이드 모델은 새로운 중력 자료를 포함하기 전에 구축된 모델에 비하여 우리나라 전역에서 약 27% 정도 정밀도가 향상되었으며, 특히 현저히 낮은 분포를 보이던 강원 및 경상지역에서는 중력자료의 업데이트에 의하여 약 42%의 정밀도 향상이 이루어 졌다. 2010년에 통합기준점 사업 및 수준점 측량사업을 통하여 약 4,000여점의 중력 자료와 300여점의 GPS/Levelling 자료가 획득되었기 때문에 향후 본 자료들을 함께 활용한다면 지오이드 모델 정밀도의 향상과 더불어 객관적으로 정밀도 검증이 가능할 것으로 판단된다.