• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.11-19
• /
• 2013

Internet service providers regulate the maximum data transmission rate of each user as a means to provide a tiered Internet access service or to avoid the monopoly of a few greedy users. In this paper, we aim to analyze the impact of this access rate regulation on the revenue of Internet service provider and the pricing strategy. We first propose a service quality model taking into account the access rate regulation, and analyze how the regulation affects the service subscription decision of users. In addition, we derive a sufficient condition that guarantees the stability of the revenue, and formulate an optimization problem that finds the optimal price to maximize the revenue.

• Journal of Information Technology Applications and Management
• /
• v.12 no.1
• /
• pp.49-68
• /
• 2005

It is one of the crucial components of electronic logistics systems to manage logistics information of cargos and transportation companies and to mediate appropriate brokerage between them. Due to the advance of e-Commerce technologies many kinds of logistics transactions can be handled by means of EDI or XML/EDI applications. but the brokering processing relies mostly on the traditional processes and the research in this field is still at the initial stage. In this paper we study a logistics brokering system for ships and cargos and describe the design and implementation of the system. We analyze the brokering constraints for logistics of cargos and ships and construct an optimization model for their brokering. We also suggest a brokering procedure and a simple heuristic algorithm with respect to the proposed matching criteria. The experimental result shows that the proposed greedy-based heuristic algorithm performs very well. In its response time the proposed algorithm executed within a couple of seconds independently of the number of cargos and the container capacities of ships. The output of the algorithm is very close to that of the optimal solution. showing higher than 95% of approximation. The proposed system is implemented for the Web environment using JSP and PL/SQL.

• Journal of information and communication convergence engineering
• /
• v.7 no.4
• /
• pp.475-479
• /
• 2009

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Current research activity for the Minimum Energy Multicast (MEM) problem has been focused on devising efficient centralized greedy algorithms for static ad hoc networks. In this paper, we consider mobile ad hoc networks(MANETs) that could provide the reliable monitoring and control of a variety of environments for remote place. Mobility of MANET would require the topology change frequently compared with a static network. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. In this paper, we propose a new method, the CACH(Context-aware Clustering Hierarchy) algorithm, a hybrid and clustering-based protocol that could analyze the link cost from a source node to a destination node. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. The proposed CACH could use localized condition to enable adaptation and robustness for dynamic network topology protocol and this provide that our hierarchy to be resilient. As a result, our simulation results would show that CACH could find energy efficient depth of hierarchy of a cluster.

• ETRI Journal
• /
• v.31 no.4
• /
• pp.399-407
• /
• 2009

In this paper, we present a robust $H_{\infty}$ distributed power control scheme for wireless CDMA communication systems. The proposed scheme is obtained by optimizing an objective function consisting of the user's performance degradation and the network interference, and it enables a user to address various user-centric and network-centric objectives by updating power in either a greedy or energy efficient manner. The control law is fully distributed in the sense that only its own channel variation needs to be estimated for each user. The proposed scheme is robust to channel fading due to the immediate decision of the power allocation of the next time step based on the estimations from the $H_{\infty}$ filter. Simulation results demonstrate the robustness of the scheme to the uncertainties of the channel and the excellent performance and versatility of the scheme with users adapting transmit power either in a user-centric or a network-centric efficient manner.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.5
• /
• pp.269-277
• /
• 2018

NAND flash memory has widely been used because of non-volatility, low power consumption and fast access time. However, it suffers from inability to provide update-in-place and the erase cycle is limited. The unit of read/write operation is a page and the unit of erase operation is a block. Moreover erase operation is slower than other operations. We proposed the Adaptive Garbage Collection (called "AGC") policy which focuses on not only reducing garbage collection process time for real-time guarantee but also wear-leveling for a flash memory lifetime. The AGC performs better than Cost-benefit policy and Greedy policy. But the AGC does not consider the operation characteristics. So we proposed the Advanced Adaptive Garbage Collection (called "A-AGC") policy which considers the page write operation count and block erase operation count. The A-AGC reduces the write operations by considering the data update frequency and update data size. Also, it reduces the erase operations by considering the file fragmentation. We implemented the A-AGC policy and measured the performance compared with the AGC policy. Simulation results show that the A-AGC policy performs better than AGC, specially for append operation.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.92-101
• /
• 2009

In this paper, we propose a dynamic bandwidth provisioning method based on traffic forecasting in IEEE 802.16e packet core network. The traffic is categorized as 4-different classes and the traffic amount of each class is forecasted by the Box-Jenkins method. To increase the service provider's revenue we provision the bandwidth of 4-different classes dynamically using greedy algorithm. The simulation results show that the number of packet drops is reduced and the level of QoS is improved compared with two different the methods - no priority considering and static provisioning.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.6
• /
• pp.513-519
• /
• 2013

The current vision-based approaches for emotion recognition, such as facial expression analysis, have many technical limitations in real circumstances, and are not suitable for applications that use them solely in practical environments. In this paper, we propose an approach for emotion recognition by combining extrinsic representations and intrinsic activities among the natural responses of humans which are given specific imuli for inducing emotional states. The intrinsic activities can be used to compensate the uncertainty of extrinsic representations of emotional states. This combination is done by using PRMs (Probabilistic Relational Models) which are extent version of bayesian networks and are learned by greedy-search algorithms and expectation-maximization algorithms. Previous research of facial expression-related extrinsic emotion features and physiological signal-based intrinsic emotion features are combined into the attributes of the PRMs in the emotion recognition domain. The maximum likelihood estimation with the given dependency structure and estimated parameter set is used to classify the label of the target emotional states.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.2
• /
• pp.254-264
• /
• 2007

This paper considers a scheduling problem to minimize the total weighted completion time in the two-stage assembly-type flowshop. The system is composed of multiple fabrication machines in the first stage and a final-assembly machine in the second stage. Each job consists of multiple components, each component is machined on the fabrication machine specified in advance. The manufactured components of each job are subsequently assembled into a final product on the final-assembly machine. The objective of this paper is to find the optimal schedule minimizing the total weighted completion time of jobs. Three lower bounds are derived and tested in a branch-and-bound (B&B) Procedure. Also, three heuristic algorithms are developed based on the greedy strategies. Computational results show that the proposed B&B procedure is more efficient than the previous work which has considered the same problem as this paper.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.11a
• /
• pp.502-509
• /
• 2002

Maximal Covering 문제(MCP)란 행렬 상에서 n개의 열(column) 중 p개를 선택하여 m개의 행(row)중 최대한 많은 행을 cover하는 문제로 정의된다. 본 논문에서는 MCP를 유전 알고리즘(Genetic Algorithm)으로 해결하기 위해 문제에 적합하게 설계된 교차 연산자(crossover operator)와 비발현 유전인잔(unexpressed gene)를 가진 새로운 염색체 구조를 제시한다. 해결하고자 하는 대상 MCP의 규모가 매우 큰 경우 전통적인 임의교차(random crossover) 방법으로는 좋은 결과를 얻기가 힘들다. 따라서 본 연구에서는 그리디 교차(greedy crossover) 방법을 제시하여 문제를 해결한다. 그러나 이러한 그리디 교차를 사용하더라도 조기 수렴 등의 문제로 인해 타부 탐색 등의 이웃해 탐색 방법에 비해 그리 좋은 결과를 얻기가 힘들다. 본 논문은 이러한 조기 수렴 문제를 해결하고 다른 이웃에 탐색 방법보다 더 좋은 결과를 얻기 위해 비발현 유전인자(unexpressed gene)를 가진 염색체를 도입하여 해결함을 특징으로 한다. 비발현 유전인자는 교차 과정에서 자식 염색체의 유전인자로 전달되지 않은 정보 중 나중에라도 유용할 가능성이 보이는 정보를 보존하는 역할을 하여 조기 수렴 문제를 해결하는데 도움을 주어 보다 나은 결과를 얻을 수 있게 해준다. 대규모 MCP를 해결하는 실험에서 새로운 비발현 유전인자를 적용한 유전 알고리즘이 기존의 유전 알고리즘뿐만 아니라 다른 탐색 기법에 비해 더욱 좋은 성능을 보여줌을 확인하였다.

• Journal of Computing Science and Engineering
• /
• v.7 no.1
• /
• pp.67-80
• /
• 2013

The worst-case execution time (WCET) of each real-time task in multicore processors with shared caches can be significantly affected by inter-thread cache interferences. The worst-case inter-thread cache interferences are dependent on how tasks are scheduled to run on different cores. Therefore, there is a circular dependence between real-time task scheduling, the worst-case inter-thread cache interferences, and WCET in multicore processors, which is not the case for single-core processors. To address this challenging problem, we present an offline real-time scheduling approach for multicore processors by considering the worst-case inter-thread interferences on shared L2 caches. Our scheduling approach uses a greedy heuristic to generate safe schedules while minimizing the worst-case inter-thread shared L2 cache interferences and WCET. The experimental results demonstrate that the proposed approach can reduce the utilization of the resulting schedule by about 12% on average compared to the cyclic multicore scheduling approaches in our theoretical model. Our evaluation indicates that the enhanced scheduling approach is more likely to generate feasible and safe schedules with stricter timing constraints in multicore real-time systems.