• Title/Summary/Keyword: Index기법

Search Result 2,241, Processing Time 0.033 seconds

The Index Scheme for User Queries on A Sensor Network Environment (센서 네트워크 환경에서의 질의 색인 기법)

  • Kim, Dong-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.923-926
    • /
    • 2010
  • A sensor network system processes user queries using the recent field data collected by each sensor node. To process user queries, the system propagates the queries to the specific sensor nodes which have the relevant data and aggregates the results of the queries. However, if continuous queries are processed by the existing scheme, the system has the problem where the queries are propagated repeatedly. In this paper, we propose the query processing scheme to process the continuous queries over the sensor streaming data. To do this, each sensor node builds its own query index on its node. And, we present the scheme to deal with the unexpected data rising on the sensor node.

  • PDF

Small Active Command Design for High Density DRAMs

  • Lee, Kwangho;Lee, Jongmin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.11
    • /
    • pp.1-9
    • /
    • 2019
  • In this paper, we propose a Small Active Command scheme which reduces the power consumption of the command bus to DRAM. To do this, we target the ACTIVE command, which consists of multiple packets, containing the row address that occupies the largest size among the addresses delivered to the DRAM. The proposed scheme identifies frequently referenced row addresses as Hot pages first, and delivers index numbers of small caches (tables) located in the memory controller and DRAM. I-ACTIVE and I-PRECHARGE commands using unused bits of existing DRAM commands are added for index number transfer and cache synchronization management. Experimental results show that the proposed method reduces the command bus power consumption by 20% and 8.1% on average in the close-page and open-page policies, respectively.

Design and Performance Analysis of a Parallel Cell-Based Filtering Scheme using Horizontally-Partitioned Technique (수평 분할 방식을 이용한 병렬 셀-기반 필터링 기법의 설계 및 성능 평가)

  • Chang, Jae-Woo;Kim, Young-Chang
    • The KIPS Transactions:PartD
    • /
    • v.10D no.3
    • /
    • pp.459-470
    • /
    • 2003
  • It is required to research on high-dimensional index structures for efficiently retrieving high-dimensional data because an attribute vector in data warehousing and a feature vector in multimedia database have a characteristic of high-dimensional data. For this, many high-dimensional index structures have been proposed, but they have so called ‘dimensional curse’ problem that retrieval performance is extremely decreased as the dimensionality is increased. To solve the problem, the cell-based filtering (CBF) scheme has been proposed. But the CBF scheme show a linear decreasing on performance as the dimensionality. To cope with the problem, it is necessary to make use of parallel processing techniques. In this paper, we propose a parallel CBF scheme which uses a horizontally-partitioned technique as declustering. In order to maximize the retrieval performance of the proposed parallel CBF scheme, we construct our parallel CBF scheme under a SN (Shared Nothing) cluster architecture. In addition, we present a data insertion algorithm, a rage query processing one, and a k-NN query processing one which are suitable for the SN cluster architecture. Finally, we show that our parallel CBF scheme achieves better retrieval performance in proportion to the number of servers in the SN cluster architecture, compared with the conventional CBF scheme.

Evaluation of Highway Traffic Safety using Reliability Theory (신뢰도를 활용한 도로시설 교통안전성 평가기법)

  • Oh, Heung-Un
    • International Journal of Highway Engineering
    • /
    • v.18 no.4
    • /
    • pp.77-82
    • /
    • 2016
  • PURPOSES : This paper proposes a reliability index for the safety evaluation of freeway sections. It establishes a reliability index as a safety surrogate on freeways considering speeds and speed dispersions. METHODS : We collated values of design elements including radii, curve lengths, vertical slopes (absolute values), superelevations, and vertical slopes from seven freeway sections in Korea. We also collected data about driving speeds, traffic accidents, and their deviations. We established a reliability index using these variables. RESULTS : The average radii, curve lengths, and superelevations are highly correlated with the incidence of traffic accidents. Deviations in radius and curve lengths show an especially high correlation. The reliability index, derived from speed and speed dispersions of the seven freeway sections, also correlated highly with accidents with a correlation index of 0.63. CONCLUSIONS : Since the reliability index obtained from speed and speed dispersions are highly correlated with traffic accidents, we conclude that a reliability index can be a safety surrogate on freeways considering speeds and speed dispersions together in terms of design and operational levels.

A Query Result Integrity Assurance Scheme Using an Order-preserving Encryption Scheme in the Database Outsourcing Environment (데이터베이스 아웃소싱 환경에서 순서 보존 암호화 기법을 이용한 질의 결과 무결성 검증 기법)

  • Jang, Miyoung;Chang, Jae Woo
    • Journal of KIISE
    • /
    • v.42 no.1
    • /
    • pp.97-106
    • /
    • 2015
  • Recently, research on database encryption for data protection and query result authentication methods has been performed more actively in the database outsourcing environment. Existing database encryption schemes are vulnerable to order matching and counting attack of intruders who have background knowledge of the original database domain. Existing query result integrity auditing methods suffer from the transmission overhead of verification object. To resolve these problems, we propose a group-order preserving encryption index and a query result authentication method based on the encryption index. Our group-order preserving encryption index groups the original data for data encryption and support query processing without data decryption. We generate group ids by using the Hilbert-curve so that we can protect the group information while processing a query. Finally, our periodic function based data grouping and query result authentication scheme can reduce the data size of the query result verification. Through performance evaluation, we show that our method achieves better performance than an existing bucket-based verification scheme, it is 1.6 times faster in terms of query processing time and produces verification data that is 20 times smaller.

Analysis of setup error at rectal cancer radiotherapy technique (직장암 방사선치료기법별 자세오차에 관한 분석)

  • Kim, Jeong-Ho;Bae, Seok-Hwan;Kim, Ki-Jin;Yu, Se-Jong;Kim, Jee-Yoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.12
    • /
    • pp.6346-6352
    • /
    • 2013
  • Radiotherapy of rectal cancer requires a stabilized image but the movement of patients is almost unavoidable in radiotherapy. In this study, the setup error using the radiation treatment technique was compared according to the loading time and BMI(Body Mass Index) for 14 patients with rectal cancer. In addition, the variation of the dose by the average setup error was compared. Therefore, the technique of a selective standard was established. As a result, 3DCRT(3-Dimensional Radiation Therapy) and VMAT(Volumetric Modulated Arc Therapy) showed a similar time and error. In comparison, IMRT(Intensity Modulated Radiation Therapy) increased the time two fold and the error four fold. In BMI, a more pyknic patient showed a larger error for all techniques. Regarding the dose, IMRT and VMAT increased much more than 3DCRT in the average error at the small bowel. Therefore, 3DCRT of the short time will be applied to pyknic rectal cancer. Moreover, VMAT selects than IMRT in the overexposure of the small bowel.

Fingertip Extraction and Hand Motion Recognition Method for Augmented Reality Applications (증강현실 응용을 위한 손 끝점 추출과 손 동작 인식 기법)

  • Lee, Jeong-Jin;Kim, Jong-Ho;Kim, Tae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.2
    • /
    • pp.316-323
    • /
    • 2010
  • In this paper, we propose fingertip extraction and hand motion recognition method for augmented reality applications. First, an input image is transformed into HSV color space from RGB color space. A hand area is segmented using double thresholding of H, S value, region growing, and connected component analysis. Next, the end points of the index finger and thumb are extracted using morphology operation and subtraction for a virtual keyboard and mouse interface. Finally, the angle between the end points of the index finger and thumb with respect to the center of mass point of the palm is calculated to detect the touch between the index finger and thumb for implementing the click of a mouse button. Experimental results on various input images showed that our method segments the hand, fingertips, and recognizes the movements of the hand fast and accurately. Proposed methods can be used the input interface for augmented reality applications.

Subspace Method Based Preceding for Spatial Multiplexing with Limited Feedback (제한된 피드백 정보를 사용하는 공간 다중화를 위한 부 공간 방식 기반 Precoding 기법)

  • Mun Cheol;Seo Jeong-Tae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.10A
    • /
    • pp.906-911
    • /
    • 2005
  • In this paper, for spatial multiplexing with limited feedback, we propose subspace method based preceding in which the active bases are selected at the receiver from a finite number of basis sets Down at both receiving and transmitting ends, conveyed to the transmitter using limited feedback, and assembled into a preceding matrix at the transmitter. The selected bases are conveyed to the transmitter using feedback information on both the index of the selected basis set, which defines the most appropriate set of coordinates for describing a multiple-input multiple-output (MIMO) channel, and the principal bases maximizing the capacity in the selected basis set. We show that the proposed subspace method based preceding provides a capacity similar to that of the closed-loop MIMO even with limited feedback.

PAPR-minimized Sequence Mapping with Data Space Reduction by Partial Data Side Information in OFDM System (OFDM 시스템에서 부분 데이터 추가정보를 이용한 데이터 공간 감소를 갖는 최대 전력 대 평균 전력 비 최소화 시퀀스 사상 기법)

  • Jin Jiyu;Ryu Kwan Woongn;Park Yong wan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12A
    • /
    • pp.1340-1348
    • /
    • 2004
  • In this paper, we propose a PAPR-minimized sequence mapping scheme that achieves the minimum Peak-to-Average Power Ratio (PAPR) and the minimum amount of computations for the OFDM system. To reduce the PAPR, the mapping table is created with information about block index and symbol patterns of the lower signal power. When the input data sequence comes, it performed division by the block length to find the quotient and remainder. The symbol pattern of the lower signal power can be found in terms of the block index as the quotient in the mapping table and transmitted with remainder as the side information to distinguish and recover the original data sequence in the receiver. The two methods with the proposed mapping scheme are proposed in this paper. One is with mapping table to recover the O%M signal in both transmitter and receiver. The other is with mapping table only in transmitter to reduce the load and the complexity in the mobile system. We show that this algorithm provides the PAPR reduction, the simple processing and less computational complexity to be implemented for the multi-carrier system.

Subspace Method Based Precoding for MIMO Spatial Multiplexing (공간 다중화를 위한 부 공간 방식 Precoding 기법)

  • Mun Cheol;Jung Chang-Kyoo;Park DongHee;Kwak Yoonsik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.6
    • /
    • pp.1161-1166
    • /
    • 2005
  • In this paper, for spatial multiplexing with limited feedback, we propose subspace based precoding in which the active bases are selected at the receiver from a finite number of basis sets known at both receiving and transmitting ends, conveyed to the transmitter using limited feedback, and assembled into a preceding matrix at the transmitter. The selected bases are conveyed to the transmitter using feedback information on both the index of a basis set, which indicates the most appropriate set of coordinates for describing a MIMO channel, and the active bases having the significant amounts of energy in the selected basis set. We show that the proposed subspace based precoding provides capacity similar to that of the closed-loop MIMO even with limited feedback.