• Journal of Computing Science and Engineering
• /
• 제9권1호
• /
• pp.1-8
• /
• 2015

Accessing and searching in a sequence of numbers are fundamental operations in computing that are encountered in a wide range of applications. One of the applications of the problem is cryptanalytic time-memory tradeoff which is aimed at a one-way function. A rainbow table, which is a common method for the time-memory tradeoff, contains elements from an input domain of a hash function that are normally sorted integers. In this paper, we present a practical indexing method for a monotonically increasing static sequence of numbers where the access and search queries can be addressed efficiently in terms of both time and space complexity. For a sequence of n numbers from a universe $U=\{0,{\ldots},m-1\}$, our data structure requires n lg(m/n) + O(n) bits with constant average running time for both access and search queries. We also give an analysis of the time and space complexities of the data structure, supported by experiments with rainbow tables.

• 한국문헌정보학회지
• /
• 제55권4호
• /
• pp.115-140
• /
• 2021

본 연구는 국외 오픈액세스 분야를 대상으로 LISTA 데이터베이스에서 추출한 키워드 집합을 두 가지 유형(통제키워드, 비통제키워드)으로 구분하고, 각 키워드 유형별로 프로파일링에 기초한 지적구조 분석을 수행한 결과를 검토하였다. 또한, 이를 동시출현단어 분석에 기초한 지적구조 분석의 결과와 비교하였다. 이를 통해 지적구조 분석의 또 다른 방법인 프로파일링에서도 이와 유사한 결과가 도출되는 지를 살펴보고, 동시출현단어 분석과 프로파일링의 차이점을 검토하고자 하였다. 그 결과, 두 가지 키워드 유형별로 프로파일링에 기초한 지적구조 분석의 결과는 동시출현단어 분석과 유사한 차이가 있었다. 또한 프로파일링과 동시출현단어 분석에 기초한 지적구조 분석의 결과 간에도 주목할 만한 차이가 있었다. 따라서 키워드를 사용하는 지적구조 분석은 연구 목적에 따라 키워드 유형별 특성을 고려하여야 하며, 특정 분야의 연구 동향을 보다 명확하게 파악하기 위해서는 동시출현단어 분석보다 프로파일링에 기초한 지적구조 분석을 사용하는 것이 더 나은 결과를 기대할 수 있다.

• Journal of Communications and Networks
• /
• 제13권4호
• /
• pp.408-417
• /
• 2011

The stringent performance requirement for the high efficiency of routing protocols on the Internet can be satisfied by exploiting the threaded border gateway protocol (TBGP) on multi-cores, but the state-of-the-art TBGP performance is restricted by a mass of contentions when racing to access the routing table. To this end, the highly-efficient parallel access approach appears to be a promising solution to achieve ultra-high route processing speed. This study proposes a general routing table structure consisting of two-level tries for fast parallel access, and it presents a heuristic-based divide-and-recombine algorithm to solve a mass of contentions, thereby accelerating the parallel route updates of multi-threading and boosting the TBGP performance. As a projected TBGP, this study also modifies the table operations such as insert and lookup, and validates their correctness according to the behaviors of the traditional routing table. Our evaluations on a dual quad-core Xeon server show that the parallel access contentions decrease sharply by 92.5% versus the traditional routing table, and the maximal update time of a thread is reduced by 56.8 % on average with little overhead. The convergence time of update messages are improved by 49.7%.

• 인터넷정보학회논문지
• /
• 제11권1호
• /
• pp.15-20
• /
• 2010

본 논문은 무선 브로드캐스트 환경에서 인접한 노드들로부터의 정보를 활용하여 질의접근시간과 에너지소모를 줄이기 위한 인덱스 기법을 소개한다. 우리는 정보의 선별적 청취를 위해 HLBS라 불리는 3-계층 위치기반 순차적 접근방식의 인덱스를 제안한다. HLBS는 객체들의 위치를 참고한 순차적인 접근탐색 구조를 통해 포인터 없이 모든 객체의 인덱스를 구성한다. HLBS는 단순하고 적은 크기의 인덱스 구조로 무선 브로드캐스트 채널에서 효율적인 정보탐색을 지원한다. 시뮬레이션을 통해 제안 기법의 효율적인 정보검색의 성능을 증명하였다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2020년도 추계학술발표대회
• /
• pp.20-23
• /
• 2020

This research is to design an effective prefetching method required for DRAM-PCM hybrid main memory systems especially used for big data applications and massive-scale computing environment. Conventional prefetchers perform well with regular memory access patterns. However, workloads such as graph processing show extremely irregular memory access characteristics and thus could not be prefetched accurately. Therefore, this research proposes an efficient dynamical prefetching algorithm based on the regression method. We have designed an intelligent prefetch engine that can identify the characteristics of the memory access sequences. It can perform regular, linear regression or polynomial regression predictive analysis based on the memory access sequences' characteristics, and dynamically determine the number of pages required for prefetching. Besides, we also present a DRAM-PCM hybrid memory structure, which can reduce the energy cost and solve the conventional DRAM memory system's thermal problem. Experiment result shows that the performance has increased by 40%, compared with the conventional DRAM memory structure.

• 전자공학회논문지
• /
• 제50권9호
• /
• pp.21-31
• /
• 2013

CP-ABE 방식은 신뢰된 서버 없이 접근 제어 메카니즘을 구현할 수 있다. 본 논문에서는 권한을 부여받은 사용자가 민감한 데이터에 접근할 수 있도록 CP-ABE 방식으로 속성기반 접근 제어 메카니즘을 제안한다. CP-ABE 개념은 암호문에서 접근 제어 방법을 포함하는 것이다. 만약 사용자가 암호문의 접근 구조를 통해 속성을 가진다면 암호문은 복호될 수 있다. 본 논문에서는 제안한 CP-ABE 방식이 비단조 접근 구조로 표현됨을 증명하고 다른 CP-ABE 방식들과 성능 비교한다.

• 대한임베디드공학회논문지
• /
• 제2권4호
• /
• pp.233-241
• /
• 2007

In an ubiquitous environment, for controlling user access according to environment of users, a number of access control models enforcing dynamic environment of users have been proposed. However, they do not support personalized environments of each user and have a run-time overhead of searching active roles. In this paper, we propose a new model, PE-RBAC, that extends the RBAC architecture by addition of a personalized environment component as a constraint to accommodate dynamic and mobile users. In this model, a dynamic role activation is presented by using a new role-to-environment structure instead of the conventional role hierarchy, which makes it efficient to find the active roles according to a user's personalized environment.

• 한국컴퓨터정보학회논문지
• /
• 제22권8호
• /
• pp.55-61
• /
• 2017

Cloud computing is cost-effective in terms of system configuration and maintenance and does not require special IT skills for management. Also, cloud computing provides an access control setting where SSO is adopted to secure user convenience and availability. As the SSO user authentication structure of cloud computing is exposed to quite a few external security threats in wire/wireless network integrated service environment, researchers explore technologies drawing on distributed SSO agents. Yet, although the cloud computing access control using the distributed SSO agents enhances security, it impacts on the availability of services. That is, if any single agent responsible for providing the authentication information fails to offer normal services, the cloud computing services become unavailable. To rectify the environment compromising the availability of cloud computing services, and to protect resources, the current paper proposes a security policy that controls the authority to access the resources for cloud computing services by applying the authentication policy of user authentication agents. The proposed system with its policy of the authority to access the resources ensures seamless and secure cloud computing services for users.

• 대한치과보존학회:학술대회논문집
• /
• 대한치과보존학회 2003년도 제120회 추계학술대회 제 5차 한ㆍ일 치과보존학회 공동학술대회
• /
• pp.556-556
• /
• 2003

It is generally agreed that endodontic success often depends on canal debridement, disinfection and canal obturation. Access opening to a canal is one of the key to canal debridement. Advantages of straight line access opening are allowed a greater proportion of the root canal walls to be prepared than conventional lingual access cavities, minimized the loss of the tooth structure, reduced incidence of file fracture in curved canals. The purpose of this study is determine the influence of different access opening methods on fracture strength in endodontically treated teeth.(omitted)

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권3호
• /
• pp.104-108
• /
• 2021

In order to improve performance in IoT, edge computing system, a memory is usually configured in a hierarchical structure. Based on the distance from CPU, the access speed slows down in the order of registers, cache memory, main memory, and storage. Similar to the change in performance, energy consumption also increases as the distance from the CPU increases. Therefore, it is important to develop a technique that places frequently used data to the upper memory as much as possible to improve performance and energy consumption. However, the technique should solve the problem of cache performance degradation caused by lack of spatial locality that occurs when the data access stride is large. This study proposes a technique to selectively place data with large data access stride to a software-controlled cache. By using the proposed technique, data spatial locality can be improved by reducing the data access interval, and consequently, the cache performance can be improved.