• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.35 no.2
• /
• pp.33-41
• /
• 2019

The purpose of this study is to provide a basic data for energy efficient apartment designs by analyzing electricity and gas usage according to horizontal locations of dwelling units in apartment buildings. The data for this research are collected from J-apartment complex, located at 'Wolbae' district in Daegu City. The data are sorted into several groups according to inner and outer locations, East-West locations, and the size of units. By the performance efficiency analysis, the study derives the result as follows: 1) generally inner units are more efficient than outer units. 2) West units are more efficient than East units. 3) The group that is most efficient in overall energy consumption is West-inner units (Group-D) and the least efficient group is East-outer units (Group-A1). 4) However, as units are getting bigger, inner units consumes more energy than outer units because of the gas usage patterns. The study also established cost analysis that shows the cost differences of usages for 30, 40, 50 years between each group. The result says Inner-outer location with East-West location affects a significant amount of the management costs. In terms of economic and social life of an apartment building, energy design standards need to be tuned and make the least efficient units perform as efficient as the most efficient units to optimize the social life of an apartment building.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.279-287
• /
• 2004

In this paper, we establish relations between a solution of a vector continuous-time program and a solution of a vector variational-type inequality problem with functionals.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1281-1288
• /
• 2008

The purpose of this study is to consider the efficient methods for introducing the confidence interval. We explain various concepts and approaches about the confidence interval estimation. Computing methods for calculating the efficient confidence interval are suggested.

• East Asian mathematical journal
• /
• v.37 no.5
• /
• pp.543-551
• /
• 2021

Recently, semidefinite optimization problems have been intensively studied since many optimization problem can be changed into the problems and the the problems are very computationable. In this paper, we consider a semidefinite linear vector optimization problem (VP) and we establish the optimality theorems for (VP), which holds without any constraint qualification.

• ETRI Journal
• /
• v.42 no.4
• /
• pp.505-517
• /
• 2020

The increasing size and complexity of deep neural networks (DNNs) necessitate the development of efficient high-performance accelerators. An efficient memory structure and operating scheme provide an intuitive solution for high-performance accelerators along with dataflow control. Furthermore, the processing of various neural networks (NNs) requires a flexible memory architecture, programmable control scheme, and automated optimizations. We first propose an efficient architecture with flexibility while operating at a high frequency despite the large memory and PE-array sizes. We then improve the efficiency and usability of our architecture by automating the optimization algorithm. The experimental results show that the architecture increases the data reuse; a diagonal write path improves the performance by 1.44× on average across a wide range of NNs. The automated optimizations significantly enhance the performance from 3.8× to 14.79× and further provide usability. Therefore, automating the optimization as well as designing an efficient architecture is critical to realizing high-performance DNN accelerators.

• ETRI Journal
• /
• v.30 no.3
• /
• pp.441-450
• /
• 2008

The scalable extension of H.264, known as scalable video coding (SVC) has been the main focus of the Joint Video Team's work and was finalized at the end of 2007. Synchronization between media is an important aspect in the design of a scalable video streaming system. This paper proposes an efficient media synchronization mechanism for SVC video transport over IP networks. To support synchronization between video and audio bitstreams transported over IP networks, a real-time transport protocol/RTP control protocol (RTP/RTCP) suite is usually employed. To provide an efficient mechanism for media synchronization between SVC video and audio, we suggest an efficient RTP packetization mode for inter-layer synchronization within SVC video and propose a computationally efficient RTCP packet processing method for inter-media synchronization. By adopting the computationally simple RTCP packet processing, we do not need to process every RTCP sender report packet for inter-media synchronization. We demonstrate the effectiveness of the proposed mechanism by comparing its performance with that of the conventional method.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.865-874
• /
• 2010

Recently, Hao et al. proposed a privacy preservation protocol based on group signature scheme for secure vehicular communications to overcome a well-recognized problems of secure VANETs based on PKI. However, although efficient group signature schemes have been proposed in cryptographic literatures, group signature itself is still a rather much time consuming operation. In this paper, we propose a more efficient privacy preservation protocol than that of Hao et al. In order to design a more efficient anonymous authentication protocol, we consider a key-insulated signature scheme as our cryptographic building block. We demonstrate experimental results to confirm that the proposed protocol is more efficient than the previous scheme.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.181-184
• /
• 2006

The mobile devices are constrained to be low battery, and the mobile data channel is low data rate. Therefore, the computational cost on the client side of the authentication protocol should be low. In 2005, Hwang and Su proposed an efficient authentication protocol for mobile networks. Hwang-Su protocol is more efficient than other related protocols. In this paper, we propose a new efficient authentication protocol for mobile networks. The proposed protocol is more efficient than Hwang-Su's in computational respect although our protocol is nearly equal to Hwang-Su's in communication respect. It is suitable to apply in the mobile networks.

• Journal of Korea Multimedia Society
• /
• v.6 no.4
• /
• pp.736-745
• /
• 2003

Traditional slicing techniques make slices through dependence graphs. They also improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication link because they are based on static slicing techniques. Therefore the graph becomes very complicated, and size of the slices is larger. We propose the representation of a dynamic object-oriented program dependence graph so as to process the slicing of object-oriented programs that is composed of related programs in order to process certain jobs. We also propose an efficient slicing algorithm using the relations of relative tables in order to compute dynamic slices of object-oriented programs. Consequently, the efficiency of the proposed efficient dynamic object-oriented program dependence graph technique is also compared with the dependence graph techniques discussed previously As a result, this is certifying that an efficient dynamic object-oriented program dependence graph is more efficient in comparison with the traditional object-oriented dependence graphs and dynamic object-oriented program dependence graph.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4680-4700
• /
• 2015

Broadcast encryption is an efficient way to distribute confidential information to a set of receivers using broadcast channel. It allows the broadcaster to dynamically choose the receiver set during each encryption. However, most broadcast encryption schemes in the literature haven't taken into consideration the receiver's privacy protection, and the scanty privacy preserving solutions are often less efficient, which are not suitable for practical scenarios. In this paper, we propose an efficient dynamic anonymous broadcast encryption scheme that has the shortest ciphertext length. The scheme is constructed over the composite order bilinear groups, and adopts the Lagrange interpolation polynomial to hide the receivers' identities, which yields efficient decryption algorithm. Security proofs show that, the proposed scheme is both secure and anonymous under the threat of adaptive adversaries in standard model.