• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.11a
• /
• pp.371-375
• /
• 2001

The concept of a new linear motor that uses piezo-stack actuator is demonstrated. The working principle is far different from the conventional inchworm motor. This motor is based on the self-moving cell concept. The linear motor has three cells and each cell is constructed with one piezo-stack actuator and a shell structure. A cell train is constructed by connecting these cells and the cell train is fitted into a guide way with a proper interference. The cell train moves along the guide way, by activating each cell in succession. The moving motion of the motor is tested. Since this linear motor uses piezo-stack actuator with unified clamping cell, it can produce fast speed, high resolution and large push force.

• Journal of Digital Convergence
• /
• v.10 no.11
• /
• pp.613-618
• /
• 2012

ICT education guidelines revised in 2005 reinforce computer science elements such as algorithm, data structure, and programming covering all schools. And Ministry of Education emphasizes STEAM education. Most important is that "How instruct them". This means necessity of contents. So this paper suggests learning method of Stack and Queue using LEGO MINDSTORMS NXT. The main purpose is that how stack and queue are used, when robot explore realistic maze. Teaching and learning strategies are algorithm, flowchart, and NXT-G programming. Simple maze has path in left or right, but complex maze has three-way intersection. These are developed by authors. Master robot explores maze and push stack, and then return to entrance using stack. Master robot explores maze and transmits path to slave's queue. And then slave robot drives without exploration. Students can naturally learn principles and applications of them. Through these studies, it can improves ability of logical and creative thinking. Furthermore it can apply to ICT and STEAM education.

• Journal of Hydrogen and New Energy
• /
• v.19 no.5
• /
• pp.417-422
• /
• 2008

In this paper, a novel DC/DC low-voltage high-current converter circuit is proposed to improve the efficiency of power converter used in the grid-connected fuel-cell generator system. We proposed a novel high efficiency grid-connected power conditioning system for RPG fuel cell. On the result of that, the loss of system was decreased rapidly by driving stack within the condition of maximum efficiency. The peak currents of the current-type inductor and the transformer's coil are reduced by synchronizing switching frequency of Buck-type converter is increased twice as the Push-Pull converter's switching frequency. The novel structure of DC/DC converter is able to realize ZVS-ZCS in fuel-cell system is proposed. The proposed switching component of Push-Pull converter has the ZVS and ZCS function by using the circuit of new passive clamp.

• Journal of Information Processing Systems
• /
• v.9 no.1
• /
• pp.157-172
• /
• 2013

There are many recommendation systems available to provide users with personalized services. Among them, the most frequently used in electronic commerce is 'collaborative filtering', which is a technique that provides a process of filtering customer information for the preparation of profiles and making recommendations of products that are expected to be preferred by other users, based on such information profiles. Collaborative filtering systems, however, have in their nature both technical issues such as sparsity, scalability, and transparency, as well as security issues in the collection of the information that becomes the basis for preparation of the profiles. In this paper, we suggest a movie recommendation system, based on the selection of optimal personal propensity variables and the utilization of a secure collaborating filtering system, in order to provide a solution to such sparsity and scalability issues. At the same time, we adopt 'push attack' principles to deal with the security vulnerability of collaborative filtering systems. Furthermore, we assess the system's applicability by using the open database MovieLens, and present a personal propensity framework for improvement in the performance of recommender systems. We successfully come up with a movie recommendation system through the selection of optimal personalization factors and the embodiment of a safe collaborative filtering system.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2596-2604
• /
• 1997

There are two kinds of backends in ACK:code generator(full-fledged backend) and code expander(fast backend). Code generators generate target code using string pattern matching and code expanders generate target code using macro expansion. ACK translates EM to SPARC code using code expander. The corresponding SPARC code sequences for a EM code are generated and then push-pop optimization is performed. But, there is the problem of maintaining hybrid stack. And code expander is not considered to passes parameters of a procedure call through register windows. The purpose of this paper is to improve SPARC code quality. We suggest a method of SPARC cod generation using EM tree. Our method is divided into two phases:EM tree building phase and code expansion phase. The EM tree building phase creates the EM tree and code expansion phase translates it into SPARC code. EM tree is designed to pass parameters of a procedure call through register windows. To remove hybrid stack, we extract an additional information from EM code. We improved many disadvantages that arise from code expander in ACK.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.623-634
• /
• 2016

Most of existing frequent pattern mining methods address time efficiency and greatly rely on the primary memory. However, in the era of big data, the size of real-world databases to mined is exponentially increasing, and hence the primary memory is not sufficient enough to mine for frequent patterns from large real-world data sets. To solve this problem, there are some researches for frequent pattern mining method based on disk, but the processing time compared to the memory based methods took very time consuming. There are some researches to improve scalability of frequent pattern mining, but their processes are very time consuming compare to the memory based methods. In this paper, we present PPFP as a novel disk-based approach for mining frequent itemset from big data; and hence we reduced the main memory size bottleneck. PPFP algorithm is based on FP-growth method which is one of the most popular and efficient frequent pattern mining approaches. The mining with PPFP consists of two setps. (1) Constructing an IFP-tree: After construct FP-tree, we assign index number for each node in FP-tree with novel index numbering method, and then insert the indexed FP-tree (IFP-tree) into disk as IFP-table. (2) Mining frequent patterns with PPFP: Mine frequent patterns by expending patterns using stack based PUSH-POP method (PPFP method). Through this new approach, by using a very small amount of memory for recursive and time consuming operation in mining process, we improved the scalability and time efficiency of the frequent pattern mining. And the reported test results demonstrate them.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.201-209
• /
• 2012

The point-based complex event processing handled an instantaneous event by using one time stamp in each event. However, the activity period of the event plays the important role in the field which is the same as the finance, multimedia, medicine, and meteorology. The point-based event is insufficient for expressing the complex temporal relationship in this field. In the application field of the real-time world, the event has the period. The events more than two kinds can be temporally overlapped. In addition, one event can include the other event. The relation about the events of kind of these can not be successive like the point-based event. This thesis designs and implements the method detecting the patterns of the complex event by using the interval-based events. The interval-based events can express the overlapping relation between events. Furthermore, it can include the others. By using the end point of beginning and end point of the termination, the operator of interval-based events shows the interval-based events. It expresses the sequence of the interval-based events and can detect the complex event patterns. This thesis proposes the algorithm using the active instance stack in order to raise efficiency of detection of the complex event patterns. When comprising the event sequence, this thesis applies the window push down technique in order to reduce the number of intermediate results. It raises the utility factor of the running time and memory.