• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.1022-1025
• /
• 2005

The effect of substrate surface to the formation of ZnO nanostructures has been investigated using Si (111), $Al_2O_3$(C-plane) $Al_2O_3$(A-plane), and $Al_2O_3$(R-plane) substrates. The growth temperature was controlled from 500$^{\circ}C$ ${\sim}$ 600$^{\circ}C$, and the luminescence properties were investigated by a series of photoluminescence (PL) measurements at the elevating temperatures. ZnO nanostructures grown on Si substrate show strong UV emission intensity along with green emission positioned at 3.22 eV and 2.5 eV, respectively. However, green emission was not observed from the ZnO nanostructures grown on $Al_2O_3$ substrates. It is explained in terms of the difference of the surface energy between Si and $Al_2O_3$. Also, the origin of UV emissions has been discussed by using the temperature-dependent PL. The distinction of the PL spectra is interpreted in terms of the difference of the impurity included in the nanostructures.

• The KIPS Transactions:PartD
• /
• v.14D no.5
• /
• pp.555-564
• /
• 2007

Internet streaming systems consist of a media server, a streaming sewer, and terminals. The media server delivers multimedia contents such as video and/or audio to the streaming server, which distributes the contents to terminals as well. Existing Internet streaming systems have a bottleneck problem in the streaming server because of the limit of the processing capacity of the streaming server and therefore a streaming server can not accomodate more terminals than the limit. As a solution to this problem, P2P streaming systems have been lately proposed and investigated, using P2P distributed architectures. Actually, however, there exist many difficulties in the design and implementation of P2P streaming systems, because it needs many real computers and various network constructions. In this paper, we have proposed and defined a P2P streaming system model such as the architectural model, the timing model, the behavior model, and the performance metrics. And also we have implemented an NS2 based P2P streaming system simulator called P2PStreamSim. Finally, we have verified it through test simulations and analyzed the results.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.45-58
• /
• 2020

In the current trend of increasing network traffic due to the popularization of cloud service and mobile devices, WAN bandwidth is very low compared to LAN bandwidth. In a WAN environment, a WAN optimizer is needed to overcome performance problems caused by transmission protocol, packet loss, and network bandwidth limitations. In this paper, we analyze the data deduplication algorithm of WANProxy, an open source WAN optimizer, and evaluate its performance in terms of network latency and WAN bandwidth. Also, we evaluate the performance of the two-stage compression method of WANProxy and Zstandard. We propose a new method to improve the performance of WANProxy by revising its data deduplication algorithm and evaluate its performance improvement. We perform experiments using 12 data files of Silesia with a data segment size of 2048 bytes. Experimental results show that the average compression rate by WANProxy is 150.6, and the average network latency reduction rates by WANProxy are 95.2% for a 10 Mbps WAN environment and 60.7% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, the two-stage compression of WANProxy and Zstandard increases the average compression rate by 33%. However, it increases the average network latency by 2.1% for a 10 Mbps WAN environment and 5.27% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, our proposed method increases the average compression rate by 34.8% and reduces the average network latency by 13.8% for a 10 Mbps WAN and 12.9% for a 100 Mbps WAN, respectively. Performance analysis results of WANProxy show that its performance improvement in terms of network latency and WAN bandwidth is excellent in a 10Mbps or less WAN environment while superior in a 100 Mbps WAN environment.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.5
• /
• pp.359-369
• /
• 2020

In this paper, we proposed a charge pump (CP) circuit that has a wide operating range while reducing the current mismatch for the PLL that generates the main clock of the CMOS X-Ray detector. The operating range and current mismatch of the CP circuit are determined by the characteristics of the current source circuit for the CP circuit. The proposed CP circuit is implemented with a wide operating current mirror bias circuit to secure a wide operating range and a cascode structure with a large output resistance to reduce current mismatch. The proposed wide operating range cascode CP circuit was fabricated as a chip using a 350nm CMOS process, and current matching characteristics were measured using a source measurement unit. At this time, the power supply voltage was 3.3 V and the CP circuit current ICP = 100 ㎂. The operating range of the proposed CP circuit is △VO_Swing=2.7V, and the maximum current mismatch is 5.15 % and the maximum current deviation is 2.64 %. The proposed CP circuit has low current mismatch characteristics and can cope with a wide frequency range, so it can be applied to systems requiring various clock speed.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.175-187
• /
• 2006

The data cube is an aggregation operator that computes group-bys for all possible combination of dimension attributes. %on the number of the dimension attributes is n, a data cube computes $2^n$ group-bys. Each group-by in a data cube is called a cuboid. Data cubes are often precomputed and stored as materialized views in data warehouses. These data cubes need to be updated when source relation change. The incremental maintenance of a data cube is to compute and propagate only its changes. To compute the change of a data cube of $2^n$ cuboids, previous works compute a delta cube that has the same number of cuboids as the original data cube. Thus, as the number of dimension attributes increases, the cost of computing a delta cube increases significantly. Each cuboid in a delta cube is called a delta cuboid. In this paper. we propose an incremental cube maintenance method that can maintain a data cube by using only $_nC_{{\lceil}n/2{\rceil}}$ delta cuboids. As a result, the cost of computing a delta cube is substantially reduced. Through various experiments, we show the performance advantages of our method over previous methods.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.7
• /
• pp.319-326
• /
• 2016

Given the attributes of mobile apps that shorten the time to make purchase decisions while enabling easy purchase cancellations, usability can be regarded to be a highly prioritized quality attribute among the diverse quality attributes that must be provided by mobile apps. With that backdrop, mobile app developers have been making great effort to minimize usability hampering elements that degrade the merchantability of apps in many ways. Most elements that hamper the convenience in use of mobile apps stem from those potential errors that occur when GUIs are designed. In our previous study, we have proposed a technique to analyze the usability of mobile apps using user behavior logs. We proposes a technique to detect usability hampering elements lying dormant in mobile apps' GUI models by expressing user behavior logs with finite state models, combining user behavior models extracted from multiple users, and comparing the combined user behavior model with the expected behavior model on which the designer's intention is reflected. In addition, to reduce the burden of the repeated test operations that have been conducted by existing developers to detect usability errors, the present paper also proposes a mobile usability error detection automation tool that enables automatic application of the proposed technique. The utility of the proposed technique and tool is being discussed through comparison between the GUI issue reports presented by actual open source app developers and the symptoms detected by the proposed technique.

• The KIPS Transactions:PartD
• /
• v.16D no.5
• /
• pp.715-728
• /
• 2009

The Enterprise Service Bus based on Java Business Integration is an web service standard and one of the methods for implementing distribution channels of Service Oriented Architecture. Consisting of open source group, extensive venders and users, the ESB based JBI has the problems of ineffectiveness as well as advantages of extensibility of service plug-in. That is, in case users need to use Service plug-in, manual connection of packaging process and sequential distribution method is required. This study, therefore, proposes as a way of trouble-shooting the user-oriented component deployment tool which can manage entire process for deploying The ESB middleware platform to Service unit. At the same time, this study elicited the requirements based on issues of JBI-based ESB and has developed the modeling property, packaging, distribution and evaluation thru Schema analysis of JBI-compatible component. Using the deployment tool this study proposed, users will be able to perform and manage the whole deploying process without additional manual work for connecting component. Not only it is expected that interface based on Graphic User Interface provide usability and convenience but they can also minimize the errors rate through component and route validity verification function provided in deployment tool.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.12
• /
• pp.447-454
• /
• 2016

The research on multipath routing has been studied to solve the problem of frequent path breakages due to node and link failures and to enhance data delivery reliability in wireless sensor networks. In the multipath routing, mobile sinks such as soldiers in battle fields and rescuers in disaster areas bring about new challenge for handling their mobility. The sink mobility requests new multipath construction from sources to mobile sinks according to their movement path. Since mobile sinks have continuous mobility, the existing multipath can be exploited to efficiently reconstruct to new positions of mobile sinks. However, the previous protocols do not address this issue. Thus, we proposed an efficient multipath reconstruction protocol called LGMR for mobile sinks in wireless sensor networks. The LGMR address three multipath reconstruction methods based on movement types of mobile sinks: a single hop movement-based local multipath reconstruction, a multiple hop movement-based local multipath reconstruction, and a multiple hop movement-based global multipath reconstruction. Simulation results showed that the LGMR has better performance than the previous protocol in terms of energy consumption and data delivery delay.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.2
• /
• pp.113-118
• /
• 2013

The current GPU virtualization techniques incur large overheads when executing application programs mainly due to the fine-grain time-sharing scheduling of the GPU among multiple Virtual Machines (VMs). Besides, the current techniques lack of portability, because they include the APIs for the GPU computations in the VM monitor. In this paper, we propose a low overhead and high performance GPU virtualization approach on a heterogeneous HPC system based on the open-source Xen. Our proposed techniques are tailored to the bio applications. In our virtualization framework, we allow a VM to solely occupy a GPU once the VM is assigned a GPU instead of relying on the time-sharing the GPU. This improves the performance of the applications and the utilization of the GPUs. Our techniques also allow a direct pass-through to the GPU by using the IOMMU virtualization features embedded in the hardware for the high portability. Experimental studies using microbiology genome analysis applications show that our proposed techniques based on the direct pass-through significantly reduce the overheads compared with the previous Domain0 based approaches. Furthermore, our approach closely matches the performance for the applications to the bare machine or rather improves the performance.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.293-304
• /
• 2004

Recently, caching for the database-backed web applications has received much attention. The results of frequent queries could be cached for repeated reuse or for efficient processing of the relevant queries. Since the emergence of XML as a standard for data exchange on the web, today's web applications are to retrieve information from the remote XML sources across the network, and thus it is desirable to maintain the XML query results in the cache for the web applications. In this paper, we describe implementation of an XML query processing system that supports cache-answerability of XML queries, and evaluate its performance. XML path expression, which is one of the core features of XML query languages including XQuery, XPath, and XQL was considered as the XML query. Their result is maintained as an XML materialized view in the XML cache. The algorithms to rewrite the given XML path expression using its relevant materialized view proposed in [13] were implemented with RDBMS as XML store. The major issues of implementation are described in detail. The results of performance experiments conducted with the implemented system showed effectiveness of cache-answerability of XML queries. Comparison with previous research in terms of performance is also Provided.