• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.11
• /
• pp.1001-1011
• /
• 2012

In this paper, the effects to system performance are evaluated in IEEE 802.11 system when the number of competing terminals are estimated and reflected to the system. The IEEE 802.11 system uses DCF (Distributed Coordination Function) for the multiple access method, and the system throughput performance depends on the accuracy of the estimated number of competing terminals. We propose extended H infinity filter (EHIF) approach which does not require the noise information for estimating the number of competing terminals. Simulation results show that EHIF outperforms the extended Kalman filter in both saturated and non-saturated network conditions.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.155-161
• /
• 2008

An automated healthcare monitoring is demand of time, lot of problems occurring just because of less monitoring of patients health condition on time. In this paper an embedded healthcare service is proposed by an iSCSI protocol on an automated multi-agent coordination by resource-constrained devices controlled system for healthcare service. The coordination between the resource constrained devices (e.g. PDA, SmartPhone, Tablet PC), and automated agents are maintained by a two-way handshaking mode iSCSI protocol. The automated health care control could be useable, and beneficial in the repetitive way. A fully centralized control is not applicable for this kind of approach.

• Industrial Engineering and Management Systems
• /
• v.14 no.2
• /
• pp.129-158
• /
• 2015

It is necessary for retailers to determine the optimal ordering policy of products considering supply disruptions due to a natural disaster and a production process failure as quality and machine breakdowns. Under the situation, a dualsourcing supply chain (DSSC) is one of effective SC for retailers to order products reliably. This paper proposes the optimal ordering policy of a product in a DSSC with a retailer and two manufacturers. Two manufacturers may face supply disruptions due to a natural disater and a production process failure after they received the retailer's order of products. Here, two scenarios of demand information of products are assumed: (i) the demand distribution is known (ii) mean and variance of the demand are known. Under above situations, two types of DSSC are discussed. Under a decentralized DSSC (DSC), a retailer determines the optimal ordering policy to maximize his/her total expected profit. Under the integrated DSSC (ISC), the optimal ordering policy is determined to maximize the whole system's total expected profit. Numerical analysis investigates how demand information and supply disruptions affect the optimal decisions under DSC and ISC. Besides, profitability of supply chain coordination adjusting the wholesale price is evaluated to encourage the optimal decision under ISC.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.617-624
• /
• 2001

With the proliferation of E-Commerce, product informations and services are provided to customers diversely. Thus customers want a software agent that can retrieve and recommend goods satisfying various purchase conditions as well as price. In this paper, we present a MAS (multi-agent system) for book information retrieval and recommendation in E-Commerce. User's preference is reflected in the MAS using the profile which is taken by user. The proposed MAS is composed of individual agents that support information retrieval, information recommendation, user interface, and web robots and a coordination agent which performs information sharing and job management between individual agents. Our goal is to design and implement this multi-agent system on a Windows NT server. Owing to the workflow management of the coordination agent, we can remove redundant information retrievals of web robots. From the results, we could provide customers various purchase conditions for several online bookstores in real-time.

• Bulletin of the Korean Chemical Society
• /
• v.25 no.4
• /
• pp.581-583
• /
• 2004

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.9 no.6
• /
• pp.171-181
• /
• 2014

CSV(Creating Shared Value) model was proposed by Porter and Kramer (2011) to address relationship between businesses and society. Namely, it means that CSV deals with business value and social problem solving simultaneously. In this paper, the notion of CSV was applied to the food enterprise, and the cases of CSV with farming area were discovered. Especially, this paper proposed the framework for analyzing CSV activity based on the three-level of CSV suggested by Porter and Kramer (2011) and strategic options for vertical coordination proposed by Peterson et al. (2001). As a result of case analysis applying the proposed framework in this study, three types of CSV activity were discovered: Local food type, downstream support type, and joint corporate establish type. Local food type creates CSV based on momentary purchase or specification contract as strategic options for vertical coordination. Downstream support type creates CSV mainly based on relation-based alliance as a strategic option for vertical coordination. Lastly, joint corporate establish type creates CSV based on equity-based alliance as a strategic option for vertical coordination. This paper contributed to the CSV literatures for discovering cases of CSV with farming area and categorizing discovered cases applying proposed framework.

• Journal of Intelligence and Information Systems
• /
• v.14 no.1
• /
• pp.47-66
• /
• 2008

This study is aimed at proposing a new type of ubiquitous decision support system (u-DSS) portal which is embedded with two important mechanisms like an intelligent ontology management module (i-OMM) and multi-agent coordination mechanism (MACM). The proposed portal provides timely decision support to the involved decision entities (represented as agents) by taking advantage of the two mechanisms embedded on the portal. The most important virtue of the proposed portal is that it can resolve two problems such as semantic discordance and data confliction which are occurring very often in an ubiquitous computing environment. Frequent requests of revising the already established decision information due to the rapid changes in decision entities' requirements require the extremely flexible and intelligent u-DSS vehicle like theproposed mechanism. In this sense, the i-OMM is designed to provide support to solving the semantic discordance in the way that the i-OMM virtually integrates ontology view (IOV) to integrate heterogeneous ontology among the agents engaged inubiquitous commerce situations. Then the i-OMM sends the IOV to the MACM to resolve the conflicts among the involved agents. The proposed u-DSS portal was applied to the u-fulfillment problem in which all the involved decisionagents need their own requirements to be satisfied seamlessly and timely. The experimental results show that the proposed u-DSS portal is very robust and promising in the field of u-DSS and context modeling.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.6
• /
• pp.1333-1340
• /
• 2015

IEEE 802.11 MAC(Media Access Control) defines DCF(Distributed Coordination Function) for data transmission control. BEB(Binary Exponential Backoff) algorithm of DCF has a problem that if the number of stations connected are over a certain threshold, it degrades network performance because of packet collisions caused from the minimum contention window size. To cope with this problem, we proposed a novel algorithm, named as VBS(Variable Backoff Stage) algorithm, which adjusts the rate of backoff stage increment depending on the number of stations associated with an AP(Access Point). Analytic model of proposed algorithm was derived and simulations on the BEB and the VBS algorithms have been conducted on the OFDM (Orthogonal Frequency Division Multiplexing) method. Simulation results showed that when the rate of backoff state increment was 5 and 10, the number of retransmission were reduced to 1/5 and 1/10 comparing to that of BEB, respectively. Our algorithm showed improvement of 19% and 18% in network utilization, respectively. Packet delay was reduced into 1/12.

• The Journal of the Korea Contents Association
• /
• v.7 no.4
• /
• pp.66-73
• /
• 2007

Internet is a part of our common life and tremendous information is cumulated. In these trends, the personalization becomes a very important technology which could find exact information to present users. Previous personalized services use content based filtering which is able to recommend by analyzing the content and collaborative filtering which is able to recommend contents according to preference of users group. But, collaborative filtering needs the evaluation of some amount of data. Also, It cannot reflect all data of users because it recommends items based on data of some users who have similar inclination. Therefore, we need a new recommendation method which can recommend prefer items without preference data of users. In this paper, we proposed the apparel coordination system using personalized preference on the semantic web. This paper provides the results which this system can reduce the searching time and advance the customer satisfaction measurement according to user's feedback to system.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.6
• /
• pp.9-17
• /
• 2014

Heterogeneous network (HetNet) is a network consisting of macrocells overlaid with small cells. In HetNet, the interference from macrocell to small cell users is a major cause of performance degradation of small cell users and enhanced inter-cell interference coordination (eICIC) is needed to mitigate the interference. Previous works on eICIC gives limited performance gain because these works focus on maximizing long-term throughput and rarely consider varying channel conditions over frames. This paper proposes a new algorithm which dynamically coordinates interference and schedules users on each frame to maximize the total utility of the network with lower computational complexity than exhaustive search. Simulation results show that the proposed algorithm achieves higher total throughput than the throughput with the conventional algorithm, and has higher fairness index than the conventional algorithm when there large number of users.