• Journal of the Korean Home Economics Association
• /
• v.39 no.5
• /
• pp.15-26
• /
• 2001

The purpose of this study is to examine specific consumer problems in internet commerce and analyze them in the age of information. The way of sorting consumer problems in internet commerce from this study. For this empirical analysis, the data was collected 319 consumers by internet on-line survey from Feb. 13 to Feb. 20, 2000. The methods for study was frequency, percentage, mean, correlation, multiple regression using SAS PC program. The major findings of this study were as follows: 1. The level of consumer problem experiences in internet commerce was examined. The problems of privacy was the most problem and the problem of price was the second. Then delivery, advertisement, information was next, and the problem of quality, and A/S, change, cancel was the next consumer problem. 2. Among factors influence on experience consumer problem in internet commerce, the amount of usable money, information search were significant.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.298-300
• /
• 2004

Arc-furnace facilities consume 9,895,165(MWh) which is about 69.6 Percent of electronic furnace power consumption. and interior of a country demand power have inclosed annual. but becaused of the problem of cost, power plant location, and environment have faced difficulty to electric power supply. In this paper, Examining Load cutting of Arc-furnace that is dominating high weight of industry electric power use. and it is expected to solve easily electric power supply and demand problem by highest Priority load cutting examination of Arc-furnace when electric power supply and demand problem happens to area electric power system when is urgent.

• Proceedings of the KIEE Conference
• /
• 2006.07c
• /
• pp.1426-1427
• /
• 2006

Chalcogenide based phase-change memory has a high capability and potential for the next generation nonvolatile memory device. Fast writing speed, low writing voltage, high sensing margin, low power consume and long cycle of read/write repeatability are also good advantages of nonvolatile phase-change memory. We have been investigated the new material for the phase-change memory. Its composition is consists of chalcogenide $Ge_{1}Se_{1}Te_2$ material. We made this new material to solve problems of conventional phase-change memory which has disadvantage of high power consume and high writing voltage. In the present work, we are manufactured $Ge_{1}Se_{1}Te_{2}/Ge_{2}Sb_{2}Te_{5}/Ge_{1}Se_{1}Te_{2}$ and $Ge_{2}Sb_{2}Te_{5}/Ge_{1}Se_{1}Te_{2}/Ge_{2}Sb_{2}Te_{5}$ sandwich triple layer structure devices are manufactured to investigate its electrical properties. Through the present work, we are willing to ensure a potential of substitutional method to overcome a crystallization problem on PRAM device.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1133-1151
• /
• 2010

Energy balanced consumption routing is based on assumption that the nodes consume energy both in transmitting and receiving. Lopsided energy consumption is an intrinsic problem in low-cost sensor networks characterized by multihop routing and in many traffic overhead pattern networks, and this irregular energy dissipation can significantly reduce network lifetime. In this paper, we study the problem of maximizing network lifetime through balancing energy consumption for uniformly deployed low-cost sensor networks. We formulate the energy consumption balancing problem as an optimal balancing data transmitting problem by combining the ideas of corona cluster based network division and optimized transmitting state routing strategy together with data transmission. We propose a localized cluster based routing scheme that guarantees balanced energy consumption among clusters within each corona. We develop a new energy cluster based routing protocol called "OECR". We design an offline centralized algorithm with time complexity O (log n) (n is the number of clusters) to solve the transmitting data distribution problem aimed at energy balancing consumption among nodes in different cluster. An approach for computing the optimal number of clusters to maximize the network lifetime is also presented. Based on the mathematical model, an optimized energy cluster routing (OECR) is designed and the solution for extending OEDR to low-cost sensor networks is also presented. Simulation results demonstrate that the proposed routing scheme significantly outperforms conventional energy routing schemes in terms of network lifetime.

• ETRI Journal
• /
• v.21 no.2
• /
• pp.22-30
• /
• 1999

In this paper, we derive an efficient parallel algorithm to solve the single function coarsest partition problem. This algorithm runs in O(\log2n) time using O(nlogn) operations on the EREW PRAM with O(n) memory cells used. Compared with the previous PRAM algorithms that consume O(n1+${\varepsilon}$) memory cells for some positive constant ${\varepsilon}\>0$, our algorithm consumes less memory cells without increasing the total number of operations.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.1
• /
• pp.197-203
• /
• 2010

The problem of location awareness in wireless sensor networks where nodes use GPS (Global Positioning System), remains challenging problem, when considering the required large energy consumption during the localization phase. In this paper we designed hardware for GPS based localization and propose a framework, called ELS, to consume low cost energy. In the ELS framework, sensor nodes are equipped with GPS. Because GPS spends large energy for position awareness, conventional localization algorithms cannot use GPS-device. We try to find a solution for efficient energy expenditure of GPS. Finally, we derive optimal transmission power of GPS data and a scheme of localization through experiment and simulation.

• Journal of the Semiconductor & Display Technology
• /
• v.21 no.3
• /
• pp.1-6
• /
• 2022

Modern computer systems usually have special hardware for operations used in deep learning workload even edge computing environment. Non-volatile memories (NVMs) have been considered for alternative memory storage because they consume little static energy and occupy small area. However, there is a problem for NVMs to be directly adopted. An NVM cell has limited write endurance, so that the lifetime of NVM-based memory system is much shorter than that of conventional memory system. To overcome this problem for the deep learning system, this paper proposes a novel method to extend the lifetime based on the analysis of the deep learning workloads. If an incoming block has more than a predefined number of frequently used values, the cacheline is defined as write friendly block. During the victim selection, the cacheline has lower possibility to be chosen as victim. The experimental results show that the lifetime is increased by about 50% and energy consumption is decreased by 3% with a little performance hurt.

• International Journal of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.77-84
• /
• 2024

Aberration is still a problem for making augmented reality displays. The existing methods to solve this problem are either slow and inefficient, consume too much battery, or are too complex for straightforward implementation. There are still some problems with image quality, and users may suffer from eye strain and headaches because the images provided to each eye lack accuracy, causing the brain to receive mismatched cues between the vergence and accommodation of the eyes. In this paper, we implemented a computer simulation of an optical aberration using Zernike polynomials which are defocus, trefoil, coma, and spherical. The research showed that these optical aberrations impact the Point Spread Function (PSF) and Modulation Transfer Function (MTF). We employed the phase conjugate technique to mitigate aberrations. The findings revealed that the most significant impact on the PSF and MTF comes from the influence of spherical aberration and coma aberration.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.64-73
• /
• 2011

The problem of Euclidean minimum spanning tree (EMST) is to connect given nodes in a plane with minimum cost. There are many algorithms for the polynomial time problem as EMST. However, for numerous nodes, the algorithms consume an enormous amount of time to find an optimal solution. In this paper, an approximation scheme using a polynomial time approximation scheme (PTAS) algorithm with dividing and parallel processing for the problem is suggested. This scheme enables to construct a large, approximate EMST within a short duration. Although initially devised for the non-polynomial problem, we employ naive PTAS to construct a vast EMST with dynamic programming. In an experiment, the approximate EMST constructed by the proposed scheme with 15,000 input terminal nodes and 16 partition cells shows 89% and 99% saving in execution time for the serial processing and parallel processing methods, respectively. Therefore, our scheme can be applied to obtain an approximate EMST quickly for numerous input terminal nodes.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.11
• /
• pp.6565-6575
• /
• 2014

Hamilton's Markov-switching model [5] was extended to the simultaneous equations model. A framework for an instrumental variable interpretation of full information maximum likelihood (FIML) by Hausman [4] can be used to deal with the problem of simultaneous equations based on the Hamilton filter [5]. A comparison of the proposed FIML Markov-switching model with the LIML Markov-switching models [1,2,3] revealed the LIML Markov-switching models to be a special case of the proposed FIML Markov-switching model, where all but the first equation were just identified. Moreover, the proposed Markov-switching model is a general form in simultaneous equations and covers a broad class of models that could not be handled previously. Excess sensitivity of marginal propensity to consume with big shocks, such as housing bubble bursts in 2008, can be determined by applying the proposed model to Campbell and Mankiw's consumption function [6], and allowing for the possibility of structural breaks in the sensitivity of consumption growth to income growth.