• Journal of Information Processing Systems
• /
• 제13권5호
• /
• pp.1149-1157
• /
• 2017

The satisfiability problem is always a core problem in artificial intelligence (AI). And how to improve the efficiency of algorithms solving the satisfiability problem is widely concerned. Algorithm IER (Improved Extension Rule) is based on extension rule. The number of atoms and the number of clauses affect the efficiency of the algorithm IER. DPLL rules are helpful to reduce these numbers. Then a complete algorithm CIER based on splitting rule and extension rule is proposed in this paper in order to improve the efficiency. At first, the algorithm CIER (Complete Improved Extension Rule) reduces the scale of a clause set with DPLL rules. Then, the clause set is split into a group of small clause sets. In the end, the satisfiability of the clause set is got from these small clause sets'. A strategy MOAMD (maximum occurrences and maximum difference) for the algorithm CIER is given. With this strategy, a better arrangement of atoms could be got. This arrangement could make the number of small clause sets fewer and the scale of these sets smaller. So, the algorithm CIER will be more efficient.

• ETRI Journal
• /
• 제29권4호
• /
• pp.524-526
• /
• 2007

In this letter, we study the multicast protection problem in sparse-splitting wavelength-division multiplexing (WDM) optical network, and propose a novel multicast protection algorithm called the shared source-leaf path-based protection (SLPP) algorithm. Unlike the proposals in previous studies, the backup paths derived by SLPP can share wavelength with the primary tree in sparse-splitting WDM networks. Simulations are used to evaluate the effectiveness of the SLPP algorithm.

• 한국경영과학회지
• /
• 제18권2호
• /
• pp.183-203
• /
• 1993

One of the most difficult and time-consuming stages in the development of the knowledge-based system is a knowledge acquisition. A splitting algorithm is developed to infer a rule-tree which can be converted to a rule-typed knowledge. A market segmentation may be performed in order to establish market strategy suitable to each market segment. As the sales data of a product market is probabilistic and noisy, it becomes necessary to prune the rule-tree-at an acceptable level while generating a rule-tree. A splitting algorithm is developed using the pruning measure based on a total amount of information gain and the measure of existing algorithms. A user can easily adjust the size of the resulting rule-tree according to his(her) preferences and problem domains. The algorithm is applied to a market segmentation problem of a medium-large computer market. The algorithm is illustrated step by step with a sales data of a computer market and is analyzed.

• 대한전자공학회논문지
• /
• 제27권1호
• /
• pp.105-111
• /
• 1990

In this paper, fast algorithms to generate the codebook of vector quantization in image coding, are proposed. And an efficient algorithm to guess a initial codebook, namely, binary splitting method, is proposed. We generated the initial codebook by binary splitting method and then reduced the searching time using Iterative Optimization algorithm as an alternate to the generalized Lloyd algorithm and several information from binary splitting method. And the searching time and performance can be traded off by varying the searching range. With this proposed algorithm, the computation time can be reduced by a factor of 60 Without any degradation of image quality.

• 한국음향학회지
• /
• 제21권1호
• /
• pp.69-72
• /
• 2002

부호책 설계에 사용되는 초기 부호책을 얻기 위해 수정된 미소분리 방법을 제안한다. 제안된 방법은 다른 클래스에 비해 소속되는 학습벡터가 다수 소속되거나 자승오차가 작은 클래스에 대표벡터를 더 많이 할당한다는 원리를 적용한다. 기존 K-means 알고리즘과 참고문헌 (5)에서 제안한 방법을 적용하여 설계된 부호책의 성능을 평가할 때, 두 경우 모두 제안된 방법에 의해 얻어진 초기 부호책을 사용하는 것이 기존 미소분리 방법에 의한 초기 부호책을 사용하는 것보다 우수한 결과를 나타낸다.

• 한국경영과학회지
• /
• 제26권4호
• /
• pp.99-108
• /
• 2001

In the ring loading problem with demand splitting, traffic demands are given for each pall of nodes in an undirected ring network and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the problem is to minimize the maximum load on the ring. The fastest a1gorithm to date is Myung, Kim and Tcha＇s a1gorithm that runs in Ο(n｜K｜) time where n is the number of nodes and K is the index set of the origin-destination pairs of nodes having flow traffic demands. Here we develop an a1gorithm for the ring loading problem with demand splitting that improves the rerouting step of Myung, Kim and Tcha＇s a1gorithm arid runs in Ο(min{n｜K｜, n$^2$}) time.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 1997년도 추계학술대회논문집
• /
• pp.17-23
• /
• 1997

In the two-dimensional Finite Element Method for forming simulation, mesh generation and remeshing process are very significant. In this paper, using the modified splitting mesh generation algorithm, we can overcome the limitation of existing techniques and acquire mesh, which has optimal mesh density. A modified splitting algorithm for automatically generating quadrilateral mesh within a complex domain is described. Unnecessary meshing process for density representation is removed. Especially, during the mesh generation with high gradient density like as shear band representation, the modified mesh density scheme, which will generate quadrilateral mesh with the minimized error, which takes effect on FEM solver, is introduced.

• Journal of Communications and Networks
• /
• 제16권2호
• /
• pp.121-129
• /
• 2014

The trend of an increasing demand for a high-quality user experience, coupled with a shortage of radio resources, has necessitated more advanced wireless techniques to cooperatively achieve the required quality-of-experience enhancement. In this study, we investigate the critical problem of rate splitting in heterogeneous cellular networks, where concurrent transmission, for instance, the coordinated multipoint transmission and reception of LTE-A systems, shows promise for improvement of network-wide capacity and the user experience. Unlike most current studies, which only deal with spectral efficiency enhancement, we implement an optimal rate splitting strategy to improve both spectral efficiency and energy efficiency by exploring and exploiting cooperation diversity. First, we introduce the motivation for our proposed algorithm, and then employ the typical cooperative bargaining game to formulate the problem. Next, we derive the best response function by analyzing the dual problem of the defined primal problem. The existence and uniqueness of the proposed cooperative bargaining equilibrium are proved, and more importantly, a distributed algorithm is designed to approach the optimal unique solution under mild conditions. Finally, numerical results show a performance improvement for our proposed distributed cooperative rate splitting algorithm.

• 융합신호처리학회논문지
• /
• 제4권4호
• /
• pp.30-39
• /
• 2003

본 논문에서는 한국어 음성 데이터를 대상으로 HM-Net(Hidden Markov Network) 음성인식 시스템의 성능평가를 수행하였다. 음향모델 작성은 음성인식에서 널리 사용되고 있는 통계적인 모델링 방법인 HMM(Hidden Markov Model)을 개량한 HM-Net을 도입하였다. HM-Net은 기존의 SSS(Successive State Splitting) 알고리즘을 개량한 PDT(Phonetic Decision Tree)-SSS 알고리즘에 의해 문맥방향과 시간방향의 상태분할을 수행하여 생성되는데, 특히 문맥방향 상태분할의 경우 학습 음성데이터에 출현하지 않는 문맥정보를 효과적으로 표현하기 위해 음소결정트리를 채용하고 있으며, 시간방향 상태분할의 경우 학습 음성데이터에서 각 음소별 지속시간 정보를 효과적으로 표현하기 위한 상태분할을 수행하며, 마지막으로 파라미터의 공유를 통해 triphone 형태의 최적인 모델 네트워크를 작성하게 된다. 인식에 사용된 알고리즘은 음소 및 단어인식의 경우에는 One-Pass Viterbi 빔 탐색을 사용하며 트리 구조 형태의 사전과 phone/word-pair 문법을 채용하고 있다. 연속음성인식의 경우에는 단어 bigram과 단어 trigram 언어모델과 목구조 형태의 사전을 채용한 Multi-Pass 빔 탐색을 사용하고 있다. 전체적으로 본 논문에서는 다양한 조건에서 HM-Net 음성인식 시스템의 성능평가를 수행하였으며, 지금까지 소개된 음성인식 시스템과 비교하여 매우 우수한 인식성능을 보임을 실험을 통해 확인할 수 있었다.

• 한국음향학회지
• /
• 제23권7호
• /
• pp.548-553
• /
• 2004

본 연구에서는 집단화 오차를 최소로 하기위해 개선된 LBG 알고리즘을 제안한다. 기존의 LBG 알고리즘은 화자확인 시스템에 적용시 소량의 학습 데이터의 분포가 가지는 특수성으로부터 기인하는 문제점들이 발생한다. 즉, 개인별 특성을 무시하고 항상 일정한 크기의 코드북을 생성해야 하는데서 기인하는 군집화 오류와 분할할 (Splitting) 방향을 잘못 선택하면서 발생하는 집단화의 오류가 전체 화자 인식율 저하의 원인이 된다. 따라서, 본 연구에서는 개인별로 최적의 크기를 가지는 가변길이 코드북 생성 기법과 중심값으로부터 최외곽의 멤버 벡터 인덱스를 찾고 다시 최외곽 멤버 벡터에서 가장 먼 멤버 벡터 인덱스를 찾음으로써 분할할 방향을 인위적으로 지정해 주는 개선된 군집화 알고리즘을 제안한다. 실험 결과, 제안된 방식을 적용한 화자확인 시스템이 기존의 LBG알고리즘을 사용한 시스템보다 오거부율(FR)은 3.165%, 오수락율 (FA)는 0.06%씩 각각 향상 되었다.