• Title/Summary/Keyword: 구조적성능

Search Result 9,765, Processing Time 0.046 seconds

Characteristics of a Plasma-Dump Combustor for VOC Destruction (VOC 분해 플라즈마-덤프 연소기 특성)

  • Kim, Eun Hyuk;Chun, Young Nam
    • Journal of Korean Society of Environmental Engineers
    • /
    • v.37 no.8
    • /
    • pp.492-497
    • /
    • 2015
  • VOCs (Volatile Organic Compounds) are generally generated in the painting process, or at the company and laundry where use organic solvents. The VOCs consist of various hydrocarbons and has low calorific value due to its dilution with atmospheric air. Therefore, the VOCs are difficult to burn by a conventional fuel combustor. In this study, a novel plasma dump combustor was proposed for the treatment of low calorific VOC gases. This combustor was designed a combination of the characteristics in a plasma burner, a dump combustor and a 3D matrix burner. The combustor has good structure for maintaining enough residence time and reaction temperature for stable flame formation and VOC destruction. For investigating the performance characteristics of the plasma dump combustor, an experiment was achieved for VOC feed rate, VOC injector position, etc. Toluene was used as a surrogate of VOC. The novel combustor gave better performance than a conventional combustor, showing that VOC destruction rate and energy efficiency were 89.64% and 12.27 kg/kWh respectively, at feeding rate of 450 L/min of VOC of 3,000 ppm of toluene concentration.

XML View Indexing Using an RDBMS based XML Storage System (관계 DBMS 기반 XML 저장시스템 상에서의 XML 뷰 인덱싱)

  • Park Dae-Sung;Kim Young-Sung;Kang Hyunchul
    • Journal of Internet Computing and Services
    • /
    • v.6 no.4
    • /
    • pp.59-73
    • /
    • 2005
  • Caching query results and reusing them in processing of subsequent queries is an important query optimization technique. Materialized view and view indexing are the representative examples of such a technique. The two schemes had received much attention for relational databases, and have been investigated for XML data since XML emerged as the standard for data exchange on the Web. In XML view indexing, XML view xv which is the result of an XML query is represented as an XML view index(XVI), a structure containing the identifiers of xv's underlying XML elements as well as the information on xv. Since XVI for xv stores just the identifiers of the XML elements not the elements themselves, when xv is requested, its XVI should be materialized against xv's underlying XML documents. In this paper, we address the problem of integrating an XML view index management system with an RDBMS based XML storage system. The proposed system was implemented in Java on Windows 2000 Server with each of two different commercial RDBMSs, and used in evaluating performance improvement through XML view indexing as well as its overheads. The experimental results revealed that XML view indexing was very effective with an RDBMS based XML storage system while its overhead was negligible.

  • PDF

Transform domain Wyner-Ziv Coding based on the frequency-adaptive channel noise modeling (주파수 적응 채널 잡음 모델링에 기반한 변환영역 Wyner-Ziv 부호화 방법)

  • Kim, Byung-Hee;Ko, Bong-Hyuck;Jeon, Byeung-Woo
    • Journal of Broadcast Engineering
    • /
    • v.14 no.2
    • /
    • pp.144-153
    • /
    • 2009
  • Recently, as the necessity of a light-weighted video encoding technique has been rising for applications such as UCC(User Created Contents) or Multiview Video, Distributed Video Coding(DVC) where a decoder, not an encoder, performs the motion estimation/compensation taking most of computational complexity has been vigorously investigated. Wyner-Ziv coding reconstructs an image by eliminating the noise on side information which is decoder-side prediction of original image using channel code. Generally the side information of Wyner-Ziv coding is generated by using frame interpolation between key frames. The channel code such as Turbo code or LDPC code which shows a performance close to the Shannon's limit is employed. The noise model of Wyner-Ziv coding for channel decoding is called Virtual Channel Noise and is generally modeled by Laplacian or Gaussian distribution. In this paper, we propose a Wyner-Ziv coding method based on the frequency-adaptive channel noise modeling in transform domain. The experimental results with various sequences prove that the proposed method makes the channel noise model more accurate compared to the conventional scheme, resulting in improvement of the rate-distortion performance by up to 0.52dB.

Development of Anti-windup Techniques for Cascade Control System (다단제어용 안티 와인드업 기술 개발)

  • Bae, Jeong Eun;Kim, Kyeong Hoon;Chu, Syng Chul;Heo, Jaepil;Lim, Sanghun;Sung, Su Whan
    • Korean Chemical Engineering Research
    • /
    • v.58 no.3
    • /
    • pp.430-437
    • /
    • 2020
  • In this research, the anti-windup techniques for the cascade control system are newly developed. Cascade control system has an additional internal feedback control loop to reject disturbances better than the conventional control system. Remarkable difference between the conventional single-loop control system and the cascade control system is the interaction that the controller output saturation of the secondary control loop strongly affects the integral action of the primary control loop. In industry, local back calculation anti-windup method has been mainly used for each controller without considering the interaction between the two controllers. But it cannot eliminate the integral-windup of the primary controller originated from the saturation of the secondary controller output. To solve the problem, the two anti-windup techniques of the cascade conditional integration and the cascade back calculation are proposed in this research by extending the local anti-windup techniques for the single-loop control system to the cascade control system. Simulation confirmed that the proposed methods can effectively remove the integral windup of the primary controller caused by the saturation of the secondary controller output and show good control performances for various types of processes and controllers. If the reliability of the proposed methods is proved through the applications to real processes in the future, they would highly contribute to improving the control performances of the cascade control system in industry.

Data Acquisition System Applying TMO for GIS Preventive Diagnostic System (GIS 예방진단시스템을 위한 TMO 응용 데이터 수집 시스템)

  • Kim, Tae-Wan;Kim, Yun-Gwan;Jang, Cheon-Hyeon
    • The KIPS Transactions:PartA
    • /
    • v.16A no.6
    • /
    • pp.481-488
    • /
    • 2009
  • GIS is used to isolate large power electrical equipment using SF6 gas. While GIS has simple structure, it has few break down, relatively high reliability. But it is hard to check up faults for reason of pressure. Faults of GIS should have a ripple effect on community and be hard to recovery. Consequently, GIS imports a preventive diagnostic system to find internal faults in advance. It is most important that reliability on the GIS preventive diagnostic system, because it estimates abnormality of system by analysis result of collected data. But, exist system which used central data management is low efficiency, and hard to guarantee timeliness and accuracy of data. To guarantee timeliness and accuracy, the GIS preventive diagnostic system needs accordingly to use a real-time middleware. So, in this paper, to improve reliability of the GIS preventive diagnostic system, we use a middleware based on TMO for guaranteeing timeliness of real-time distributed computing. And we propose an improved GIS preventive diagnostic system applying data acquisition, monitoring and control methods based on the TMO model. The presented system uses the Communication Control Unit(CCU) for distributed data handling which is supported by TMO. CCU can improve performance of the GIS preventive diagnostic system by guaranteeing timeliness of data handling process and increasing reliability of data through the TMO middleware. And, it has designed to take full charge of overload on a data acquisition task had been processed in an exist server. So, it could reduce overload of the server and apply distribution environment from now. Therefore, the proposed system can improve performance and reliability of the GIS preventive diagnostic system and contribute to stable operation of GIS.

Improving Haskell GC-Tuning Time Using Divide-and-Conquer (분할 정복법을 이용한 Haskell GC 조정 시간 개선)

  • An, Hyungjun;Kim, Hwamok;Liu, Xiao;Kim, Yeoneo;Byun, Sugwoo;Woo, Gyun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.9
    • /
    • pp.377-384
    • /
    • 2017
  • The performance improvement of a single core processor has reached its limit since the circuit density cannot be increased any longer due to overheating. Therefore, the multicore and manycore architectures have emerged as viable approaches and parallel programming becomes more important. Haskell, a purely functional language, is getting popular in this situation since it naturally supports parallel programming owing to its beneficial features including the implicit parallelism in evaluating expressions and the monadic tools supporting parallel constructs. However, the performance of Haskell parallel programs is strongly influenced by the performance of the run-time system including the garbage collector. Though a memory profiling tool namely GC-tune has been suggested, we need a more systematic way to use this tool. Since GC-tune finds the optimal memory size by executing the target program with all the different possible GC options, the GC-tuning time takes too long. This paper suggests a basic divide-and-conquer method to reduce the number of GC-tune executions by reducing the search area by one-quarter for every searching step. Applying this method to two parallel programs, a maximally independent set and a K-means programs, the memory tuning time is reduced by 7.78 times with accuracy 98% on average.

Fabrication of Polysulfone Hollow Fiber Membranes for N2/NF3 Separation (N2/NF3 분리용 폴리썰폰 중공사막 제조 연구)

  • Lim, Min Su;Kim, Seong-Joong;Kang, Ha Sung;Park, Ho Bum;Nam, Seung Eun;Park, Ho Sik;Lee, Pyung Soo;Park, You In
    • Membrane Journal
    • /
    • v.26 no.1
    • /
    • pp.76-85
    • /
    • 2016
  • Fabrication of polysulfone (PSf) hollow fiber membranes was investigated for the separation of $N_2/NF_3$ gas mixtures, which are emitted from the display and the semiconductor industries. A combination of the non-solvent induced phase separation (NIPS) and the vapor-induced phase separation (VIPS) technique was applied to develop high flux hollow fiber membranes. Thin polymer layers were further coated onto the surface of the hollow fiber membranes by using polydimethylsiloxiane (PDMS) or Teflon AF1600(R), which contributes to improve the $N_2/NF_3$ selectivity. The $N_2/NF_3$ separation performances of our PSf hollow fiber membranes were determined by the intrinsic properties of coating materials. Especially, the PSf hollow fiber membrane coated with Teflon AF 1600(R) exhibited a higher $N_2/NF_3$ selectivity (> 14) with a slightly lower $N_2$ permeance (4.5 GPU), as compared to the commercial PSf counterparts. This feature provides a good potential as a membrane structure to separate $N_2/NF_3$.

Direction-Embedded Branch Prediction based on the Analysis of Neural Network (신경망의 분석을 통한 방향 정보를 내포하는 분기 예측 기법)

  • Kwak Jong Wook;Kim Ju-Hwan;Jhon Chu Shik
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.1
    • /
    • pp.9-26
    • /
    • 2005
  • In the pursuit of ever higher levels of performance, recent computer systems have made use of deep pipeline, dynamic scheduling and multi-issue superscalar processor technologies. In this situations, branch prediction schemes are an essential part of modem microarchitectures because the penalty for a branch misprediction increases as pipelines deepen and the number of instructions issued per cycle increases. In this paper, we propose a novel branch prediction scheme, direction-gshare(d-gshare), to improve the prediction accuracy. At first, we model a neural network with the components that possibly affect the branch prediction accuracy, and analyze the variation of their weights based on the neural network information. Then, we newly add the component that has a high weight value to an original gshare scheme. We simulate our branch prediction scheme using Simple Scalar, a powerful event-driven simulator, and analyze the simulation results. Our results show that, compared to bimodal, two-level adaptive and gshare predictor, direction-gshare predictor(d-gshare. 3) outperforms, without additional hardware costs, by up to 4.1% and 1.5% in average for the default mont of embedded direction, and 11.8% in maximum and 3.7% in average for the optimal one.

Korean Phoneme Recognition Using Self-Organizing Feature Map (SOFM 신경회로망을 이용한 한국어 음소 인식)

  • Jeon, Yong-Koo;Yang, Jin-Woo;Kim, Soon-Hyob
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.2
    • /
    • pp.101-112
    • /
    • 1995
  • In order to construct a feature map-based phoneme classification system for speech recognition, two procedures are usually required. One is clustering and the other is labeling. In this paper, we present a phoneme classification system based on the Kohonen's Self-Organizing Feature Map (SOFM) for clusterer and labeler. It is known that the SOFM performs self-organizing process by which optimal local topographical mapping of the signal space and yields a reasonably high accuracy in recognition tasks. Consequently, SOFM can effectively be applied to the recognition of phonemes. Besides to improve the performance of the phoneme classification system, we propose the learning algorithm combined with the classical K-mans clustering algorithm in fine-tuning stage. In order to evaluate the performance of the proposed phoneme classification algorithm, we first use totaly 43 phonemes which construct six intra-class feature maps for six different phoneme classes. From the speaker-dependent phoneme classification tests using these six feature maps, we obtain recognition rate of $87.2\%$ and confirm that the proposed algorithm is an efficient method for improvement of recognition performance and convergence speed.

  • PDF

Implementation of Virtualization Techniques and its Performance Evaluation for the Independent Operation of OpenFlow-based Future Internet Testbed (오픈플로우 기반 미래인터넷 테스트베드의 독립적 운용을 위한 가상화 기능 구현 및 성능 평가)

  • Min, Seok Hong;Kim, Seung Ju;Kim, Byung Chul;Lee, Jae Yong;Hong, Won Taek;Kong, Jong Uk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.1
    • /
    • pp.34-45
    • /
    • 2013
  • Recently, world-wide research activities on new network architectures and protocols are being actively progressed. Furthermore, research activities on testbed and related technologies for supporting those activities are being actively performed. In domestic study, research on the OpenFlow protocol based future Internet testbed implementation and research on its virtualization for supporting independent research experiments are being performed at the same time. The network virtualization is a technology which maximizes the testbed utilization without interfering each other for the individual research when many researchers share the testbed. In this paper, we implemented a Enhanced FlowVisor by extending basic FlowVisor by adding QoS functions which are admission control and minimum bandwidth guarantee. On the testbed, we performed a real-time video streaming experiment for verifying the performance of the Enhnaced FlowVisor on the OpenFlow protocol based future internet testbed. The result shows that the Enhanced FlowVisor can provide reliable and stable QoS to the individual researches without disturbing each other traffic on virtualized networks of the future Internet testbed.