• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.1
• /
• pp.1-10
• /
• 2012

The way-lookup cache and the way-tracking cache are considered to be the most energy-efficient when used for level 1 and level 2 caches, respectively. This paper proposes an energy-efficient set-associative cache using the bi-mode way-selector that combines the way selecting techniques of the way-tracking cache and the way-lookup cache. The simulation results using an Alpha 21264-based system show that the bi-mode way-selecting L1 instruction cache consumes 27.57% of the energy consumed by the conventional set-associative cache and that it is as energy-efficient as the way-lookup cache when used for L1 instruction cache. The bi-mode way-selecting L1 data cache consumes 28.42% of the energy consumed by the conventional set-associative cache, which means that it is more energy-efficient than the way-lookup cache by 15.54% when used for L1 data cache. The bi-mode way-selecting L2 cache consumes 15.41% of the energy consumed by the conventional set-associative cache, which means that it is more energy-efficient than the way-tracking cache by 16.16% when used for unified L2 cache. These results show that the proposed cache can provide the best level of energy-efficiency regardless of the cache level.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1100-1101
• /
• 2007

This paper proposes an efficient mechanism of node membership verification within the groups of sensors in a wireless sensor network (WSN). We utilize one-way accumulator to check the memberships of the legitimate nodes in a secure way. Our scheme also supports the addition and deletion of nodes in the groups in the network. Our analysis shows that, our scheme could be well-suited for the resource constrained sensors in a sensor network and it provides a lightweight mechanism for secure node membership verification in WSN.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.11
• /
• pp.11-16
• /
• 1993

VLIW architecture capable of testing multiple conditions in a cycle must support an efficient mechanism for multi-way branches. This paper proposes a mechanism to speed up the execution of multi-way branches and an efficient memory packing method of instructions, which reduced the wasted memory space. Also, we develops a new compiler technique which can transform program segments that are not applied to multi-way branches into ones that are applied to multi-way branches. The benefits gained by the transformation are to reduce branch penalty and to increase instruction-level parallelism.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.3
• /
• pp.220-226
• /
• 2000

The problem (P) of optimizing a linear function $d^Tx$ over the set of efficient points for a multiple objective linear program (M) is difficult because the efficient set is nonconvex. There are some interesting properties between the objective linear vector d and the matrix of multiple objectives C and those properties lead us to establish criteria to solve (P) with a linear program. In this paper we investigate a system of the linear equations $C^T{\alpha}$ = d and construct two linearly independent positive vectors u, v such that ${\alpha}$ = u - v. From those vectors u, v, solving an weighted sum linear program for finding an efficient extreme point for the (M) is a way of getting an optimal solution of the problem (P). Therefore the theorems presented in this paper provided us an easy way of solving nonconvex program (P) with a weighted sum linear program.

• Proceedings of the KIEE Conference
• /
• 2009.04a
• /
• pp.18-22
• /
• 2009

In this paper, we are develop specifications light-way lighting appliance for efficient construction. Analyzed wide application and connection regulation. Also, flickering circuit Presented separation, arrangement, mounting instruction. Incandescent lamp occurs much heat. Therefore, establishment of enough electric light interval is required. Voltage of discharge lamp does by below 300v, and provide so that a person is not can may touched.

• Journal of Forest and Environmental Science
• /
• v.28 no.1
• /
• pp.46-55
• /
• 2012

The research on urban forests in Chuncheon, so far, has mainly conducted in Ponguisan urban forest. Research on other urban forests in Chuncheon was scarce. Accordingly, in this study, the author chose the main urban forests in Chuncheon and tried to find a way of efficient establishment and management of urban forests in Chuncheon by field and questionnaire survey. The research findings, there were several reasons why effective management can not be implemented in the main urban forests in Chuncheon. To solve these problems and make an efficient establishment and management of urban forests in Chuncheon, the first way is to make forest management plans on the urban forest in Chuncheon and expand administrative organization, personnel and budget. Establishment and management of urban forests needs a practical, strengthened overall management system. The second way is to enhance the regional and functional characteristics for urban forest, expand the area of urban forests, and enhance management of Street trees. The third way is to designate Urban Nature Park or Urban Park for the main urban forests in Chuncheon and need to change the ownership of the urban forests by purchasing. The fourth way is to respond to Chuncheon citizen's preference and their way of utilization when create the urban forests in Chuncheon, expand convenience facilities, relaxation facilities as well.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.6
• /
• pp.93-112
• /
• 2002

Since the multicast group which is composed of various members is dynamic, members of the group frequently join or leave. So, for a new session, group keys are efficiently updated and distributed. In this paper, we describe very simple and new efficient logical key hierarchy(ELKH) protocol which is based on an one-way function. In the previous schemes, when the group controller distributes new created keys or updated keys to the members the information is usally encryted and then transmited over a multicast channel. But ELKH secretes the multicast message by using the one-way function and XOR operator instead of encrypting it. Hence our main construction improves the computational efficiency required from the group controller and group memebers while doesn't increase size of re-keying message when compared to $EHBT^{[12]}$. Assuming the security of an underlying one-way function, we prove that our scheme satisfies forward secrecy and backward secrecy.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.317-324
• /
• 2009

In this paper, a 4-way Handshake protocol in the IEEE 802.11i is analyzed in terms of both security and reliability. It is shown that the 4-way Handshake protocol breaks down under some conditions due to a MIC (message integrity code) failure, and a solution to fix it is proposed. It is also proposed that a new 2-way Handshake protocol which is more secure and efficient than the 4-way Handshake protocol.

• International journal of advanced smart convergence
• /
• v.8 no.2
• /
• pp.204-210
• /
• 2019

Mobile Crowd Computing is one of the most efficient and effective way to collect the Electronic health records and they are very intelligent in processing them. Mobile Crowd Computing can handle, analyze and process the huge volumes of Electronic Health Records (EHR) from the high-performance Cloud Environment. Electronic Health Records are very sensitive, so they need to be secured, authenticated and processed efficiently. However, security, privacy and authentication of Electronic health records(EHR) and Patient health records(PHR) in the Mobile Crowd Computing Environment have become a critical issue that restricts many healthcare services from using Crowd Computing services .Our proposed Efficient Multi-layer Encryption Framework(MLEF) applies a set of multiple security Algorithms to provide access control over integrity, confidentiality, privacy and authentication with cost efficient to the Electronic health records(HER)and Patient health records(PHR). Our system provides the efficient way to create an environment that is capable of capturing, storing, searching, sharing, analyzing and authenticating electronic healthcare records efficiently to provide right intervention to the right patient at the right time in the Mobile Crowd Computing Environment.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.1
• /
• pp.34-39
• /
• 2004

Huffman coding which has been used in many data compression algorithms is a popular data compression technique used to reduce statistical redundancy of a signal. It has been proposed that the Huffman algorithm can decode efficiently using characteristics of the Huffman tables and patterns of the Huffman codeword. We propose a new Huffman decoding algorithm which used a multi way tree search and present an efficient hardware implementation method. This algorithm has a small logic area and memory space and is optimized for high speed decoding. The proposed Huffman decoding algorithm can be applied for many multimedia systems such as MPEG audio decoder.