• Korean Chemical Engineering Research
• /
• 제43권1호
• /
• pp.181-185
• /
• 2005

인화점은 가연성 물질의 화재 및 폭발의 잠재위험성을 결정하는데 가장 중요한 연소 특성치 가운데 하나이다. 인화점의 정확한 지식은 산업 화재의 방호 평가 및 적절한 예방에 중요하다. 본 연구에서 n-butanol+n-propionic acid계와, n-propanol+n-propionic계의 개방계 인화점을 Tag식 개방계 장치(ASTM D 1310-86)를 이용하여 측정하였다. 실험값은 라울의 법칙과 van Laar식에 의해 계산된 값과 비교하였다. 그 결과, van Laar식에 의한 예측값이 라울의 법칙에 의한 예측값 보다 실험값에 더욱 근사함을 확인하였다.

• 한국정보처리학회논문지
• /
• 제7권7호
• /
• pp.2204-2218
• /
• 2000

This paper proposes a dynamic storage allocation algorithm, QHF(quick-half-fit) for real-time systems. The proposed algorithm manages a free block list per each worked size for memory requests of small size, and a free block list per each power of 2 size for memory requests of large size. This algorithms uses the exact-fit policy for small sie requests and provides high memory utilization. The proposed algorithm also has the time complexity O(I) and enables us to easily estimate the worst case execution time (WCET). In order to confirm efficiency of the proposed algorithm, we compare he memory utilization of proposed algorithm with that of half-fit and binary buddy system that have also time complexity O(I). The simulation result shows that the proposed algorithm guarantees the constant WCET regardless of the system memory size and provides lower fragmentation ratio and allocation failure ratio thant other two algorithms.

• 한국정보과학회논문지:시스템및이론
• /
• 제34권5_6호
• /
• pp.195-201
• /
• 2007

트리의 최소단말경로분할이란 트리를 에지가 서로 소인 단말 노드 간 경로들로 분할하되, 가장 긴 경로의 길이를 최소화하는 문제이다. 본 논문에서는 트리의 최소단말경로분할을 $O({\mid}V{\mid}^2$시간에 구하는 알고리즘을 제시한다. 이 알고리즘은 주어진 최적화 문제를 이에 대응하는 결정 문제, 즉 최소단말경로 분할의 비용이 l 이하인지를 결정하는 문제를 이용한 이진 탐색으로 환원한다. 결정 문제는 트리를 한 차례 순회하는 동안 동적 계획법에 의해 해결된다

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권11호
• /
• pp.3008-3025
• /
• 2012

In this paper, the downlink resource allocation of OFDMA system with decode-and-forward (DF) relaying is investigated. A non-convex optimization problem maximizing system throughput with users' satisfaction constraints is formulated with joint relay selection, subcarrier assignment and power allocation. We first transform it to a standard convex problem and then solve it by dual decomposition. In particular, an Optimal resource allocation scheme With Time-sharing (OWT) is proposed with combination of relay selection, subcarrier allocation and power control. Due to its poor adaption to the fast-varying environment, an improved version with subcarrier Monopolization (OWM) is put forward, whose performance promotes about 20% compared with that of OWT in the fast-varying vehicular environment. In fact, OWM is the special case of OWT with binary time-sharing factor and OWT can be seen as the tight upper bound of the OWM. To the best of our knowledge, such algorithms and their relation have not been accurately investigated in cooperative OFDMA networks in the literature. Simulation results show that both the system throughput and the users' satisfaction of the proposed algorithms outperform the traditional ones.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권7호
• /
• pp.1705-1720
• /
• 2013

Human face gender recognition requires fast image processing with high accuracy. Existing face gender recognition methods used traditional local features and machine learning methods have shortcomings of low accuracy or slow speed. In this paper, a new framework for face gender recognition to reach fast face gender recognition is proposed, which is based on Local Ternary Pattern (LTP) and Extreme Learning Machine (ELM). LTP is a generalization of Local Binary Pattern (LBP) that is in the presence of monotonic illumination variations on a face image, and has high discriminative power for texture classification. It is also more discriminate and less sensitive to noise in uniform regions. On the other hand, ELM is a new learning algorithm for generalizing single hidden layer feed forward networks without tuning parameters. The main advantages of ELM are the less stringent optimization constraints, faster operations, easy implementation, and usually improved generalization performance. The experimental results on public databases show that, in comparisons with existing algorithms, the proposed method has higher precision and better generalization performance at extremely fast learning speed.

• 한국분말재료학회지
• /
• 제21권5호
• /
• pp.338-342
• /
• 2014

In the present work, we investigated the mechanical alloying of binary Ga-Se(1:1) and Ga-Te(1;1) sysyems. The high-energy ball-milling was performed at $40^{\circ}C$ where one of constituents (Ga) is molten state. The purpose of the work was to see whether reactions between constituent elements are accelerated by the presence of a liquid phase. During the ball-milling, the liquid Ga phase completely disappeared and the resulting powders consist of nanocrystalline grain of ~20 nm with partly amorphized phases. However, no intermetallic compounds formed in spite of the presence of the liquid phases which has much higher diffusivity than solid constituents. By subsequent heat-treatments, the intermetallic compounds such as GaSe and GaTe formed at relatively low temperatures. The formation temperature of theses compound was much lower than those predicted by equilibrium phase diagram. The comparison of the ball-milled powders with un-milled ones indicated that the easy formation of intermetallic compound or allying occurs at low temperatures.

• 한국통신학회논문지
• /
• 제36권10C호
• /
• pp.605-613
• /
• 2011

잡음에 있는 채널을 통한 디지털 통신에서는 채널 잡음에 대항하기 위해 오류정정부호(채널부호)를 사용하게 된다. 만일 송신측의 협조 없이 전송정보를 알아내려면 사용된 채널부호를 복원하는 것이 무엇보다 중요하다. 본 논문에서는 잡음에 오염된 수신 비트열로부터 사용된 채널부호의 여려 파라메타를 추출하여 궁극적으로 채널부호를 복원하는 채널부호 복원기법 중 순회부호(cyclic code)의 복원 기법을 제안한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1260-1263
• /
• 2005

Data storage related with writing and retrieving requires high storage capacity, fast transfer rate and less access time. Today any data storage system cannot satisfy these conditions, however holographic data storage system can perform faster data transfer rate because it is a page oriented memory system using volume hologram in writing and retrieving data. System can be constructed without mechanical actuating part therefore fast data transfer rate and high storage capacity about 1Tb/cm3 can be realized. In this research, to reduce errors of binary data stored in holographic data storage system, a new method for bit error reduction is suggested. First, find fuzzy rule using experimental system for Element of Holographic Digital Data System. Second, make fuzzy rule table using Genetic algorithm. Third, reduce prior error element and recording Digital Data. Recording ratio and reconstruction ratio will be very good performance

• 대한임베디드공학회논문지
• /
• 제2권1호
• /
• pp.31-42
• /
• 2007

A transform coding scheme for the transmission of audio data in ZigBee based wireless personal area networks (WPAN) is presented in this paper. Here, wavelet transform is exploited to encode the features of audio data included mainly in the low frequency region. As a result, it is confirmed that the presented scheme recovers the original audio signals much accurately while it transmits the binary data compressed as 37.5% of the entire data generated without coding scheme. Especially, the mean-squared error between the recovered and original audio data approaches $10^{-4}$ when the signal-to-noise power ratio is sufficiently high. Hence, the presented coding scheme which exploits the wavelet transform is possibly applied for high-quality audio data transmission services in a small-scale sensor network based on ZigBee. Such a result is considered to be applicable as a basic material to update the technical specifications and develop the applications of ZigBee in WPANs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1595-1613
• /
• 2017

The IR camera and laser-based IR projector provide an effective solution for real-time collection of moving targets in RGB-D videos. Different from the traditional RGB videos, the captured depth videos are not affected by the illumination variation. In this paper, we propose a novel feature extraction framework to describe human activities based on the above optical video capturing method, namely spatial-temporal texture features for 3D human activity recognition. Spatial-temporal texture feature with depth information is insensitive to illumination and occlusions, and efficient for fine-motion description. The framework of our proposed algorithm begins with video acquisition based on laser projection, video preprocessing with visual background extraction and obtains spatial-temporal key images. Then, the texture features encoded from key images are used to generate discriminative features for human activity information. The experimental results based on the different databases and practical scenarios demonstrate the effectiveness of our proposed algorithm for the large-scale data sets.