• Journal of Computing Science and Engineering
• /
• v.1 no.2
• /
• pp.177-194
• /
• 2007

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1A
• /
• pp.26-34
• /
• 2002

Mobile telecommunication systems such as IS-95 and IMT-2000 employ frame based communication using frames up to 20 msec in length and the receiving end has to store the whole frome before it is being processed. The size of the frame buffer ofter dominates those of the processing unit such as soft decision Viterbi decoder. The frame buffer for IMT-2000, for example, has to be increased 80 times as large as that of IS-95. One of the parameters deciding the number of bits in a frame will be obviously the number of bits in soft quantization. Start after striking space key 2 times. This paper has studied a new aspect of offset and quantization step size on BER performance and proposes a new 3-bit soft quantization algorithm which shows similar performance as that of 4-bit soft decision Viterbi receiver. The optimal offset values and step sizes for the other practical quantization levels ---16, 8, 4, 2--- have also been found. In addition, a new optimal symbol metric table has been devised which takes the accumulation value of various repeated signals and produces a rescaled 3-bit valu.tart after striking space key 2 times.

• KIPS Transactions on Software and Data Engineering
• /
• v.12 no.5
• /
• pp.199-206
• /
• 2023

The current software becomes the huge size of source codes. Therefore it is increasing the importance and necessity of static analysis for high-quality product. With static analysis of the code, it needs to identify the defect and complexity of the code. Through visualizing these problems, we make it guild for developers and stakeholders to understand these problems in the source codes. Our previous visualization research focused only on the process of storing information of the results of static analysis into the Database tables, querying the calculations for quality indicators (CK Metrics, Coupling, Number of function calls, Bad-smell), and then finally visualizing the extracted information. This approach has some limitations in that it takes a lot of time and space to analyze a code using information extracted from it through static analysis. That is since the tables are not normalized, it may occur to spend space and time when the tables(classes, functions, attributes, Etc.) are joined to extract information inside the code. To solve these problems, we propose a regularized design of the database tables, an extraction mechanism for quality metric indicators inside the code, and then a visualization with the extracted quality indicators on the code. Through this mechanism, we expect that the code visualization process will be optimized and that developers will be able to guide the modules that need refactoring. In the future, we will conduct learning of some parts of this process.

• Journal of the Korean Mathematical Society
• /
• v.39 no.5
• /
• pp.783-800
• /
• 2002

Let B denote the unit ball in $C^n$, and ν the normalized Lebesgue measure on B. For $\alpha$ > -1, define $dv_\alpha$(z) ＝ $c_\alpha$$(1-\midz\mid^2)^{\alpha}$dν(z), z $\in$ B. Here $c_\alpha$ is a positive constant such that $v_\alpha$(B) ＝ 1. Let H(B) denote the space of all holomorphic functions in B. For $p\geq1$, define the Bergman-Privalov space $(AN)^{p}(v_\alpha)$ by $(AN)^{p}(v_\alpha)$ = ${f\inH(B)$ : $\int_B{log(1+\midf\mid)}^pdv_\alpha\;<\;\infty}$ In this paper we prove that a function $f\inH(B)$ is in $(AN)^{p}$$(v_\alpha)$ if and only if $(1+\midf\mid)^{-2}{log(1+\midf\mid)}^{p-2}\mid\nablaf\mid^2\;\epsilon\;L^1(v_\alpha)$ in the case 1＜p＜$\infty$, or $(1+\midf\mid)^{-2}\midf\mid^{-1}\mid{\nabla}f\mid^2\;\epsilon\;L^1(v_\alpha)$ in the case p ＝ 1, where $nabla$f is the gradient of f with respect to the Bergman metric on B. This is an analogous result to the characterization of the Hardy spaces by M. Stoll [18] and that of the Bergman spaces by C. Ouyang-W. Yang-R. Zhao [13].

• Journal of The Korean Astronomical Society
• /
• v.42 no.3
• /
• pp.55-60
• /
• 2009

The properties of SOHO/LASCO CMEs are subjected to projection effects. Their dependence on the source position is important to be studied. Our main aim is to study the dependence of CME properties on helio-longitude and latitude using the CMEs associated with type IIs observed by Wind/WAVES spacecraft (Deca-hecta metric type IIs - DH type IIs). These CMEs were identified as a separate population of geo-effective CMEs. We considered the CMEs associated with the Wind/WAVE type IIs observed during the period January 1997 - December 2005. The source locations of these CMEs were identified using their associated GOES X-ray flares and listed online. Using their locations and the cataloged properties of CMEs, we carried out a study on the dependence of CME properties on source location. We studied the above for three groups of CMEs: (i) all CMEs, (ii) halo and non-halo CMEs, and (iii) limb and non-limb CMEs. Major results from this study can be summarized as follows. (i) There is a clear dependence of speed on both the longitude and latitude; while there is an increasing trend with respect to longitude, it is opposite in the case of latitude. Our investigations show that the longitudinal dependence is caused by the projection effect and the latitudinal effect by the solar cycle effect. (ii) In the case of width, the disc centered events are observed with more width than those occurred at higher longitudes, and this result seems to be the same for latitude. (iii) The dependency of speed is confirmed on the angular distance between the sun-center and source location determined using both the longitude and latitude. (iv) There is no dependency found in the case of acceleration. (v) Among all the three groups of CMEs, the speeds of halo CMEs show more dependency on longitude. The speed of non-halo and non-limb CMEs show more dependency on latitude. The above results may be taken into account in correcting the projection effects of geo-effective CMEs.

• Korean Journal of Optics and Photonics
• /
• v.19 no.4
• /
• pp.270-275
• /
• 2008

This paper addresses occluded object reconstruction and recognition with computational integral imaging (II). Integral imaging acquires and reconstructs target information in the three-dimensional (3D) space. The reconstruction is performed by averaging the intensities of the corresponding pixels. The distance to the object is estimated by minimizing the sum of the standard deviation of the pixels. We adopt principal component analysis (PCA) to classify occluded objects in the reconstruction space. The Euclidean distance is employed as a metric for decision making. Experimental and simulation results show that occluded targets are successfully classified by the proposed method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.976-978
• /
• 2005

We present a nearly optimal ($O(\nu\;min(\nu,\;n)n\;log\;n)$ time and O(n) srace) algorithm that constructs a shortest path map with n isothetic roads of speed $\nu$ under the $L_1$ metric. The algorithm uses the continuous Dijkstra method and its efficiency is based on a new geometric insight; the minimum in-degree of any nearest neighbor graph for points with roads of speed $\nu$ is $\Theta(\nu\;min(\nu,\;n))$, which is first shown in this paper. Also, this algorithm naturally extends to the multi-source case so that the Voronoi diagram for m sites can be computed in $O(\nu\;min(\nu,\;n)(n+m)log(n+m))$ time and O(n+m) space, which is also nearly optimal.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.545-553
• /
• 2009

String matching is a fundamental element of an important category of modern packet processing applications which involve scanning the content flowing through a network for thousands of strings at the line rate. To keep pace with high network speeds, specialized hardware-based solutions are needed which should be efficient enough to maintain scalability in terms of speed and the number of strings. In this paper, a novel architecture based upon a recently proposed data structure called the Bloomier filter is proposed which can successfully support scalability. The Bloomier filter is a compact data structure for encoding arbitrary functions, and it supports approximate evaluation queries. By eliminating the Bloomier filter's false positives in a space efficient way, a simple yet powerful exact string matching architecture is proposed that can handle several thousand strings at high rates and is amenable to on-chip realization. The proposed scheme is implemented in reconfigurable hardware and we compare it with existing solutions. The results show that the proposed approach achieves better performance compared to other existing architectures measured in terms of throughput per logic cells per character as a metric.

• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.4
• /
• pp.325-334
• /
• 2006

For $f{\in}L^2(B,d{\nu})$, ${\parallel}f{\parallel}_{BMO}=\widetilde{{\mid}f{\mid}^2}(z)-{\mid}{\tilde{f}}(z){\mid}^2$. For f continuous on B, ${\parallel}f{\parallel}_{BO}=sup\{w(f)(z):z{\in}B\}$ where $w(f)(z)=sup\{{\mid}f(z)-f(w){\mid}:{\beta}(z,w){\leq}1\}$. In this paper, we will show that if $f{\in}BMO$, then ${\parallel}f{\parallel}_{BO}{\leq}M{\parallel}f{\parallel}_{BMO}$. We will also show that if $f{\in}BO$, then ${\parallel}f{\parallel}_{BMO}{\leq}M{\parallel}f{\parallel}_{BO}^2$. A homomorphic function $f:B{\rightarrow}{\mathbb{C}}$ is called a Bloch function ($f{\in}{\mathcal{B}}$) if ${\parallel}f{\parallel}_{\mathcal{B}}=sup_{z{\in}B}\;Qf(z)$<${\infty}$. In this paper, we will show that if $f{\in}{\mathcal{B}}$, then ${\parallel}f{\parallel}_{BO}{\leq}{\parallel}f{\parallel}_{\mathcal{B}}$. We will also show that if $f{\in}BMO$ and f is holomorphic, then ${\parallel}f{\parallel}_{\mathcal{B}}^2{\leq}M{\parallel}f{\parallel}_{BMO}$.

• Journal of the Korean Statistical Society
• /
• v.30 no.2
• /
• pp.179-192
• /
• 2001

When a statistical model has a hierarchical structure such as multilayer perceptrons in neural networks or Gaussian mixture density representation, the model includes distribution with unidentifiable parameters when the structure becomes redundant. Since the exact structure is unknown, we need to carry out statistical estimation or learning of parameters in such a model. From the geometrical point of view, distributions specified by unidentifiable parameters become a singular point in the parameter space. The problem has been remarked in many statistical models, and strange behaviors of the likelihood ratio statistics, when the null hypothesis is at a singular point, have been analyzed so far. The present paper studies asymptotic behaviors of the maximum likelihood estimator and the Bayesian predictive estimator, by using a simple cone model, and show that they are completely different from regular statistical models where the Cramer-Rao paradigm holds. At singularities, the Fisher information metric degenerates, implying that the cramer-Rao paradigm does no more hold, and that he classical model selection theory such as AIC and MDL cannot be applied. This paper is a first step to establish a new theory for analyzing the accuracy of estimation or learning at around singularities.