• Journal of the Korean institute of surface engineering
• /
• v.31 no.3
• /
• pp.133-141
• /
• 1998

Stainless is widely used for various purposes due to its good corrosion resistance. There has been much research to produce the color stainless steel by several methods. In this experiment, TixN films have been deposited on the SUS304 substrate by the DC magnetron sputtering system and the color and texture of the films as a function of coating conditions has been studies. The TixN films showed a (111) preferred orintation in bias-free conditions. The texture of coated later was changed from (111) to (200) to (2200 with a change of the bias from -1000V to -3000V. When the bias is low, coated elements have low energy. Therefore, the texturct (111) of low surface energy. The mobility of atoms was increased with the increase of the blas and texture was changed to the other plane. Non-etched specimens all exhibited strong (111) texture. This result shows that (111) is a loose plane and of non-etched specimens all exhibited. High growing velocity of (111) of especially was main texture of Non-etched specimens. Low working pressure($4\times10^{-3}$torr) was more effective than figh working pressure ($6\times10^{-3}$torr) for the gold color of $Ti_xN$ film. L and b were increased and a was decreased with the increase of bias voltage. Accordingly, We obtained the near gold color of $Ti_xN$ film(L;92, a;1~1.5 b:24~29.50. As a result of reflectance. And as the bias increased, the reflectance was proportional to the increasing bias voltage, but we took the top reflectance when the bias voltage was -200V.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.3
• /
• pp.21-28
• /
• 2016

We propose an adaptive scheme of a differential codebook for temporally correlated channels. And the codeword entries of the propose codebook are selected among the set of M-PSK constellations - the values of M proposed in this paper are 8, 16, or 32. Firstly, we analyze mathematically how the optimal spherical cap radius of the proposed codebook is tracked. Then, we explain the practical implementation of the proposed adaptive method. Practically, some candidate differential codebooks we propose in this paper can be switched according to the temporal correlation coefficients of wireless channels in the proposed scheme. Monte-Carlo simulations demonstrate that the achievable throughput performance employing the proposed codebook is always superior to those of the differential codebooks employing M-PSK constellations and non-adaptive differential codebooks with the same amount of feedback information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1554-1563
• /
• 2008

As the interests on RFID technologies increase, a lot of research activities on RFID middleware systems to handle the data acquired by RFID readers are going on actively. Meanwhile, even though various kinds of RFID middleware methodologies and related techniques have been proposed, the common data type which is dealt with in those systems is an EPC code, mainly. Also, there are few researches of the implementation of collecting the stream data queued from RFID readers endlessly and without blocking, classifying the data into some groups according to usage, and sending the resulting data to specific applications. In this paper, we propose the method of data handling in RFID middleware to efficiently process an EPC event stream data using detail filtering, checking of data modification, creation of data set to transfer, data grouping, and various kinds of RFID data format transform. Our method is based on a de facto international standard interface defined in the ALE middleware specification by EPCglobal, and application and service users can directly set various kinds of conditions to handle the stream data.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2016.05a
• /
• pp.521-521
• /
• 2016

상수도 관망은 수원에서 수요절점까지 물을 안정적으로 공급하는 것을 목표로 한다. 상수도 관망의 최적설계는 수리학적 제한조건 (절점의 수압, 관로의 유속)을 만족하는 범위에서 비용을 최소화하는 설계안을 얻는 것으로 Savic and Walters (1997)는 유전 알고리즘 (Genetic Algorithms, Holland 1975)을 적용한 상수도 관망 설계 프로그램인 GANET를 제안하였고, Maier et al. (1996)은 개미군집알고리즘 (Ant Colony Optimization Algorithm, Dorigo et al. 1996)을 상수도 관망 최적설계에 적용한 후 그 결과가 유전 알고리즘에 비해 우수함을 증명하는 등 상수도 관망 최적설계에 관한 연구가 활발히 진행되어 오고 있다. 유전알고리즘은 선택, 교차, 돌연변이의 반복계산 과정을 통하여 최적해를 찾는 최적화 기법이다. 이 과정에서 결정변수는 유전자 (Gene)의 집합으로 표현되며, 염색체 (Chromosome) 내에서 근접한 유전 인자들은 일종의 Building Block을 형성하게 된다. Building Block은 좋은 해를 갖는 유전 인자를 높은 확률로 보관하여 지역해에 빠질 가능성을 줄이는 반면, 유전형 (Genotype)이 표현형 (Phenotype)을 충분히 모방하여 표현하지 못한 경우 오히려 최적해의 탐색을 방해할 수 있다는 한계점을 갖는다. 유전 알고리즘을 상수도 관망 최적설계에 적용하였을 때에도 이 한계점은 여실히 드러난다. 관로의 관경을 결정변수로 설정한 후 유전형으로 표현하였을 때, 관망도 상에서 근접하지 않은 두 관로가 염색체 내에서 연속으로 나열된다면 두 관로 간의 연관성이 실제보다 크게 고려되기 때문이다. 한편, 하모니써치 (Harmony Search, Geem et al. 2001) 알고리즘은 즉흥 연주 (Improvisation)를 통해 최상의 화음을 만들어내는 현상으로부터 착안하여 만들어진 최적화기법으로 연산 기법은 무작위선택, 기억회상, 피치조정 등으로 구성되어 있으며, 결정변수에 해당하는 연주자가 독립적으로 행동하며 해를 탐색한다는 점에서 유전알고리즘과 큰 차이를 갖는다. 본 연구에서는 유전알고리즘의 Building Block에 의해 발생하는 오류를 개선하고자, 상수도 관망 최적설계 연구에 많이 사용되는 Hanoi 관망 (Fujiwara and Khang 1990) 관로의 정렬 순서를 여러 가지 기준으로 설정하여 관망데이터를 구축한 후 하모니써치와 유전 알고리즘을 적용하여 최적화를 수행하였고 그 결과를 비교하였다. 그 결과 유전 알고리즘과 달리 하모니써치 알고리즘의 경우, 관로의 나열 순서와 상관없이 우수한 최적해 탐색 결과를 보이는 것을 확인할 수 있었다.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.13 no.2
• /
• pp.1-8
• /
• 2009

Present studies of these experiments was conducted to using water, over a range of cross-flow velocities from 42 to 136 m/s, with injection frequencies from 35.7 to 166.2 Hz. In cross-flow field, main parameters of liquid jet for secondary breakup were cross-flow drag rather than pressure pulse frequency. As oscillation of the periodic pressure, liquid jet was moved up and down. Also, a bulk of liquid jet puff was detected at upper field of liquid surface. Because of pressure pulsation frequency, an inclination of SMD for the structured layer was evanescent. Cross-sectional characteristics of SMD at downstream area were non-structured distributions. The tendency of volume flux value for various frequency of pressure pulse was same distribution. And volume flux was decreased when the frequency of pressure pulse increasing.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.1
• /
• pp.17-31
• /
• 2010

In VANET (Vehicular Ad hoc NETwork), vehicles can efficiently verify a large number of signatures efficiently using batch verification techniques. However, batch verification performed independently in each vehicle raises many redundant verification cost. Although, an RSU (Road Side Unit) can perform the batch verification as a proxy to reduce this cost, it additionally requires an efficient method to identify invalid signatures when the batch verification fails. In this paper, we analyze several ways of constructing a distributed batch verification system, and propose an efficient distributed batch verification system in which participating vehicles perform batch verification in a distributive manner for a small size signature set. In our proposed system, each node can report the batch verification result or the identified invalid signatures list and the RSU who received these reports can identify the invalid signatures and efficiently exclude them.

• The Journal of the Korea Contents Association
• /
• v.22 no.6
• /
• pp.56-68
• /
• 2022

Recently, as the demand for real-time processing increases, studies on a dynamic graph that changes over time has been actively done. There is a connected components processing algorithm as one of the algorithms for analyzing dynamic graphs. GPUs are suitable for large-scale graph calculations due to their high memory bandwidth and computational performance. However, when computing the connected components of a dynamic graph using the GPU, frequent data exchange occurs between the CPU and the GPU during real graph processing due to the limited memory of the GPU. The proposed scheme utilizes the Weighted-Quick-Union algorithm to process large-scale graphs on the GPU. It supports fast connected components computation by applying the size to the connected component label. It computes the connected component by determining the parts to be recalculated and minimizing the data to be transmitted to the GPU. In addition, we propose a processing structure in which the GPU and the CPU execute asynchronously to reduce the data transfer time between GPU and CPU. We show the excellence of the proposed scheme through performance evaluation using real dataset.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.11-22
• /
• 2009

For a wireless ad-hoc network, event routing algorithm of the publish/subscribe system is especially important for the performance of the system because of the dynamic characteristic and constraint network of its own. In this paper, we propose a new hybrid event routing algorithm. TopSim for efficient publish/subscribe system on the wireless ad-hoc network by extending the ShopParent algorithm by considering not only network overheads to choose a Parent of the publish/subscribe tree, but also topic similarity which is closeness of subscriptions. Our evaluation shows our proposed TopSim performs better for the case where a new joining node subscribed to the multiple topics and there is a node among Parent candidate nodes who subscribe to the ones in the list of multiple topics (related topics).

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.12
• /
• pp.509-516
• /
• 2022

Accurate pose prediction of objects in 3D space is an important visual recognition technique widely used in many applications such as scene understanding in both indoor and outdoor environments, robotic object manipulation, autonomous driving, and augmented reality. Most previous works for object pose estimation have the limitation that they require an exact 3D CAD model for each object. Unlike such previous works, this paper proposes a novel neural network model that can predict the poses of unknown objects based on only their RGB color images without the corresponding 3D CAD models. The proposed model can obtain depth maps required for unknown object pose prediction by using an adaptive depth estimator, AdaBins,. In this paper, we evaluate the usefulness and the performance of the proposed model through experiments using benchmark datasets.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.12 no.4
• /
• pp.287-297
• /
• 2014

For several decades, many countries operating nuclear power plants have been studying the various disposal alternatives to dispose of the spent nuclear fuel or high-level radioactive waste safely. In this paper, as a direct disposal of spent nuclear fuels for deep geological disposal concept, the rod consolidation from spent fuel assembly for the disposal efficiency was considered and analyzed. To do this, a concept of spent fuel rod consolidation was described and the related concepts of disposal canister and disposal system were reviewed. With these concepts, several thermal analyses were carried out to determine whether the most important requirement of the temperature limit for a buffer material was satisfiedin designing an engineered barrier of a deep geological disposal system. Based on the results of thermal analyses, the deposition hole distance, disposal tunnel spacing and heat release area of a disposal canister were reviewed. And the unit disposal areas for each case were calculated and the disposal efficiencies were evaluated. This evaluation showed that the rod consolidation of spent nuclear fuel had no advantages in terms of disposal efficiency. In addition, the cooling time of spent nuclear fuels from nuclear power plant were reviewed. It showed that the disposal efficiency for the consolidated spent fuel rods could be improved in the case that cooling time was 70 years or more. But, the integrity of fuels and other conditions due to the longer term storage before disposal should be analyzed.