• Journal of the Korean Data and Information Science Society
• /
• 제18권2호
• /
• pp.561-572
• /
• 2007

In this paper, we describe various efficient optimization algorithms for obtaining an optimal customer allocation in the telephone call center. The main advantages of the proposed algorithms are simple, fast and very attractive for massive dataset. The proposed algorithms also provide comparable performance with the other more sophisticated linear programming methods. The proposed optimal allocation algorithms increase the customer contact, response rate and management product and optimize the performance of call centers. Simulation results are given to demonstrate the effectiveness of our algorithms.

• 정보보호학회논문지
• /
• 제12권4호
• /
• pp.99-114
• /
• 2002

실행시간이나 전력 소모량 분석 등과 같은 부가채널 공격에 안전하면서도 보다 효율적인 새로운 타원곡선 상수배 알고리즘을 제안한다. 먼저 기존 방식들을 분석하여 잠재적인 문제점들을 지적하고, 이런 문제점들을 제거할 수 있는 간단한 $\pm$1-이진 부호화 방식을 제안한다. 또한 제안 부호화 방식을 이용한 이진 및 고정 윈도우 알고리즘을 기술하고 안전성과 효율성을 분석한다.

• 산업기술연구
• /
• 제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.

• 한국통신학회논문지
• /
• 제12권3호
• /
• pp.239-253
• /
• 1987

DCT-III型의 高速處理方法을 다른 型의 DCT-DST 및 DHT의 高速變換에 확대 適用항 시스템의 구성이 간단하고 곱셈 및 덧셈 回數가 기존의 方法보다 작은 高速 알고리즘을 開發하였다. 또한 各各 四種의 DCT, DST 및 DHT의 相互 관계식과 各各에 곰셈回數 및 덧셈回數에 관한 公式이 유도되었다.

• ETRI Journal
• /
• 제28권6호
• /
• pp.709-720
• /
• 2006

In this paper, we suggest a simple and efficient multiple-forwarder-based file distribution method which can work with a tree-based application layer multicast. Existing multiple-forwarder approaches require high control overhead. The proposed method exploits the assumption that receivers join a session at different times. In tree-based application layer multicast, a set of data packets is delivered from its parent after a receiver has joined but before the next receiver joins without overlapping that of other receivers. The proposed method selects forwarders from among the preceding receivers and the forwarder forwards data packets from the non-overlapping data packet set. Three variations of forwarder selection algorithms are proposed. The impact of the proposed algorithms is evaluated using numerical analysis. A performance evaluation using PlanetLab, a global area overlay testbed, shows that the proposed method enhances throughput while maintaining the data packet duplication ratio and control overhead significantly lower than the existing method, Bullet.

• 전자공학회논문지B
• /
• 제28B권5호
• /
• pp.343-356
• /
• 1991

An efficient real-time implementation of digital filtering algorithms using a multiprocessor system in a ring network is investigated. The development time and cost for implementing a high speed signal processing system can be considerably reduced because algorithm are implemented in software using commercially available digital signal processors. This method is based on a parallel block processing approach, where a continuously supplied input data is divided into blocks, and the blocks are processed concurrently by being assigned to each processor in the system. This approach not only requires a simple interconnection network but also reduces the number of communications among the processors very much. The data dependency of the blocks to be processed concurrently brings on dependency problems between the processors in the system. A systematic scheduling method has been developed by using a processors which can be used efficiently, the methods for solving dependency problems between the processors are investigated. Implementation procedures and results for FIR, recursive (IIR), and adaptive filtering algorithms are illustrated.

• International Journal of Control, Automation, and Systems
• /
• 제1권4호
• /
• pp.431-443
• /
• 2003

This paper presents an efficient method to evaluate the performance of an extended stochastic Petri net by simple algebraic operations. The reachability graph is derived from an extended stochastic Petri net, and then converted to a timed stochastic state machine, using a semi-Markov process. The n-th moments of the performance index are derived by algebraic manipulations with each of the n-th moments of transition time and transition probability. For the derivation, three reduction rules are introduced on the transition trajectories in a well-formed regular expression. Efficient computation algorithms are provided to automate the suggested method. The presented method provides a proficient means to derive both the numerical and the symbolic solutions for the performance of an extended stochastic Petri net by simple algebraic manipulations.

• ETRI Journal
• /
• 제35권3호
• /
• pp.439-447
• /
• 2013

To increase device memory yield, many manufacturers use incorporated redundancy to replace faulty cells. In this redundancy technology, the implementation of an effective redundancy analysis (RA) algorithm is essential. Various RA algorithms have been developed to repair faults in memory. However, nearly all of these RA algorithms have low analysis speeds. The more densely compacted the memory is, the more testing and repair time is needed. Even if the analysis speed is very high, the RA algorithm would be useless if it did not have a normalized repair rate of 100%. In addition, when the number of added spares is increased in the memory, then the memory space that must be searched with the RA algorithms can exceed the memory space within the automatic test equipment. A very efficient RA algorithm using simple calculations is proposed in this work so as to minimize both the repair time and memory consumption. In addition, the proposed algorithm generates an optimal solution using a tree-based algorithm in each fault group. Our experiment results show that the proposed RA algorithm is very efficient in terms of speed and repair.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.35-38
• /
• 2000

Low bit rate image/video coding is essential for many visual communication applications. When bit rates become low, most compression algorithms yield visually blocking artifacts that highly degrade the perceptual quality, and post-processing approaches provide one attractive solution. In this paper, we provide simple and very efficient blocking artifacts reduction method using constrained random value addition. Our method is simple enough to be used for real-time post-processing of video.

• 대한교통학회지
• /
• 제22권6호
• /
• pp.121-131
• /
• 2004

다수경로 알고리즘은 비루프경로(Loopless Path: 또는 Simple Path)와 루프경로(Loop Path)를 탐색하는 방안으로 대별된다. 알고리즘의 난이도 측면에서 일반적으로 비루프경로를 탐색하는 방안이 루프경로를 탐색하는 방안보다 많은 노력이 소요된다. 바꾸어 말하면, 루프경로 탐색방안이 알고리즘의 이해 및 활용성 측면에서 용이하다는 장점이 존재한다. 루프경로탐색방안에서 경로삭제방식(Path Deletion Method)이 가장 효율적인 알고리즘으로 알려져 있다. 경로삭제방식은 K번째의 최적경로를 탐색하기 위하여 K-1번째의 경로의 탐색금지 상황설정이 필요하며, 이를 네트워크의 변형된 확장형태(Enlarged Transform)를 통하여 추구하는 방식이다. 그러나 이 알고리즘은 경로상에 노드 및 링크의 반복이 허용되는 루프를 생성시켜 교통망에 적용하기에는 한계가 존재하는 단점이 있다. 본 연구에서 링크표지를 활용하여 루프를 제거하는 방안을 개발한다. 이를 위해 K-1번째 확장네트워크에서 링크표지를 갱신하는 과정에서 대상링크와 전 링크의 부분경로와의 관계를 고려하여 루프가 생성되지 않도록 링크표지를 확정하여 원천적으로 루프의 생성을 방지한다. 본 연구에서 제안하는 비루프 알고리즘은 노드비루프와 링크비루프로 구분되며, 노드비루프는 경로 상에서 노드의 반복이 존재하지 않는 일반적인 단순경로(Simple Path)를 의미하며, 링크비루프는 경로 상에 링크의 반복이 존재하지 않는 경로를 의미한다. 특히 링크비루프는 도시 교차로에서 발생하는 U-턴, P-턴의 덩굴망 통행행태를 설명하기 위한 중요개념으로 확대 정의된다. 사례연구를 통하여 제안된 알고리즘의 활용성을 검증한다.