• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.1
• /
• pp.3-10
• /
• 2017

Counting Bloom filters (CBFs) have been popularly used in many network algorithms and applications for the membership queries of dynamic sets, since CBFs can provide delete operations, which are not provided in a standard 1-bit vector Bloom filter. However, because of the counting functions, a CBF can have overflows and accordingly false negatives. CBFs composed of 4-bit counters are generally used, but the 4-bit CBF wastes memory spaces by allocating 4 bits for every counter. In this paper, we propose a simple alternative of a 4-bit CBF named ternary Bloom filter (TBF). In the proposed TBF structure, if two or more elements are mapped to a counter in programming, the counters are not used for insertion or deletion operations any more. When the TBF consumes the same amount of memory space as a 4-bit CBF, it is shown through simulation that the TBF provides a better false positive rate than the CBF as well as the TBF does not generate false negatives.

• Journal of Families and Better Life
• /
• v.27 no.4
• /
• pp.189-201
• /
• 2009

This study is to solve following problems by a family leisure as the problem of a single person in seclusion type, teenager-children being addicted to game, the disconnection of culture inheritance among inter-generation, the elder being isolated from leisure, the increase of the children using a key to go into home alone, the problem of a gender discrimination. This study defines the policy for a family leisure as "policy that ultimately creates the happiness of family, prevents the family problem and deals with it, through the leisure activities that are suitable to family life cycle". It also considers some other important properties(equality, gender and family life cycle, space) besides the constitution and function of family leisure. To create the happiness of family, the direction of the policy for a family leisure heads toward the positive function such as unification, creativity, and psychological stability of family members. At this point, the object of the policy for a family leisure is a unit of the family and it focuses on the level of interaction and positive function development between family members, being beyond the concept of family activity. Therefore, the policy that is to vitalize a family leisure must contain the interaction and positive function between the family members. Hereupon, to vitalize a family leisure, this study leads above-mentioned subjects based on programming, running leisure facility, information system, experts, social awareness, and supporting to the various family. Specialty, the process of leading these subjects is connected to the suggestion of the concrete program and then, is to result in supporting the program development for the essential leisure policy.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.6
• /
• pp.2026-2036
• /
• 1991

An expert system is developed which can diagnose the causes and remedies of the failures of power transmission gears. The basic components of the expert system are knowledge base, inference engine, and working memory. The knowledges in knowledge base are classified into the knowledges for determining the failure types and for diagnosis of causes and remedies of the failures. The former is represented hierarchically into the main category of eleven groups by rules and the sub category of twenty four groups by facts, while the later is represented by facts according to the each group of knowledges. In the inference engine some considerations are implemented, i.e., the backward chaining method and depth first search to determine the category of the failures, the meta-knowledges to shorten the search space, the certainty factor to evaluate the reliability of result, and the unification strategy to diagnose the causes and remedies of the failures. The working memory is established to hold the results during inference temporarily. In addition, knowledge acquisition facility, explanation facility, and user interface are included for the usefulness of user. This expert system is written with the PROLOG programming language on IBM-PC compatible computer operated by MS-DOS and be executed alone.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1098-1107
• /
• 1999

In multimedia applications, a source usually generates multiple streams. By heterogeneous multimedia multicast, we mean a recipient can receive some of them, not necessarily all of them. A recipient bids for what it wants to receive and the source gains the same amount when a connection is established. The problem of distributing streams for heterogeneous multicast to maximize the source's gain, can be solved using a 0-1 integer programming, hewn as NP-complete. In this paper, we propose efficient stream distribution algorithms in two different types of multicast models. The first restricted model assumes that the capacity for a link in the multicast tree is grater than or equal to the capacities of its descendant links. In the second unrestricted model, we drop out the restriction in the restricted model. Proposed algorithms have better time and space complexities compared with any existing one. In addition, distributed implementations are straightforward, which is very useful for large networks.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.4
• /
• pp.1-9
• /
• 2016

In this paper we present a projection mapping system onto human's moving hand by a projector as information delivery media and Kinect to recognize hand motion. Most traditional projection mapping techniques project a variety of images onto stationary objects, however, our system provides new user experience by projecting images onto the center of the moving palm. We explain development process of the system, and production of content as applications on our system. We propose hardware organization and development process of open software architecture based on object oriented programming approach. For stable image projection, we describe a device calibration method between the projector and Kinect in three dimensional space, and a denoising technique to minimize artifacts from Kinect coordinates vibration and unstable hand tremor.

• Journal of the Korea Convergence Society
• /
• v.7 no.5
• /
• pp.213-219
• /
• 2016

This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.8
• /
• pp.971-980
• /
• 2010

In this paper, we present a navigation control algorithm for mobile robots that move in environments having static and moving obstacles. The algorithm includes a global and a local path-planning algorithm that uses $D^*$ search algorithm, a fuzzy logic for determining the immediate level of danger due to collision, and a fuzzy logic for evaluating the required wheel velocities of the mobile robot. To apply the $D^*$ search algorithm, the two-dimensional space that the robot moves in is decomposed into small rectangular cells. The algorithm is verified by performing simulations using the Python programming language as well as by using the dynamic equations for a two-wheeled mobile robot. The simulation results show that the algorithm can be used to move the robot successfully to reach the goal position, while avoiding moving and unknown static obstacles.

• Journal of KIISE:Software and Applications
• /
• v.28 no.11
• /
• pp.833-841
• /
• 2001

Abstract In this work, we analyze the Levy mutation operations based on the Levy probability distribution in the evolutionary programming via the mean square displacement and the distinctness. The Levy probability distribution is characterized by an infinite second moment and has been widely studied in conjunction with the fractals. The Levy mutation operators not only generate small varied offspring, but are more likely to generate large varied offspring than the conventional mutation operators. Based on this fact, we prove mathematically, via the mean square displacement and the distinctness, that the Levy mutation operations can explore and exploit a search space more effectively. As a result, one can get better performance with the Levy mutation than the conventional Gaussian mutation for the multi-valued functional optimization problems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1B
• /
• pp.71-79
• /
• 2011

This paper proposes a compiled-code simulator generation system based-on machine description language for efficient design space exploration in designing an embedded system optimized for a specific application. The proposed system generates a compiled-code simulator which maintains the functional accuracy of an event-driven simulator by determining instruction fetch and decoding processes statically. Generated simulator takes instruction-level and cycle-level simulation for estimating performances in embedded core. To show the efficiency of the constructed compiled-code simulator generator, architecture exploration had been performed for the JPEG encoder application. Starting with MIPS R3000 processor for one embedded core, the proposed system can produce the core showing optimized execution time for the application programming. In this process, a huge amount of simulation time has been used. Cycle-level compiled-code simulator has the functional accuracy and shows performance improvement by 21.7% in terms of simulation speed on the average when compared with an event-driven simulator.

• The Journal of the Korea Contents Association
• /
• v.7 no.6
• /
• pp.44-51
• /
• 2007

For real-time recognizing of model objects in remote position a new Neural Networks algorithm is proposed. The proposed neural networks technique is the real time computation methods through the inter-node diffusion. In the networks, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of objects, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through several simulation experiments, real time reconstruction of the nonlinear image information is processed. 1-D LIPN hardware has been composed and various experiments with static and dynamic signals have been implemented.