• Title/Summary/Keyword: Efficient

Search Result 46,207, Processing Time 0.058 seconds

An Efficient Algorithm of Data Anonymity based on Anonymity Groups (익명 그룹 기반의 효율적인 데이터 익명화 알고리즘)

  • Kwon, Ho Yeol
    • Journal of Industrial Technology
    • /
    • v.36
    • /
    • pp.89-92
    • /
    • 2016
  • In this paper, we propose an efficient anonymity algorithm for personal information protections in big data systems. Firstly, we briefly introduce fundamental algorithms of k-anonymity, l-diversity, t-closeness. And then we propose an anonymity algorithm using controlling the size of anonymity groups as well as exchanging the data tuple between anonymity groups. Finally, we demonstrate an example on which proposed algorithm applied. The proposed scheme gave an efficient and simple algorithms for the processing of a big amount of data.

  • PDF

EFFICIENT PLOTTING OF CLOSED POLAR CURVES WITH MATHEMATICA

  • Lee, Kwang-Bok;Kim, Young-Ik
    • The Pure and Applied Mathematics
    • /
    • v.5 no.2
    • /
    • pp.133-142
    • /
    • 1998
  • A simple mathematical theory is developed on the periodicity of elementary polar functions. The periodicity plays an important role in efficient plotting of some closed polar curves, without the excessive use of plotting devices and materials. An efficient plotting algorithm utilizing the periodicity is proposed and its implementation by a Mathematica program is introduced for a family of closed polar functions.

  • PDF

Evaluation of Methods to Analyze SNP-based Association Studies in a DNA-Pooling Experiment with Preferential Amplification

  • Ahn, Chul;Lee, Kyu-Sang
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2005.09a
    • /
    • pp.395-398
    • /
    • 2005
  • Genetic association case-control studies using DNA pools are efficient ways of detecting association between a marker allele and disease status. DNA pooling is an efficient screening method for locating susceptibility genes associated with the disease. However, DNA pooling is efficient only when allele frequency estimation is done precisely and accurately. Through the evaluation of empirical type I errors and empirical powers by simulation, we will evaluate the methods that correct for preferential amplification of nucleotides when estimating the allele frequency of single-nucleotide polymorphisms.

  • PDF

The Optimal Sizing and Efficient Driving Scheme of Series HEV (직렬형 HEV의 최적 용량산정과 효율적 운전방안)

  • 허민호
    • Proceedings of the KIPE Conference
    • /
    • 2000.07a
    • /
    • pp.651-656
    • /
    • 2000
  • This paper describes the optimal sizing of each component using computer simulation and presents the efficient operating scheme of series HEV using hardware simulator the equivalent system. As the sizing method of components have been experimental and empirical it is needed to spend much time and development cost. however the results of computer simulation will set the optimal sizing of components in short time. There are two type of driving control power-tracking mode and load-levelling mode in series HEV. This paper presents that series HEV be operated in the load-levelling mode which is more efficient that power-tracking mode.

  • PDF

A Face Optimization Algorithm for Optimizing over the Efficient Set

  • Kim, Dong-Yeop;Taeho Ahn
    • Korean Management Science Review
    • /
    • v.15 no.1
    • /
    • pp.77-85
    • /
    • 1998
  • In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solutions of a multiple objective linear program. Since the efficient set is in general a nonconvex set, problem (P) can be classified as a global optimization problem. Perhaps due to its inherent difficulty, relatively few attempts have been made to solve problem (P) in spite of the potential benefits which can be obtained by solving problem (P). The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations.

  • PDF

An Algorithm for Optimizing over the Efficient Set of a Bicriterion Linear Programming

  • Lee, Dong-Yeup
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.20 no.1
    • /
    • pp.147-158
    • /
    • 1995
  • In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solution of a bicriterion linear program. We show that problem (P) can arise in a variety of practical situations. Since the efficient set is in general a nonoconvex set, problem (P) can be classified as a global optimization problem. The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations. The algorithm can be easily implemented using only linear programming method.

  • PDF

Efficient Use of Radio Frequencies with Civil and Military Cooperation (${\cdot}$군 협력을 통한 주파수 자원의 효율적 사용방안)

  • Kim, Tae-Seong;Yu, Hye-Won;Lee, Su-Hyeong
    • Journal of Korea Technology Innovation Society
    • /
    • v.8 no.1
    • /
    • pp.77-93
    • /
    • 2005
  • This study examines the efficient use of radio frequencies, which become one of the new economic resources, with civil and military cooperation. The current status of radio frequency resource and its future demands are predicted. Some problems and solutions regarding the civil and military usage of frequencies are suggested. Finally, economic, systematic and technical plans are presented for efficient use of frequencies.

  • PDF

Energy Efficient Locomotion Control of Compliant Legged Robot (유연 다리 구조를 가진 로봇의 에너지 효율적 주행 제어)

  • Kwon, Oh-Seok;Choi, Rock-Hyun;Lee, Dong-Ha
    • The Journal of Korea Robotics Society
    • /
    • v.7 no.2
    • /
    • pp.76-82
    • /
    • 2012
  • In this study, we aim to develop energy efficient walking and running robot with compliant leg. So, we propose the energy efficient locomotion control method. And, we experiment the proposed control method applying to the experimental robot with compliant leg. From the experiment, we look at whether the proposed control method can the robot walk and run energy efficiently.

A simple and efficient planning of robot motions with obstacle avoidance (장애물이 있는 경우의 효율적인 로보트 동자계획)

  • 정봉주;이영훈
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.880-885
    • /
    • 1995
  • This paper deals with the efficient planning of robot motions in the Cartesian space while avoiding the collision with obstacles. The motion planning problem is to find a path from the specified starting robot configuration that avoids collision with a known set of stationary obstacles. A simple and efficient algorithm was developed using "Backward" approach to solve this problem. The computational result was satisfactory enough to real problems. problems.

  • PDF

CONNECTEDNESS AND COMPACTNESS OF WEAK EFFICIENT SOLUTIONS FOR VECTOR EQUILIBRIUM PROBLEMS

  • Long, Xian Jun;Peng, Jian Wen
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.6
    • /
    • pp.1225-1233
    • /
    • 2011
  • In this paper, without assumption of monotonicity, we study the compactness and the connectedness of the weakly efficient solutions set to vector equilibrium problems by using scalarization method in locally convex spaces. Our results improve the corresponding results in [X. H. Gong, Connectedness of the solution sets and scalarization for vector equilibrium problems, J. Optim. Theory Appl. 133 (2007), 151-161].