• Journal of the Korean Society for information Management
• /
• v.40 no.4
• /
• pp.403-428
• /
• 2023

This study investigates the development path and intellectual structure of data literacy research, aiming to identify emerging topics in the field. A comprehensive search for data literacy-related articles on the Web of Science reveals that the field is primarily concentrated in Education & Educational Research and Information Science & Library Science, accounting for nearly 60% of the total. Citation network analysis, employing the PageRank algorithm, identifies key papers with high citation impact across various topics. To accurately trace the development path of data literacy research, an enhanced PageRank main path algorithm is developed, which overcomes the limitations of existing methods confined to the Education & Educational Research field. Keyword bibliographic coupling analysis is employed to unravel the intellectual structure of data literacy research. Utilizing the PNNC algorithm, the detailed structure and clusters of the derived keyword bibliographic coupling network are revealed, including two large clusters, one with two smaller clusters and the other with five smaller clusters. The growth index and mean publishing year of each keyword and cluster are measured to pinpoint emerging topics. The analysis highlights the emergence of critical data literacy for social justice in higher education amidst the ongoing pandemic and the rise of AI chatbots. The enhanced PageRank main path algorithm, developed in this study, demonstrates its effectiveness in identifying parallel research streams developing across different fields.

• 전자공학회논문지 IE
• /
• v.43 no.4
• /
• pp.43-51
• /
• 2006

Segmentation method using RSST has many advantages in extracting of accurate region boundaries and controlling the resolution of segmented result and so on. In this paper, we propose three fast RSST algorithms for image segmentation. In first method, we classify links according to weight size for fast link search. In the second method, very similar links before RSST construction are eliminated. In third method, the links of very small regions which are not important for human eye are eliminated. As a result, the total times elapsed for segmentation are reduced by about 10 $\sim$ 40 times, and reconstructed images based on the segmentation results show little degradation of PSNR and visual quality.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.2 s.308
• /
• pp.11-19
• /
• 2006

In this paper, we propose a method to estimate camera extrinsic parameter based on projective and permutation invariance point features. Because feature informations in previous research is variant to c.:men viewpoint, extraction of correspondent point is difficult. Therefore, in this paper, we propose the extracting method of invariant point features, and new matching method using similarity evaluation function and Graham search method for reducing time complexity and finding correspondent points accurately. In the calculation of camera extrinsic parameter stage, we also propose two-stage motion parameter estimation method for enhancing convergent degree of LM algorithm. In the experiment, we compare and analyse the proposed method with existing method by using various indoor images to demonstrate the superiority of the proposed algorithms.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.187-190
• /
• 2003

Many manufacturing companies consider the integrated and concurrent scheduling because they need the global optimization technology that could manufacture various products more responsive to customer needs. In this paper, we propose an advanced scheduling model to generate the schedules considering resource constraints and precedence constraints in make-to-order (MTO) manufacturing environments. Precedence of work- in-process(WIP) and resources constraints have recently emerged as one of the main constraints in advanced scheduling problems. The advanced scheduling problems is formulated as a multiobjective mathematical model for generating operation schedules which are obeyed resources constraints, alternative workstations of operations and the precedence constraints of WIP in MTO manufacturing. For effectively solving the advanced scheduling problem, the multi-objective hybrid genetic algorithm (m-hGA) is proposed in this paper. The m-hGA is to minimize the makespan, total flow time of order, and maximum tardiness for each order, simultaneously. The m-hGA approach with local search-based mutation through swap mutation is developed to solve the advanced scheduling problem. Numerical example is tested and presented for advanced scheduling problems with various orders to describe the performance of the proposed m-hGA.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2116-2124
• /
• 2000

In this paper we propose combustion control of refuse incineration plant using fuzzy model and genetic algorithm. At first fuzzy modelling is performed to obtain fuzzy model of the refuse incineration plant and obtained fuzzy model predicts outputs of the plant when inputs are given. Fuzzy model ca be used to obtain control strategy, and train and enhance operators' skill by simulating the plant. Then genetic algorithms search and find out optimal control inputs over all possible solutions in respect to desired outputs and these are inserted to plant. In order to testify proposed control method, computer simulation was carried out. As a result, ISE of fuzzy model of refuse incineration plant is 0.015 and ITAE of control by proposed method, 352 which is better than that by manual operation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1601-1604
• /
• 2001

본 논문에서는 SM 메시지(Search Message)를 이용하여 효과적인 예약 오류 최소화를 위한 새로운 RSVP(Resource Reservation Protocol) 알고기즘을 제안한다. 기존의 RFC-2205[1]에 제시된 방안은 각각의 예약 요청을 모두 유지해야하기 때문에 과도한 대역폭 낭비와 이로인한 예약 성공 횟수가 감소되는 문제점을 안고 있다. 대역폭 낭비를 줄이기위해 본 논문에서는 SM 메시지를 도입하였다. 수신자는 주기적으로 SM 메시지를 송신자로 전송하여, 전송로 상의 각 라우터의 사용가능한 대역폭을 검사하여 최소 대역폭으로 각 라우터에 블록케이드 값을 생성한다. 각 라우터에서의 병합작업시 SM 메시지를 이용하여 설정된 블록케이드 값을 기준으로 병합작업 여부를 결정한다. 이는 각각의 예약요청을 별도로 유지해야 할 필요가 없어지므로, 기존의 KRP-I 문제의 해결책인 RFC-2205보다 대역폭 낭비를 줄일수 있게되며 이로인해 예약 수락율이 증가하여 보다 많은 예약 성공 횟수를 얻을수 있게된다. 제안한 SM 알고리즘을 모의 실험 해 본 결과, 예약 수락율이 기존의 RFC-2205보다 전체적으로 약 26% 정도 향상되었다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.14 no.2
• /
• pp.167-179
• /
• 1996

The AFM (Ambiguity Function Method) is insensitive to the integer ambiguity and the presence of cycle slips in the carrier phase observations. But there are two significant problems with using the AM to determine GPS base-lines. The first problem is the long computation time required to determine the optim position. The second problem is that there may be sever maxima points that the AFM gorithm must discriminate between within the search volume in order to identify the optim position. A new gorithm which enables the AFM to be applied to the OTF (On-the-fly) environments by significantly shortening the computation time is proposed in this paper. In addition to it, sever statistic procedures which verify whether the optim position is true or not are proposed.

• Environmental and Resource Economics Review
• /
• v.15 no.5
• /
• pp.799-826
• /
• 2006

Combining recent advances in causal flows with time series analysis, relationships among eight North American natural gas spot market prices are examined. Results indicate that price discovery tends to occur in excess demand regions and move to excess supply regions. Across North America, the U.S. Midwest region represented by Chicago spot market is the most important market for price discovery. The Ellisburg-Leidy Hub in Pennsylvania is important in price discovery, especially for markets in the eastern two-thirds of the U.S. Malin Hub in Oregon is important for the western markets including the AECO Hub in Alberta, Canada.

• Bulletin of the Korean Chemical Society
• /
• v.34 no.3
• /
• pp.899-906
• /
• 2013

Using generated conformations from docking analysis by Gold algorithm, some 3D-QSAR models; CoMFA and CoMSIA have been created on 39 N-benzoylated phenoxazines and phenothiazines, including their S-oxidized analogues. These molecules inhibit the polymerization of tubulin into microtubules and thus they have been studied for the development of antitumor drugs. Training set for the CoMFA and CoMSIA models using 30 docked conformations gives $q^2$ Leave one out (LOO) values of 0.756 and 0.617, and $r^2$ ncv values of 0.988 and 0.956, respectively. The ability of prediction and robustness of the models were evaluated by test set, cross validation (leave-one-out and leave-ten-out), bootstrapping, and progressive scrambling approaches. The all-orientation search (AOS) was used to achieve the best orientation to minimize the effect of initial orientation of the structures. The docking results confirmed CoMFA and CoMSIA contour maps. The docking and 3D-QSAR studies were thoroughly interpreted and discussed and confirmed the experimental $pIC_{50}$ values.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.281-284
• /
• 2010

In this paper, we present Hand-gesture recognition for actual computing into color images from camera. Color images are binarization and labeling by using the YCbCr Color model. Respectively label area seeks the center point of the hand from to search Maximum Inscribed Circle which applies Voronoi-Diagram. This time, searched maximum circle and will analyze the elliptic ingredient which is contiguous so a hand territory will be able to extract. we present the presentation contral system using elliptic element and Maximum Inscribed Circle. This algorithm is to recognize the various environmental problems in the hand gesture recognition in the background objects with similar colors has the advantage that can be effectively eliminated.