• 한국소음진동공학회논문집
• /
• 제20권2호
• /
• pp.138-143
• /
• 2010

Hydraulic breakers are widely used for mining and construction engineering area but make serious noise problem. The noise is generated between a chisel and a piston when they are hit by a fluid power. This study proposed noise reduction method by the change of a chisel in a hydraulic breaker. In the new design, a different material is inserted inside of a chisel. The proposed design is analyzed and simulated by the use of a numerical method. A chisel by the new design was installed in a hydraulic breaker and experimented for sound pressure level. As a result, the noise of hydraulic breaker can be reduced more than 4 dB by simply changing a chisel.

• Journal of Information Technology Applications and Management
• /
• 제14권2호
• /
• pp.151-168
• /
• 2007

The corporate credit rating represents an assessment of the relative level of risk associated with the timely payments required by the debt obligation. In this study, the corporate credit rating model employs artificial intelligence methods including Neural Network (NN) and Case-Based Reasoning (CBR). At first we suggest three classification models, as partitioned neural networks, all of which convert multi-group classification problems into two group classification ones: Ordinal Pairwise Partitioning (OPP) model, binary classification model and simple classification model. The experimental results show that the partitioned NN outperformed the conventional NN. In addition, we put to use CBR that is widely used recently as a problem-solving and learning tool both in academic and business areas. With an advantage of the easiness in model design compared to a NN model, the CBR model proves itself to have good classification capability through the highest hit ratio in the corporate credit rating.

• Journal of information and communication convergence engineering
• /
• 제16권2호
• /
• pp.114-124
• /
• 2018

This paper illustrates a vision-based vehicle positioning method at an intersection to support the C-ITS. It removes the minor shadow that causes the merging problem by simply eliminating the fractional parts of a quotient image. In order to separate the occlusion, it firstly performs the distance transform to analyze the contents of the single foreground object to find seeds, each of which represents one vehicle. Then, it applies the watershed to find the natural border of two cars. In addition, a general vehicle model and the corresponding space estimation method are proposed. For performance evaluation, the corresponding ground truth data are read and compared with the vision-based detected data. In addition, two criteria, IOU and DEER, are defined to measure the accuracy of the extracted data. The evaluation result shows that the average value of IOU is 0.65 with the hit ratio of 97%. It also shows that the average value of DEER is 0.0467, which means the positioning error is 32.7 centimeters.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.238-241
• /
• 2002

With the popularity of utilization of the Internet among people, the amount of data in the network rapidly increased. So that, the fall of response time from WWW server, which is caused by the network traffic and the burden on m server, has become more of an issue. This problem is encouraged the rearch by redundancy of requesting the same pages by many people, even though they browse the same the ones. To reduce these redundancy, WWW cache server is used commonly in order to store m page data and reuse them. However, the technical uses of WWW cache that different from CPU and Disk cache, is known for its difficulty of improving the cache hit rate. Consecuently, it is difficult to choose effective WWW data to be stored from all data flowing through the WWW cache server. On the other hand, there are room for improvement in commonly used cache replacement algorithms by WWW cache server. In our study, we try to realize a WWW cache server that stresses on the improvement of the stresses of response time. To this end, we propose the new cache replacement algorithm by focusing on the utilizable information of network distance from the WWW cache server to WWW server that possessing the page data of the user requesting.

• 조명전기설비학회논문지
• /
• 제18권1호
• /
• pp.85-89
• /
• 2004

산업자동화의 고정밀도에 따라 궤환 제어시스템은 강인한 제어가 요구되고 있다. 하지만 신경망 궤환 제어시스템이 외란의 영향을 받았을 때, 시스템의 강인한 제어는 어렵게 된다. 본 논문에서는 이러한 문제를 해결하기 위한 한 방법으로 신경회로망제어기와 PR제어기의 복합형 제어방법을 제시하였다. 신경회로망 제어기는 주 제어기로서 동작하고, PID제어기는 허용오차가 경계영역을 벗어날 때 동작하는 보조제어기로 사용된다. 신경회로망-PID복합형제어기의 강인성은 전동기의 속도제어에 의해서 확인하였다.

• 한국항공운항학회지
• /
• 제25권3호
• /
• pp.74-80
• /
• 2017

As for A rotary wing aircraft, the configuration change about split yaw swaged rod was executed to improve hit treat capability for dealing with a long rod. The purpose of this study was to analyze if or not the quality of the split yaw swaged rod was obtained, and so the flight safety was ensured or not. Buckling analysis, Coupling Thread Strength Analysis, Thermal Stress analysis and Rod Natural Frequency Analysis were executed for structural analysis. The results of the analysis were presented that the split rod had the sufficient margin of safety and so there were no anomalies in the limit load and no failures in the ultimate load. And there were no resonances in result of natural frequency analysis. In conclusion, this study showed that the split yaw swaged rod had structural safety, so flight safety of rotary wing aircraft was secured and there was no problem in aircraft operation. It is certain that the technology of splitting the yaw swage rod will contribute to the operational Safety of the rotary wing aircraft in the future.

• 한국컴퓨터산업학회논문지
• /
• 제2권11호
• /
• pp.1453-1464
• /
• 2001

인터넷 사용자의 폭발적인 증가로 인해 웹 서비스는 심각한 성능상의 지연을 보이고 있다. 인기 있는 웹사이트의 입장에서는 많은 요청으로 인하여 원활한 서비스를 제공하기 어렵고, 사용자 또한 만족스러운 수준의 응답시간을 제공받지 못한다. 이에 대한 해결책으로 제시된 웹캐슁은 서버에 대한 요청을 흡수하여 전체적인 교통량을 줄이며 사용자에게는 보다 빠른 응답을 제공한다. 본 논문에서는 미국의 웹 캐쉬 프로젝트인 NLANR(National Laboratory for Applied Network Research)의 최상위 캐쉬들로부터 생성된 트레이스와 서울대에 위치한 교육망 캐쉬의 트레이스를 이용하여 웹 캐쉬 트래픽의 특성들에 관해 분석하고, 이들로부터 얻은 각종 특성 자료를 바탕으로, 미래에 필요하리라고 여겨지는 웹 오브젝트를 미리 가져오는 prefetch 방법을 제시하였으며 그로 인한 효과에 관해 분석하였다. 그 결과, l∼3% 정도 일일 평균 적중률의 향상과 최대 5% 정도의 평균 응답시간의 개선을 기대할 수 있음을 발견하였다.

• 한국항행학회논문지
• /
• 제15권3호
• /
• pp.355-363
• /
• 2011

무선 모바일 네트워크상에서 트랜스코딩은 지연을 줄이고, 스트림의 처리 성능을 향상시키는 중요한 메커니즘이다. 그러나 무선 모바일 스트리밍 미디어 서비스는 제한된 네트워크 대역폭과 자원 등으로 인하여 혼잡, 간섭 및 지연등과 같은 문제점이 발생하고 있다. 간섭과 지연은 QoS를 떨어뜨릴 뿐만 아니라 스트리밍 미디어 서비스의 응답성을 떨어뜨린다. 본 논문에서는 객체 버전 트랜스코딩 기법을 제안한다. 제안된 기법은 객체 버전들을 분석하여 트랜스코딩 그래프를 구축한다. 스트리밍을 효율적으로 제어하기 위하여 참조율 기반 제어 함수를 이용하며, 지연 절약을 위해 MVDS(Multiple Version Delay Saving)를 측정한다. 시뮬레이션 결과 제안된 기법이 다른 비교 결과 기법들에 비해서 지연율, 캐시 히트율이 증가됨을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권3호
• /
• pp.1065-1085
• /
• 2020

With rapid growth of content demands, device-to-device (D2D) content sharing is exploited to effectively improve the service quality of users. Considering the limited storage space and various content demands of users, caching schemes are significant. However, most of them ignore the influence of the asynchronous content reuse and the selfishness of users. In this work, the user preferences are defined by exploiting the user-oriented content popularity and the current caching situation, and further, we propose the social-aware rate, which comprehensively reflects the achievable contents download rate affected by the social ties, the caching indicators, and the user preferences. Guided by this, we model the collaborative caching problem by making a trade-off between the redundancy of caching contents and the cache hit ratio, with the goal of maximizing the sum of social-aware rate over the constraint of limited storage space. Due to its intractability, it is computationally reduced to the maximization of a monotone submodular function, subject to a matroid constraint. Subsequently, two social-aware collaborative caching algorithms are designed by leveraging the standard and continuous greedy algorithms respectively, which are proved to achieve different approximation ratios in unequal polynomial-time. We present the simulation results to illustrate the performance of our schemes.

• 한국전자거래학회지
• /
• 제8권2호
• /
• pp.23-31
• /
• 2003

링크 기반 검색엔진은사용자의 질의어와 관련된 웹 문서들의 링크 정보를 이용하여 순위를 생성한다. 이러한 링크기반 웹 문서의 특성을 이용한 대표적인 순위 평가 알고리즘. HITS는 웹 페이지들 간의 상호 연결된 링크 정보로부터 웹 문서들의 중요도를 평가하고, 순위 정보에 따른 결과를 제시한다. 이러한 HITS 알고리즘의 문제점은 문서 내의 링크 빈도 수만을 고려하고, 입력 값으로 주어지는 웹 문서 집합의 특성에 의존적이라는 것이다. 본 논문에서는 링크기반 웹 검색 엔진들로부터 얻어진 문서 집합에 대해 질의와 검색결과 간의 적합도를 향상시킨 HITS 알고리즘을 수행하는 검색 에이전트를 설계하였다. 이로써 향상된 검객 성능과 결과의 지역성을 보완한다.