• Journal of Advanced Navigation Technology
• /
• v.16 no.5
• /
• pp.864-870
• /
• 2012

Voice pattern recognition technology to solve the problems of the existing problems and common issues that you may have in language learning content analysis. This is the first problem of language-learning content, online learning posture. Game open another web page through the lesson, but the concentration of the students fell. Have not been able to determine the second issue according Speaking has made the learning process actually reads. Third got a problem with the mechanical process by a learning management system, as well by the teacher in the evaluation of students and students who are learning progress between the difference in the two. Finally, the biggest problem, while maintaining their existing content made to be able to solve the above problem. Speaking learning dedicated learning programs under this background, voice pattern recognition technology learning process for speech recognition and voice recognition capabilities for learning itself has been used in the recognition process the data of the learner's utterance as an audio file of the desired change to a transfer to a specific location of the server or SQL server may be easily inserted into any system or program, any and all applicable content that has already been created without damaging the entire component because the new features were available. Contributed to this paper, active participation in class more interactive teaching methods to change.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.341-348
• /
• 2009

In this paper, we propose a grouping technique for the SDD(Synchronous Digital Duplexing) based on OFDMA(Orthogonal Frequency Division Multiple Access). The SDD has advantages of increasing data efficiency and flexibility of resource since SDD can transmit uplink signals and downlink signals simultaneously by using mutual time information and mutual channel information, obtained during mutual ranging process. However, the SDD has a disadvantage of requiring additional CS to maintain orthogonality of OFDMA symbols when the sum of mutual time difference and mutual channel length between AP(access point) and SS(subscriber station) or among SSs are larger than CP length. In order to minimize the length of CS for the case of requiring additional CS in SDD, we proposes a grouping technique which controls transmit timing and receive timing of AP and SS in a cell by classifying them into groups. Performances of the proposed grouping technique are evaluated by computer simulation.

• Proceedings of the KWS Conference
• /
• 2009.11a
• /
• pp.27-27
• /
• 2009

드라이브 샤프트는 일반적으로 엔진에서 발생된 회전력을 바퀴에 직접 전달하는 동시에 조향기능을 수행하는 자동차 부품이다. 최근에 경량화를 통한 에너지 절감을 위하여 기존 스틸소재를 알루미늄으로 대체하는 방안에 대한 연구가 집중되고 있다. 그러나 알루미늄 단일소재로 드라이브 샤프트를 제조하는 것은 비경제적이며 또한 기 개발된 자동차 부품들과의 연결을 고려하여 알루미늄 튜브와 스틸 요크의 이종금속 접합기술이 요구된다. 전자기 펄스용접은 전자기력을 이용하여 용접대상물을 고속으로 충돌시켜 용접하는 기술로서 열 발생이 적어 재료의 특성차로 인한 결함 및 변형이 발생하지 않아, 이종금속간 고품질 용접이 가능하며, 전자기 펄스 용접부의 품질과 밀접한 관계를 갖는 공정변수 경우 모재와 접합재의 재질 따라 적정 공정변수 범위가 변화되므로 공정에 따른 데이터의 축적은 대단히 중요하다. 전자기 펄스 용접을 이용한 이종금속 접합시 접합부 품질에 영향을 미치는 공정변수는 충전전압, 모재와 접합재 사이의 간격 및 접합재의 직경과 두께의 비(D/T비)로서 보고되었으며, Al/Steel 이종 금속 접합시 이들 공정변수가 접합부에 미치는 영향 및 최적의 공정변수 도출을 위한 연구는 시도되지 않았다. 따라서 본 연구는 전자기 펄스 용접기술을 이용한 Al/Steel 이종금속 접합 실험을 통하여 전자기 펄스용접의 적정성과 최적의 충전전압, 모재와 접합재 사이의 간격, D/T비를 도출하고자 한다. 전자기 펄스 용접 장치는 한국생산기술연구원과 웰메이트(주)에서 공동으로 개발한 $120{\mu}F$의 캐패시터 6개로 구성된 'W-MPW36'을 사용하였으며 이 장치의 최대충전전압과 최대접합용량은 각각 10kV, 36kJ이다. 접합재는 전기 전도율의 높은 Al 1070 파이프를 사용하였으며 모재는 기존 스틸 요크재인 SM45C 환봉을 사용하였다. 기보고된 연구를 통하여 코일과 접합재 사이의 간격이 좁을수록 높은 전자기력이 접합재에 작용하는 것을 확인하였으나 코일내 접합재와 모재 삽입 편의를 위하여 1mm로 설정하였다. 접합부의 품질 평가를 위하여 수압시험을 실시하였으며, 시험 후 접합부 단면을 주사전자현미경(SEM)을 이용하여 관찰하였다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2007.05a
• /
• pp.683-687
• /
• 2007

우리나라의 축산업은 대략 1970년대 이후부터 급속한 산업화에 따른 인구 증가 및 국민 소득의 증가로 식품 소비 형태가 변화하면서 육류 및 유제품의 소비가 증가하게 되고 농가에서 새로운 소득원으로 축산업이 활성화되면서 전통적인 재래식 가축사육 형태에서 전업식 사육형태로 점차적으로 규모가 커지기 시작하였다. 반면, 우루과이라운드(UR) 협상에 따라 농산물을 비롯한 축산물 등 완전시장개방에 따라 국제경쟁력 약화 및 축산폐수 규제의 강화에 대한 우려 등으로 겸엽(兼業)농식의 축산업은 도태 감소하게 되고 그 규모에 있어서 전업 전문화, 대규모화로 변모되어 가고 있는 추세임은 분명하다. 따라서 축산물 시장개방에 효율적으로 대처하기 위해서는 축산전업농가 육성과 계열화와 그에 따른 고품질 축산물 생산을 통한 축산업 경쟁력 제고에 노력해야 하며 아울러 축산폐수처리에 대한 기술개발 및 연구투자 확대와 더불어 축분 유기질비료의 생산 및 유통을 촉진하기 위한 법적 근거를 마련 등을 추진함으로서 국내 축산업의 경쟁력을 유지하며 친 환경적인 축산 경영을 이루어야 할 것이다. 이에 본 연구에서는 현재 날로 심각해지는 가축분뇨가 환경에 미치는 영향을 평가가 필요하여, 기초데이터의 확충 및 현황 파악을 위하여 축산 농가 내의 분뇨처리 실태를 조사 하고 문제점을 도출하고자 하였다. 또한 현재 조사된 자료를 바탕으로 가축 분뇨에 의한 오염 발생여부 및 발생량을 예측하고, 가축분뇨에 의한 오염 방지 및 수계에 미치는 영향을 안정적으로 유지하기 위하여 가축분뇨 이용 및 관리를 전반적으로 검토함으로써 가축분뇨를 효율적으로 관리하고 앞으로의 이용에 관한 여러 대안을 제시하는 것을 목적으로 한다.요했던 출혈(2예), 흉골 지연봉합(2예), 급성 신부전(2예), 폐렴(1예), 대동맥내 풍선펌프로 인한 혈전색전증(1예),수술 후 섬망(2예) 등이 있었다. 생존한 10명의 환자들 중 1명을 제외한 나머지 9명의 환자에서 $38{\pm}40$개월간의 추적관찰이 되었는데, 추적 관찰 기간 중에 3명이 사망하였고 생존한 6명의 환자는 모두 양호한 상태(NYHA 기능등급, $I{\sim}II$)를 보였으며, 그 중 3명에서는 혈역학적으로 큰 의미가 없는 잔여단락이 있었다. 결론: 급성 심근경색증 후 심실중격 결손은 수술위험도가 높은 질환이지만, 수술 전 대동맥내 풍선펌프를 삽입하고 조기에 심실중격 결손부의 infarct exclusion 술식과 함께 관상동맥우회술을 시행함으로써 만족할 만한 수술 및 중기 결과를 얻을 수 있었다.출물 투여로 저하되었으나 NC군보다는 높게 나타났다. 간 중 중성지질 함량은 참나물 에탄올 추출물 투여 용량에 따른 유의차가 없었으나, 총콜레스테롤 함량은 고용량 병합투여한 HC-PBH군만 유의하게 저하되었다. 혈청 및 간 중의 지질 함량 변화는 정상식이를 급여한 NC군과 NC-PB군 간에는 유의차가 없었다. 따라서 고콜레스테롤식이를 급여하면서 참나물 에탄올 추출물을 병합투여 시에만 지질대사 개선 효과가 있는 것으로 여겨지며, 고용량 병합투여 시 효능이 더 큰 것으로 나타났다. 고콜레스테롤식이로 인한 산화적 스트레스가 고콜레스테롤혈증을 유발하였으며, 이는 참나물 에탄올 추출물에 함유된 항산화물질을 포함한 여러 생리활성물질이 영향을 미친 것으로 사료된다. 이상의 실험 결과에서 참나물 에탄올 추출물은 고콜레스테롤식이

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.736-745
• /
• 2002

In network delivery of compressed video, packets may be lost if the channel is unreliable like Internet. Such losses tend to of cur in burst like continuous bit-stream error. In this paper, we propose an effective error-concealment approach to which an error resilient video encoding approach is applied against burst errors and which reduces a complexity of error concealment at the decoder using data hiding. To improve the performance of error concealment, a temporal and spatial error resilient video encoding approach at encoder is developed to be robust against burst errors. For spatial area of error concealment, block shuffling scheme is introduced to isolate erroneous blocks caused by packet losses. For temporal area of error concealment, we embed parity bits in content data for motion vectors between intra frames or continuous inter frames and recovery loss packet with it at decoder after transmission While error concealment is performed on error blocks of video data at decoder, it is computationally costly to interpolate error video block using neighboring information. So, in this paper, a set of feature are extracted at the encoder and embedded imperceptibly into the original media. If some part of the media data is damaged during transmission, the embedded features can be extracted and used for recovery of lost data with bi-direction interpolation. The use of data hiding leads to reduced complexity at the decoder. Experimental results suggest that our approach can achieve a reasonable quality for packet loss up to 30% over a wide range of video materials.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.1916-1932
• /
• 1997

The synchronous stream cipher which require absoulte clock synchronization has the problem of synchronization loss by cycle slip. Synchronization loss makes the state which sender and receiver can't communicate with each other and it may break the receiving system. To lessen the risk, we usually use a continuous resynchronization method which achieve resynchronization at fixed timesteps by inserting synchronization pattern and session key. While we can get resynchronization effectively by continuous resynchroniation, there are some problems. In this paper, we proposed an adaptive resynchronization algorithm for cipher system using HDLC protocol. It is able to solve the problem of the continuous resynchronization. The proposed adaptive algorithm make resynchronization only in the case that the resynchronization is occurred by analyzing the address field of HDLC. It measures the receiving rate of theaddress field in the decision duration. Because it make resynchronization only when the receiving rate is greateer than the threshold value, it is able to solve the problems of continuous resynchronization method. When the proposed adaptive algorithm is applied to the synchronous stream cipher system in packet netork, it has addvance the result in R_e and D_e.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.5
• /
• pp.57-70
• /
• 2009

A CAD design drawing based on vector data that is very important art work in industrial fields has been considered to content that the copyright protection is urgently needed. This paper presents a watermarking scheme based on k-means++ for CAD design drawing. One CAD design drawing consists of several layers and each layer consists of various geometric objects such as LINE, POLYLINE, CIRCLE, ARC, 3DFACE and POLYGON. POLYLINE with LINE, 3DFACE and ARC that are fundamental objects make up the majority in CAD design drawing. Therefore, the proposed scheme selects the target object with high distribution among POLYLINE, 3DFACE and ARC objects in CAD design drawing and then selects layers that include the most target object. Then we cluster the target objects in the selected layers by using k-means++ and embed the watermark into the geometric distribution of each group. The geometric distribution is the normalized length distribution in POLYLINE object, the normalized area distribution in 3DFACE object and the angle distribution in ARC object. Experimental results verified that the proposed scheme has the robustness against file format converting, layer attack as well as various geometric editing provided in CAD editing tools.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.261-273
• /
• 2004

Advances in information and communication technologies have been creating new classes of applications in the area of databases. For example, in moving object databases, which track positions of a lot of objects, or stream databases, which process data streams from a lot of sensors, data Processed in such database systems are usually changed very rapidly and continuously. However, traditional database systems have a problem in processing these rapidly and continuously changing data because they suppose that a data item stored in the database remains constant until It is explicitly modified. The problem becomes more serious in the R-tree, which is a typical index structure for multidimensional data, because modifying data in the R-tree can generate cascading node splits or merges. To process frequent updates more efficiently, we propose a novel update technique for the R-tree, which we call the leaf-update technique. If a new value of a data item lies within the leaf MBR that the data item belongs, the leaf-update technique changes the leaf node only, not whole of the tree. Using this leaf-update manner and the leaf-access hash table for direct access to leaf nodes, the proposed technique can reduce update cost greatly. In addition, the leaf-update technique can be adopted in diverse variants of the R-tree and various applications that use the R-tree since it is based on the R-tree and it guarantees the correctness of the R-tree. In this paper, we prove the effectiveness of the leaf-update techniques theoretically and present experimental results that show that our technique outperforms traditional one.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.247-258
• /
• 2004

Recently, there have been researches on storage and retrieval technique of moving objects, which are highly concerned by user in database application area such as video databases, spatio-temporal databases, and mobile databases. In this paper, we propose a new signature-based indexing scheme which supports similar sub-trajectory retrieval at well as good retrieval performance on moving objects trajectories. Our signature-based indexing scheme is classified into concatenated signature-based indexing scheme for similar sub-trajectory retrieval, entitled CISR scheme and superimposed signature-based indexing scheme for similar sub-trajectory retrieval, entitled SISR scheme according to generation method of trajectory signature based on trajectory data of moving object. Our indexing scheme can improve retrieval performance by reducing a large number of disk access on data file because it first scans all signatures and does filtering before accessing the data file. In addition, we can encourage retrieval efficiency by appling k-warping algorithm to measure the similarity between query trajectory and data trajectory. Final]y, we evaluate the performance on sequential scan method(SeqScan), CISR scheme, and SISR scheme in terms of data insertion time, retrieval time, and storage overhead. We show from our experimental results that both CISR scheme and SISR scheme are better than sequential scan in terms of retrieval performance and SISR scheme is especially superior to the CISR scheme.

• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.487-496
• /
• 2009

This paper addresses an indexing scheme capable of efficiently processing range queries in a large-scale trajectory database. After discussing the drawbacks of previous indexing schemes, we propose a new scheme that divides the temporal dimension into multiple time intervals and then, by this interval, builds an index for the line segments. Additionally, a supplementary index is built for the line segments within each time interval. This scheme can make a dramatic improvement in the performance of insert and search operations using a main memory index, particularly for the time interval consisting of the segments taken by those objects which are currently moving or have just completed their movements, as contrast to the previous schemes that store the index totally on the disk. Each time interval index is built as follows: First, the extent of the spatial dimension is divided onto multiple spatial cells to which the line segments are assigned evenly. We use a 2D-tree to maintain information on those cells. Then, for each cell, an additional 3D $R^*$-tree is created on the spatio-temporal space (x, y, t). Such a multi-level indexing strategy can cure the shortcomings of the legacy schemes. Performance results obtained from intensive experiments show that our scheme enhances the performance of retrieve operations by 3$\sim$10 times, with much less storage space.