• Title/Summary/Keyword: 구조성능실험

Search Result 5,141, Processing Time 0.033 seconds

CACB-Q2AM Modulation for High Bandwidth Efficiency and Constant Amplitude Signal Transmission (높은 대역폭 효율과 정진폭 신호 전송을 위한 CACB-Q2AM 변조)

  • Hong, Dae-Ki;Kang, Sung-Jin
    • Journal of Internet Computing and Services
    • /
    • v.9 no.1
    • /
    • pp.21-32
    • /
    • 2008
  • In this paper, we propose new modulation schemes using the conventional CACB (Constant Amplitude Coded Multicode Biorthogonal) modulation with constant amplitude property. Also the proposed modulation schemes supports high transmission data rate by increasing the spectral efficiency, In order to obtain the high spectral efficiency, the $Q^2$AM (Quadrature-Quadrature Amplitude Modulation) and CA-$Q^2$AM (Constant Amplitude-$Q^2$AM) are used. We explain the simplest combining modulation scheme of CACB and $Q^2$AM (i.e., CACB-$Q^2$AM). However, this modulation scheme cannot support the constant amplitude property. Hence the first CACB-CA-$Q^2$AM (or CACB-CA-$Q^2$AM I) modulation scheme is proposed for the constant amplitude property. In the modulation scheme, the redundant constant amplitude encoding (spectral efficiency decrease) is required. Therefore, the second CACB-CA-$Q^2$AM (or CACB-CA-$Q^2$AM II) modulation scheme is proposed retaining the constant amplitude and the spectral efficiency. Computer simulations show that the proposed CACB-CA-$Q^2$AM II is the efficient modulation scheme.

  • PDF

Effect of Alcohols on the Dry Etching of Sacrificial SiO2 in Supercritical CO2 (초임계 이산화탄소를 이용한 웨이퍼의 건식 식각에서 알콜 첨가제의 효과)

  • Kim, Do-Hoon;Jang, Myoung-Jae;Lim, Kwon-Taek
    • Clean Technology
    • /
    • v.18 no.3
    • /
    • pp.280-286
    • /
    • 2012
  • The dry etching of sacrificial $SiO_2$ was performed in supercritical carbon dioxide. The etching of boron phosphor silica glass (BPSG), tetraethyl orthosilicate (TEOS), thermal $SiO_2$, and Si-nitride (SiN) was investigated by using a two chamber system with HF/py etchant and alcohol additives. The etch rate of sacrificial $SiO_2$ increased upon the addition of methanol. The etch selectivity of BPSG with respect to SiN was highest with IPA although the highest etch rate was resulted from methanol except BPSG. The etch rate increased with the temperature in HF/py/MeOH system. Especially the increase of the etch rate was much higher for BPSG with an increase in the reaction temperature. The etch residue was not reduced apparently upon the addition of alcohol cosolvents to HF/py. While the etch rate in HF/$H_2O$ was higher than HF/py/alcohol system, the rate decreased with the addition of alcohols to HF/$H_2O$. The cantilever beam structure of high aspect ratios was released by the dry ething in supercritical carbon dioxide without damage.

Parallel Processing of Multiple Queries in a Declustered Spatial Database (디클러스터된 공간 데이터베이스에서 다중 질의의 병렬 처리)

  • Seo, Yeong-Deok;Park, Yeong-Min;Jeon, Bong-Gi;Hong, Bong-Hui
    • Journal of KIISE:Databases
    • /
    • v.29 no.1
    • /
    • pp.44-57
    • /
    • 2002
  • Multiple spatial queries are defined as two or more spatial range queries to be executed at the same time. The primary processing of internet-based map services is to simultaneously execute multiple spatial queries. To improve the throughput of multiple queries, the time of disk I/O in processing spatial queries significantly should be reduced. The declustering scheme of a spatial dataset of the MIMD architecture cannot decrease the disk I/O time because of random seeks for processing multiple queries. This thesis presents query scheduling strategies to ease the problem of inter-query random seeks. Query scheduling is achieved by dynamically re-ordering the priority of the queued spatial queries. The re-ordering of multiple queries is based on the inter-query spatial relationship and the latency of query processing. The performance test shows that the time of multiple query processing with query scheduling can be significantly reduced by easing inter-query random seeks as a consequence of enhanced hit ratio of disk cache.

Interfacial Properties and Stress-Cure Sensing of Single-Shape Memory Alloy (SMA) Fiber/Epoxy Composites using Electro-Micromechanical Techniques (미세역학적 시험법을 이용한 단-섬유 형태 형상기억합금/에폭시 복합재료의 계면특성 및 응력-경화 감지능)

  • Jang, Jung-Hoon;Kim, Pyung-Gee;Wang, Zuo-Jia;Lee, Sang-Il;Park, Joung-Man
    • Journal of Adhesion and Interface
    • /
    • v.9 no.3
    • /
    • pp.20-26
    • /
    • 2008
  • It is well know that the structure of shape memory alloy (SMA) can change from martensite austenite by either temperature or stress. Due to their inherent shape recovery properties, SMA fiber can be used such as for stress or cure-monitoring sensor or actuator, during applied stress or temperature. Incomplete superelasticity was observed as the stress hysteresis at stress-strain curve under cyclic loading test and temperature change. Superelasticity behavior was observed for the single-SMA fiber/epoxy composites under cyclic mechanical loading at stress-strain curve. SMA fiber or epoxy embedded SMA fiber composite exhibited the decreased interfacial properties due to the cyclic loading and thus reduced shape memory performance. Rigid epoxy and the changed interfacial adhesion between SMA fiber and epoxy by the surface treatment on SMA fiber exhibited similar incomplete superelastic trend. Epoxy embedded single SMA fiber exhibited the incomplete recovery during cure process by remaining residual heat and thus occurring residual stress in single SMA fiber/epoxy composite.

  • PDF

A Fast Algorithm of the Belief Propagation Stereo Method (신뢰전파 스테레오 기법의 고속 알고리즘)

  • Choi, Young-Seok;Kang, Hyun-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.5
    • /
    • pp.1-8
    • /
    • 2008
  • The belief propagation method that has been studied recently yields good performance in disparity extraction. The method in which a target function is modeled as an energy function based on Markov random field(MRF), solves the stereo matching problem by finding the disparity to minimize the energy function. MRF models provide robust and unified framework for vision problem such as stereo and image restoration. the belief propagation method produces quite correct results, but it has difficulty in real time implementation because of higher computational complexity than other stereo methods. To relieve this problem, in this paper, we propose a fast algorithm of the belief propagation method. Energy function consists of a data term and a smoothness tern. The data term usually corresponds to the difference in brightness between correspondences, and smoothness term indicates the continuity of adjacent pixels. Smoothness information is created from messages, which are assigned using four different message arrays for the pixel positions adjacent in four directions. The processing time for four message arrays dominates 80 percent of the whole program execution time. In the proposed method, we propose an algorithm that dramatically reduces the processing time require in message calculation, since the message.; are not produced in four arrays but in a single array. Tn the last step of disparity extraction process, the messages are called in the single integrated array and this algorithm requires 1/4 computational complexity of the conventional method. Our method is evaluated by comparing the disparity error rates of our method and the conventional method. Experimental results show that the proposed method remarkably reduces the execution time while it rarely increases disparity error.

Examination of the Characteristics of Mortar Mixed with Boron Compounds Presenting Various Levels of Alkalinity (다양한 알칼리도를 가진 붕소화합물이 혼입된 모르타르의 특성 검토)

  • Lee, Binna;Lee, Jong-Suk;Min, Jiyoung;Lee, Jang Hwa
    • Journal of the Korea Concrete Institute
    • /
    • v.29 no.1
    • /
    • pp.85-92
    • /
    • 2017
  • This study examines the characteristics of mortar mixed with various boron compounds. The adapted boron compounds, classified into acid, slightly alkaline and strongly alkaline with respect to the value of the pH are acid-based boron (AA), low-alkaline-based boron (AB), and high-alkaline-based boron (HB). The pH test, setting test and compressive strength test are performed to evaluate the physical and chemical properties of mortar, and SEM imaging is conducted to analyze the microstructure of mortar. The measured pH shows that the specimens mixed with boron compounds have lower pH than the basic mortar without boron and that loss of pH occurs according to time. The setting test reveals that the initial and final setting times of the specimens mixed with boron compounds occur later than the basic mortar, which disagrees slightly with the previous literature stating that the setting time can be shortened according to the alkalinity. From the compressive strength test and SEM imaging results, it is recommended to determine the optimal content of boron considering type and composition of the boron compounds.

Development of the Hippocampal Learning Algorithm Using Associate Memory and Modulator of Neural Weight (연상기억과 뉴런 연결강도 모듈레이터를 이용한 해마 학습 알고리즘 개발)

  • Oh Sun-Moon;Kang Dae-Seong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.4 s.310
    • /
    • pp.37-45
    • /
    • 2006
  • In this paper, we propose the development of MHLA(Modulatory Hippocampus Learning Algorithm) which remodel a principle of brain of hippocampus. Hippocampus takes charge auto-associative memory and controlling functions of long-term or short-term memory strengthening. We organize auto-associative memory based 3 steps system(DG, CA3, CAl) and improve speed of learning by addition of modulator to long-term memory learning. In hippocampal system, according to the 3 steps order, information applies statistical deviation on Dentate Gyrus region and is labelled to responsive pattern by adjustment of a good impression. In CA3 region, pattern is reorganized by auto-associative memory. In CAI region, convergence of connection weight which is used long-term memory is learned fast by neural networks which is applied modulator. To measure performance of MHLA, PCA(Principal Component Analysis) is applied to face images which are classified by pose, expression and picture quality. Next, we calculate feature vectors and learn by MHLA. Finally, we confirm cognitive rate. The results of experiments, we can compare a proposed method of other methods, and we can confirm that the proposed method is superior to the existing method.

IRFP-tree: Intersection Rule Based FP-tree (IRFP-tree(Intersection Rule Based FP-tree): 메모리 효율성을 향상시키기 위해 교집합 규칙 기반의 패러다임을 적용한 FP-tree)

  • Lee, Jung-Hun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.3
    • /
    • pp.155-164
    • /
    • 2016
  • For frequency pattern analysis of large databases, the new tree-based frequency pattern analysis algorithm which can compensate for the disadvantages of the Apriori method has been variously studied. In frequency pattern tree, the number of nodes is associated with memory allocation, but also affects memory resource consumption and processing speed of the growth. Therefore, reducing the number of nodes in the tree is very important in the frequency pattern mining. However, the absolute criteria which need to order the transaction items for construction frequency pattern tree has lowered the compression ratio of the tree nodes. But most of the frequency based tree construction methods adapted the absolute criteria. FP-tree is typically frequency pattern tree structure which is an extended prefix-tree structure for storing compressed frequent crucial information about frequent patterns. For construction the tree, all the frequent items in different transactions are sorted according to the absolute criteria, frequency descending order. CanTree also need to absolute criteria, canonical order, to construct the tree. In this paper, we proposed a novel frequency pattern tree construction method that does not use the absolute criteria, IRFP-tree algorithm. IRFP-tree(Intersection Rule based FP-tree). IRFP-tree is constituted with the new paradigm of the intersection rule without the use of the absolute criteria. It increased the compression ratio of the tree nodes, and reduced the tree construction time. Our method has the additional advantage that it provides incremental mining. The reported test result demonstrate the applicability and effectiveness of the proposed approach.

Copyright Protection for Fire Video Images using an Effective Watermarking Method (효과적인 워터마킹 기법을 사용한 화재 비디오 영상의 저작권 보호)

  • Nguyen, Truc;Kim, Jong-Myon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.8
    • /
    • pp.579-588
    • /
    • 2013
  • This paper proposes an effective watermarking approach for copyright protection of fire video images. The proposed watermarking approach efficiently utilizes the inherent characteristics of fire data with respect to color and texture by using a gray level co-occurrence matrix (GLCM) and fuzzy c-means (FCM) clustering. GLCM is used to generate a texture feature dataset by computing energy and homogeneity properties for each candidate fire image block. FCM is used to segment color of the fire image and to select fire texture blocks for embedding watermarks. Each selected block is then decomposed into a one-level wavelet structure with four subbands [LL, LH, HL, HH] using a discrete wavelet transform (DWT), and LH subband coefficients with a gain factor are selected for embedding watermark, where the visibility of the image does not affect. Experimental results show that the proposed watermarking approach achieves about 48 dB of high peak-signal-to-noise ratio (PSNR) and 1.6 to 2.0 of low M-singular value decomposition (M-SVD) values. In addition, the proposed approach outperforms conventional image watermarking approach in terms of normalized correlation (NC) values against several image processing attacks including noise addition, filtering, cropping, and JPEG compression.

Development of the KOSPI (Korea Composite Stock Price Index) forecast model using neural network and statistical methods) (신경 회로망과 통계적 기법을 이용한 종합주가지수 예측 모형의 개발)

  • Lee, Eun-Jin;Min, Chul-Hong;Kim, Tae-Seon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.5
    • /
    • pp.95-101
    • /
    • 2008
  • Modeling of stock prices forecast has been considered as one of the most difficult problem to develop accurately since stock prices are highly correlated with various environmental conditions including economics and political situation. In this paper, we propose a agent system approach to predict Korea Composite Stock Price Index (KOSPI) using neural network and statistical methods. To minimize mean of prediction error and variation of prediction error, agent system includes sub-agent modules for feature extraction, variables selection, forecast engine selection, and forecasting results analysis. As a first step to develop agent system for KOSPI forecasting, twelve economic indices are selected from twenty two basic standard economic indices using principal component analysis. From selected twelve economic indices, prediction model input variables are chosen again using best-subsets regression method. Two different types data are tested for KOSPI forecasting and the Prediction results showed 11.92 points of root mean squared error for consecutive thirty days of prediction. Also, it is shown that proposed agent system approach for KOSPI forecast is effective since required types and numbers of prediction variables are time-varying, so adaptable selection of modeling inputs and prediction engine are essential for reliable and accurate forecast model.