• Title/Summary/Keyword: min-hash

Search Result 48, Processing Time 0.021 seconds

An efficient algorithm for hash-join on NUMA architecture (NUMA 구조 기반의 효율적인 해시 조인 알고리즘)

  • Choe, Seongjun;Kim, Hongyeon;Min, Jun-Ki
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.05a
    • /
    • pp.300-303
    • /
    • 2018
  • 최근, 불균일 기억 장치 접근 (NUMA) 구조가 부각됨에 따라 NUMA 구조 기반의 관계 연산 기법들이 제안되고 있다. 본 논문에서는 NUMA 구조 기반의 효율적인 해시 조인 기법을 제안한다. NUMA 구조에서 조인 속성 값의 분포가 편중된 릴레이션들 간의 조인은 NUMA 노드들 간의 부하 불균형과 과도한 원격 메모리 접근을 발생시킬 수 있다. 제안 기법에서는 근사 히스토그램을 이용하여 조인 속성 값의 분포를 파악하고, 이를 기반으로 원격 메모리 접근을 줄이는 전달 방안을 제안한다. 실험에서는 입력 릴레이션들에 대해 조인 속성 값의 분포를 변화시키면서 제안 기법에 대한 성능을 평가한다.

Design and Performance Evaluation of an Efficient Index Mechanism for Real-Time MMDBMS (실시간 MMDBMS 를 위한 효율적인 색인 기법의 설계 및 성능평가)

  • Min, Young-Soo;Shin, Jae-Ryong;Yoo, Jae-Soo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.04a
    • /
    • pp.61-64
    • /
    • 2001
  • 본 논문에서는 실시간 MMDBMS 를 위한 효율적인 색인 기법을 제안한다. 기존의 주기억장치 트리 기반 색인 구조는 범위 검색을 효과적으로 지원할 수 있지만 한 노드에 대한 접근시간과 평균 접근시간의 차이가 클 수 있기 때문에 실시간 특성을 보장하지 못하는 단점이 있다. 또한 해시 기반 색인 구조는 간단한 검색에서 접근 시간이 매우 빠르고 일정하지만 범위 검색을 지원하지 못하는 단점이 있다. 이러한 두 색인 구조의 단점을 해결하기 위해 본 논문에서는 동적 확장이 가능하며 검색 시간이 빠르고 실시간 특성을 지원할 수 있는 ECBH(Extendible Chained Bucket Hashing)와 범위 검색에 더욱 효과적인 $T^{\ast}$-트리를 상호보완적으로 결합하여 Hyper-TH(Hyper Tree-Hash)라는 실시간 MMDBMS 에 적합한 새로운 색인 기법을 제안하고 구현한다. 그리고 성능 평가를 통해 제안하는 색인 기법의 우수성을 증명한다.

  • PDF

The Effects of Social Media Advertising on Social Search in China: Evidence from Luxury Brand

  • GAO, XING;Kim, Sang Yong;Kim, Da Yeon;Lee, Seung Min
    • Asia Marketing Journal
    • /
    • v.21 no.3
    • /
    • pp.65-82
    • /
    • 2019
  • This study examines the relationship between social media advertisement and customer interest in the context of luxury brands. Further, this study investigates the effective ways to utilize visual types (pictorial advertisement and video advertisement) and contents types (website link and hash-tag) in social media advertising by proposing a time-series model to estimate the long-term effect of social media advertising on social search. We find that the pictorial advertisements are more effective than video advertisements, which provides a different result from previous existing research. In addition, advertisements using hashtags are more effective than web links due to efficiency of the search feature. Finally, since the number of brand fans also have a positive effect on advertising interest, it is essential to utilize social media advertising for the enhancement of customers' interests. Confirming that the effectiveness of social media advertising varies depending on how the visual contents and text are presented, this research can help marketing managers to assess predicted outcomes of using various methods of social media advertising.

Renewable energy trends and relationship structure by SNS big data analysis (SNS 빅데이터 분석을 통한 재생에너지 동향 및 관계구조)

  • Jong-Min Kim
    • Convergence Security Journal
    • /
    • v.22 no.1
    • /
    • pp.55-60
    • /
    • 2022
  • This study is to analyze trends and relational structures in the energy sector related to renewable energy. For this reason, in this study, we focused on big data including SNS data. SNS utilizes the Instagram platform to collect renewable energy hash tags and use them as a word embedding method for big data analysis and social network analysis, and based on the results derived from this research, it will be used for the development of the renewable energy industry. It is expected that it can be utilized.

Classification Method of Sleep Induction Sounds in Sleep Care Service based on Brain Wave (뇌파에 기반한 수면케어 서비스에서 수면유도음향의 분류기법)

  • Wi, Hyeon Seung;Lee, Byung Mun
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.11
    • /
    • pp.1406-1417
    • /
    • 2020
  • Sounds that have been evaluated to be effective in inducing sleep are helpful to reduce sleep disorders. Generally, several sounds have been verified the effects by brainwave experiments, but it cannot be considered on all users because of individual variation for effects. Moreover, the effectiveness for inducing sleep is not known for all new sounds made by creative activities. Therefore, new classification system is required to collect new effective sounds with considering personal brainwave characteristics. In this paper, we propose a new sound classification method by applying improved MinHash cluster to brain waves. The proposed method will classify them through whether it is effective for sleep care by evaluation his brainwave during listening for each sound. In order to prove effectiveness of the proposed classification method, we conducted accuracy experiment for sleep sound classification using verified sleep induction sound. In addition, we have compared time for existing method and proposed method. The former is scored 85% accuracy in the experiment. We confirmed the latter one that the average processing time was reduced to 70%. It is expected to be one of method for pre-screening whether it is effective when a new sound is introduced as a sound for sleep induction.

Proposal of Process Hollowing Attack Detection Using Process Virtual Memory Data Similarity (프로세스 가상 메모리 데이터 유사성을 이용한 프로세스 할로윙 공격 탐지)

  • Lim, Su Min;Im, Eul Gyu
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.29 no.2
    • /
    • pp.431-438
    • /
    • 2019
  • Fileless malware uses memory injection attacks to hide traces of payloads to perform malicious works. During the memory injection attack, an attack named "process hollowing" is a method of creating paused benign process like system processes. And then injecting a malicious payload into the benign process allows malicious behavior by pretending to be a normal process. In this paper, we propose a method to detect the memory injection regardless of whether or not the malicious action is actually performed when a process hollowing attack occurs. The replication process having same execution condition as the process of suspending the memory injection is executed, the data set belonging to each process virtual memory area is compared using the fuzzy hash, and the similarity is calculated.

A Study on Efficient Data De-Identification Method for Blockchain DID

  • Min, Youn-A
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.60-66
    • /
    • 2021
  • Blockchain is a technology that enables trust-based consensus and verification based on a decentralized network. Distributed ID (DID) is based on a decentralized structure, and users have the right to manage their own ID. Recently, interest in self-sovereign identity authentication is increasing. In this paper, as a method for transparent and safe sovereignty management of data, among data pseudonymization techniques for blockchain use, various methods for data encryption processing are examined. The public key technique (homomorphic encryption) has high flexibility and security because different algorithms are applied to the entire sentence for encryption and decryption. As a result, the computational efficiency decreases. The hash function method (MD5) can maintain flexibility and is higher than the security-related two-way encryption method, but there is a threat of collision. Zero-knowledge proof is based on public key encryption based on a mutual proof method, and complex formulas are applied to processes such as personal identification, key distribution, and digital signature. It requires consensus and verification process, so the operation efficiency is lowered to the level of O (logeN) ~ O(N2). In this paper, data encryption processing for blockchain DID, based on zero-knowledge proof, was proposed and a one-way encryption method considering data use range and frequency of use was proposed. Based on the content presented in the thesis, it is possible to process corrected zero-knowledge proof and to process data efficiently.

Reversible Data Hiding and Message Authentication for Medical Images (의료영상을 위한 복원 가능한 정보 은닉 및 메시지 인증)

  • Kim, Cheon-Shik;Yoon, Eun-Jun;Jo, Min-Ho;Hong, You-Sik
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.1
    • /
    • pp.65-72
    • /
    • 2010
  • Nowadays, most hospitals have been used to create MRI or CT and managed them. Doctors depend on fast access to images such as magnetic resonance imaging (MRIs), computerized tomography (CT) scans, and X-rays for accurate diagnoses. Those image data are related privacy of a patient. Therefore, it should be protected from hackers and managed perfectly. In this paper, we propose a data hiding method into MRI or CT related a condition and intervention of a patient, and it is suggested that how to authenticate patient information from an image. In this way, we create hash code using HMAC with patient information, and hash code and patient information is hided into an image. After then, doctor will check authentication using HMAC. In addition, we use a reversible data hiding DE(Difference Expansion) algorithm to hide patient information. This technique is possible to reconstruct the original image with stego image. Therefore, doctor can easily be possible to check condition of a patient. As a consequence of an experiment with MRI image, data hiding, extraction and reconstruct is shown compact performance.

Sorting Cuckoo: Enhancing Lookup Performance of Cuckoo Hashing Using Insertion Sort (Sorting Cuckoo: 삽입 정렬을 이용한 Cuckoo Hashing의 입력 연산의 성능 향상)

  • Min, Dae-hong;Jang, Rhong-ho;Nyang, Dae-hun;Lee, Kyung-hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.3
    • /
    • pp.566-576
    • /
    • 2017
  • Key-value stores proved its superiority by being applied to various NoSQL databases such as Redis, Memcached. Lookup performance is important because key-value store applications performs more lookup than insert operations in most environments. However, in traditional applications, lookup may be slow because hash tables are constructed out of linked-list. Therefore, cuckoo hashing has been getting attention from the academia for constant lookup time, and bucketized cuckoo hashing (BCH) has been proposed since it can achieve high load factor. In this paper, we introduce Sorting Cuckoo which inserts data using insertion sort in BCH structure. Sorting Cuckoo determines the existence of a key with a relatively small memory access because data are sorted in each buckets. In particular, the higher memory load factor, the better lookup performance than BCH's. Experimental results show that Sorting Cuckoo has smaller memory access than BCH's as many as about 19 million (25%) in 10 million negative lookup operations (key is not in the table), about 4 million times (10%) in 10 million positive lookup operations (where it is) with load factor 95%.

A Security SoC embedded with ECDSA Hardware Accelerator (ECDSA 하드웨어 가속기가 내장된 보안 SoC)

  • Jeong, Young-Su;Kim, Min-Ju;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.7
    • /
    • pp.1071-1077
    • /
    • 2022
  • A security SoC that can be used to implement elliptic curve cryptography (ECC) based public-key infrastructures was designed. The security SoC has an architecture in which a hardware accelerator for the elliptic curve digital signature algorithm (ECDSA) is interfaced with the Cortex-A53 CPU using the AXI4-Lite bus. The ECDSA hardware accelerator, which consists of a high-performance ECC processor, a SHA3 hash core, a true random number generator (TRNG), a modular multiplier, BRAM, and control FSM, was designed to perform the high-performance computation of ECDSA signature generation and signature verification with minimal CPU control. The security SoC was implemented in the Zynq UltraScale+ MPSoC device to perform hardware-software co-verification, and it was evaluated that the ECDSA signature generation or signature verification can be achieved about 1,000 times per second at a clock frequency of 150 MHz. The ECDSA hardware accelerator was implemented using hardware resources of 74,630 LUTs, 23,356 flip-flops, 32kb BRAM, and 36 DSP blocks.