• 한국정밀공학회지
• /
• 제28권9호
• /
• pp.1025-1031
• /
• 2011

Take-out robots used for handling of the plastic parts manufactured with the injection mold are usually the gantry type that consists of long and thin links, The performance of the take-out robot is determined by the speed of the motion and the positioning accuracy to grab the part out of the mold, As the speed of the robot increases the flexure in the links of the take-out robot becomes more significant and it results in more residual vibration, The residual vibration deteriorates the positioning accuracy and compels the operator to slow down the motion of the robot. The typical method to reduce the vibration in the robot requires stiffening the links and/or slowing down the robot, Vibration control could achieve the desired performance without increasing the manufacturing cost or the operation cost that would be incurred otherwise, Considering the point-to-point nature of the task to be performed by the take-out robot the time-delay command (or input) shaping filter approach would be the most effective control method to be adopted among a few available control schemes. In this paper a direct adaptive command shaping filter (ACSF) algorithm has been modified and applied to design the optimal command shaping filters for various configuration of the take-out robot. Optimal filters designed by ACSF algorithm have been implemented on a take-out robot and the effectiveness of the designed filters in terms of vibration suppression has been verified for multiple positions of the robot.

• 대한교통학회지
• /
• 제22권3호
• /
• pp.167-177
• /
• 2004

Hub-and-spoke운송은 교통분야에서 널리 이용되고 있는 운송전략의 대표적 개념이다. 화물의 컨테이너화와 환적기술의 발달로 최근 유럽을 중심으로 철도화물운송부문에서도 이 운송전략의 적용사례가 나타나고 있다. 이에 본 연구는 Hub-and-spoke운송전략을 구현하는 철도화물서비스네트워크 디자인모형을 제시하고, 대규모 운송망에도 적용이 가능한 효율적 알고리즘을 개발하였다. 개발되는 모형이 전략적 수준의 계획모형임에도 불구하고 모형에서는 일반화된 운영비용 외에 열차속도, 서비스빈도, 터미널에서의 화물처리속도 등에 따른 시간지체비용도 고려되었다. 시간지체비용의 고려에 따라 야기되는 목적함수의 비선형성은 빈도별 서비스결정변수의 설정을 통해 선형최적화문제로 표현되었다. 규모가 큰 네트워크의 경우 해도출의 어려움 때문에 본 논문은 전체문제의 분할(decomposition)에 기초한 휴리스틱방법((heuristic method)으로 문제를 해결하고자 하였다. 해도출의 효율성을 높이기 위해 서비스빈도개선과 관련하여 3개의 알고리즘이 개발되었고, 개발된 알고리즘은 유럽의 실제네트워크를 기초로 도출한 4개의 테스트문제를 대상으로 해의 정확도와 해 도출의 효율성이 비교 평가되었다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제14권3호
• /
• pp.322-330
• /
• 2014

New effective techniques to repair "small" design errors in integrated circuits are presented. As semiconductor chip complexity increases and the design period becomes tight, errors frequently remain in a fabricated chip making revisions required. Full mask revision significantly increases the cost and time-to-market. However, since many "small" errors can be repaired by modifying several connections among the circuit blocks and spare cells, errors can frequently be repaired by revising metal layers. Metal only revision takes significantly less time and involves less cost when compared to full mask revision, since mask revision costs multi-million dollars while metal revision costs tens of thousand dollars. In our research, new techniques are developed to further reduce the number of metal layers to be revised. Specifically, we partition the circuit blocks with higher error probabilities and extend the terminals of the signals crossing the partition boundaries to the preselected metal repair layers. Our partitioning and pin extension to repair layers can significantly improve the repairability by revising only the metal repair layers. Since pin extension may increase delay slightly, this method can be used for non-timing-critical parts of circuits. Experimental results by using academia and industrial circuits show that the revision of the two metal layers can repair many "small" errors at low-cost and with short revision time. On the average, when 11.64% of the spare cell area and 24.72% of the extended pins are added to the original circuits, 83.74% of the single errors (and 72.22% of the double errors) can be corrected by using two metal revision. We also suggest methods to use our repair techniques with normal commercial vender tools.

• 대한교통학회지
• /
• 제31권4호
• /
• pp.3-17
• /
• 2013

본 연구는 대규모 교통망에서 통행배정시 신호교차로에 의한 지체를 반영한 통행배정을 수행하여 보다 현실 모사가 가능한 통행배정기법을 개발 하는 것이다. 실제로 도시부나 단속류에서 발생하는 통행시간 및 비용의 증가 원인은 많은 부분이 교차로 지체에 의한 정지 혹은 혼잡에 의해 발생함에도 불구하고 기존의 통행배정 모형은 이를 반영하지 못하고 있었다. 본 연구에서 개발한 신호교차로 지체 반영 통행배정 모형은 기존의 통행배정모형과 한국도로 용량편람의 신호교차로 지체 산정 방법을 결합하여 구축하였다. 다양한 모의실험을 통해 이 모형이 실제 가로망에 적용이 가능한 모형임을 보였다. 따라서 본 모형은 대규모 지역에서의 교통정책 및 교통시설의 변화 등에 교차로 지체를 적용하여 분석할 수 있을 것으로 판단된다.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2014년도 춘계 학술논문 발표대회
• /
• pp.64-65
• /
• 2014

Recently freeform buildings which are free from simple shape are implemented depending on improvement of construction method. However, freeform buildings are spent more time and cost to materialize than typical form. Because molds for production of freeform shape cannot be reused. For these reasons, low productivity, delay of construction schedule and budget overflow are occurred. Thus, technology of molds need to be developed for manufacturing of freeform concrete segments. The objective of this study is manufacturing of freeform concrete segments using rod type mold. This technology can implement not only application to various shape but also mass production. Thus, problems of construction period, productivity and cost can be solved. After this study, productivity analysis should be continued through the field application.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 컴퓨터소사이어티 추계학술대회논문집
• /
• pp.45-48
• /
• 2003

We can easily buy network system for high performance micro-processor, progress computer architecture is caused of high bandwidth and low delay time. Coupling PC-based commodity technology with distributed computing methodologies provides an important advance in the development of single-user dedicated systems. Lately Network is joined PC or workstation by computers of high performance and low cost. Than it make intensive that Cluster system is resembled supercomputer. Unix, Linux, BSD, NT(Windows series) can use Cluster system OS(operating system). I'm chosen linux gain low cost, high performance and open technical documentation. This paper is benchmark performance of Beowulf clustering by UltraSPARC-1K(64bit-RISC processor). Benchmark tools use MPI(Message Passing Interface) and NetPIPE. Beowulf is a class of experimental parallel workstations developed to evaluate and characterize the design space of this new operating point in price-performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2379-2397
• /
• 2017

Content distribution technology, which routes content to the cache servers, is considered as an effective method to reduce the response time of the user requests. However, due to the exponential increases of content traffic, traditional content routing methods suffer from high delay and consequent inefficient delivery. In this paper, a content selection policy is proposed, which combines the histories of cache hit and cache hit rate to collaboratively determine the content popularity. Specifically, the CGM policy promotes the probability of possible superior paths considering the storage cost and transmission cost of content network. Then, the content routing table is updated with the proportion of the distribution on the paths. Extensive simulation results show that our proposed scheme improves the content routing and outperforms existing routing schemes in terms of Internet traffic and access latency.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1993년도 하계학술대회 논문집 B
• /
• pp.860-862
• /
• 1993

This paper presents a study on a self oscillating dc/dc converter with low cost, high power density. This converter only consists of power filter, switch and comparater and time delay reduction parts. But it has better characteristics than the conventional self-oscillating dc/dc converter. And it can be made by a few devices and can be smaller size. These type of converters find their applications in many industrial equipments. And the performances of the proposed system are verified through expriment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.4054-4071
• /
• 2015

Named-Data Networking (NDN) is one of the promising approaches for the Future Internet to cope with the explosion and current usage pattern of Internet traffic. Content provider mobility in the NDN allows users to receive real-time traffic when the content providers are on the move. However, the current solutions for managing these mobile content providers suffer several issues such as long handover latency, high cost, and non-optimal routing path. In this paper, we survey main approaches for provider mobility in NDN and propose an optimal scheme to support the mobile content providers in the large-scale NDN domain. Our scheme predicts the movement of the provider and uses state information in the NDN forwarding plane to set up an optimal new routing path for mobile providers. By numerical analysis, our approach provides NDN users with better service access delay and lower total handover cost compared with the current solutions.

• ETRI Journal
• /
• 제45권3호
• /
• pp.433-447
• /
• 2023

Critical issues such as connection congestion, long transmission delay, and packet loss become even worse during epidemic, disaster, and so on. In this study, a link load balancing method is proposed to address these issues on the data plane, a plane of the software-defined network (SDN) architecture. These problems are NP-complete, so a meta-heuristic approach, discrete particle swarm optimization, is used with a novel hybrid cost function. The superiority of the proposed method over existing methods in the literature is that it provides link and switch load balancing simultaneously. The goal is to choose a path that minimizes the connection load between the source and destination in multipath SDNs. Furthermore, the proposed work is dynamic, so selected paths are regularly updated. Simulation results prove that with the proposed method, streams reach the target with minimum time, no loss, low power consumption, and low memory usage.