• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.4
• /
• pp.572-584
• /
• 1993

In this paper, we propose an efficient method to allocate carrier frequencies so as to minimize intermodulation products in two-level SCPC systems in which Hub station and many Remote stations communicate each other through the satellite transponder. Also we present a very efficient method to evaluate intermodulation products with highly reduced CPU time in two-level SCPC systems. We study and analyze the performance of some possible methods to extend the Deletion and Insertion operation, which is proposed by Okinaka and applied to only one-level SCPC systems, to two-level SCPC systems. The proposed algorithm is carefully selected out of these methods and is optimized, which shows superior performance to any other published strategies, especially in that it has very excellent characteristics in terms of generality for practical application. Considering the fact that most published strategies are seldom applicable to actual two-level SCPC systems, we can say that the proposed algorithm in this paper is quite meaningful.

• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.497-506
• /
• 2009

The method of effectively merging XML documents becomes necessary, as the use of XML is popular and the collaborative editing is required in the areas such as office documents and scientific documents editing works. As a solution to this problem, in this paper we present a theoretical framework for merging individual editing works by muli-users to a same source document. Different from existing approaches which merge documents themselves when they are merged, we represent editing works with a series of edit operations applied to a source document, which is called a edit script, merge those edit scripts by multi-users, and apply the merged one to the source document so that we can achieve the same effect of merging documents. In order to do this, assuming edit scripts based on insertion and deletion edit operations, we define notions such as static edit scripts, the intervention between edit scripts and the conflict between the ones, then propose the conflict conditions between edit scripts and the method of adjusting edit scripts when merged. This approach is effective in reducing network overhead in distributed environments and also in version management systems because of preserving the semantics of individual editing works.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.6
• /
• pp.748-757
• /
• 1999

본 논문에서는 차량 영역의 추출을 이용한 효율적인 교통 혼잡도 측정 시스템을 설계하고 구현한다. 차량 영역 정보의 추출은 첫째 영역 분할, 둘째 작은 영역의 제거와 영역의 직사각형화, 셋째 영역의 병합 및 삭제의 단계로 나눌 수 있다. 영역 분할 단계에서는 획득한 도로 영상을 영역 기반 영역 분할에 의해 영역으로 분할한다. 그 다음 영역 분할 후의 영역 정보 중 차량 영역을 추출하는데 영향을 미치지 않는 작은 영역들을 제거하고, 남은 영역들을 직사각형화한다. 마지막으로 차선 별로 남은 영역들을 병합, 삭제함으로써 각 차선마다 차량 영역 정보를 추출할 수 있다. 이러한 방법은 배경 영상과 같은 부가적인 정보를 사용하지 않고 도로 자체 영상만으로 교통 혼잡도를 측정할 수 있으며, 그림자의 영향이 없을 경우 적용할 수 있는 기법이다.Abstract In this paper, we designed and implemented an efficient road congestion analysis system using regional information. To extract vehicle regions from a road image, the system process the image in five steps: segmentation, small region elimination, region rectangularization, region merging and region deletion. First, we segment road image by a threshold value. Then, we eliminate useless small regions to extract vehicle region, and perform region rectangularization. Finally, we extract vehicle region of each lane of the road by region merging and deletion. This method has the advantage of measuring road congestion without additional information such as background images. But this method must be applied to road images without shadow.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2804-2807
• /
• 2000

This paper suggests a method of the forward dynamic analysis for the computer simulation on the analysis of the dynamic behavior for biped walking robot. The equations f motion of the system or the simulation are constructed by using the Method of the multibody dynamics which is powerful method for modeling of the complex biped system. For the simplicity of simulation, we consider that the sole of the contacting foot is affected by the reaction forces for tree structure system topology instead of the addition or deletion of the kinematic constraints. The ground reaction forces can be modeled using the simple spring and damper model at the three contacting points on the sole of the foot. For minimizing the errors of numerical integration, the number of equations of motion is minimized by adding the driving constraints or a controller instead of the direct driving torques.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.563-577
• /
• 2006

A stream processor uses resource sharing method for efficient of limited resource in multiple continuous queries. The previous methods process aggregate queries to consist the level structure. So insert operation needs to reconstruct cost of the level structure. Also a search operation needs to search cost of aggregation information in each size of sliding windows. Therefore this paper uses linear structure for optimization of sliding window aggregations. The method comprises of making decision, generation and deletion of panes in sequence. The decision phase determines optimum pane size for holding accurate aggregate information. The generation phase stores aggregate information of data per pane from stream buffer. At the deletion phase, panes are deleted that are no longer used. The proposed method uses resources less than the method where level structures were used as data structures as it uses linear data format. The input cost of aggregate information is saved by calculating only pane size of data though numerous stream data is arrived, and the search cost of aggregate information is also saved by linear searching though those sliding window size is different each other. In experiment, the proposed method has low usage of memory and the speed of query processing is increased.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• pp.159-162
• /
• 1998

Speech synthesis coding is classified into three categories: waveform coding, source coding and hybrid coding. To obtain the synthetic speech with high quality, the synthesis by waveform coding is desired. However, it is difficult to apply waveform coding to synthesis by syllable or phoneme unit, because it does not divide the speech into excitation and formant component. Thus it is required to alter the excitation in waveform coding for applying waveform coding to synthesis by rule. In this paper we propose a new pitch alteration method that minimizes the spectrum distortion by using the behavior of cepstrum. This method splits the spectrum of speech signal into excitation spectrum and formant spectrum and transforms the excitation spectrum into cepstrum domain. The pitch of excitation cepstrum is altered by zero insertion or zero deletion and the pitch altered spectrum is reconstructed in spectrum domain. As a result of performance test, the average spectrum distortion was below 2.29%.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.269-272
• /
• 2001

Since Multi-way Search Tree reduces the number of the memory access by increasing the branch factor, it is considered a method to archive the high-speed IP address lookup. Using the combination of initial 16 bit may and Multi-way Search Tree, it also reduces the search time of If address lookup. Multi-way Search Tree consists of K keys and K＋1 key pointers. This paper shows how the E update of Multi-way Search Tree which consists of the one pointer within a node can be performed. Using the one pointer within a node, it increases the number of keys within a node and reduces the search time of IP lookup. We also describes IP updating methods such as modification, Insertion and Deletion of address entries. Our update scheme performs better than the method which rebuilds the entire IP routing table when IP update processes.

• The Journal of Information Systems
• /
• v.23 no.3
• /
• pp.127-142
• /
• 2014

Plagiarism occurs when the content is copied without permission or citation, and the problem of plagiarism has rapidly increased because of the digital era of resources available on the World Wide Web. An important task in plagiarism detection is measuring and determining similar text portions between a given pair of documents. One of the main difficulties of this task is that not all similar text fragments are examples of plagiarism, since thematic coincidences also tend to produce portions of similar text. In order to handle this problem, this paper proposed association analysis in data mining to detect plagiarism. This method is able to detect common actions performed by plagiarists such as word deletion, insertion and transposition, allowing to obtain plausible portions of plagiarized text. Experimental results employing an unsupervised document classification strategy showed that the proposed method outperformed traditionally used approaches.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.83-90
• /
• 2004

In this paper, we study the CCD(Clustering with Circular Distance) and the COD(Clustering with Obstructed Distance) problems to be considered when objects are being clustered in a circularly search space and a search space with the presence of obstacles. We also propose a now clustering algorithm for clustering efficiently objects that the insertion or the deletion is occurring frequently in multi-dimensional search space. The distance function for solving the CCD and COD Problems is defined in the Proposed clustering algorithm. This algorithm is included a clustering method to create clusters that have a high spatial locality by minimum computation time.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.5
• /
• pp.395-404
• /
• 2007

Feature-based modeling and history-based modeling are the two main paradigms that are used in most of current CAD systems. Although these modeling paradigms make it easier for designers to create solid model, it may pose dependency constraints on features that are interacting one with another. When editing such features, these constraints often cause unpredictable and unacceptable results. For example, when a parent feature is deleted, the child features of the parent feature are also deleted. This entails re-generations of the deleted features, which requires additional modeling time. In order to complement this situation, we propose a method to delete only the features of interest by disconnecting the dependency constraints. This method can provide designers with more efficient way of model modification.