• Journal of Computing Science and Engineering
• /
• v.9 no.2
• /
• pp.73-82
• /
• 2015

Understanding how the topic evolves is an important and challenging task. A topic usually consists of multiple related events, and the accurate identification of event evolution relationship plays an important role in topic evolution analysis. Existing research has used the traditional vector space model to represent the event, which cannot be used to accurately compute the semantic similarity between events. This has led to poor performance in identifying event evolution relationship. This paper suggests constructing a semantic aspect-based vector space model to represent the event: First, use hierarchical Dirichlet process to mine the semantic aspects. Then, construct a semantic aspect-based vector space model according to these aspects. Finally, represent each event as a point and measure the semantic relatedness between events in the space. According to our evaluation experiments, the performance of our proposed technique is promising and significantly outperforms the baseline methods.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.8
• /
• pp.56-64
• /
• 1997

In distributed autonomous robotic systems, each robot must behaves by itself according to the its states and environements, and if necessary, must cooperates with other orbots in order to carray out a given task. Therefore it is essential that each robot has both learning and evolution ability to adapt the dynamic environments. In this paper, the new learning and evolution method based on reinforement learning having delayed reward ability and distributed genectic algorithms is proposed for behavior learning and evolution of collective autonomous mobile robots. Reinforement learning having delayed reward is still useful even though when there is no immediate reward. And by distributed genetic algorithm exchanging the chromosome acquired under different environments by communication each robot can improve its behavior ability. Specially, in order to improve the perfodrmance of evolution, selective crossover using the characteristic of reinforcement learning is adopted in this paper, we verify the effectiveness of the proposed method by applying it to cooperative search problem.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.5
• /
• pp.712-717
• /
• 2008

In swarm robot systems, each robot must act by itself according to the its states and environments, and if necessary, must cooperate with other robots in order to carry out a given task. Therefore it is essential that each robot has both learning and evolution ability to adapt the dynamic environments. In this paper, reinforcement learning method with SVM based on structural risk minimization and distributed genetic algorithms is proposed for behavior learning and evolution of collective autonomous mobile robots. By distributed genetic algorithm exchanging the chromosome acquired under different environments by communication each robot can improve its behavior ability. Specially, in order to improve the performance of evolution, selective crossover using the characteristic of reinforcement learning that basis of SVM is adopted in this paper.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.279-284
• /
• 2009

In swarm robot systems, each robot must behaves by itself according to the its states and environments, and if necessary, must cooperates with other robots in order to carry out a given task. Therefore it is essential that each robot has both learning and evolution ability to adapt the dynamic environments. In this paper, reinforcement learning method using many SVM based on structural risk minimization and distributed genetic algorithms is proposed for behavior learning and evolution of collective autonomous mobile robots. By distributed genetic algorithm exchanging the chromosome acquired under different environments by communication each robot can improve its behavior ability. Specially, in order to improve the performance of evolution, selective crossover using the characteristic of reinforcement learning that basis of Cascade SVM is adopted in this paper.

• Archives of Plastic Surgery
• /
• v.39 no.2
• /
• pp.94-105
• /
• 2012

Simple or complex defects in the lower leg, and especially in its distal third, continue to be a challenging task for reconstructive surgeons. A variety of flaps were used in the attempt to achieve excellence in form and function. After a long evolution of the reconstructive methods, including random pattern flaps, axial pattern flaps, musculocutaneous flaps and fasciocutaneous flaps, the reappraisal of the works of Manchot and Salmon by Taylor and Palmer opened the era of perforator flaps. This era began in 1989, when Koshima and Soeda, and separately Kroll and Rosenfield described the first applications of such flaps. Perforator flaps, whether free or pedicled, gained a high popularity due to their main advantages: decreasing donor-site morbidity and improving aesthetic outcome. The use as local perforator flaps in lower leg was possible due to a better understanding of the cutaneous circulation, leg vascular anatomy, angiosome and perforasome concepts, as well as innovations in flaps design. This review will describe the evolution, anatomy, flap design, and technique of the main distally pedicled propeller perforator flaps used in the reconstruction of defects in the distal third of the lower leg and foot.

• ICROS
• /
• v.1 no.1
• /
• pp.16-16
• /
• 1995

Like the usual systems, the industrial robot manipulator has some constraints for motion. Usually we hope that the manipulators move fast to accomplish the given task. The problem can be formulated as the time-optimal control problem under the constraints such as the limits of velocity, acceleration and jerk. But it is very difficult to obtain the exact solution of the time-optimal control problem. This paper solves this problem in two steps. In the first step, we find the minimum time trajectories by optimizing cubic polynomial joint trajectories under the physical constraints using the modified evolution strategy. In the second step, the controller is optimized for robot manipulator to track precisely the optimized trajectory found in the previous step. Experimental results for SCARA type manipulator show that the proposed method is very useful.

• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.1
• /
• pp.16-20
• /
• 1999

Like the usual systems, the industrial robot manipulator has some constraints for motion. Usually we hope that the manipulators move fast to accomplish the given task. The problem can be formulated as the time-optimal control problem under the constraints such as the limits of velocity, acceleration and jerk. But it is very difficult to obtain the exact solution of the time-optimal control problem. This paper solves this problem in two steps. In the first step, we find the minimum time trajectories by optimizing cubic polynomial joint trajectories under the physical constraints using the modified evolution strategy. In the second step, the controller is optimized for robot manipulator to track precisely the optimized trajectory found in the previous step. Experimental results for SCARA type manipulator show that the proposed method is very useful.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1100-1122
• /
• 2023

Scheduling user-submitted cloud tasks to the appropriate virtual machine (VM) in cloud computing is critical for cloud providers. However, as the demand for cloud resources from user tasks continues to grow, current evolutionary algorithms (EAs) cannot satisfy the optimal solution of large-scale cloud task scheduling problems. In this paper, we first construct a large- scale multi-objective cloud task problem considering the time and cost functions. Second, a multi-objective optimization algorithm based on multi-factor optimization (MFO) is proposed to solve the established problem. This algorithm solves by decomposing the large-scale optimization problem into multiple optimization subproblems. This reduces the computational burden of the algorithm. Later, the introduction of the MFO strategy provides the algorithm with a parallel evolutionary paradigm for multiple subpopulations of implicit knowledge transfer. Finally, simulation experiments and comparisons are performed on a large-scale task scheduling test set on the CloudSim platform. Experimental results show that our algorithm can obtain the best scheduling solution while maintaining good results of the objective function compared with other optimization algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.383-403
• /
• 2021

With the development of mobile edge computing (MEC), some late-model application technologies, such as self-driving, augmented reality (AR) and traffic perception, emerge as the times require. Nevertheless, the high-latency and low-reliability of the traditional cloud computing solutions are difficult to meet the requirement of growing smart cars (SCs) with computing-intensive applications. Hence, this paper studies an efficient offloading decision and resource allocation scheme in collaborative vehicular edge computing networks with multiple SCs and multiple MEC servers to reduce latency. To solve this problem with effect, we propose a context-aware offloading strategy based on differential evolution algorithm (DE) by considering vehicle mobility, roadside units (RSUs) coverage, vehicle priority. On this basis, an autoregressive integrated moving average (ARIMA) model is employed to predict idle computing resources according to the base station traffic in different periods. Simulation results demonstrate that the practical performance of the context-aware vehicular task offloading (CAVTO) optimization scheme could reduce the system delay significantly.

• Journal of KIISE
• /
• v.45 no.2
• /
• pp.150-156
• /
• 2018

Software visualization can assist developers to understand a software system and change its code. The recent development of bottom-up visualization tools demonstrates the advantages by revealing the code that is directly related to a software evolution task. However, the information provided by these tools is limited to the code already investigated by the developers in that task session. To broaden the scope and provide the code information that developers should explore, we propose to present the latest revision of a software system via a class diagram. When a developer clicks on a button, the proposed tool reveals the code changes committed to a configuration management system, and facilitates the understanding of code changes. We also conduct case studies illustrating the advantages of the proposed tool.