• Nuclear Engineering and Technology
• /
• 제13권2호
• /
• pp.73-84
• /
• 1981

B$\Phi$rrensen은 3차원적 노심분석에 긴 시간이 요구되는 유한차분법의 대안으로서 경수형 원자로의 전체출력분포를 계산하는데 한가지의 coarse mesh 방법을 제안하였다. 이 방법은 계산시간이 매우 짧은 것으로 알려져 있지만. 그 계산의 정확도에 대한 것은 아직까지 알려져 있지 않다. 본 논문에서는 B$\Phi$rrensen의 방법을 IAEA benchmark 문제와 RIS$\Phi$ benchmark 문제에 적용시켜서 계산시간과 정확도에 대해서 고찰하였다. 두 문제에서 노심-반사체와의 경계조건과 B$\Phi$rrensen의 모델상수들의 개선으로 출력분포 계산의 정확도를 상당히 높힐 수 있었다.

• Nuclear Engineering and Technology
• /
• 제52권11호
• /
• pp.2422-2430
• /
• 2020

In order to improve calculational efficiency of the CAPP code in the analysis of the hexagonal reactor core, we have tried to implement a refined AFEN method with transverse gradient basis functions and interface flux moments in the hexagonal geometry. The numerical scheme for the refined AFEN method adopted here is the response matrix method that uses the interface partial currents as nodal unknowns instead of the interface fluxes used in the original AFEN method. Since the response matrix method is single-node based, it has good properties such as good calculational efficiency and parallel computing affinity. Because a refined AFEN method equivalent nonlinear FDM response matrix method tried first could not provide a numerically stable solution, a direct formulation of the refined AFEN response matrix were developed. To show the numerical performance of this response matrix method against the original AFEN method, the numerical error analyses were performed for several benchmark problems including the VVER-440 LWR benchmark problem and the MHTGR-350 HTGR benchmark problem. The results showed a more than three times speedup in computing time for the LWR and HTGR benchmark problems due to good convergence and excellent calculational efficiency of the refined AFEN response matrix method.

• 한국인터넷방송통신학회논문지
• /
• 제23권4호
• /
• pp.85-91
• /
• 2023

국산 마이크로서버인 KOSMOS의 활용을 위해 클라우드 컴퓨팅 분야의 실제 응용 서비스 기반 벤치마크 프로그램인 CloudSuite로 성능 평가 결과를 제시한다. CloudSuite는 오프라인 응용과 온라인 응용의 두 가지 부분에서 클라우드 서비스로 제공되는 몇 가지의 구분되는 응용 프로그램을 컨테이너 기반으로 제공하고 있다. KOSMOS의 유사 스펙의 비교군인 다른 마이크로서버와의 성능 비교에서 전 부분에 걸처 KOSMOS가 우수하였으며, 인텔 Xeon CPU 기반 서버와의 비교에서도 일부 오프라인 응용에서는 성능이 더 우수하였다. CloudSuite 오프라인 응용 벤치마크 프로그램인 Graph Analytics 수행 시 KOSMOS의 다수의 노드들을 분산 실행시킨 형상에서 인텔 Xeon CPU 기반 2개의 서버 비교군과 비교하였을 때, 각각 30.3%, 72.3%만큼의 수행시간을 감소시켰다.

• 대한기계학회논문집B
• /
• 제26권11호
• /
• pp.1521-1530
• /
• 2002

This article proposes a pressure based method for predicting flows at all speeds. The compressible SIMPLE algorithm is extended to unstructured grid framework. Convection terms are discretized using second-order scheme with deferred correction approach. Diffusion term discretization is based on structured grid analogy that can be easily adopted to hybrid unstructured grid solver. This method also uses node centered scheme with edge based data structure for memory and computing time efficiency of arbitrary grid types. Both incompressible and compressible benchmark problems are solved using the above methodology. The demonstration of this method is extended to slip flow problem that has low Reynolds number but compressibility effect. It is shown that the proposed method can improve efficiency in memory usage and computing time without losing any accuracy.

• 한국원자력학회:학술대회논문집
• /
• 한국원자력학회 1998년도 춘계학술발표회논문집(1)
• /
• pp.87-92
• /
• 1998

A nonlinear iterative scheme developed to reduce the computing time of the AFEN method was tested and applied to two benchmark problems. The new nonlinear method for the AFEN method is based on solving two-node problems and use of two nonlinear correction factors at every interface instead of one factor in the conventional scheme. The use of two correction factors provides higher-order accurate interface noes as well as currents which are used as the boundary conditions of the two-node problem. The numerical results show that this new method gives exactly the same solution as that of the original AEFEN method and the computing time is significantly reduced in comparison with the original AFEN method.

• International Journal of Computer Science & Network Security
• /
• 제21권4호
• /
• pp.131-139
• /
• 2021

In current time, anomaly detection is the primary concern of the administrative authorities. Suspicious activity identification is shifting from a human operator to a machine-assisted monitoring in order to assist the human operator and react to an unexpected incident quickly. These automatic surveillance systems face many challenges due to the intrinsic complex characteristics of video sequences and foreground human motion patterns. In this paper, we propose a novel approach to detect anomalous human activity using a hybrid approach of statistical model and Genetic Programming. The feature-set of local motion patterns is generated by a statistical model from the video data in an unsupervised way. This features set is inserted to an enhanced Genetic Programming based classifier to classify normal and abnormal patterns. The experiments are performed using publicly available benchmark datasets under different real-life scenarios. Results show that the proposed methodology is capable to detect and locate the anomalous activity in the real time. The accuracy of the proposed scheme exceeds those of the existing state of the art in term of anomalous activity detection.

• Nuclear Engineering and Technology
• /
• 제28권3호
• /
• pp.311-319
• /
• 1996

We reconstruct the assembly pinwise flux using several types of boundary conditions and confirm that the reconstructed fluxes are the same with the reference flux if the boundary condition is exact. We test EPRI-9R benchmark problem with four boundary conditions, such as Dirichlet boundary condition, Neumann boundary condition, homogeneous mixed boundary condition (albedo type), and inhomogeneous mixed boundary condition. We also test reconstruction of the pinwise flux from nodal values, specifically from the AFEN [1, 2] results. From the nodal flux distribution we obtain surface flux and surface current distributions, which can be used to construct various types of boundary conditions. The result show that the Neumann boundary condition cannot be used for iterative schemes because of its ill-conditioning problem and that the other three boundary conditions give similar accuracy. The Dirichlet boundary condition requires the shortest computing time. The inhomogeneous mixed boundary condition requires only slightly longer computing time than the Dirichlet boundary condition, so that it could also be an alternative. In contrast to the fixed-source type problem resulting from the Dirichlet, Neumann, inhomogeneous mixed boundary conditions, the homogeneous mixed boundary condition constitutes an eigenvalue problem and requires longest computing time among the three (Dirichlet, inhomogeneous mixed, homogeneous mixed) boundary condition problems.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 컴퓨터소사이어티 추계학술대회논문집
• /
• pp.45-48
• /
• 2003

We can easily buy network system for high performance micro-processor, progress computer architecture is caused of high bandwidth and low delay time. Coupling PC-based commodity technology with distributed computing methodologies provides an important advance in the development of single-user dedicated systems. Lately Network is joined PC or workstation by computers of high performance and low cost. Than it make intensive that Cluster system is resembled supercomputer. Unix, Linux, BSD, NT(Windows series) can use Cluster system OS(operating system). I'm chosen linux gain low cost, high performance and open technical documentation. This paper is benchmark performance of Beowulf clustering by UltraSPARC-1K(64bit-RISC processor). Benchmark tools use MPI(Message Passing Interface) and NetPIPE. Beowulf is a class of experimental parallel workstations developed to evaluate and characterize the design space of this new operating point in price-performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권1호
• /
• pp.396-413
• /
• 2017

Dynamically checking the integrity of software at run-time is always a hot and difficult spot for trusted computing. Control-flow integrity is a basic and important safety property of software integrity. Many classic and emerging security attacks who introduce illegal control-flow to applications can cause unpredictable behaviors of computer-based systems. In this paper, we present a software-based approach to checking violation of control flow integrity at run-time. This paper proposes a high-performance and low-overhead software control flow checking solution, control flow checking at virtual edges (CFCVE). CFCVE assigns a unique signature to each basic block and then inserts a virtual vertex into each edge at compile time. This together with insertion of signature updating instructions and checking instructions into corresponding vertexes and virtual vertexes. Control flow faults can be detected by comparing the run-time signature with the saved one at compile time. Our experimental results show that CFCVE incurs only 10.61% performance overhead on average for several C benchmark programs and the average undetected error rate is only 9.29%. Compared with previous techniques, CFCVE has the characteristics of both high fault coverage and low memory and performance overhead.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제8권2호
• /
• pp.183-194
• /
• 2002

이기종 워크스테이션 클러스터링은 응용 프로그램의 병렬 처리에 유용하며 비용 측면에서 효과적이다. 이기종 워크스테이션 클러스터링 환경에서 총작업반환시간을 최소화하기 위해서는 부하 균형 시스템이 필요하다. 기존의 부하 균형 방식은 각 워크스테이션의 처리능력에 가중치를 미리 부여하여 작업을 분배하는 정적방식이거나, 각 워크스테이션의 상대적 처리능력을 얻기 위해서 성능 테스트 프로그램을 수행하는 동적 방식이 있다. 수행되는 응용 프로그램과는 관계없는 성능 테스트 프로그램은 계산시간을 소비하고 총작업반환시간을 지연시킨다. 이 논문은 상대적 부하 색인에 기초한 효과적 작업 분배 방식과 작업 이주 방식을 제안하였으며 이기종 워크스테이션 클러스터 환경에서 부하 균형 시스스템을 설계 구현하였다. 이 논문에서 제안한 방식의 총작업반환시간을 실험을 통하여 부하 균형을 하지 않은 라운드 로빈 방식의 총작업반환시간과 성능 테스트 프로그램에 의한 부하 균형 방식의 총작업반환시간과 비교하였다. 실험 결과는 비교한 방식보다 제안 방식의 결과가 우수함을 보였다.