• Journal of the Microelectronics and Packaging Society
• /
• v.20 no.2
• /
• pp.17-22
• /
• 2013

We investigated the optimum bonding conditions for thermo-compression bonding of electrodes between flexible printed circuit board(FPCB) and rigid printed circuit board(RPCB) with Sn-58Bi solder as interlayer. In order to figure out the optimum bonding conditions, peel test of FPCB/RPCB joint was conducted. The peel strength was affected by the bonding conditions, such as temperature and time. The fracture energies were calculated through F-x (Force-displacement) curve during peel test and the relationships between bonding conditions and fracture behaviors were investigated. The optimum condition for the thermo-compression bonding with Sn-58Bi solder was found to be temperature of $195^{\circ}C$ and time of 7 s.

• Journal of Korean Society of Transportation
• /
• v.23 no.1
• /
• pp.21-32
• /
• 2005

At present automated speed enforcement system in Korea control overspeed vehicle only in the specific spot. Because the drivers generally recognize the previous stated fact, they reduce a speed only in the establishment location of systems and increase rapidly again as soon as it passes the location. we have known that the rate of traffic risk at the tunnel, bridge and curve road segment is higher than other road section. Therefore, it needs speed control in them. In such a case, it is necessary to establish the automated traffic enforcement system based on the travel time speed of an individual vehicle over a pre defined stretch of road. In this study, the application limit of existing spot overspeed enforcement system was studied through an analysis of traffic flow characteristics in the tunnel, bridge and curve section. Also we found out the optimal distance of segment and the most suitable location to an application of the overspeed vehicle by travel time speed through an analysis of the road structure, traffic condition and accident numbers in the road.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1562-1578
• /
• 2020

Vector data compression algorithm can meet requirements of different levels and scales by reducing the data amount of vector graphics, so as to reduce the transmission, processing time and storage overhead of data. In view of the fact that large threshold leading to comparatively large error in Douglas-Peucker vector data compression algorithm, which has difficulty in maintaining the uncertainty of shape features and threshold selection, a segmented Douglas-Peucker algorithm based on node importance is proposed. Firstly, the algorithm uses the vertical chord ratio as the main feature to detect and extract the critical points with large contribution to the shape of the curve, so as to ensure its basic shape. Then, combined with the radial distance constraint, it selects the maximum point as the critical point, and introduces the threshold related to the scale to merge and adjust the critical points, so as to realize local feature extraction between two critical points to meet the requirements in accuracy. Finally, through a large number of different vector data sets, the improved algorithm is analyzed and evaluated from qualitative and quantitative aspects. Experimental results indicate that the improved vector data compression algorithm is better than Douglas-Peucker algorithm in shape retention, compression error, results simplification and time efficiency.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.358-365
• /
• 2010

We develop a low complexity cooperative diversity protocol for low energy adaptive clustering hierarchy (LEACH) based wireless sensor networks. A cross layer approach is used to obtain spatial diversity in the physical layer. In this paper, a simple modification in clustering algorithm of the LEACH protocol is proposed to exploit virtual multiple-input multiple-output (MIMO) based user cooperation. In lieu of selecting a single cluster-head at network layer, we proposed M cluster-heads in each cluster to obtain a diversity order of M in long distance communication. Due to the broadcast nature of wireless transmission, cluster-heads are able to receive data from sensor nodes at the same time. This fact ensures the synchronization required to implement a virtual MIMO based space time block code (STBC) in cluster-head to sink node transmission. An analytical method to evaluate the energy consumption based on BER curve is presented. Analysis and simulation results show that proposed cooperative LEACH protocol can save a huge amount of energy over LEACH protocol with same data rate, bit error rate, delay and bandwidth requirements. Moreover, this proposal can achieve higher order diversity with improved spectral efficiency compared to other virtual MIMO based protocols.

• The Bulletin of The Korean Astronomical Society
• /
• v.35 no.1
• /
• pp.87.2-87.2
• /
• 2010

Near-Earth asteroid-comet transition object 4015 Wilson-Harrington is a possible target of the joint European Space Agency (ESA) and Japanese Aerospace Exploration Agency (JAXA) Marco Polo sample return mission. 4015 W-H was discovered showing cometary activity by Albert G. Wilson and Robert G. Harrington at Palomar Observatory in 1949. After recovered in 1979, 4015 W-H has been observed at every apparition, it always was seen as a point source. We made time series observations for 4015 W-H using the 1.8m telescope with 2K CCD at Bohyunsan Observatory, on the nights of 2009 November 17-19. The geocentric distance of 4015 H-W was about 0.38 AU at that time. No trace of cometary activity is seen from our images. From the light curve analysis, we find a double-peaked rotational period of 2.2 hours with amplitude of 0.4 magnitude. Our result is much shorter than previous measurements of 3.6 hours (Harris & Young 1983) and 6.1 hours (Osip et al 1995). We will discuss possible origin of the period variations.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.1
• /
• pp.52-57
• /
• 2014

This paper presents an implementation of a smooth path planning method considering physical limits on a real time operating system for a two-wheel mobile robot. A Bezier curve is utilized to make a smooth path considering a robot's position and direction angle through the defined path. A convolution operator is used to generate the center velocity trajectory to travel the distance of the planned path while satisfying the physical limits. The joint space velocity is computed to drive the two-wheel mobile robot from the center velocity. Trajectory planning, velocity command according to the planned trajectory, and monitoring of encoder data are implemented with a multi-tasking system. And the synchronization of tasks is performed with a real-time mechanism of Event Flag. A real time system with multi-tasks is implemented and the result is compared with a non-real-time system in terms of path tracking to the designed path. The result shows the usefulness of a real-time multi-tasking system to the control system which requires real-time features.

• Journal of the Korean Society for information Management
• /
• v.36 no.4
• /
• pp.83-105
• /
• 2019

This study aims to suggest an effective method for the automatic classification of keywords with similar patterns by calculating pattern similarity of temporal data. For this, large scale news on the Web were collected and time series data composed of 120 time segments were built. To make training data set for the performance test of the proposed model, 440 representative keywords were manually classified according to 8 types of trend. This study introduces a Dynamic Time Warping(DTW) method which have been commonly used in the field of time series analytics, and proposes an application model, MA-DTW based on a Moving Average(MA) method which gives a good explanation on a tendency of trend curve. As a result of the automatic classification by a k-Nearest Neighbor(kNN) algorithm, Euclidean Distance(ED) and DTW showed 48.2% and 66.6% of maximum micro-averaged F1 score respectively, whereas the proposed model represented 74.3% of the best micro-averaged F1 score. In all respect of the comprehensive experiments, the suggested model outperformed the methods of ED and DTW.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.172-175
• /
• 2016

Time of Flight(ToF) LiDAR(Light Detection And Ranging) technology has been used for distance measurement and object detection by measuring ToF time information. This technology has been evolved into higher precision measurement field such like autonomous driving car and terrain analysis since the retrieval of exact ToF time information is of prime importance. In this paper, as a accuracy indicator of the ToF time information, timing jitter was measured and analyzed through Single-Shot LiDAR system(SSLs) mainly consisting of 1.5um wavelength MOPA LASER, InGaAs Avalanche Photodiode(APD) at 31M free space environment. Additionally, we applied spline interpolation and multiple-shot averaging method on measured data through SSLs to improve ToF timing information.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.4
• /
• pp.110-126
• /
• 2024

Several studies have focused on developing the safest and most efficient path from the current location to the available parking area for vehicles entering a parking lot. In the present study, the parking lot structure and parking environment such as the lane width, width, and length of the parking space, were vaired by referring to the actual parking lot with vertical and horizontal parking. An automatic parking path planning model was proposed by collecting path data by various setting angles and environments such as a starting point and an arrival point, by putting the collected data into a deep learning model. The existing algorithm(Hybrid A-star, Reeds-Shepp Curve) and the deep learning model generate similar paths without colliding with obstacles. The distance and the consumption time were reduced by 0.59% and 0.61%, respectively, resulting in more efficient paths. The switching point could be decreased from 1.3 to 1.2 to reduce driver fatigue by maximizing straight and backward movement. Finally, the path generation time is reduced by 42.76%, enabling efficient and rapid path generation, which can be used to create a path plan for autonomous parking during autonomous driving in the future, and it is expected to be used to create a path for parking robots that move according to vehicle construction.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.56-70
• /
• 2005

The results of location-dependent queries(LDQ) generally depend on the current locations of query issuers. Many mechanisms, e.g. broadcast scheme, hoarding, or racking policy, have been developed to improve the system peformance and provide better services, which are specialized for LDQs. Considering geographical adjacency of data and characteristics oi target area, caching policy and broadcast scheme affect the overall performance in LDQ. For this reason, we propose both the caching policy and broadcast scheme, which these features are reflected in. Based on the adjacency of data in LDQ, our broadcast scheme use Hilbert curve to cluster data. Moreover, in order to develop the caching policy suitable for LDQ on urban area, we apply the moving distance of a MH(Mobile Host) to our caching policy We evaluate the performance of the caching policy measuring the workload of MHs and the correctness of LDQ results and the performance of the broadcast scheme measuring the average setup-time of MHs in our experiments. Finally, we expect that our caching policy Provides more correct answers when executing LDQ in focal cache and leads significant improvement of the performance of MHs. It also seems quite probable that our broadcast scheme leads improvement of battery life of the MH.