• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.423-428
• /
• 2017

These days, various and tons of education information are rapidly increasing and spreading due to Internet and smart devices usage. Recently, as e-Learning usage increasing, many instructors and students (learners) need to set a goal to maximize learners' result of education and education system efficiency based on big data analytics via online recorded education historical data. In this paper, the author applied Word2Vec algorithm (neural network algorithm) to find similarity among education words and classification by clustering algorithm in order to objectively recognize and analyze online recorded education historical data. When the author applied the Word2Vec algorithm to education words, related-meaning words can be found, classified and get a similar vector values via learning repetition. In addition, through experimental results, the author proved the part of speech (noun, verb, adjective and adverb) have same shortest distance from the centroid by using clustering algorithm.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.4
• /
• pp.93-100
• /
• 2021

The Ethereum shard system for solving the scalability problem of the blockchain has a load balancing issue, which is modeled as a graph partitioning problem. In this paper, we propose an adaptive online weighted graph partitioning algorithm that can negotiate between two utility of the shard system using the game theory's bargaining solution. The bargaining solution is an axiomatic solution that can fairly determine the points of conflict of utility. The proposed algorithm was improved to apply the existing online graph partitioning algorithm to the weighted graph, and load balancing was performed efficiently through the design considering the situation of the sharding system using the extension of Nash bargaining solution, which is extended to apply solution to non-convex feasible set of bargaining problem. As a result of the experiment, it showed up to 37% better performance than typical load balancing algorithm of shard system.

• Information Systems Review
• /
• v.17 no.3
• /
• pp.95-111
• /
• 2015

The recommendation system automatically provides the predicted items which are expected to be purchased by analyzing the previous customer behaviors. This recommendation system has been applied to many e-commerce businesses, and it is generating positive effects on user convenience as well as the company's revenue. However, there are several limitations of the existing recommendation systems. They do not reflect specific criteria for evaluating products or the factors that affect customer buying decisions. Thus, our research proposes a collaborative recommendation model algorithm that utilizes each customer's online product reviews. This study deploys topic modeling method for customer opinion mining. Also, it adopts a kernel-based machine learning concept by selecting kernels explaining individual similarities in accordance with customers' purchase history and online reviews. Our study further applies a multiple kernel learning algorithm to integrate the kernelsinto a combined model for predicting the product ratings, and it verifies its validity with a data set (including purchased item, product rating, and online review) of BestBuy, an online consumer electronics store. This study theoretically implicates by suggesting a new method for the online recommendation system, i.e., a collaborative recommendation method using topic modeling and kernel-based learning.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.177-182
• /
• 1989

In this paper a new adaptive control algorithm is derived, with the unknown manipulator and payload parameters being estimated online. In practice, we may simplify the algorithm by not explicity estimating all unknown parameters. Further, the controller must be robust to residual time-varying disturbance, such as striction or torque ripple. Also, the reference model is a simple douple integrator and the acceleration input for robot manipulator consists of a proportion and derivative controller for trajectory tracking purposes. The validity of this control is confirmed in simulation where two-link robot manipulator shows the robust performances in spite of the existing nonlinear interaction and unknown parametrictings

• Proceedings of the KIEE Conference
• /
• 2002.11d
• /
• pp.313-316
• /
• 2002

In this paper, we present an online scheme for parameter estimation of solar cell, based on the model adjustment technique and a genetic algorithm. The ideal diode model and the diode model with series and shunt resistor are used to estimate their parameters. Simulation works using field data in the form of a VI characteristic curve are carried out to demonstrate the effectiveness of the proposed method.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.04b
• /
• pp.504-509
• /
• 1995

In this paper, we developed a position correction system of industrial robot for door-chassis assembly task. With the aid of a dedicated vision system, industrial robot accomplished visually acceptable door-chassis's assembly task. The alogorithm of the position detection of notch and 2 dimesional position correction algorithm are noteworthy. The obtained algorithms were satisfatorily implemented for a real door-chassis model.

• Journal of Information Technology Services
• /
• v.19 no.1
• /
• pp.145-158
• /
• 2020

With the development and widespread application of online shopping, the number of online consumers has increased. With one click of a mouse, people can buy anything they want without going out and have it sent right to the doors. As consumers benefit from online shopping, people are becoming more concerned about protecting their privacy. In the group buying scenario described in our paper, online shopping was regarded as intra-group communication. To protect the sensitive information of consumers, the polynomial-based encryption key sharing method (Piao et al., 2013; Piao and Kim, 2018) can be applied to online shopping communication. In this paper, we analyze security problems by using a polynomial-based scheme in the following ways : First, in Kamal's attack, they said it does not provide perfect forward and backward secrecy when the members leave or join the group because the secret key can be broken in polynomial time. Second, for simultaneous equations, the leaving node will compute the new secret key if it can be confirmed that the updated new polynomial is recomputed. Third, using Newton's method, attackers can successively find better approximations to the roots of a function. Fourth, the Berlekamp Algorithm can factor polynomials over finite fields and solve the root of the polynomial. Fifth, for a brute-force attack, if the key size is small, brute force can be used to find the root of the polynomial, we need to make a key with appropriately large size to prevent brute force attacks. According to these analyses, we finally recommend the use of a relatively reasonable hash-based mechanism that solves all of the possible security problems and is the most suitable mechanism for our application. The study of adequate and suitable protective methods of consumer security will have academic significance and provide the practical implications.

• Journal of the Korea Society for Simulation
• /
• v.13 no.4
• /
• pp.43-53
• /
• 2004

The distributed OCSP (Online Certificate Status Protocol), composed of multiple responders, is a model that enhances the utilization of each responder and reduces the response time. In a multi-user distributed environment, load balancing mechanism must be developed for the improvement of the performance of the whole system. Conservative load balancing algorithms often ignore the communication cost of gathering the information of responders. As the number of request is increased, however, fail to consider the communication cost may cause serious problems since the communication time is too large to disregard. We propose an adaptive load balancing algorithm and evaluate the effectiveness by performing modeling and simulation. The principal advantage of new algorithm is in their simplicity: there is no need to maintain and process system state information. We evaluated the quality of load balancing achieved by the new algorithm by comparing the queue size of responders and analyzing the utilization of these responders. The simulation results show how efficiently load balancing is done with the new algorithm.

• Advances in robotics research
• /
• v.2 no.3
• /
• pp.247-257
• /
• 2018

Various studies have been performed to coordinate robots in transporting objects and different artificial intelligence algorithms have been considered in this field. In this paper, we investigate and solve Multi-Robot Transportation problem by using a combined auction algorithm. In this algorithm each robot, as an agent, can perform the auction and allocate tasks. This agent tries to clear the auction by studying different states to increase payoff function. The algorithm presented in this paper has been applied to a multi-robot system where robots are responsible for transporting objects. Using this algorithm, robots are able to improve their actions and decisions. To show the excellence of the proposed algorithm, its performance is compared with three heuristic algorithms by statistical simulation approach.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.26 no.6
• /
• pp.397-403
• /
• 2021

In this paper, phase shedding algorithm that measuring to converter's input and output parameter during real-time to control the number of driving converters is proposed. The proposed phase-shedding algorithm drives the DVR power supply with the optimal converter's combination without the loss calculation curve and the lookup table in which the efficiency is measured in advance. The proposed algorithm was implemented through a digital controller and verified in a two-modular LLC converter with a single rated power of 60 Win a 120 W DVR power supply system. Experimental results are presented to prove the validity of the proposed algorithm.