• Nuclear Engineering and Technology
• /
• v.25 no.2
• /
• pp.193-203
• /
• 1993

A new heuristic method for loading pattern search has been developed to overcome short-comings of the algorithmic approach. To reduce the size of vast solution space, general shuffling rules, a regionwise shuffling method, and a pattern grouping method were introduced. The entropy theory was applied to classify possible loading patterns into groups with similarity between them. The pattern search program was implemented with use of the PROLOG language. A two-group nodal code MEDIUM-2D was used for analysis of power distribution in the core. The above mentioned methodology has been tested to show effectiveness in reducing of solution space down to a few hundred pattern groups. Burnable poison rods were then arranged in each pattern group in accordance with burnable poison distribution rules, which led to further reduction of the solution space to several scores of acceptable pattern groups. The method of maximizing cycle length(MCL) and minimizing power-peaking factor(MPF) were applied to search for specific useful loading patterns from the acceptable pattern groups. Thus, several specific loading patterns that have low power-peaking factor and large cycle length were successfully searched from the selected pattern groups.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.19 no.1
• /
• pp.19-25
• /
• 2024

This paper proposes an artificial intelligence-based personal information area object detection optimization method in an embedded system to de-identify personal information in video data. As an object detection optimization method, first, in order to increase the detection rate for personal information areas when detecting objects, a gyro sensor is used to collect the shooting angle of the image data when acquiring the image, and the image data is converted into a horizontal image through the collected shooting angle. Based on this, each learning model was created according to changes in the size of the image resolution of the learning data and changes in the learning method of the learning engine, and the effectiveness of the optimal learning model was selected and evaluated through an experimental method. As a de-identification method, a shuffling-based masking method was used, and double-key-based encryption of the masking information was used to prevent restoration by others. In order to reuse the original image, the original image could be restored through a security key. Through this, we were able to secure security for high personal information areas and improve usability through original image restoration. The research results of this paper are expected to contribute to industrial use of data without personal information leakage and to reducing the cost of personal information protection in industrial fields using video through de-identification of personal information areas included in video data.

• Proceedings of the KIPE Conference
• /
• 2013.11a
• /
• pp.27-28
• /
• 2013

이 논문에서는 부분 그늘짐에서도 다중 태양광 모듈의 최대 전력점 추종이 가능한 셔플링 차동전력 마이크로 컨버터를 설계 및 구현하였다. 마이크로 컨버터 시스템은 PV에 직접 연결된 셔플링 컨버터와 이후 단으로서 부스트 컨버터가 존재한다. 셔플링 컨버터는 다이렉트-시비율 기법을 통하여 PV모듈을 최대전력으로 동작시키고, 부스트 컨버터는 전압루프를 통하여 P&O 방식으로 최대 전력점을 추종하였다. PV 모듈에 병렬로 셔플링 컨버터를 적용함으로써, 다중 태양광 모듈의 전류 편차를 차동전력으로 조절하여 각각의 최대 전력점을 추종하면서 안정된 동작을 유지할 수 있다. 제안하는 컨버터는 2개의 PV모듈이 연결된 정상상태 연속모드 (CCM) 160[W]급 마이크로 컨버터 하드웨어 프로토타입을 통해 동작특성을 분석하였다.

• Journal of Information Technology Applications and Management
• /
• v.11 no.4
• /
• pp.25-33
• /
• 2004

Recently, as network and computer technologies are growing rapidly, most of business transactions are performed in cyber world. In spite of many advantages, the most concerns in Electronic Commerce are the information security matters, and the cryptosystem has been claimed as one of the proper means to settle this problem. In this paper, a partial encryption/decryption algorithm has been in-troduced to show the efficiency against the conventional method in which all the data are completely encoded. In our proposed scheme, the multimedia data can be efficiently encoded in a short time providing good data security. For example, the MP3 data can be securely protected with 10% encryption in our scheme. Moreover, 1he shuffling process at the end of partial encryption procedure provides higher level of data security.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.771-787
• /
• 2009

We use an idea of linear representations of the symmetric group to reduce the number of communication rounds in the verification protocol, proposed in Crypto 2005 by Peng et al., of a shuffling. We assume Paillier encryption scheme with which we can apply some known zero-knowledge proofs following the same line of approaches of Peng et al. Incidence matrices of 1-subsets and 2-subsets of a finite set is intensively used for the implementation, and the idea of $\lambda$-designs is employed for the improvement of the computational complexity.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.92-96
• /
• 2008

모바일 인터넷 사용자가 급속히 늘어남에 따라 모바일 콘텐츠의 수요도 증가하고 있다. MP3, 온라인 게임, 비디오 클립 등 지적재산권이 있는 유료 콘텐츠를 보호하기 위해 일반적으로 모바일 DRM과 같은 암호화 방식이 적용된다. 하지만, 자원이 제한된 모바일 환경에서 AES 알고리즘 등으로 콘텐츠 전체를 암호화할 경우, 응답시간 지연과 전력소비 증가로 효율적 모바일 콘텐츠 서비스를 제공하기 어렵다. 이러한 문제를 해결하기 위해, 본 논문에서는 모바일 콘텐츠를 고정크기 분할(fragment)들로 나눈 다음 각 분할의 앞 뒤 부분만 암호화하는 효율적인 부분 암호화(partial encryption) 기법을 제안한다. 또한, 부분 암호화로 인한 안전성 감소 가능성을 보완하기 위하여 분할들에 대해 뒤섞기(shuffling)를 적용한다. 제안한 개념을 모바일 DRM 표준 블록 암호화 알고리즘인 AES를 사용하여 ARM 기반 임베디드 보드에서 구현하여 실험하였다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.5
• /
• pp.12-25
• /
• 1994

A two dimensional constant geometry FFT algorithms and architectures with shuffled inputs and normally ordered outputs are presented. It is suitable for VLSI implementation because all buterfly stages have identical, regular structure. Also a methodology using shuffled FFT inputs and outputs to halve the number of butterfly stages connected by a global interconnection which requires much area is presented. These algorithms can be obtained by shuffling the row and column of a decomposed FFT matrix which corresponds to one butterfly stage. Using non-recursive and recursive pipeline, the degree of serialism and parallelism in FFT computation can be adjusted. To implement high performance high radix FFT easily and reduce the amount of interconnections between stages, the method to build a high radix PE with lower radix PE 's is discussed. Finally the performances of the present architectures are evaluated and compared.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2004.09a
• /
• pp.277-280
• /
• 2004

TCE and PCE, suspected carcinogens, are the most common groundwater pollutant from extensive use as a solvent and degreaser. Escherichia coli TGI pBSKAN TOM Green and E. coli TGI pBSKAN ToMO, which were used DNA shuffling technique, produce Toluene-o-monooxygenase(TOM) and toluene-o-xylene- monooxygenase(ToMO). These cells and enzymes are degrading TCE and PCE, TOM and ToMO are needed to cofactor, such as NADH, NADPH and other cofactors. Used TCE and PCE degrading microorganisms experiment the contaminated material removal efficiency. A shunting test used NAD and Hydrogen peroxide.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1790-1806
• /
• 2016

Digital image encryption is widely used for image data security. JPEG standard compresses image with great performance on reducing file size. Thus, to encrypt an image in JPEG format we should keep the quality of original image and reduced size. This paper proposes a JPEG image encryption scheme based on quantized DC and non-zero AC coefficients inner category scrambling. Instead of coefficient value encryption, the address of coefficient is encrypted to get the address of cipher text. Then 8*8 blocks are shuffled. Chaotic iteration is employed to generate chaotic sequences for address scrambling and block shuffling. Analysis of simulation shows the proposed scheme is resistant to common attacks. Moreover, the proposed method keeps the file size of the encrypted image in an acceptable range compared with the plain text. To enlarge the cipher text possible space and improve the resistance to sophisticated attacks, several additional procedures are further developed. Contrast experiments verify these procedures can refine the proposed scheme and achieve significant improvements.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.691-693
• /
• 2017

하둡 시스템은 대용량의 데이터를 처리할 수 있는 클러스터 기반 개방형 소프트웨어 프레임워크이다. 이는 하둡 분산 파일시스템(HDFS)과 MapReduce 모델을 활용하여 데이터의 병렬 처리를 지원한다. 본 연구에서는 3D 프린터를 위한 3D 모델 데이터를 G-code로 변환하는 알고리즘을 하둡을 활용하여 구현하였다. 4대의 컴퓨터에 하둡 시스템을 설치한 후 전처리-Map-Shuffling-Reduce의 과정을 거쳐 변환작업이 효율적으로 처리하였음을 보일 수 있었다.