• The Journal of the Convergence on Culture Technology
• /
• v.7 no.4
• /
• pp.189-193
• /
• 2021

This study purports to depict the generational topography of welfare attitudes of Korean people. Three generational groups are made for analytical purpose, 'between 20-39 age group', 'between 40-59 age group', and '60 and older'. Two major statistical techniques are used, the analysis of variance and correspondence analysis. The analysis of variance shows that the respondents' attitudes upon 'social services target(universal vs selective)', 'education', 'housing', 'child-care', 'youth support', and 'employment' varies significantly by age groups. Correspondence analysis also shows that 'between 20-39 age group' is located with proximity with 'child-care', 'employment', and 'housing', while '60 and older' is located with 'poverty' and 'old age life care'. Clearly this study shows that there is generational difference on welfare consciousness in many areas of social policy. Overall, the results show that significant generational differences with regard to welfare attitudes clearly exist in current Korean society.

• Journal of Internet Computing and Services
• /
• v.14 no.4
• /
• pp.63-72
• /
• 2013

Business Process Intelligence (BPI) is one of the emerging technologies in the knowledge discovery and analysis area. BPI deals with a series of techniques from discovering knowledge to analyzing the discovered knowledge in BPM-supported organizations. By means of the BPI technology, we are able to provide the full functionality of control, monitoring, prediction, and optimization of process-supported organizational knowledge. Particularly, we focus on the focal organizational knowledge, which is so-called the BPM activity-performer affiliation networking knowledge that represents the affiliated relationships between performers and activities in enacting a specific business process model. That is, in this paper we devise a statistical analysis method to be applied to the BPM activity-performer affiliation networking knowledge, and dubbed it the activity-performer correspondence analysis method. The devised method consists of a series of pipelined phases from the generation of a bipartite matrix to the visualization of the analysis result, and through the method we are eventually able to analyze the degree of correspondences between a group of performers and a group of activities involved in a business process model or a package of business process models. Conclusively, we strongly expect the effectiveness and efficiency of the human resources allotments, and the improvement of the correlational degree between business activities and performers, in planning and designing business process models and packages for the BPM-supported organization, through the activity-performer correspondence analysis method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.6
• /
• pp.25-37
• /
• 2000

The trajectories of feature points can be defined by the correspondences between points in consecutive frames. The correspondence problem is known to be difficult to solve because false positives and false negatives almost always exist in real image sequences. In this paper, we propose a robust feature tracking algorithm considering incomplete trajectories such as entering and/or vanishing trajectories. The trajectories of feature points are determined by calculating the matching measure, which is defined as the minimum weighted Euclidean distance between two feature points. The weights are automatically updated in order to properly reflect the motion characteristics. We solve the correspondence problem as an optimal graph search problem, considering that the existence of false feature points may have serious effect on the correspondence search. The proposed algorithm finds a local optimal correspondence so that the effect of false feature point can be minimized in the decision process. The time complexity of the proposed graph search algorithm is given by O(mn) in the best case and O($m^2n$) in the worst case, where m and n arc the number of feature points in two consecutive frames. By considering false feature points and by properly reflecting motion characteristics, the proposed algorithm can find trajectories correctly and robustly, which has been shown by experimental results.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.1
• /
• pp.9-18
• /
• 2018

Recently, the use of image stitching technology has been increasing as the number of contents based on virtual reality increases. Image Stitching is a method for matching multiple images to produce a high resolution image and a wide field of view image. The image stitching is used in various fields beyond the limitation of images generated from one camera. Image Stitching detects feature points and corresponding points to match multiple images, and calculates the homography among images using the RANSAC algorithm. Generally, corresponding points are needed for calculating conversion relation. However, the corresponding points include various types of noise that can be caused by false assumptions or errors about the conversion relationship. This noise is an obstacle to accurately predict the conversion relation. Therefore, RANSAC algorithm is used to construct an accurate conversion relationship from the outliers that interfere with the prediction of the model parameters because matching methods can usually occur incorrect correspondence points. In this paper, we propose an algorithm that extracts more accurate inliers and computes accurate transformation relations by using correspondence point relation information used in RANSAC algorithm. The correspondence point relation information uses distance ratio between corresponding points used in image matching. This paper aims to reduce the processing time while maintaining the same performance as RANSAC.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.4
• /
• pp.235-241
• /
• 2017

This study investigated the performance factors for entry into the labor market of 4 - year college graduates using KEEP data and to determine how the labor market performance is related to the training institutions. The labor market performance is termed as 1) labor market entry time, 2) employment type, and 3) wage. Correspondence analysis was carried out with a nominal variable indicating the characteristics of a training institute, in which the respondents were trained for employment, and the relationship between the two was expressed in a more visible way. First, as a result of analyzing the first job transition period, the shortest training institutes were analyzed as public institutes, followed by private institutes and universities. Second, the employment rate of the public institutions is higher than that of private institutes and universities. Second, the employment rate of public institutions is higher than that of private institutes and universities. Third, the wage level of public institutes ranged from wage level 1 to 3, while private institutes had a wage level ranging from 2 to 4. Universities showed a wide range from 1 to 5. Based on these results, this study can analyze the difference in the labor market performance by training institutions when young people enter society.

• Journal of Korea Society of Industrial Information Systems
• /
• v.28 no.6
• /
• pp.151-171
• /
• 2023

For the efficient establishment of a channel strategy for banks, this study aims to propose a channel model by classifying channels into types, and carrying out a correspondence analysis per type. A survey of bankers was conducted to visualize categorical data and create a positioning map. As a result, first, 12 banking channels were classified into 4 types based on business processing subjects and places, which were then, further grouped into the categories of full-banking and self-banking. Second, a correspondence analysis according to the classified types was carried out, and it was found that the branch-type is suitable for product description and customer management, while the banking-type is suitable for efficient business processing without time and space constraints. Furthermore, the analysis also showed that the machine-type and banking-type are inappropriate for customer management, and the mobility-type demonstrates low operational effectiveness due to a lack of awareness. The aforementioned findings suggest the need for a hybrid convergence channel that reflects the characteristics of banking tasks and fills in the gaps between the different channels. Third, a channel model was derived by adding a common area to the 2×2 model consisting of the business processing subjects and places. Therefore, this study is meaningful in that it examines the diversification of channels and factors in the division of roles by channel type based on customers' banking channel selection factors, and presents basic research findings for future channel strategy establishment and efficient channel operation.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.797-801
• /
• 2001

The purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewords in a binary code of word length n with minimum distance 4 between codewords. We have improved upper bound for A[12k+11,4]. In this correspondence we prove $A[23,4]\leq173716$.

• Journal of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.733-748
• /
• 2017

We give Hodge structures on quasitoric orbifolds. We define orbifold Hodge numbers and show a correspondence of orbifold Hodge numbers for crepant resolutions of quasitoric orbifolds. In short we extend Hodge structures to a non almost complex setting.

• Journal of the Korean Mathematical Society
• /
• v.53 no.2
• /
• pp.263-286
• /
• 2016

We discuss relations between Galois coverings of compact Riemann surfaces and their Jacobi varieties. We prove a theorem of a kind of Galois correspondence for Abelian subvarieties of Jacobi varieties. We also prove a theorem on the sets of points in Jacobi varieties fixed by Galois group actions.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2005.09a
• /
• pp.378-378
• /
• 2005