• Title/Summary/Keyword: in-memory computing

Search Result 766, Processing Time 0.028 seconds

A Lightweight Authentication and Key Agreement Protocol in Wireless Sensor Networks (무선센서 네트워크에서 경량화된 인증과 키 동의 프로토콜)

  • Yoon, Sin-Sook;Ha, Jae-Cheol
    • Journal of Internet Computing and Services
    • /
    • v.10 no.2
    • /
    • pp.41-51
    • /
    • 2009
  • Recently, there are many researches on security to remove vulnerability which is caused by wireless communication in wireless sensor networks. To guarantee secure communication, we should basically provide key management for each node, mutual authentication and key agreement protocol between two nodes. Although many protocols are presented to supply these security services, some of them require plentiful storage memory, powerful computation and communication capacity. In this paper, we propose a lightweight and efficient authentication and key agreement protocol between two sensor nodes, which is an enhanced version of Juang's scheme. In Juang's protocol, sensor node's information used to share a secret key should be transmitted to registration center via a base station. On the contrary, since node's information in our protocol is transmitted up to only base station, the proposed scheme can decrease computation and communication cost for establishing the shared key between two nodes.

  • PDF

Performance Enhancement and Evaluation of Distributed File System for Cloud (클라우드 분산 파일 시스템 성능 개선 및 평가)

  • Lee, Jong Hyuk
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.7 no.11
    • /
    • pp.275-280
    • /
    • 2018
  • The choice of a suitable distributed file system is required for loading large data and high-speed processing through subsequent applications in a cloud environment. In this paper, we propose a write performance improvement method based on GlusterFS and evaluate the performance of MapRFS, CephFS and GlusterFS among existing distributed file systems in cloud environment. The write performance improvement method proposed in this paper enhances the response time by changing the synchronization level used by the synchronous replication method from disk to memory. Experimental results show that the distributed file system to which the proposed method is applied is superior to other distributed file systems in the case of sequential write, random write and random read.

A Resource Planning Policy to Support Variable Real-time Tasks in IoT Systems (사물인터넷 시스템에서 가변적인 실시간 태스크를 지원하는 자원 플래닝 정책)

  • Hyokyung Bahn;Sunhwa Annie Nam
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.4
    • /
    • pp.47-52
    • /
    • 2023
  • With the growing data size and the increased computing load in machine learning, energy-efficient resource planning in IoT systems is becoming increasingly important. In this paper, we suggest a new resource planning policy for real-time workloads that can be fluctuated over time in IoT systems. To handle such situations, we categorize real-time tasks into fixed tasks and variable tasks, and optimize the resource planning for various workload conditions. Based on this, we initiate the IoT system with the configuration for the fixed tasks, and when variable tasks are activated, we update the resource planning promptly for the situation. Simulation experiments show that the proposed policy saves the processor and memory energy significantly.

Fine-tuning BERT-based NLP Models for Sentiment Analysis of Korean Reviews: Optimizing the sequence length (BERT 기반 자연어처리 모델의 미세 조정을 통한 한국어 리뷰 감성 분석: 입력 시퀀스 길이 최적화)

  • Sunga Hwang;Seyeon Park;Beakcheol Jang
    • Journal of Internet Computing and Services
    • /
    • v.25 no.4
    • /
    • pp.47-56
    • /
    • 2024
  • This paper proposes a method for fine-tuning BERT-based natural language processing models to perform sentiment analysis on Korean review data. By varying the input sequence length during this process and comparing the performance, we aim to explore the optimal performance according to the input sequence length. For this purpose, text review data collected from the clothing shopping platform M was utilized. Through web scraping, review data was collected. During the data preprocessing stage, positive and negative satisfaction scores were recalibrated to improve the accuracy of the analysis. Specifically, the GPT-4 API was used to reset the labels to reflect the actual sentiment of the review texts, and data imbalance issues were addressed by adjusting the data to 6:4 ratio. The reviews on the clothing shopping platform averaged about 12 tokens in length, and to provide the optimal model suitable for this, five BERT-based pre-trained models were used in the modeling stage, focusing on input sequence length and memory usage for performance comparison. The experimental results indicated that an input sequence length of 64 generally exhibited the most appropriate performance and memory usage. In particular, the KcELECTRA model showed optimal performance and memory usage at an input sequence length of 64, achieving higher than 92% accuracy and reliability in sentiment analysis of Korean review data. Furthermore, by utilizing BERTopic, we provide a Korean review sentiment analysis process that classifies new incoming review data by category and extracts sentiment scores for each category using the final constructed model.

Analysis on the Performance Impact of Partitioned LLC for Heterogeneous Multicore Processors (이종 멀티코어 프로세서에서 분할된 공유 LLC가 성능에 미치는 영향 분석)

  • Moon, Min Goo;Kim, Cheol Hong
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.15 no.2
    • /
    • pp.39-49
    • /
    • 2019
  • Recently, CPU-GPU integrated heterogeneous multicore processors have been widely used for improving the performance of computing systems. Heterogeneous multicore processors integrate CPUs and GPUs on a single chip where CPUs and GPUs share the LLC(Last Level Cache). This causes a serious cache contention problem inside the processor, resulting in significant performance degradation. In this paper, we propose the partitioned LLC architecture to solve the cache contention problem in heterogeneous multicore processors. We analyze the performance impact varying the LLC size of CPUs and GPUs, respectively. According to our simulation results, the bigger the LLC size of the CPU, the CPU performance improves by up to 21%. However, the GPU shows negligible performance difference when the assigned LLC size increases. In other words, the GPU is less likely to lose the performance when the LLC size decreases. Because the performance degradation due to the LLC size reduction in GPU is much smaller than the performance improvement due to the increase of the LLC size of the CPU, the overall performance of heterogeneous multicore processors is expected to be improved by applying partitioned LLC to CPUs and GPUs. In addition, if we develop a memory management technique that can maximize the performance of each core in the future, we can greatly improve the performance of heterogeneous multicore processors.

Direct construction of a four-dimensional mesh model from a three-dimensional object with continuous rigid body movement

  • Otomo, Ikuru;Onosato, Masahiko;Tanaka, Fumiki
    • Journal of Computational Design and Engineering
    • /
    • v.1 no.2
    • /
    • pp.96-102
    • /
    • 2014
  • In the field of design and manufacturing, there are many problems with managing dynamic states of three-dimensional (3D) objects. In order to solve these problems, the four-dimensional (4D) mesh model and its modeling system have been proposed. The 4D mesh model is defined as a 4D object model that is bounded by tetrahedral cells, and can represent spatio-temporal changes of a 3D object continuously. The 4D mesh model helps to solve dynamic problems of 3D models as geometric problems. However, the construction of the 4D mesh model is limited on the time-series 3D voxel data based method. This method is memory-hogging and requires much computing time. In this research, we propose a new method of constructing the 4D mesh model that derives from the 3D mesh model with continuous rigid body movement. This method is realized by making a swept shape of a 3D mesh model in the fourth dimension and its tetrahedralization. Here, the rigid body movement is a screwed movement, which is a combination of translational and rotational movement.

A study on the estimate of the angular distortion for a fillet weldment (필릿 용접부의 각변형량 예측에 관한 연구)

  • ;;;Lee, S. H.;Cho, S. H.
    • Journal of Welding and Joining
    • /
    • v.15 no.4
    • /
    • pp.63-69
    • /
    • 1997
  • Welding distortion is more serious problem than any other problems caused by welding process, especially, in the heavy-industrial place. These welding distortions are caused by nonuniform heating and cooling of metal during and after welding operations. And these distortion quantities are must be known to worker in production line because distorions are important role in assembling part. Therefore an analytical model to explain and predict the welding distortion are needed. A numerical analysis of welding distortion which is inelastic behavior of weldment would require the three dimensional calculation. But computing time and memory would be very large, and the resulting cost might be unacceptable. Therefore we use a numerical technique for two dimensional analysis in the section normal to the weld direction of weldment under an assumption of quasi-stationary conditions. But the result of the calculation under two dimensional(plane strain) assumption was not satisfied as compared with experimental result. This paper proposed a technique for analysing the welding angular distortion by using a constraint boundary condition on the two dimensional finite element model. The simulation results revealed that the constraint boundary model could more reasonably describe the welding distortion than the plane strain model did.

  • PDF

RFID Information Protection using Biometric Information (생체정보를 이용한 RFID 정보보호)

  • Ahn, Hyo-Chang;Rhee, Sang-Burm
    • Journal of the Korea Computer Industry Society
    • /
    • v.7 no.5
    • /
    • pp.545-554
    • /
    • 2006
  • RFID could be applied in the various fields such as distribution beside, circulation, traffic and environment on information communication outside. So this can speak as point of ubiquitous computing's next generation technology. However, it is discussed problem of RFID security recently, so we must prepare thoroughly about RFID security for secure information. In this paper, we proposed a method which could protect private information and ensure RFID's identification effectively storing face feature information on RFID tag. Our method which is improved linear discriminant analysis has reduced dimension of feature information which has large size of data. Therefore, we can sore face feature information in small memory field of RFID tag. Our propose d algorithm has shown 92% recognition rate in experimental results and can be applied to entrance control management system, digital identification card and others.

  • PDF

RFID Authenticated Encryption Scheme of Multi-entity by Elliptic Curve's Coordinates (타원곡선 좌표계를 이용한 RFID 다중객체 간 인증 암호기법)

  • Kim, Sung-Jin;Park, Seok-Cheon
    • Journal of Internet Computing and Services
    • /
    • v.9 no.3
    • /
    • pp.43-50
    • /
    • 2008
  • Authenticated Encryption scheme in RFID system is the important issue for ID security. But, implementing authenticated Encryption scheme in RFID systems is not an easy proposition and systems are often delivered for reasons of complexity, limited resources, or implementation, fail to deliver required levels of security. RFID system is so frequently limited by memory, performance (or required number of gates) and by power drain, that lower levels of security are installed than required to protect the information. In this paper, we design a new authenticated encryption scheme based on the EC(Elliptic Curve)'s x-coordinates and scalar operation. Our scheme will be offers enhanced security feature in RFID system with respect to user privacy against illegal attack allowing a ECC point addition and doubling operation.

  • PDF

On the Availability of Anti-Forensic Tools for Android Smartphones (안드로이드 스마트폰을 위한 앤티-포렌식 도구들의 활용성)

  • Moon, Phil-Joo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.6
    • /
    • pp.855-861
    • /
    • 2013
  • Smartphone is very useful for use in the real life through the improvement of computing power, faster data rate and the variety of applications. On the other hand, using the smartphone has been exposed to a lot of crime. Also, it occurs attempting to delete a data of smartphone memory by anti-forensic tools. In this paper, we investigate and analyze the anti-forensic tools used in the Android smartphone to study the characteristics and techniques of anti-forensic tools. In addition, experiments are performed to validate the availability of anti-forensic tools by the Oxygen Forensic Suite that is a commercial forensic tool.