• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.1-23
• /
• 2005

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.

• MALSORI
• /
• no.49
• /
• pp.159-174
• /
• 2004

The development of the durational component of prosody modelling was overviewed and discussed in text-to-speech conversion of spoken English and Korean, showing the strengths and weaknesses of each approach. The possibility of integrating linguistic feature effects into the duration modelling of TTS systems was also investigated. This paper claims that current approaches to language timing synthesis still require an understanding of how segmental duration is affected by context. Three modelling approaches were discussed: sequential rule systems, Classification and Regression Tree (CART) models and Sums-of-Products (SoP) models. The CART and SoP models show good performance results in predicting segment duration in English, while it is not the case in the SoP modelling of spoken Korean.

• Journal of the Korean Mathematical Society
• /
• v.53 no.1
• /
• pp.187-199
• /
• 2016

The r-ary number sequences given by $$(b^{(r)}_n)_{n{\geq}0}=\Large{\frac{1}{(r-1)n+1}}(^{rn}_n)$$ are analogs of the sequence of the Catalan numbers ${\frac{1}{n+1}}(^{2n}_n)$. Their history goes back at least to Lambert [8] in 1758 and they are of considerable interest in sequential testing. Usually, the sequences are considered separately and the generalizations can go in several directions. Here we link the various r first by introducing a new combinatorial structure related to GR trees and then algebraically as well. This GR transition generalizes to give r-ary analogs of many sequences of combinatorial interest. It also lets us find infinite numbers of combinatorially defined sequences that lie between the Catalan numbers and the Ternary numbers, or more generally, between $b^{(r)}_n$ and $b^{(r+1)}_n$.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.215-221
• /
• 2005

TRecently, there has been enormous growth in the amount of commercial and scientific data, such as protein sequences, retail transactions, and web-logs. Such datasets consist of sequence data that have an inherent sequential nature. In this Paper, we study how to classify these sequence datasets. There are several kinds techniques for data classification such as decision tree induction, Bayesian classification and K-NN etc. In our approach, we use a K-NN algorithm for classifying sequences. In addition, we propose a new similarity measure to compute the similarity between two sequences and an efficient method for measuring similarity.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.620-626
• /
• 2014

In this paper, we propose a parallel collaborative sphere decoder with a scalable architecture promising quasi-maximum likelyhood performance with a relatively small amount of computational resources. This design offers a hardware-friendly algorithm using a modified node operation through fixing the variable complexity of the critical path caused by the sequential nature of the conventional sphere decoder (SD). It also reduces the computational complexity compared to the fixed-complexity sphere decoder (FSD) algorithm by tree pruning using collaboratively operated node operators. A Monte Carlo simulation shows that our proposed design can be implemented using only half the parallel operators compared to the approach using an ideal fully parallel scheme such as FSD, with only about a 7% increase of the normalized decoding time for MIMO dimensions of $16{\times}16$ with 16-QAM modulation.

• Proceedings of the KSLP Conference
• /
• 2003.11a
• /
• pp.236-236
• /
• 2003

음성합성을 위한 운율연구는 실험음성학과 음성공학 분야에서 활발히 이루어져 왔고, 가시적인 성과도 거두어 왔다. 최근 운율의 자연성을 향상시키기 위한 노력은 corpus-based unit selection에서와 같이, 대단위 음성자료에 의존하게 되면서 급격한 자연성의 향상을 가져온 것이 사실이지만, 여전히 새로 주어진 자료에 대해서 부자연스러운 운율을 극복해야 한다는 과제를 안고 있다. 이 논문은 길이, 억양, 에너지 등의 운율요소 가운데, 우선적으로 분절음의 길이에 초점을 두고, 대규모 음성자료를 바탕으로 한 자료기반형 길이예측모델을 지양하고 언어학적 지식과 언어자질을 이용한 지식기반형 길이예측모델을 제시하고자 한다. 모델링을 위한 방법으로는, 기본적으로 자료기반형 모델링 기법이지만 언어자질을 이용한 길이예측이 가능한 Classification and Regression Tree (CART) 모델링과 전통적인 지식기반형 모델링인 sequential rule systems을 확대시킨 Sums-of-Products 모델링을 사용한다. (중략)

• Nuclear Engineering and Technology
• /
• v.29 no.3
• /
• pp.211-217
• /
• 1997

Adverse effects caused by the surveillance test for the components of nuclear power plant involve plant transients, unnecessary wear, burden on licensee's time, and the radiation exposure to personnel along with the characteristics of each component. The optimization methodology of STI and AOT has been developed and applied to AFWPs of a reference plant. The approach proposed in this paper consist of the resole in minimal mean unavailability of the two-out-of-four system with adverse effects are analytically calculated for the example system. The surveillance testing strategy are given by the sequential test, the staggered test and the train staggered test which is a mined test scheme. In the system level, the sensitivity analyses for the STI and AOT, are performed for the measure of the system unavailability of the top event in the fault tree developed for the example system. This methodology may contribute to establishing the basis for the risk-based regulations.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.23 no.6
• /
• pp.109-123
• /
• 2020

The purpose of this study is to provide basic data for the establishment of future countermeasures by diagnosing the growth status and actual condition of undesignated old trees distributed in Hyeongok-myeon, Gyeongju, Gyeongsangbuk-do. The number of old trees surveyed was 2 weeks in Gajeong-ri, 2 weeks in Haguri, 3 weeks in Nae-Tae-ri, 1 week in Nawon-ri, 6 weeks in Oryu-ri, 3 weeks in Sangguri, and 2 weeks in Sohyeon-ri, The trees species composition was 6 trees Celtis sinensis Pers., 1 Diospyros lotus L. trees, 4 trees Salix chaenomeloides Kimura trees, 2 Styphnolobium japonicum L. trees, and 7 Zelkova serrata (Thunb.) Makino trees. Growth status is 7.1~22.0m in height, 14.6~25.1m in long axis, 10.2~19.2m in short axis, root diameter is 76.0~236.4cm, diamter at breast height is 67.0~220.0cm, soil acidity is pH4.9~7.0, soil The hardness was measured to be 4.0-27.0mm. The result grade of the scoring data of health information is represented by monitoring generally, monitoring critically, and absolute monitoring, and it was confirmed that out of the 20 trees population in Hyeongok-myeon, the general monitoring grade was 7 weeks, the major monitoring grade was 13 weeks, and there was no absolute monitoring grade. Accordingly, the number of old trees of the general surveillance level was maintained at the current level, and ecological surgical operations were introduced for the major surveillance level, but the case of village forests should be different, and sequential treatments were the old tree urgently needed. The level and bark of the target tree, the state of the crown, the root exposure, the presence of pests and pests, the vitality and the ground condition, the degree of pollution are normal, poor, or very poor, operation and protection management, soil improvement, removal of cover, and disinfection were urgently needed for the old trees with the surveyed data. In order to compensate for these matters, continuous monitoring and management measures for the old number should be sought.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.708-714
• /
• 2000

In this paper, an one-dimensional VLSI array for high speed processing of fractal image compression algorithm based the quad-tree partitioning method is proposed. First of all, the single assignment code algorithm is derived from the sequential Fisher's algorithm, and then the data dependence graph(DG) is obtained. The two-dimension array is designed by projecting this DG along the optimal direction and the one-dimensional VLSI array is designed by transforming the obtained two-dimensional array. The number of Input/Output pins in the designed one-dimensional array can be reduced and the architecture of process elements(PEs) can he simplified by sharing the input pins of range and domain blocks and internal arithmetic units of PEs. Also, the utilization of PEs can be increased by reusing PEs for operations to the each block-size. For fractal image compression of 512X512gray-scale image, the proposed array can be processed fastly about 67 times more than sequential algorithm. The operations of the proposed one-dimensional VLSI array are verified by the computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.354-361
• /
• 2011

Increasing interest and technological advances in smart home has led to active research on context-awareness service and prediction algorithms such as Bayesian Networks, Tree-Dimensional Structures and Genetic prediction algorithms. Context-awareness service presents that providing automatic customized service regarding individual user's pattern surely helps users improve the quality of life. However, it is difficult to implement context-awareness service because the problems are that handling coincidence with context information and exceptional cases have to consider. To overcome this problem, we proposes an Intelligent Sequential Matching Algorithm(ISMA), models context-awareness service using Timed Petri-net(TPN) which is petri-net to have time factor. The example scenario illustrates the effectiveness of the Timed Petri-net model and our proposed algorithm improves average 4~6% than traditional in the accuracy and reliability of prediction.