• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.4
• /
• pp.309-313
• /
• 2009

SQL:2003 standard provides SQL/XML publishing functions to publish the result of an SQL query as XML values but it does not provide any SQL/XML publishing function that can publish the result of a recursive query as recursively structured XML values. Therefore, for the relational tuples which are connected directly or indirectly according to given conditions, to publish both the contents of them and the relationship among them as XML values with the use of appropriate SQL/XML publishing functions, we have to write a nested SQL query. Writing that query, however, is not easy provided that the depth of the connections is deep even if we know the depth of them and is not possible once the depth of the connections is not known in advance. In order to resolve that problem, we propose a new SQL function XMLNEST that can publish the result of a recursive query as recursively structured XML values.

• Korean Journal of Optics and Photonics
• /
• v.25 no.6
• /
• pp.334-339
• /
• 2014

In this paper, the optical properties of a miniature telecentric camera are studied analytically and experimentally. By means of optical properties, the luminous intensity of retro-reflection of a miniature telecentric optical system is investigated. First, from a simulation the theoretical value of the coefficient of luminous intensity of retro-reflection of a miniature telecentric system is estimated. Second, a miniature telecentric camera device is designed, and the value of the coefficient of luminous intensity of retro-reflection of the actual device is measured through experiment. From simulation and experiment, we found that both the estimated and observed values of the coefficient of luminous intensity of retro-reflection range from 0.002 to $0.03m^2/sr$ (P384200CPH: $0.0042-0.018m^2/sr$, P285200CPH: $0.0045-0.0297m^2/sr$, P321450S: $0.0021-0.00963m^2/sr$) at 1.4 to 4.9 arcminute. The results prove the significance of the mechanisms used to design the miniature telecentric camera, and the experimental method. Accordingly, with these significant results, this study contributes to the development of theory and practice in optical engineering science.

• Journal of Embryo Transfer
• /
• v.18 no.3
• /
• pp.257-262
• /
• 2003

These studies were performed to improve the reproductive efficiency of gilts and we investigated the effects of nursing periods after parturition and backfat thickness will adapt to these results for early selection of excellent gilts. The main results were as follows; 1. The backfat thickness in sows nursing for 17∼21 days was 19.19 mm, and 16.52 mm in 22∼26 days and longer nursing period affected significantly the backfat thinner (p<0.01). 2. The recurrence of estrus in sows nursing for 17∼21 days was 5.76 day and 5.62 day in 22∼26 days and there was no difference between nursing periods. 3. The recurrence of estrus in sows had 13∼16 mm backfat thickness was 5.69 day, 5.67 day in 17∼20 mm and 5.75 day in 21∼23 mm and there was no difference among backfat thickness. 4. The concentration of plasma estradiol were 28.49 pg/$m\ell$ in parturition, 12.39 pg/$m\ell$ in weaning and 16.52 pg/$m\ell$ in return of estrous. The concentration ot plasma progesterone were 1.50 ng/$m\ell$ in parturition, 0.69 ng/$m\ell$ in weaning and 0.94 ng/$m\ell$ in return of estrous. The concentration of plasma cortisol were 57.74 ng/$m\ell$ in parturition, 43.01 ng/$m\ell$ in weaning and 47.89 ng/$m\ell$ in return of estrous. There showed the highest level of estradiol, progesterone and cortisol in parturition.

• Journal of Animal Science and Technology
• /
• v.49 no.4
• /
• pp.451-458
• /
• 2007

This study was to investigate the effectiveness of pre-weaning injection of gonadotropin and scheduled fixed-time insemination on sow fertility. Sows were randomly assigned to receive gonadotropin 2 days before weaning, 1 day after weaning or none as control. In gonadotropin treated groups, half of sows were inseminated twice at 24 and 36 hours after onset estrus and half of sows were inseminated twice at scheduled fixed-time. Weaning to onset of estrus was the shortest in lactating sows injected with gonadotropin prior to weaning. Liter size was significantly higher in AI groups after detection of estrus, compared to fixed-time AI group. Results of these experiments indicated that injection of gonadotropin in lactating sows could initiate the final follicular development, and has potential to enhance the reintegration of estrus. Further researches are needed to define the relationship between reduced interval of wean to onset estrus and enhanced fertility in lactating sows.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.2981-2988
• /
• 1999

A deductive database consists of facts being the extensional database and rules being the intensional database. Because of the difficulty of evaluating rules, many parallel evaluation algorithms for rules have been presented. But we have not gotten an acceptable result. This paper proposes a new methodology to evaluate proof-theoretic meaning of the linear recursion rule which contains transitive dependency by using a shared-nothing parallel architecture. As first, we prove that there exists the equivalent expression for a linear recursion rule, design the algorithm for evaluating the linear recursion rule based on the equivalent expression, and finally analyse performance of the proposed algorithm.

• Journal of KIISE
• /
• v.43 no.12
• /
• pp.1342-1350
• /
• 2016

Induction and coinduction are well-established proof principles, which are widely used in mathematics and computer science. In particular, induction is taught in most undergraduate programs and well understood in the field of computer science. In contrast, coinduction is not as widespread or well understood as induction. In this paper, we introduce coinduction by defining a subtype system for recursive and union types and proving the transitivity property of the system. This paper will help to promote familiarity with coinduction and provides a basis for a subtype system for recursive types with other advanced type constructors and connectives.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.999-1007
• /
• 1999

이 논문은 재귀원형군 G(2^m , 2^k )를 그래프 이론적 관점에서 고찰하고 정점이 서로소인 사이클과 그래프 invariant에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )가 길이 사이클을 가질 필요 충분 조건을 구하고, 이 조건하에서 G(2^m , 2^k )는 가능한 최대 개수의 정점이 서로소이고 길이가l`인 사이클을 가짐을 보인다. 그리고 정점 및 에지 채색, 최대 클릭, 독립 집합 및 정점 커버에 대한 그래프 invariant를 분석한다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties of G(2^m , 2^k ) concerned with vertex-disjoint cycles and graph invariants. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . A necessary and sufficient condition for recursive circulant {{{{G(2^m , 2^k ) to have a cycle of lengthl` is derived. Under the condition, we show that G(2^m , 2^k ) has the maximum possible number of vertex-disjoint cycles of length l`. We analyze graph invariants on vertex and edge coloring, maximum clique, independent set and vertex cover.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9C
• /
• pp.843-850
• /
• 2003

Turbo coding and turbo processing have been known as methods close to Shannon limit in the aspect of wireless MIMO communications similarly to wireless single antenna communication. The iterative processing can maximize the mutual effect of coding and interference cancellation, but turbo coding has not been used for turbo processing because of the inherent decoding process delay. This paper proposes a turbo coded MIMO system with adaptive turbo parallel space-time (Turbo-PAST) processing for high-speed wireless communications and a enhanced cyclic redundancy check (E-CRC) scheme as an efficient and simple priori stopping criterion. Simulation results show that the Turbo-PAST outperforms conventional system with 1.3dB and the proposed E-CRC scheme effectively reduces the amount of turbo processing iterations from the point of average number of iterations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.1009-1023
• /
• 1999

이 논문은 재귀원형군 G(2^m , 2^k ) 그래프 이론적 관점에서 고찰하고 정점이 서로소인 경로에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )의 서로 다른 두 노드 v와 w를 잇는 연결도 kappa(G)개의 서로소인 경로의 길이가 두 노드 사이의 거리d(v,w)나 혹은 G(2^m , 2^k )의 지름 \dia(G)에 비해서 얼마나 늘어나는지를 고려한다. 서로소인 경로를 재귀적으로 설계하는데, 그 길이는 k ge2일 때 d(v,w)+2^k-1과 \dia(G)+2^k-1의 최솟값 이하이고, k=1일 때 d(v,w)+3과 \dia(G)\+2의 최솟값 이하이다. 이 연구는 (2^m , 2^k )의 고장 감내 라우팅, 고장 지름이나 persistence의 분석에 이용할 수 있다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties concerned with node-disjoint paths. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . We consider the length increments of {{{{kappa(G)disjoint paths joining arbitrary two nodes v and win G(2^m , 2^k )compared with distance d(v,w)between the two nodes and diameter {{{{\dia(G)of G(2^m , 2^k ), where kappa(G)is the connectivity of G(2^m , 2^k ). We recursively construct disjoint paths of length less than or equal to the minimum of {{{{d(v,w)+2^k-1and \dia(G)+2^k-1for kge2 and the minimum of d(v,w)+3 and \dia(G)+2for k=1. This work can be applied to fault-tolerant routing and analysis of fault diameter and persistence of G(2^m , 2^k )

• Spatial Information Research
• /
• v.21 no.5
• /
• pp.63-72
• /
• 2013

This paper analyzed the flood propagation characteristics of each flood elevation due to failure of embankment in Muju Namdae Stream using recursive call algorithm. A flood propagation order by the flood elevation was estimated by setting destruction point at Beonggu and Chasan small dam through recursive call algorithm and then, the number of grids of each flood propagation order and accumulated inundation area were calculated. Based on the flood propagation order and the grid size of DEM, flood propagation time could be predicted each flood elevation. As a result, the study could identify the process of flood propagation through distribution characteristic of the flood propagation order obtained from recursive call algorithm, and could provide basic data for protection from flood disaster by selecting the flood vulnerable area through the gradient pattern of the graph for accumulated inundation area each flood propagation order. In addition, the prediction of the flood propagation time for each flood water level using this algorithm helped provide valuable information to calculate the evacuation path and time during the flood season by predicting the flood propagation time of each flood water level.