• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.12-31
• /
• 2006

The n-gram inverted index has two major advantages: language-neutral and error-tolerant. Due to these advantages, it has been widely used in information retrieval or in similar sequence matching for DNA and Protein databases. Nevertheless, the n-gram inverted index also has drawbacks: the size tends to be very large, and the performance of queries tends to be bad. In this paper, we propose the two-level n-gram inverted index (simply, the n-gram/2L index) that significantly reduces the size and improves the query performance while preserving the advantages of the n-gram inverted index. The proposed index eliminates the redundancy of the position information that exists in the n-gram inverted index. The proposed index is constructed in two steps: 1) extracting subsequences of length m from documents and 2) extracting n-grams from those subsequences. We formally prove that this two-step construction is identical to the relational normalization process that removes the redundancy caused by a non-trivial multivalued dependency. The n-gram/2L index has excellent properties: 1) it significantly reduces the size and improves the Performance compared with the n-gram inverted index with these improvements becoming more marked as the database size gets larger; 2) the query processing time increases only very slightly as the query length gets longer. Experimental results using databases of 1 GBytes show that the size of the n-gram/2L index is reduced by up to 1.9${\~}$2.7 times and, at the same time, the query performance is improved by up to 13.1 times compared with those of the n-gram inverted index.

• Communications of the Korean Mathematical Society
• /
• v.25 no.1
• /
• pp.11-18
• /
• 2010

The work in this paper was motivated by [3], where Eschenbach and Li listed four 4 by 4 sign patterns, conjectured to be nilpotent sign patterns of nilpotence index at least 3. These sign patterns with no zero entries, called full sign patterns, are shown to be potentially nilpotent of nilpotence index 3. We also generalize these sign patterns of order 4 so that we provide classes of n by n sign patterns of nilpotence indices at least 3, if they are potentially nilpotent. Furthermore it is shown that if a full sign pattern A of order n has nilpotence index k with $2{\leq}k{\leq}n-1$, then sign pattern A has nilpotent realizations of nilpotence indices k, k + 1, $\ldots$, n. Hence, the four 4 by 4 sign patterns in [3, page 91] also allow nilpotent realizations of nilpotence index 4.

• Journal of Korean Ophthalmic Optics Society
• /
• v.5 no.2
• /
• pp.151-155
• /
• 2000

We calculated a refractive index of the lens surface by measuring a spectral reflectance for a tinted time on manufacturing of the color lens. The longer a tinted time, the larger a reflectance and reflective index. The refractive index increased for a time up to the colorant's saturation state on the lens surface. The refractive index's change curve of blue color lens for a time depended on the Boltzmann growth curve. then we obtained the parameter's values of $n_{min}=1.482$, $n_{max}=1.497$, $t_c=11.53$ and $d_0=2.287$.

• International Journal of Contents
• /
• v.1 no.1
• /
• pp.50-58
• /
• 2005

Generally, multidimensional data such as image and spatial data require large amount of storage space. There is a limit to store and manage those large amounts of data in single workstation. If we manage the data on parallel computing environment which is being actively researched these days, we can get highly improved performance. In this paper, we propose a parallel multidimensional index structure that exploits the parallelism of the parallel computing environment. The proposed index structure is nP(processor)-nxmD(disk) architecture which is the hybrid type of nP-nD and 1P-nD. Its node structure in-creases fan-out and reduces the height of an index. Also, a range search algorithm that maximizes I/O parallelism is devised, and it is applied to k-nearest neighbor queries. Through various experiments, it is shown that the proposed method outperforms other parallel index structures.

• Journal of The Korean Astronomical Society
• /
• v.52 no.2
• /
• pp.41-47
• /
• 2019

We report on the timing properties of the 'Crab twin' pulsar PSR B0540-69 measured with X-ray data taken with the Swift telescope over a period of 1100 days. The braking index of the pulsar was estimated to be $n=0.03{\pm}0.013$ in a previous study performed in 2015 with 500-day Swift data. This small value of n is unusual for pulsars, and a comparison with an old estimate of $n{\approx}2.1$ for the same target determined ~10 years earlier suggests a dramatic change in the braking index. To confirm the small value and therefore the large change of n, we used 1100-day Swift observations including the data used in the earlier determination of n = 0.03. In this study we find that the braking index of PSR B0540-69 is $n=0.163{\pm}0.001$, somewhat larger than 0.03. Since the measured value of n is still much smaller than 2.1, we can confirm the dramatic change in the braking index for this pulsar.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.569-573
• /
• 2006

Nagata and Higman proved that any nil-algebra of finite nilindex is nilpotent of finite index. The Nagata-Higman Theorem can be formulated in terms of T-ideals. TheT-ideal generated by $a^n$ for all $a{\in}A$ is also generated by the symmetric polynomials. The symmetric polynomials play an importmant role in analyzing nil-algebra. We construct the incidence matrix with the symmetric polynomials. Using this incidence matrix, we determine the nilpotency index of nil-algebra of nil-index 3.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.58-71
• /
• 2002

Generally, multi-dimensional data such as image and spatial data require large amount of storage space. There is a limit to store and manage those large amount of data in single workstation. If we manage the data on parallel computing environment which is being actively researched these days, we can get highly improved performance. In this paper, we propose a parallel high-dimensional index structure that exploits the parallelism of the parallel computing environment. The proposed index structure is nP(processor)-n$\times$mD(disk) architecture which is the hybrid type of nP-nD and lP-nD. Its node structure increases fan-out and reduces the height of a index tree. Also, A range search algorithm that maximizes I/O parallelism is devised, and it is applied to K-nearest neighbor queries. Through various experiments, it is shown that the proposed method outperforms other parallel index structures.

• International Commerce and Information Review
• /
• v.9 no.2
• /
• pp.161-182
• /
• 2007

The objective of this paper is to examine the competitiveness of Korean export firms in EU market. In this study, market share index, RCA index, trade specialization index, and market competitiveness index were used as an analytical tool. On the market share index, Korea had a large market share in the SITC section 7(machinery and transport equipment) market in EU. On the RCA index, Korea appeared to have high export competitiveness in the electrical machinery, apparatus and appliances, n.e.s.(not elsewhere specified[stated]), and electrical parts thereof (77), travel goods, handbags and similar containers(83), textile yarn, fabrics, made-up articles, n.e.s., and related products(65), and iron and steel(67) division. On the trade specialization index, however, Korea appeared to tend to decline generally. On the market competitiveness index, Korea appeared to have competitive advantage in the iron and steel(67), machinery specialized for particular industries(72), office machines and automatic data-processing machines(75), electrical machinery, apparatus and appliances, n.e.s., and electrical parts thereof(77), road vehicles(78), and other transport equipment(79) division; but in 29 divisions, the index indicates that Korean firms' competitiveness was low. Finally, the authors discuss the implications of these findings and offer directions for future study.

• Kyungpook Mathematical Journal
• /
• v.54 no.1
• /
• pp.95-101
• /
• 2014

An n-tuple ($a_1,a_2,{\ldots},a_n$) is symmetric, if $a_k$ = $a_{n-k+1}$, $1{\leq}k{\leq}n$. Let $H_n$ = {$(a_1,a_2,{\ldots},a_n)$ ; $a_k$ ${\in}$ {+,-}, $a_k$ = $a_{n-k+1}$, $1{\leq}k{\leq}n$} be the set of all symmetric n-tuples. A symmetric n-sigraph (symmetric n-marked graph) is an ordered pair $S_n$ = (G,${\sigma}$) ($S_n$ = (G,${\mu}$)), where G = (V,E) is a graph called the underlying graph of $S_n$ and ${\sigma}$:E ${\rightarrow}H_n({\mu}:V{\rightarrow}H_n)$ is a function. The restricted super line graph of index r of a graph G, denoted by $\mathcal{R}\mathcal{L}_r$(G). The vertices of $\mathcal{R}\mathcal{L}_r$(G) are the r-subsets of E(G) and two vertices P = ${p_1,p_2,{\ldots},p_r}$ and Q = ${q_1,q_2,{\ldots},q_r}$ are adjacent if there exists exactly one pair of edges, say $p_i$ and $q_j$, where $1{\leq}i$, $j{\leq}r$, that are adjacent edges in G. Analogously, one can define the restricted super line symmetric n-sigraph of index r of a symmetric n-sigraph $S_n$ = (G,${\sigma}$) as a symmetric n-sigraph $\mathcal{R}\mathcal{L}_r$($S_n$) = ($\mathcal{R}\mathcal{L}_r(G)$, ${\sigma}$'), where $\mathcal{R}\mathcal{L}_r(G)$ is the underlying graph of $\mathcal{R}\mathcal{L}_r(S_n)$, where for any edge PQ in $\mathcal{R}\mathcal{L}_r(S_n)$, ${\sigma}^{\prime}(PQ)$=${\sigma}(P){\sigma}(Q)$. It is shown that for any symmetric n-sigraph $S_n$, its $\mathcal{R}\mathcal{L}_r(S_n)$ is i-balanced and we offer a structural characterization of super line symmetric n-sigraphs of index r. Further, we characterize symmetric n-sigraphs $S_n$ for which $\mathcal{R}\mathcal{L}_r(S_n)$~$\mathcal{L}_r(S_n)$ and $$\mathcal{R}\mathcal{L}_r(S_n){\sim_=}\mathcal{L}_r(S_n)$$, where ~ and $$\sim_=$$ denotes switching equivalence and isomorphism and $\mathcal{R}\mathcal{L}_r(S_n)$ and $\mathcal{L}_r(S_n)$ are denotes the restricted super line symmetric n-sigraph of index r and super line symmetric n-sigraph of index r of $S_n$ respectively.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.2
• /
• pp.361-365
• /
• 2016

This note is a remark on simple observation that the degree bound of Fano (n+1)-folds of Picard number one and index greater than one can be related with that of Fano n-folds of Picard number one and index one.