• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2005.11a
• /
• pp.209-212
• /
• 2005

The look-ahead preview control with the use of limited bandwidth active suspensions is presented. Both a linearized racked vehicle model and a complex nonlinear model based on a commercial multibody dynamic program are used to verify the performance of preview control. The performance of the preview control system is evaluated on the ride quality which is estimated from the acceleration of the driver position. Due to the practical advantages associated with the use of limited bandwidth active control in comparison with full bandwidth systems, the results are considered important to the future development of active tracked vehicle suspensions.

• International conference on construction engineering and project management
• /
• 2009.05a
• /
• pp.907-913
• /
• 2009

Pipeline construction is a highly repetitive and resource-intensive process that is exposed to various constraints and uncertainties in the working environment. Effective look-ahead scheduling based on the most recent project performance data can greatly improve project execution and control. This study enhances the traditional linear scheduling method with stochastic simulation to incorporate activity performance uncertainty in look-ahead scheduling. To facilitate the use of this stochastic method, a computer program, Stochastic Linear Scheduling Method (SLSM), was designed and implemented. Accurate look-ahead scheduling can help schedulers to better anticipate problem areas and formulate new plans to improve overall project performance.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.1
• /
• pp.31-38
• /
• 2011

With the increasing demand for high-speed transmission systems, adaptive equalizers have been widely used in receivers to overcome the limited bandwidth of channels. In order to reduce the cost for testing high-speed receiver chips, on-chip eye-opening monitoring (EOM) technique which measures the eye-opening of data waveform inside the chip can be employed. In this paper, a 10-Gb/s adaptive 2-tap look-ahead decision feedback equalizer (DFE) with EOM function is proposed. The proposed EOM circuit can be applied to look-ahead DFEs while existing EOM techniques cannot. The magnitudes of the post-cursors are measured by monitoring the eye of received signal, and coefficients of DFE are calculated using them by proposed adaptation algorithm. The circuit designed in 90nm CMOS technology and the algorithm are verified with post-layout simulation. The DFE core occupies $110{\times}95{\mu}m^2$ and consumes 11mW in 1.2V supply voltage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.688-696
• /
• 2013

In wireless sensor networks, real-time applications have to ensure the timely delivery of real-time data. Recently, OMLRP (On-demand Multi-hop Look-ahead Routing Protocol) has been proposed to improve the timeliness of wireless sensor networks. The protocol needs initialization time to establish multi-hop information based routing path because it performs incremental look-ahead of the information. Consequently, the protocol deteriorates DDSR (Deadline Delivery Success Ratio) as an event moves because it takes little consideration of event mobility. In this paper, we proposed a Real-time Routing for Events Mobility (RREM) which exploits a data redirection in order to improve the DDSR of moving events. Instead of recollecting muti-hop look-ahead information, the RREM redirects the data to a sensor node holding the information collected in a previous round. We verify the timeliness and energy efficiency of RREM using various MatLab simulations.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.11-16
• /
• 2004

Recently, collaborative works are increased more and more over the distributed heterogeneous computing environments. The availability of high-speed wide-area networks has also enabled collaborative multimedia applications such as video conferencing, distributed interactive simulation and collaborative visualization. Distributed high performance computing and collaborative multimedia applications, it is extremely important to efficiently perform group communication over a heterogeneous network. Typical group communication patterns are broadcast and Multicast. Heuristic algorithms such as FEF, ECEF, look-ahead make up the message transmission tree for the broadcast and multicast over the distributed heterogeneous systems. But, there are some shortcomings because these select the optimal solution at each step, it may not be reached to the global optimum In this paper, we propose a new heuristic algerian that constructs tree for efficiently collective communication over the previous heterogeneous communication model which has heterogenity in both node and network. The previous heuristic algorithms my result in a locally optimal solution, so we present more reasonable and available criterion for choosing edge. Through the performance evaluation over the various communication cost, improved heuristic algorithm we proposed have less completion time than previous algorithms have, especially less time complexity than look-ahead approach.

• IE interfaces
• /
• v.18 no.1
• /
• pp.63-72
• /
• 2005

In this paper, we present a distribution planning method for a supply chain. Like a typical distribution network of manufacturing firms, we have the form of arborescence. To consider more realistic situation, we investigated that an outside supplier has limited capacity. The customer demands are given in deterministic form in finite number of discrete time periods. In this environment, we attempt to minimize the total costs, which is the sum of inventory holding and backorder costs over the distribution network during the planning horizon. To make the best of the restricted capacity, we propose the look-ahead feature. For looking ahead, we convert this problem into a single machine scheduling problem and utilize tabu search approach to solve it. Numerous simulation tests have shown that the proposed algorithm performs quite well.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.4
• /
• pp.906-912
• /
• 2014

The study of fish robot is a main subject that are related with the propulsive force comparison using a varying amplitude and frequency for body and tail motion trajectory, and the quick turn using a proper trajectory function. In this study, when a fish robot thrusts forward, feedback control is difficult to apply for a fish robot, because body and tail joints as a sine wave are rolled. Therefore, we detect the virtual position based on the path of the fish robot, define the angle errors using the detected position and the look-ahead point on the given path, and design a controller to track given path. We have found that the proposed method is useful through the computer simulations.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.1
• /
• pp.1-13
• /
• 2003

In this paper, LAC(Look-ahead AGV Controller) has been developed for efficient routing of parts in semiconductor and LCD production systems. Several procedures have been developed as sub-modules. LACP(Look-ahead AGV Control Procedure) which controls AGVs using the information on the current and future status of the systems is the main element of the LAC. To support LACP, DSP(Destination Selection Procedure) which determines a destination of a part and AGV call time, SSP(Source Selection Procedure)which selects a part coming next to a buffer when the buffer becomes available. and RTM(Response Time Model) which estimates empty travel time of AGVs and waiting time for an available AGV have been developed. A simulation experiment shows that LAC reduces part's flow time, AGV utilization, average and maximum inventory level of a central buffer, empty travel time of an AGV, and waiting time for an available AGV.

• Journal of Information Technology Applications and Management
• /
• v.10 no.2
• /
• pp.61-71
• /
• 2003

Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12B
• /
• pp.1037-1043
• /
• 2006

There has been proposed an algorithm to reduce data burst processing delay in group scheduling in core nodes of optical burst switching networks. Since, in this algorithm, look-up tables containing all the void time information in scheduling windows are generated as soon as the primary group scheduling session terminates, it becomes faster to reassign dropped data bursts to proper voids in different data channels by referring to the tables. The group scheduling with this algorithm showed almost the same channel utilization as the one without using the algorithm but performed a little better in both burst loss probability and wavelength conversion rate. On the other hand, per-burst processing time has been reduced dramatically in the load region of higher than 0.8, showing a factor of 2.1 reduction at 0.9.