• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.33 no.5
• /
• pp.1989-1998
• /
• 2013

As the importance of 'bike revitalization' has been emphasized in our society, many cities around the world put enormous efforts to create a bike-oriented transportation system. None the less, the results were not much productive and effective. In this study, to decide the location and number of the bike-parking facilities, the heuristic P-median algorithm has been applied with and without budget constraints. A test network with 30 candidate locations (centroids) were employed. The results show that the optimum number of bike parking lots with and without the budget limits are 9 and 20, respectively. Since the optimum locations determined in this study were congruous with the actual bike parking lots with high utilization rates, it is expected that the proposed methods can be applied for determining the optimum locations of the bike parking facilities elsewhere. Some limitations and future research agenda have also been discussed.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.1
• /
• pp.57-70
• /
• 2004

Given a tree network on which each node has its own demand and also stands for a candidate location of a potential facility. such as plant or warehouse, the f-median problem on the network (PMPOT) is to select less than or equal to P number of facility locations so that the whole demand on a node is satisfied from only one facility and the total demand occurred on the network can be satisfied from those facilities with the minimum total cost, where the total cost Is the sum of transportation costs and the fixed costs of establishing facilities. Tamir(1996) developed an O(p n$^2$) algorithm for PMPOT which is known to be the best algorithm In terms of the time complexity, where n is the number of nodes in the network, but he didn't make any comments or explanation about implementation details for finding the optimal solution. In contrast to Tamir's work, Kariv and Hakimi(1979) developed O(p$^2$n$^2$) algorithm for PMPOT and presented O(n$^2$) algorithm for finding the optimal solution in detail. In this paper, we not only develop another O(p n$^2$) dynamic programming algorithm for PMPOT that is competitive to Tamir's algorithm in terms of the time complexity, but also present O(n) algorithm that is more efficient than kariv and Hakimi's algorithm in finding the optimal solution. finally, we implement our algorithm on a set of randomly generated problems and report the computational results.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.1E
• /
• pp.14-21
• /
• 1995

This paper presents a parallel sorting algorithm suitable for the SIMD multiprocessor. The algorithm finds pivots for partitioning the data into ordered subsets. The data can be evenly distributed to be sorted since it uses the probability theory. For n data elements to be sorted on p processors, when $n{\geq}p^2$, the algorithm is shown to be asymptotically optimal. In practice, sorting 8 million data items on 64 processors achieved a 48.43-fold speedup, while the PSRS required a 44.4-fold speedup. On a variety of shared and distributed memory machines, the algorithm achieved better than half-linear speedups.

• Journal of Korean Society of Transportation
• /
• v.19 no.5
• /
• pp.99-108
• /
• 2001

A framework of using and integrating GIS and OR tools for determining the best site selection has been provided. In this research, we demonstrated that both the P-Median heuristic method and MIP method can be successfully applied to the optimum site selection problem of oil tank location selection. Furthermore, the results identified by both approaches are identical. To accomplish this, both GIS road and maritime networks have been constructed and combined to calculated the minimum distance matrix, which is required by both approaches. After the application to the Korean peninsula, the facility locations chosen are Kunsan, Yosu, Busan, and Okgye for each district. As has been shown, the power of GIS and both algorithm have been demonstrated throughout the research and further similar research can also be conducted using the power of GIS and Operations Research tools.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.236-243
• /
• 1994

In this paper we consider the part-machine cell formation decision of the generalized Group Technology(GT) problem in which multiple process routes can be generated for each part. The existing p-median model and similarity coefficient algorithm can solve only small-sized or well-structured cases. We suggest an assignment method for the cell formation problem. This method uses an assignment model which is a simple linear programming. Numerical examples show that our assignment method provides good separable cells formation even for large-sized and ill-structured problems.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.77-85
• /
• 2015

This paper proposes a location algorithm that locates newly built p-facilities in the optimal area with minimum cost in a city of n districts. This problem has been classified as NP-hard, to which no polynomial time algorithm exists. The proposed algorithm improves the shortcomings of existing Myopic algorithm by constructing until p-facilities and exchanging locations of p-th facility for p=[1, n-1]. When applied to experimental data of n=5, 7, 10, 55, the proposed algorithm has obtained an approximate value nearest possible to the optimal solution take precedence of reverse-delete method. This algorithm is also simply executable using Excel.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2000.04a
• /
• pp.115-120
• /
• 2000

This study is on the application the image processing algorithm for inspection of the aluminium mill strip surface defect. The image of surface defect data was obtained using the CCD camera with the digital signal board. The edge was found from the difference of pixel intensity between the normal image and defect image. Two step were taken to find the edge in the image processing algorithm. First, noise was removed by using the median filter in the image. Second, the edge was sharpened in detail by using the sharpening convolution filter in the image. Canny algorithm was used to defect the exact edge. The defect section was separated from the original image is to find the coordination point p1 and p2 which include the defect image

• Journal of Biomedical Engineering Research
• /
• v.17 no.2
• /
• pp.235-240
• /
• 1996

The automated ECG diagnostic systems that are odd in hospitals have low performance of P-wave detection when faced with some diseases such as conduction block. So, the purpose of this study was the improvement of detection performance in conduction block which is low in P-wave detection. The first procedure was removal of baseline drift by subtracting the median filtered signal of 0.4 second length from the original signal. Then the algorithm detected R peak and T end point and cancelled the QRS-T complex to get'p prototypes'. Next step was magnification of P prototypes with dispersion and detection of'p candidates'in the magnified signal, and then extraction of contextual information concerned with P-waves. For the last procedure, the CIR was applied to P candidates to confirm P-waves. The rule base consisted of three rules that discriminate and confirm P-waves. This algorithm was evaluated using 500 patient's raw data P-wave detection perFormance was in- creased 6.8% compared with the QRS-T complex cancellation method without application of the rule base.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.107-117
• /
• 2014

This paper proposed the method of removing baseline drift by eliminating local maxima such as P, R, T-wave signal region and local minima Q, S-wave signal region. We applied morphology-pair operations improved from morphology operation to the ECG signal. To eliminate overshoot in the result of morphology-pair operation, we apply median value operation to the result of morphology-pair operation. We use MIT/BIH database to estimate the proposed algorithm. Experiment result show that proposed algorithm removing baseline drift effectively without orignal ECG signal distortion.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.394-400
• /
• 2016

Currently, with the rapid development of the digital age, multimedia-related image devices become popular. However image deterioration is generated by multiple causes during the transmission process, with typical example of salt and pepper noise. When the noise of high density is added, existing methods are deteriorated in the characteristics of removal noise. After judging the noise condition to remove the salt and pepper noise, if the center pixel is the non-noise pixel, it is replaced with the original pixel. On the other hand, if it is the noise pixel, algorithm is suggested by the study, where the histogram of the corrupted image and the median filters are used. And for objective judgment, the proposed algorithm was compared with existing methods and PSNR(peak signal to noise ratio) was used as judgment standard. As the result of the simulation, The proposed algorithm shows a high PSNR of 32.57[dB] for Lena images that had been damaged of a high density salt and pepper noise(P=60%), Compared to the existing CWMF, A-TMF and AWMF there were improvements by 21.67[dB], 18.07[dB], and 20.13[dB], respectively.