• Journal of Information Technology Applications and Management
• /
• v.23 no.4
• /
• pp.55-70
• /
• 2016

Recently, development of indoor positioning system and IoT such as beacon makes it possible to collect and analyze each customer's shopping behavior in off-line shopping malls. In this study, we propose a realtime brand recommendation scheme based on each customer's brand visiting history for off-line shopping mall with indoor positioning system. The proposed scheme, which apply collaborative filtering to off-line shopping mall, is composed of training and apply process. The training process is designed to make the base brand network (BBN) using historical transaction data. Then, the scheme yields recommended brands for shopping customers based on their behaviors and BBN in the apply process. In order to verify the performance of the proposed scheme, simulation was conducted using purchase history data from a department store in Korea. Then, the results was compared to the previous scheme. Experimental results showd that the proposed scheme performs brand recommendation effectively in off-line shopping mall.

• The Journal of Korea Robotics Society
• /
• v.7 no.2
• /
• pp.120-128
• /
• 2012

The loop closure problem is one of the most challenging issues in the vision-based simultaneous localization and mapping community. It requires the robot to recognize a previously visited place from current camera measurements. While the loop closure often relies on visual bag-of-words based on point features in the previous works, however, in this paper we propose a line-based method to solve the loop closure in the corridor environments. We used both the floor line and the anchored vanishing point as the loop closing feature, and a two-step loop closure algorithm was devised to detect a known place and perform the global pose correction. We propose an anchored vanishing point as a novel loop closure feature, as it includes position information and represents the vanishing points in bi-direction. In our system, the accumulated heading error is reduced using an observation of a previously registered anchored vanishing points firstly, and the observation of known floor lines allows for further pose correction. Experimental results show that our method is very efficient in a structured indoor environment as a suitable loop closure solution.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.377-384
• /
• 2004

The field based morphing requires the user to set most of the control lines manually which requires much time and skill to get satisfactory results. This thesis proposes a method to acquire semi-automation of image morphing through first acquiring shape information from the source image and the target image, then after the user manually designates the least amount of a pair of feature points, these are used as standards for polygon based vertex search to set the appropriate control line to the source mage and target image, and then using the ratio of control line lengths and space. Using the proposed method, the user can reduce the time setting the control line and unskilled persons can get natural image morphing results while designating the least amount control line.

• YAKHAK HOEJI
• /
• v.56 no.4
• /
• pp.217-221
• /
• 2012

To determination of antioxidant substance homoorientin, from Phyllostachys bambusoides leaves, the ultrasonic extraction and HPLC on-line $ABTS^+$ screening method were empolyed. Also, the various experimental variables such as the frequency and time of ultrasonic system were investigated and homoorientin was extracted efficiently at the low frequency 35 kHz and the extraction time 60 min. The values were positive peak 1574.71 (relative area, 23.67%) and negative peak 6924.34 (relative area, 1.23%), respectively. This HPLC on-line $ABTS^+$ screening method was rapid and efficient to search for antioxidants from natural products. These results will provide a database for investigating the constituents of natural products and the resources of pharmaceutical and cosmetic products.

• East Asian mathematical journal
• /
• v.34 no.2
• /
• pp.85-101
• /
• 2018

The purpose of this paper is to investigate counting-based and collection-based computation of the elementary mathematics textbook in Korea and United States of America. As a results, we will provide some suggestive points through how to use and activity of number line, decomposing number, counting, grouping and so on by analyzing counting and collection-based computation in the elementary mathematics textbook of Korea and United States of America.

• The Journal of Korea Robotics Society
• /
• v.11 no.1
• /
• pp.1-8
• /
• 2016

In this paper, we propose a new algorithm of the guidance line extraction for autonomous agricultural robot based on vision camera in paddy field. It is the important process for guidance line extraction which finds the central point or area of rice row. We are trying to use the central region data of crop that the direction of rice leaves have convergence to central area of rice row in order to improve accuracy of the guidance line. The guidance line is extracted from the intersection points of extended virtual lines using the modified robust regression. The extended virtual lines are represented as the extended line from each segmented straight line created on the edges of the rice plants in the image using the Hough transform. We also have verified an accuracy of the proposed algorithm by experiments in the real wet paddy.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.20 no.8
• /
• pp.86-92
• /
• 2021

As interest and demand for high value-added industries, including the global automobile and aerospace industries, have increased recently, demand for line centers with excellent performance that can respond to the production system for producing high value-added products is also rapidly increasing. A line center improves productivity based on the installed area using a multi-spindle compared to a conventional machining center. However, as the number of spindles increases, the weight increases and results in structural problems owing to the heat and vibration generated by each spindle. Therefore, it is necessary to improve machining precision through the structural improvement of the line center. This study presents research on the stabilization design of the line center through structural stability analysis through structural analysis to develop a compact multi-axis line center. An optimization model of the line center has been proposed to improve the processing precision and increase the rigidity by performing weight reduction based on the structural analysis results.

• Asian Pacific Journal of Cancer Prevention
• /
• v.15 no.16
• /
• pp.6587-6590
• /
• 2014

Objective: To further observe the efficacy and safety of pemetrexed, combined with Irinotecan or oxaliplatin or cisplatin in treating patients with advanced gastric cancer as second-line or third-line chemotherapy. Methods: From September 2013 to February 2014 we recruited 50 patients with advanced gastric cancer, with stage IV disease or postoperative recurrence, or unresectable. Then treated with pemetrexed based chemotherapy. After two cycles of treatment, efficacy and toxicity were evaluated. Results: Pemetrexed based chemotherapy was used as second-line in 33 patients, RR(CR+PR) is 41.2%. And achieved 36.4% when used as third-line. Overall response rate of 50 patients treated with Pemetrexed based treatment was 38% (CR+PR). Treatment related side effects were bone marrow suppression, vomiting, hepatic dysfunction and malaise.No treatment related death occurred. Conclusions: Treatment with pemetrexed based chemotherapy is active and is well tolerated in patients with advanced gastric cancer.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• Korean Journal of Cognitive Science
• /
• v.3 no.2
• /
• pp.271-289
• /
• 1992

In this paper,a cursive on-line Hangul recognition system which permits cursive writing between graphemes is presented.In general,the recognition of cursive Hangul writing has a difficulty of graheme segmentation and a complexity in matching procedure due to the increasing number of character candidates.To manage efficiently these problems,we propose a double segmentation method.Based on this segmentation,a recognition algorithm based on the line segment matching is proposed.Through the experimental result,it is show that the proposed recognition method is suitable for the cursive Hangul writings.