• ETRI Journal
• /
• 제36권6호
• /
• pp.988-998
• /
• 2014

For memory-based big data storage, using hybrid memories consisting of both dynamic random-access memory (DRAM) and non-volatile random-access memories (NVRAMs) is a promising approach. DRAM supports low access time but consumes much energy, whereas NVRAMs have high access time but do not need energy to retain data. In this paper, we propose a new data migration method that can dynamically move data pages into the most appropriate memories to exploit their strengths and alleviate their weaknesses. We predict the access frequency values of the data pages and then measure comprehensively the gains and costs of each placement choice based on these predicted values. Next, we compute the potential benefits of all choices for each candidate page to make page migration decisions. Extensive experiments show that our method improves over the existing ones the access response time by as much as a factor of four, with similar rates of energy consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권6호
• /
• pp.1600-1619
• /
• 2023

Organizations and other institutions have recently started using cloud service providers to store and share information in light of the Internet of Things (IoT). The major issues with this storage are preventing unauthorized access and data theft from outside parties. The Block chain based Security Sharing scheme with Data Access Control (BSSDAC) was implemented to improve access control and secure data transaction operations. The goal of this research is to strengthen Data Access Control (DAC) and security in IoT applications. To improve the security of personal data, cypher text-Policy Attribute-Based Encryption (CP-ABE) can be developed. The Aquila Optimization Algorithm (AOA) generates keys in the CP-ABE. DAC based on a block chain can be created to maintain the owner's security. The block chain based CP-ABE was developed to maintain secures data storage to sharing. With block chain technology, the data owner is enhancing data security and access management. Finally, a block chain-based solution can be used to secure data and restrict who has access to it. Performance of the suggested method is evaluated after it has been implemented in MATLAB. To compare the proposed method with current practices, Rivest-Shamir-Adleman (RSA) and Elliptic Curve Cryptography (ECC) are both used.

• ETRI Journal
• /
• 제9권3호
• /
• pp.33-42
• /
• 1987

본고는 UNIX O/S(System V)에서 C-언어로 구현된 전전자교환기(TDX-1A) 집중보전시스팀(CSMS-TDX)의 데이터베이스 접근방법을 중심으로 메시지 수집 시스팀에 필요한 기본적인 데이터베이스 모형과 이러한 모형을 활용하기 위해 구현된 access method interface의 각종 알고리즘을 설명한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5497-5512
• /
• 2016

An improved optimal weights based on parallel interference cancellation algorithm has been proposed to cancel for interference induced by multi-user access satellite to ground uplink system. Due to differences in elevation relative motion between the user and the satellite, as well as access between users, resulting in multi-user access interference (Multi-user Access Interference, MUI), which significantly degrade system performance when multi-user access. By steepest gradient method, it obtained based on the MMSE criterion, parallel interference cancellation adjust optimal weights to obtain the maximum SINR. Compared to traditional parallel interference cancellation (Parallel Interference Cancellation, PIC) algorithm or serial interference cancellation ( Successive interference Cancellation, SIC), the accuracy of which is not high and too many complex iterations, we establish the multi-user access to the satellite to ground up link system to demonstrate that the improved WPIC algorithm could be provided with high accuracy and relatively low number of iterations.

• 정보보호학회논문지
• /
• 제13권1호
• /
• pp.147-155
• /
• 2003

인터넷 인프라의 보급과 이용인구의 급속한 증가는 off-line을 통해서 물리적으로 제공받아 이용하던 다양한 정보와 자료, 그리고 디지탈 컨텐츠를 인터넷을 통해서 쉽고 빠르게 이용할 수 있는 서비스의 기반이 되고 있다. 그러나 인터넷 서비스를 통해서 제공되는 다양한 컨텐츠의 저작권 보호와 불법 복제 등과 같은 문제는 해당 사업의 발전을 저해하는 위험요소가 되고 있다. 이와 같은 문제를 해결하기 위한 방안으로 컨텐츠를 이용할 수 있는 정당한 자격을 소유한 사용자만이 해당 컨텐츠를 정상적으로 이용할 수 있도록 하는 접근제어(Access Control, AC) 기술이 연구되고 있다. 위성 방송에서 사용되고 있는 제한수신 시스템(Conditional Access System, CAS)과 인터넷 컨텐츠 서비스에 사용되고 있는 디지탈 저작권 관리 시스템(Distal Right Management System DRMS)은 현재 상용화되어 있는 AC의 대표적인 모델이라 할 수 있다. CAS와 DRMS는 지불 구조에 기반을 둔 형태(Payment Based Type, PBT)의 AC 기술이라 할 수 있다. 본 논문에서는 ［5］에서 제시된 지불 구조에 독립적인 형태(Payment Free Type, PFT)의 AC를 위한 보안 체계를 살펴보고, 각각의 특징을 간략하게 정리한다. 또한 효과적인 운영을 위한 PRT 기반의 새로운 AC 구조를 제시한다.

• Journal of Medicine and Life Science
• /
• 제20권3호
• /
• pp.115-125
• /
• 2023

Arteriovenous fistula flow dysfunction is the leading cause of vascular access thrombosis and loss in patients undergoing hemodialysis. However, data regarding the influence of access flow rate measurements on the long-term outcomes of access are limited. This study aims to identify accesses at a high risk of thrombosis and loss among patients undergoing hemodialysis by measuring the access flow rate and exploring an optimal threshold value for predicting future access thrombosis. We enrolled 220 patients with arteriovenous fistula undergoing hemodialysis. The primary outcome was the occurrence of access thrombosis. Access flow rates were measured monthly using the ultrasound dilution method and were averaged using all measurements from patients with patent access. In patients experienced access thrombosis, those immediately before the thrombosis were selected. Using these data, we calculated the access flow rate threshold for thrombosis occurrence by analyzing the receiver operating characteristic curve, and the patients were divided into two groups according to whether access flow rates were higher or lower than 400 mL/min. During a median follow-up period of 3.1 years, 4,510 access flows were measured (median measurements per patient, 33 times; interquartile range, 11-54). A total of 65 access thromboses and 19 abandonments were observed. Access thrombosis and loss were higher in the lowflow group than in the high-flow group. This study revealed that low access flow rates are strongly associated with access thrombosis occurrence and subsequent loss of arteriovenous fistulas in patients undergoing hemodialysis.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제13권5호
• /
• pp.443-450
• /
• 2013

This paper propose a new ROM data encoding method that takes into account of a sequential access pattern to reduce the power consumption in ROMs used in applications such as FIR filters that access the ROM sequentially. In the proposed encoding method, the number of 1's, of which the increment leads to the increase of the power consumption, is reduced by applying an exclusive-or (XOR) operation to a bit pair composed of two consecutive bits in a bit line. The encoded data can be decoded by using XOR gates and D flip-flops, which are usually used in digital systems for synchronization and glitch suppression. By applying the proposed encoding method to coefficient ROMs of FIR filters designed by using various design methods, we can achieve average reduction of 43.7% over the unencoded original data in the power consumption, which is larger reduction than those achieved by previous methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5671-5693
• /
• 2017

With the rapid development of cloud computing, more and more data owners are motivated to outsource their data to cloud for various benefits. Due to serious privacy concerns, sensitive data should be encrypted before being outsourced to the cloud. However, this results that effective data utilization becomes a very challenging task, such as keyword search over ciphertexts. Although many searchable encryption methods have been proposed, they only support exact keyword search. Thus, misspelled keywords in the query will result in wrong or no matching. Very recently, a few methods extends the search capability to fuzzy keyword search. Some of them may result in inaccurate search results. The other methods need very large indexes which inevitably lead to low search efficiency. Additionally, the above fuzzy keyword search methods do not support access control. In our paper, we propose a searchable encryption method which achieves fuzzy search and access control through algorithm design and Ciphertext-Policy Attribute-based Encryption (CP-ABE). In our method, the index is small and the search results are accurate. We present word pattern which can be used to balance the search efficiency and privacy. Finally, we conduct extensive experiments and analyze the security of the proposed method.

• 한국컴퓨터정보학회논문지
• /
• 제6권4호
• /
• pp.146-153
• /
• 2001

본 논문에서는 웹 페이지 운영자가 웹 서버에 패스워드로 보호된 웹 영역을 배치시키는데 편리함을 제공하는 목적으로 새로운 패스워드 인증 방안을 제안한다. 이 방법에 따라 웹 영역은 접근 제한된 웹 페이지가 저장된 웹서버의 보안 디렉토리에 연결된다. 패스워드는 보안 디렉토리의 이름을 생성하는데 사용되며, 자바스크립트 코드는 보안 디렉토리영역 외부의 인증 웹 페이지에 포함된다. 이 스크립트 코드는 사용자가 입력한 패스워드를디렉토리 이름으로 변환시키고, 보안 디렉토리 내부의 접근 제한된 웹 페이지를 지시하는 완전한 URL을 형성한다. 따라서, 패스워드를 아는 사용자만이 유효한 URL을 구성할 수 있고, 접근 제한된 웹 페이지를 검색할 수 있다. 이 방법에 따라, 웹 페이지 운영자는 서버 독립적인 방식으로 패스워드로 보호된 웹 영역을 배치할 수 있다.

• Journal of Electrical Engineering and information Science
• /
• 제1권2호
• /
• pp.134-144
• /
• 1996

In this paper, we propose a new access method, called the HG-tree, to support indexing and retrieval by image content in large image databases. Image content is represented by a point in a multidimensional feature space. The types of queries considered are the range query and the nearest-neighbor query, both in a multidimensional space. Our goals are twofold: increasing the storage utilization and decreasing the area covered by the directory regions of the index tree. The high storage utilization and the small directory area reduce the number of nodes that have to be touched during the query processing. The first goal is achieved by absorbing splitting if possible, and when splitting is necessary, converting two nodes to three. The second goal is achieved by maintaining the area occupied by the directory region minimally on the directory nodes. We note that there is a trade-off between the two design goals, but the HG-tree is so flexible that it can control the trade-off. We present the design of our access method and associated algorithms. In addition, we report the results of a series of tests, comparing the proposed access method with the buddy-tree, which is one of the most successful point access methods for a multidimensional space. The results show the superiority of our method.