• Title/Summary/Keyword: Multi-dimensional

Search Result 2,877, Processing Time 0.03 seconds

Concurrency Control and Recovery Methods for Multi-Dimensional Index Structures (다차원 색인구조를 위한 동시성제어 기법 및 회복기법)

  • Song, Seok-Il;Yoo, Jae-Soo
    • The KIPS Transactions:PartD
    • /
    • v.10D no.2
    • /
    • pp.195-210
    • /
    • 2003
  • In this paper, we propose an enhanced concurrency control algorithm that maximizes the concurrency of multi-dimensional index structures. The factors that deteriorate the concurrency of index structures are node splits and minimum bounding region (MBR) updates in multi-dimensional index structures. The proposed concurrency control algorithm introduces PLC(Partial Lock Coupling) technique to avoid lock coupling during MBR updates. Also, a new MBR update method that allows searchers to access nodes where MBR updates are being performed is proposed. To reduce the performance degradation by node splits the proposed algorithm holds exclusive latches not during whole split time but only during physical node split time that occupies the small part of a whole split process. For performance evaluation, we implement the proposed concurrency control algorithm and one of the existing link technique-based algorithms on MIDAS-3 that is a storage system of a BADA-4 DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm in terms of throughput and response time. Also, we propose a recovery protocol for our proposed concurrency control algorithm. The recovery protocol is designed to assure high concurrency and fast recovery.

Flavor Components of Poncirus trifoliata (탱자(Poncirus trifoliata)의 향기성분 분석에 관한 연구)

  • Oh, Chang-Hwan;Kim, Jung-Han;Kim, Kyoung-Rae;Ahn, Hey-Joon
    • Korean Journal of Food Science and Technology
    • /
    • v.21 no.6
    • /
    • pp.749-754
    • /
    • 1989
  • The essential oil was prepared by a gas co-distillation method from flavedo of Poncirus trifoliata and was analyzed by GC/ retention index (RI) and GC/MS. The essential oil prepared by a gas co-distillation gave a whole fragrance of Poncirus trifoliata. The identification of the flavor components was performed by multi-dimensional analysis using GC/RI and GC/MS. GC/RI and GC/MS were complementary to each other. In applying GC/RI for identification, it was more effective when two columns of different polarities were used. Thirty volatile flavor constituents were identified in Poncirus trifoliata. Limonene, myrcene, ${\beta}-caryophyllene,\;trans-{\beta}-ocimene$, ${\beta}-pinene$, 3-thujene and 7-geranyloxycoumarin were the major constituents and cis-3-hexenyl acetate, n-hexyl acetate, 2-methyl acetophenone, elixene and elemicine had not been reported earlier as citrus components.

  • PDF

The Effect of Food Therapy on Multi-dimensional Health (푸드테라피가 다차원적 건강에 미치는 영향)

  • Jang, Seok-Jong
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.1
    • /
    • pp.222-231
    • /
    • 2018
  • This study aims to examine the effect of food therapy on multi-dimensional health and to suggest valuable information for diet of today's people. The participants were adults over 30 years old, living in Seoul and Gyeonggi district. To examine the effect of food therapy, the study sampled 220 questionnaire out of 230. The multi-dimensional health was measured by Huangdi Neijing's principle on food therapy. And the food therapy was measured by participants' experience, the dosage and the period of the dosage. The data has analyzed by independent sample t-test and multiple regression analysis. The results are as follows: First, the dosage and the period dosage showed significant effect on medical health. Second, no variable showed significant effect on functional health. Third, no variable showed significant effect on subjective health. Therefore, the food therapy showed significant effect on participants' medical health. The result shows that the food therapy has significant effect on people's health.

A MULTI-DIMENSIONAL REDUCTION METHOD OF LARGE-SCALE SURVEY DATABASE

  • Lee, Y.;Kim, Y.S.;Kang, H.W.;Jung, J.H.;Lee, C.H.;Yim, I.S.;Kim, B.G.;Kim, H.G.;Kim, K.T.
    • Publications of The Korean Astronomical Society
    • /
    • v.28 no.1
    • /
    • pp.7-13
    • /
    • 2013
  • We present a multi-dimensional reduction method of the surveyed cube database obtained using a single- dish radio telescope in Taeduk Radio Astronomy Observatory (TRAO). The multibeam receiver system installed at the 14 m telescope in TRAO was not optimized at the initial stage, though it became more stabilized in the following season. We conducted a Galactic Plane survey using the multibeam receiver system. We show that the noise level of the first part of the survey was higher than expected, and a special reduction process seemed to be definitely required. Along with a brief review of classical methods, a multi-dimensional method of reduction is introduced; It is found that the 'background' task within IRAF (Image Reduction and Analysis Facility) can be applied to all three directions of the cube database. Various statistics of reduction results is tested using several IRAF tasks. The rms value of raw survey data is 0.241 K, and after primitive baseline subtraction and elimination of bad channel sections, the rms value turned out to be 0.210 K. After the one-dimensional reduction using 'background' task, the rms value is estimated to be 0.176 K. The average rms of the final reduced image is 0.137 K. Thus, the image quality is found to be improved about 43% using the new reduction method.

A Main Memory-resident Multi-dimensional Index Structure Employing Partial-key and Compression Schemes (부분키 기법과 압축 기법을 혼용한 주기억장치 상주형 다차원 색인 구조)

  • 심정민;민영수;송석일;유재수
    • Journal of KIISE:Databases
    • /
    • v.31 no.4
    • /
    • pp.384-394
    • /
    • 2004
  • Recently, to relieve the performance degradation caused by the bottleneck between CPU and main memory, cache conscious multi-dimensional index structures have been proposed. The ultimate goal of them is to reduce the space for entries so as to widen index trees and minimize the number of cache misses. The existing index structures can be classified into two approaches according to their entry reduction methods. One approach is to compress MBR keys by quantizing coordinate values to the fixed number of bits. The other approach is to store only the sides of minimum bounding regions (MBRs) that are different from their parents partially. In this paper, we propose a new index structure that exploits the properties of the both techniques. Then, we investigate the existing multi-dimensional index structures for main memory database system through experiments under the various work loads. We perform various experiments to show that our approach outperforms others.

Multi-dimensional Contextual Conditions-driven Mutually Exclusive Learning for Explainable AI in Decision-Making

  • Hyun Jung Lee
    • Journal of Internet Computing and Services
    • /
    • v.25 no.4
    • /
    • pp.7-21
    • /
    • 2024
  • There are various machine learning techniques such as Reinforcement Learning, Deep Learning, Neural Network Learning, and so on. In recent, Large Language Models (LLMs) are popularly used for Generative AI based on Reinforcement Learning. It makes decisions with the most optimal rewards through the fine tuning process in a particular situation. Unfortunately, LLMs can not provide any explanation for how they reach the goal because the training is based on learning of black-box AI. Reinforcement Learning as black-box AI is based on graph-evolving structure for deriving enhanced solution through adjustment by human feedback or reinforced data. In this research, for mutually exclusive decision-making, Mutually Exclusive Learning (MEL) is proposed to provide explanations of the chosen goals that are achieved by a decision on both ends with specified conditions. In MEL, decision-making process is based on the tree-based structure that can provide processes of pruning branches that are used as explanations of how to achieve the goals. The goal can be reached by trade-off among mutually exclusive alternatives according to the specific contextual conditions. Therefore, the tree-based structure is adopted to provide feasible solutions with the explanations based on the pruning branches. The sequence of pruning processes can be used to provide the explanations of the inferences and ways to reach the goals, as Explainable AI (XAI). The learning process is based on the pruning branches according to the multi-dimensional contextual conditions. To deep-dive the search, they are composed of time window to determine the temporal perspective, depth of phases for lookahead and decision criteria to prune branches. The goal depends on the policy of the pruning branches, which can be dynamically changed by configured situation with the specific multi-dimensional contextual conditions at a particular moment. The explanation is represented by the chosen episode among the decision alternatives according to configured situations. In this research, MEL adopts the tree-based learning model to provide explanation for the goal derived with specific conditions. Therefore, as an example of mutually exclusive problems, employment process is proposed to demonstrate the decision-making process of how to reach the goal and explanation by the pruning branches. Finally, further study is discussed to verify the effectiveness of MEL with experiments.

Efficient Multi-Step k-NN Search Methods Using Multidimensional Indexes in Large Databases (대용량 데이터베이스에서 다차원 인덱스를 사용한 효율적인 다단계 k-NN 검색)

  • Lee, Sanghun;Kim, Bum-Soo;Choi, Mi-Jung;Moon, Yang-Sae
    • Journal of KIISE
    • /
    • v.42 no.2
    • /
    • pp.242-254
    • /
    • 2015
  • In this paper, we address the problem of improving the performance of multi-step k-NN search using multi-dimensional indexes. Due to information loss by lower-dimensional transformations, existing multi-step k-NN search solutions produce a large tolerance (i.e., a large search range), and thus, incur a large number of candidates, which are retrieved by a range query. Those many candidates lead to overwhelming I/O and CPU overheads in the postprocessing step. To overcome this problem, we propose two efficient solutions that improve the search performance by reducing the tolerance of a range query, and accordingly, reducing the number of candidates. First, we propose a tolerance reduction-based (approximate) solution that forcibly decreases the tolerance, which is determined by a k-NN query on the index, by the average ratio of high- and low-dimensional distances. Second, we propose a coefficient control-based (exact) solution that uses c k instead of k in a k-NN query to obtain a tigher tolerance and performs a range query using this tigher tolerance. Experimental results show that the proposed solutions significantly reduce the number of candidates, and accordingly, improve the search performance in comparison with the existing multi-step k-NN solution.

An Improvement of FSDD for Evaluating Multi-Dimensional Data (다차원 데이터 평가가 가능한 개선된 FSDD 연구)

  • Oh, Se-jong
    • Journal of Digital Convergence
    • /
    • v.15 no.1
    • /
    • pp.247-253
    • /
    • 2017
  • Feature selection or variable selection is a data mining scheme for selecting highly relevant features with target concept from high dimensional data. It decreases dimensionality of data, and makes it easy to analyze clusters or classification. A feature selection scheme requires an evaluation function. Most of current evaluation functions are based on statistics or information theory, and they can evaluate only for single feature (one-dimensional data). However, features have interactions between them, and require evaluation function for multi-dimensional data for efficient feature selection. In this study, we propose modification of FSDD evaluation function for utilizing evaluation of multiple features using extended distance function. Original FSDD is just possible for single feature evaluation. Proposed approach may be expected to be applied on other single feature evaluation method.

Multi-Dimensional Emotion Recognition Model of Counseling Chatbot (상담 챗봇의 다차원 감정 인식 모델)

  • Lim, Myung Jin;Yi, Moung Ho;Shin, Ju Hyun
    • Smart Media Journal
    • /
    • v.10 no.4
    • /
    • pp.21-27
    • /
    • 2021
  • Recently, the importance of counseling is increasing due to the Corona Blue caused by COVID-19. Also, with the increase of non-face-to-face services, researches on chatbots that have changed the counseling media are being actively conducted. In non-face-to-face counseling through chatbot, it is most important to accurately understand the client's emotions. However, since there is a limit to recognizing emotions only in sentences written by the client, it is necessary to recognize the dimensional emotions embedded in the sentences for more accurate emotion recognition. Therefore, in this paper, the vector and sentence VAD (Valence, Arousal, Dominance) generated by learning the Word2Vec model after correcting the original data according to the characteristics of the data are learned using a deep learning algorithm to learn the multi-dimensional We propose an emotion recognition model. As a result of comparing three deep learning models as a method to verify the usefulness of the proposed model, R-squared showed the best performance with 0.8484 when the attention model is used.

Characterization Of Rainrate Fields Using A Multi-Dimensional Precipitation Model

  • Yoo, Chul-sang;Kwon, Snag-woo
    • Water Engineering Research
    • /
    • v.1 no.2
    • /
    • pp.147-158
    • /
    • 2000
  • In this study, we characterized the seasonal variation of rainrate fields in the Han river basin using the WGR multi-dimensional precipitation model (Waymire, Gupta, and Rodriguez-Iturbe, 1984) by estimating and comparing the parameters derived for each month and for the plain area, the mountain area and overall basin, respectively. The first-and second-order statistics derived from observed point gauge data were used to estimate the model parameters based on the Davidon-Fletcher-Powell algorithm of optimization. As a result of the study, we can find that the higher rainfall amount during summer is mainly due to the arrival rate of rain bands, mean number of cells per cluster potential center, and raincell intensity. However, other parameters controlling the mean number of rain cells per cluster, the cellular birth rate, and the mean cell age are found invariant to the rainfall amounts. In the application to the downstream plain area and upstream mountain area of the Han river basin, we found that the number of storms in the mountain area was estimated a little higher than that in the plain area, but the cell intensity in the mountain area a little lower than that in the plain area. Thus, in the mountain area more frequent but less intense storms can be expected due to the orographic effect, but the total amount of rainfall in a given period seems to remain the same.

  • PDF