• Journal of the Ergonomics Society of Korea
• /
• v.36 no.5
• /
• pp.437-446
• /
• 2017

Objective: This study aims to draw an efficient UI design by comparing the usability of App drawer and single-layered home screens, which are smartphone home screens. Background: Because smartphone home screen is frequently used including the installation, deletion, and editing of APPs, it should be designed with easily controllable information structure. There is a need to seek a user-friendly UI by comparing the usability of App drawer and single-layered home screens, of which methods to search Apps are different. There is also a need to examine an efficient UI and the factors to improve from the user perspective. Method: This study targeted 30 Android OS and iOS users to evaluate the App drawer and single-layered home screens, of which UI structures are different. Each participant was instructed to carry out an App searching task and App deleting task, and the execution time and the number of errors were measured. After the tasks were completed, they evaluated satisfaction through a questionnaire survey. Results: In the App searching task with low task level, there was no difference in execution level between the App drawer and single-layered home screens. However, the single-layered home screen showed higher efficiency and accuracy in the App deleting task with high task level. As for the group difference according to use experience, there was no difference in satisfaction among Android OS users, but iOS user satisfaction with single-layered home screen with which they were familiar was higher. Conclusion: As for home screen usability, the single-layered home screen UI structure can be advantageous, as task level is higher. Repulsion was higher, when users, who had used easier UI, used complex UI in comparison with user satisfaction, when users familiar with complex UI used easier UI. A UI indicating the current status with clear label marking through a task flow chart-based analysis, and a UI in which a user can immediately recognize by exposing hidden functions to the first depth were revealed as things to improve. Application: The results of this study are expected to be used as reference data in designing smartphone home screens. Especially, when iOS users use Android OS, the results are presumed to contribute to the reduction of predicted barriers.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.3
• /
• pp.134-142
• /
• 2002

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The window operation is one of important geometry operations in image processing, which extracts a sub-image indicated by a window in the image. In this paper, we present an algorithm to perform the window operation of binary images represented by quadtrees, using three-dimensional $n{\times}n{\times}n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of $n{\times}n{\times}n$ RMESH.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.173-180
• /
• 2004

Quadtree, which 11 a hierarchical data structure, is a very important data structure to represent images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related to quadtrees. The region expansion is an operation to expand images by a given distance and the scaling If an operation to scale images by a given scale factor. In this paper, we present algorithms to perform the region expansion and scaling of images represented by quadtrees, using three-dimensional n${\times}$n${\times}$n processors on RMESH(Reconfigurable MESH). These algorithms have constant time complexities by using efficient basic operations to route the locational codes of quadtree on the hierarchical structure of n${\times}$n${\times}$n RMESH.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.305-312
• /
• 2001

Recently, high-dimensional index structures have been required for similarity search in such database applications s multimedia database and data warehousing. In this paper, we propose a new cell-based signature tree, called CS-tree, which supports efficient storage and retrieval on high-dimensional feature vectors. The proposed CS-tree partitions a high-dimensional feature space into a group of cells and represents a feature vector as its corresponding cell signature. By using cell signatures rather than real feature vectors, it is possible to reduce the height of our CS-tree, leading to efficient retrieval performance. In addition, we present a similarity search algorithm for efficiently pruning the search space based on cells. Finally, we compare the performance of our CS-tree with that of the X-tree being considered as an efficient high-dimensional index structure, in terms of insertion time, retrieval time for a k-nearest neighbor query, and storage overhead. It is shown from experimental results that our CS-tree is better on retrieval performance than the X-tree.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.11
• /
• pp.20-25
• /
• 2016

This study addresses a low complexity and lossless frame memory compression algorithm based on block-buffer structure for efficient high resolution video processing. Our study utilizes the block-based MHT (modified Hadamard transform) for spatial decorrelation and AGR (adaptive Golomb-Rice) coding as an entropy encoding stage to achieve lossless image compression with low complexity and efficient hardware implementation. The MHT contains only adders and 1-bit shift operators. As a result of AGR not requiring additional memory space and memory access operations, AGR is effective for low complexity development. Comprehensive experiments and computational complexity analysis demonstrate that the proposed algorithm accomplishes superior compression performance relative to existing methods, and can be applied to hardware devices without image quality degradation as well as negligible modification of the existing codec structure. Moreover, the proposed method does not require the memory access operation, and thus it can reduce costs for hardware implementation and can be useful for processing high resolution video over Full HD.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.54-62
• /
• 2010

Inverted index structures have become the most efficient data structure for high performance indexing of large text collections, especially online index maintenance, In-Place and merge-based index structures are the two main competing strategies for index construction in dynamic search environments. In the above-mentioned two strategies, a contiguity of posting information is the mainstay of design for online index maintenance and query time. Whereas with the emergence of new storage device(SSD, SCRAM), those do not consider a contiguity of posting information in the design of index structures because of its superiority such as low access latency and I/O throughput speeds. However, SSD(Solid State Drive) is not well suited for traditional inverted structures due to the poor random write throughput in practical systems. In this paper, we propose the new efficient online index structure(SPM) for SSD that significantly reduces the query time and improves the index maintenance performance.

• Korean Journal of Materials Research
• /
• v.28 no.1
• /
• pp.32-37
• /
• 2018

We report on the efficient detection of NO gas by an all-oxide semiconductor p-n heterojunction diode structure comprised of n-type zinc oxide (ZnO) nanorods embedded in p-type copper oxide (CuO) thin film. The CuO thin film/ZnO nanorod heterostructure was fabricated by directly sputtering CuO thin film onto a vertically aligned ZnO nanorod array synthesized via a hydrothemal method. The transport behavior and NO gas sensing properties of the fabricated CuO thin film/ZnO nanorod heterostructure were charcterized and revealed that the oxide semiconductor heterojunction exhibited a definite rectifying diode-like behavior at various temperatures ranging from room temperature to $250^{\circ}C$. The NO gas sensing experiment indicated that the CuO thin film/ZnO nanorod heterostructure had a good sensing performance for the efficient detection of NO gas in the range of 2-14 ppm under the conditions of an applied bias of 2 V and a comparatively low operating temperature of $150^{\circ}C$. The NO gas sensing process in the CuO/ZnO p-n heterostructure is discussed in terms of the electronic band structure.

• Journal of Microbiology and Biotechnology
• /
• v.27 no.11
• /
• pp.1999-2009
• /
• 2017

The secretion efficiency of a protein in a Sec-type secretion system is mainly determined by an N-terminal signal peptide and its combination with its cognate protein. Five signal peptides, namely, two synthetic Sec-type and three Bacillus licheniformis alpha-amylase-derived signal peptides, were compared for periplasmic expression of the human growth hormone (hGH) in E. coli. Based on in silico predictions on the signal peptides' cleavage efficiencies and their corresponding mRNA secondary structures, a number of amino acid substitutions and silent mutations were considered in the modified signal sequences. The two synthetic signal peptides, specifically designed for hGH secretion in E. coli, differ in their N-terminal positively charged residues and hydrophobic region lengths. According to the mRNA secondary structure predictions, combinations of the protein and each of the five signal sequences could lead to different outcomes, especially when accessibility of the initiator ATG and ribosome binding sites were considered. In the experimental stage, the two synthetic signal peptides displayed complete processing and resulted in efficient secretion of the mature hGH in periplasmic regions, as was demonstrated by protein analysis. The three alpha-amylase-derived signal peptides, however, were processed partially from their precursors. Therefore, to achieve efficient secretion of a protein in a heterologous system, designing a specific signal peptide by using a combined approach of optimizations of the mRNA secondary structure and the signal peptide H-domain and cleavage site is recommended.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.16 no.4
• /
• pp.387-399
• /
• 2003

The box system that consists only of reinforced concrete walls and slabs we adopted in many high-rise apartment buildings recently constructed in Korea. Recently, many of the box system buildings with pilotis has been constructed to meet the architectural design requirements. This structure has abrupt change in the structural properties between the upper and lower parts divided by transfer girders. For an accurate analysis of a structure with pilotis, it is necessary to have the buildings modeled into a finer mesh. But it would cost tremendous amount of computational time and memory. In this study, an efficient method is proposed for an efficient analysis of buildings those have pilotis with drastically reduced time and memory. In the proposed analysis method, transfer gilders are modeled using super elements developed by the matrix condensation technique and fictitious beams are introduced to enforce the compatibility conditions at the boundary of each element. The analyses of example structures demonstrated that the proposed method used for the analysis of a structure with pilotis will provide analysis results with accuracy for the design of box system buildings.

• The KIPS Transactions:PartA
• /
• v.14A no.3 s.107
• /
• pp.151-158
• /
• 2007

Quadtree, which is a hierarchical data structure, is a very important data structure to represent images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The computation of block location is one of important geometry operations in image processing, which extracts a component completely including a given block. In this paper, we present a constant time algorithm to compute the block location of images represented by quadtrees, using three-dimensional $n\times n\times n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to deal with the locational codes of quardtree on the hierarchical structure of $n\times n\times n$ RMESH.