• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.740-745
• /
• 2005

Selective assembly is a method to find out appropriate matching pairs to be assembled to enhance the quality of the product. This study proposes an algorithm to select and match the components with two performance characteristics: at first, the number of matchable mates are calculated for each components. A matchable mate is defined to be the one of which the values of each performance characteristics lie in a rectangular mesh originated from the component under consideration. And the highest priority is given to the item with smallest number of matchable mates. The item of highest priority is matched to the one with smallest number of matchable mates among them. To find out the mates for the unmatched items, the mesh size is enlarged at the next iteration. Beginning with a small mesh, the procedure is repeated until the mesh covers the tolerance intervals of each performance characteristics. A VCR head case is analyzed.

• Journal of Labour Economics
• /
• v.43 no.4
• /
• pp.87-116
• /
• 2020

This study empirically investigates the possible negative relationship between the number of job offers and the job satisfaction in the Korean labor market, using the Korea Labor Income Panel Study, where the number of job offers of young workers are collected in the third wave. Results show that the number of job offers is negatively related to every year job satisfaction, this effect is smaller for higher earning and older individuals, and there is a gender heterogeneity. We discuss that having more job offers does not necessarily increase the workers' utility, which is a general monotonic assumption in the traditional economics. We suggest that having a large number of job offers allowing them to choose the best option can be inefficient itself, and therefore it is better to focus on qualitative matching rather than increasing just the absolute number of job opportunities.

• International Journal of Computer Science & Network Security
• /
• v.24 no.5
• /
• pp.79-88
• /
• 2024

The information retrieval domain deals with the retrieval of unstructured data such as text documents. Searching documents is a main component of the modern information retrieval system. Locality Sensitive Hashing (LSH) is one of the most popular methods used in searching for documents in a high-dimensional space. The main benefit of LSH is its theoretical guarantee of query accuracy in a multi-dimensional space. More enhancement can be achieved to LSH by adding a bit to its steps. In this paper, a new Dynamic Locality Sensitive Hashing (DLSH) algorithm is proposed as an improved version of the LSH algorithm, which relies on employing the hierarchal selection of LSH parameters (number of bands, number of shingles, and number of permutation lists) based on the similarity achieved by the algorithm to optimize searching accuracy and increasing its score. Using several tampered file structures, the technique was applied, and the performance is evaluated. In some circumstances, the accuracy of matching with DLSH exceeds 95% with the optimal parameter value selected for the number of bands, the number of shingles, and the number of permutations lists of the DLSH algorithm. The result makes DLSH algorithm suitable to be applied in many critical applications that depend on accurate searching such as forensics technology.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.87-95
• /
• 1996

A new design scheme for the fuzzy pattern matching classifier (FPMC) is proposed. in conventional design of FPMC, there are no exact information about the membership function of which shape and number critically affect the performance of classifier. So far, a trial and error or heuristic method is used to find membership functions for the input patterns. But each of them have limits in its application to the various types of pattern recognition problem. In this paper, a new method to find the appropriate shape and number of membership functions for the input patterns which minimize classification error is proposed using genetic algorithms(GAs). Genetic algorithms belong to a class of stochastic algorithms based on biological models of evolution. They have been applied to many function optimization problems and shown to find optimal or near optimal solutions. In this paper, GAs are used to find the appropriate shape and number of membership functions based on fitness function which is inversely proportional to classification error. The strings in GAs determine the membership functions and recognition results using these membership functions affect reproduction of next generation in GAs. The proposed design scheme is applied to the several patterns such as tire tread patterns and handwritten alphabetic characters. Experimental results show the usefulness of the proposed scheme.

• Journal of the Korean Society of Radiology
• /
• v.15 no.5
• /
• pp.749-754
• /
• 2021

In order to maximize the matching ratio between the scintillation pixel and the photosensor of the PET detector using a small number of photosensor, various arrays of scintillation pixels and four photosensors were used. The array of scintillation pixels consisted of six cases from 6 × 6 to 11 × 11. The distance between the photosensors was applied equally to all scintillation pixels, and the arrangement was expanded by reducing the size of scintillation pixel. DETECT2000 capable of light simulation was used to acquire flood images of the designed PET detectors. At the center of each scintillation pixel array, light generated through the interaction between extinction radiation and scintillation pixels was generated, and the light was detected through for four photosensors, and then a flood image was reconstructed. Through the reconstructed flood image, we found the largest arrangement in which all the scintillation pixels can be distinguished. As a result, it was possible to distinguish all the scintillation pixels in the flood image of 8 × 8 scintillation pixel array, and from the 9 × 9 scintillation pixel flood image, the two edge scintillation pixels overlapped and appeared in the image. At this time, the matching ratio between the scintillation pixel and the photosensor was 16:1. When a PET system is constructed using this detector, the number of photosensors used is reduced and the cost of the oveall system is expected to be reduced through the simplification of the signal processing circuit.

• Journal of Broadcast Engineering
• /
• v.26 no.1
• /
• pp.26-38
• /
• 2021

In this paper, DLKF (Deep Learning Keypoint Filtering), the deep learning-based keypoint filtering method for the rapidization of the image registration method for remote sensing images is proposed. The complexity of the conventional feature-based image registration method arises during the feature matching step. To reduce this complexity, this paper proposes to filter only the keypoints detected in the artificial structure among the keypoints detected in the keypoint detector by ensuring that the feature matching is matched with the keypoints detected in the artificial structure of the image. For reducing the number of keypoints points as preserving essential keypoints, we preserve keypoints adjacent to the boundaries of the artificial structure, and use reduced images, and crop image patches overlapping to eliminate noise from the patch boundary as a result of the image segmentation method. the proposed method improves the speed and accuracy of registration. To verify the performance of DLKF, the speed and accuracy of the conventional keypoints extraction method were compared using the remote sensing image of KOMPSAT-3 satellite. Based on the SIFT-based registration method, which is commonly used in households, the SURF-based registration method, which improved the speed of the SIFT method, improved the speed by 2.6 times while reducing the number of keypoints by about 18%, but the accuracy decreased from 3.42 to 5.43. Became. However, when the proposed method, DLKF, was used, the number of keypoints was reduced by about 82%, improving the speed by about 20.5 times, while reducing the accuracy to 4.51.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.119-126
• /
• 1996

In this paper we study the asymptotic behavior of the edge independence number of a random (n,n)-tree. The tools we use include the matrix-tree theorem, the probabilistic method and Hall's theorem. We begin with some definitions. An (n,n)_tree T is a connected, acyclic, bipartite graph with n light and n dark vertices (see [Pa92]). A subset M of edges of a graph is called independent(or matching) if no two edges of M are adfacent. A subset S of vertices of a graph is called independent if no two vertices of S are adjacent. The edge independence number of a graph T is the number $\beta_1(T)$ of edges in any largest independent subset of edges of T. Let $\Gamma(n,n)$ denote the set of all (n,n)-tree with n light vertices labeled 1, $\ldots$, n and n dark vertices labeled 1, $\ldots$, n. We give $\Gamma(n,n)$ the uniform probability distribution. Our aim in this paper is to find bounds on $\beta_1$(T) for a random (n,n)-tree T is $\Gamma(n,n)$.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.311-325
• /
• 2013

The effects of the moments of the interarrival time and service time on the system performance measures such as blocking probability, mean and standard deviation of the number of customers in service facility and orbit are numerically investigated. The results reveal the performance measures are more sensitive with respect to the interarrival time than the service time. Approximation for $GI/G/c$ retrial queues using $PH/PH/c$ retrial queue is presented.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.62-65
• /
• 2000

In order to reconstruct a high resolution image, it is important to reconstruct frames from fields. A number of approaches have been developed in making frames. In this paper, we propose a new deinterlacing algorithm based on local motion compensation, which is performed based on statistical property. The proposed algorithm achieves faster processing speed than block matching algorithm and higher resolution than inter-field interpolation. The effectiveness of the proposed algorithm is demonstrated experimentally.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.209-215
• /
• 2000

In this paper we present polyline upward order preserving grid drawing algorithm for binary trees with n vertices that achieves 0(n) height, 0(log n) width and 0(nlog n) area, matching the previously known results, and that reduces the number of bends to 0(n/log n) from 0(n)