• Smart Structures and Systems
• /
• v.32 no.6
• /
• pp.359-369
• /
• 2023

Servo-motor driven uniaxial shake tables have been widely used for education and research purposes in earthquake engineering. These shake tables are mostly displacement-controlled by a digital proportional-integral-derivative (PID) controller; however, accurate reproduction of acceleration time histories is not guaranteed. In this study, a control strategy is proposed and verified for uniaxial shake tables driven by a servo-motor. This strategy incorporates a deep-learning algorithm named Long Short-Term Memory (LSTM) network into a displacement PID feedback controller. The LSTM controller is trained by using a large number of experimental data of a self-made servo-motor driven uniaxial shake table. After the training is completed, the LSTM controller is implemented for directly generating the command voltage for the servo motor to drive the shake table. Meanwhile, a displacement PID controller is tuned and implemented close to the LSTM controller to prevent the shake table from permanent drift. The control strategy is named the LSTM-PID control scheme. Experimental results demonstrate that the proposed LSTM-PID improves the acceleration tracking performance of the uniaxial shake table for both bare condition and loaded condition with a slender specimen.

• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.43-62
• /
• 1995

For a complex scheduling system like time table construction, its optimal solution, if exists, is hard to obtain. In this paper, the scheduling environment is reasonably confined as where objects have their own events competing for better slots on boards, and objects have their own board slot preferences and belong to one or more classes of the society which globally constrains them. Here, two phase method is suggested, where the first phase is human-like preference driven and the second phase is for fine tuning by considering all the factors given. Designed and implemented in our system HI-SCHED are dynamic object switching, temporal-constraint-driven intelligent backtracking, case-based revisions, object-based approach, and so on. Some satisfaction degrees are also defined to measure the usefulness of our method. In addition, look-ahead dynamic object switching is considered, and additional global constraints are introduced and processed. A simple scheme is also used to verify the usefulness of the post processing scheme.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.2
• /
• pp.102-110
• /
• 2012

ZigBee networks developed for low power and short range communication are being used as home network solution for ubiquitous computing. However, as smart phones and tablet PCs have been widely used, WLANs which use same frequency with ZigBee networks have been increasingly used. Therefore, radio frequency interference causes many problems. To solve radio frequency interference problem among ZigBee networks and WLANs, many researches focus on designing interference minimization schemes in ZigBee networks. However, existing schemes have problems that have waste of resource for detecting interference, and have unnecessary time to avoid interference. In this paper, we propose an interference minimization scheme to solve radio frequency interference in ZigBee networks. The proposed scheme detects interference using ACK mechanism to reduce waste of resource, and avoids interference using table driven channel hopping scheme which is faster than existed schemes. The performance of proposed interference minimization scheme is evaluated by using OPNET simulator. Through the simulation result, we prove that proposed scheme has faster channel hopping than existing schemes.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.251-261
• /
• 2001

The traffic on the Internet has been growing exponentially for some time. This growth is beginning to stress the current-day routers. However, switching technology offers much higher performance. So the label switching network which combines IP routing with switching technology, is emerged. EspeciaJJy in the data driven label switching, flow classification and cache table management are needed. Flow classification is to classify packets into switching and non-switching packets, and cache table management is to maintain the cache table which contains information for flow classification and label switching. However, the cache table management affects the performance of label switching network considerably as well as flowclassification because the bigger cache table makes more packet switched and maintains setup cost lower, but cache is restricted by local router resources. For that reason, there is need to study the cache replacement scheme for the efficient cache table management with the Internet traffic characterized by user. So in this paper, we propose several cache replacement schemes for label switching network. First, without the limitation at switching capacity in the router. we introduce FIFO(First In First Out). LFC(Least Flow Count), LRU(Least Recently Used! scheme and propose priority LRU, weighted priority LRU scheme. Second, with the limitation at switching capacity in the router, we introduce LFC-LFC, LFC-LRU, LRU-LFC, LRU-LRU scheme and propose LRU-weighted LRU scheme. Without limitation, weighted priority LRU scheme and with limitation, LRU-weighted LRU scheme showed best performance in this paper.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.04b
• /
• pp.342-347
• /
• 1995

Loop shaping $H_{\infty}$control with normalized coprime factorization was applied to a servo-motor driven high-speed powitioning system. The high-gain controller was designed to attenuate the postion errors caused byfriction effects and extermal disturbances. The non-existence of limit cycle was analyzed, though there is actuator saturation. The designed $H_{\infty}$control system was experimently tested in a rotary index table. Results showed its effectiveness to improve postion accuracy with out any compensation scheme for friction, and robustness to model perturbation and external disturbances.ces.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1383-1386
• /
• 2002

Ad Hoc 네트워크는 베이스 스테이션이나 이동스위칭 센터와 같은 기존의 고정 된 infrastructure가 없는 이동 호스트들을 위한 새로운 패러다임이다. 본 논문에서는 기존의 Table-driven 방식과 On-demand 라우팅의 장점을 접목시킨 2-tier 계층구조를 사용한 다이나믹 라우팅 기법과 이를 바탕으로 효율적인 routing 경로를 확보하면서도 구조적으로 취약한 보안 위협 요소들에 대한 안정성을 제공하는 클러스터 노드간에 RSA기법을 사용한 인증 알고리즘을 제안한다.

• Journal of Power Electronics
• /
• v.9 no.5
• /
• pp.800-808
• /
• 2009

This paper presents a practical method of pressure control for a hydraulic oil-pump system using an SR (Switched Reluctance) drive. For a 6Mpa grade hydraulic oil-pump, a 2.6kW SR drive is developed. In order to get high performance pressure dynamics in actual applications, a data based PID control scheme is proposed. The look-up table from a pre-measured data base produces an approximate current reference based on motor speed and oil-pressure. A PID controller can compensate for the pressure error. With the combination of the two references, the proposed control scheme can achieve fast dynamics and stable operation. Furthermore, a suitable current controller considering the nonlinear characteristics of an SRM (Switched Reluctance Motor) and practical test methods for data measuring are presented. The proposed control scheme is verified by experimental tests.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.873-889
• /
• 2014

IP address lookup is very crucial in performance of routers. Several works have been done on prefix caching to enhance the performance of IP address lookup. Since a prefix represents a range of IP addresses, a prefix cache shows better performance than an IP address cache. However, not every prefix is cacheable in itself. In a prefix cache it causes false hit to cache a non-leaf prefix because there is possibly the longer matching prefix in the routing table. Prefix expansion techniques such as complete prefix tree expansion (CPTE) make it possible to cache the non-leaf prefixes as the expanded forms, but it is hard to manage the expanded prefixes. The expanded prefixes sometimes incur a great deal of update overhead in a routing table. We propose a bitmap-based prefix cache (BMCache) to provide low update overhead as well as low cache miss ratio. The proposed scheme does not have any expanded prefixes in the routing table, but it can expand a non-leaf prefix using a bitmap on caching time. The trace-driven simulation shows that BMCache has very low miss ratio in spite of its low update overhead compared to other schemes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.496-498
• /
• 2004

무선 ad-hoc 네트워크는 이동 노드만으로 구성된 자율적이고 수평적인 네트워크이다. 무선 ad-hoc 네트워크에서의 라우팅 프로토콜은 table driven 방식과 on-demand 방식으로 나뉘는데, 이 중 라우팅 메시지의 오버헤드가 비교적 적은 on-demand 방식이 주로 사용되고 있다. 이 프로토콜은 경로를 찾기 위해서 경로 요청 메시지를 브로드캐스팅 하는데, 경로 요청 메시지는 네트워크 전체로 확산되기 때문에 이를 이용한 공격이 가능하다 공격자는 연속적으로 경로 요청 메시지를 보냄으로써 패킷 충돌과 네트워크 큐오버플로우 등의 장애를 일으켜 정상적인 메시지나 데이터의 전송을 방해할 수 있다. 본 논문에서는 기존의 라우팅 프로토콜에 별도의 인증 절차 없이 경로 요청 패킷의 확산을 이용한 공격을 막는 방법을 제안하고자 한다. 각각의 노드는 경로 요청 메시지의 시작 주소와 수신 시간을 경로 요청 테이블을 이용해 관리함으로써 정상적인 경로 요청 패킷과 공격자의 경로 요청 패킷을 구분한다. 수신된 경로 요청 패킷이 공격자의 패킷이라고 판단된 경우, 공격자의 패킷을 이웃 노드에 전달하지 않음으로써 전체 네트워크에 가해지는 공격을 막을 수 있다.

• The Journal of Society for e-Business Studies
• /
• v.15 no.4
• /
• pp.21-31
• /
• 2010

Recently e-business such as online financial trade and online shopping using mobile computes are widely spread. Most of mobile computers use NAND flash memory-based storage devices for storing data. Flash memory storage devices use a software called flash translation layer to translate logical address from a file system to physical address of flash memory by using mapping tables. The legacy FTLs have a problem that they must maintain very large mapping tables in the RAM. In order to address this issues, in this paper, we proposed a new caching scheme of mapping tables. We showed through the trace-driven simulations that the proposed caching scheme reduces the space overhead dramatically but does not increase the time overhead. In the case of online transaction workload in e-business environment, in particular, the proposed scheme manifests better performance in reducing the space overhead.