• Industrial Engineering and Management Systems
• /
• 제9권2호
• /
• pp.97-106
• /
• 2010

Can eBay.com's fee structure coordinate the channel? It's a critical strategic problem in e-commerce operations and an interesting research hypothesis as well. eBay's fees include three parts: monthly subscription fee, insertion fee, and final value fee (i.e., a revenue sharing portion), which represent a generic form of revenue sharing fee structure between the retailer and the vendor in a supply chain. This research deals with such a channel consisting of a price-setting vendor who sells products through eBay's marketplace exclusively to the end customers. The up- and down-stream channel relationship is consignment-based revenue sharing. We use a game-theoretic approach with assumption of the retailer (i.e., eBay.com) being a Stackelberg-leader and the vendor being a follower. The Stackelberg-leader decides on the terms of revenue sharing contract (i.e., fee structure), and the follower (vendor) decides on how many units to sell and the items' selling price. This study formulates several profit-maximization models by considering the effects of the retail price on the demand function. Under such settings, we show that eBay's fee structure can improve the channel efficiency; yet it cannot coordinate the channel optimally.

• 제어로봇시스템학회논문지
• /
• 제9권4호
• /
• pp.310-319
• /
• 2003

As the importance and the need for network security are increased, many organizations use the various security systems. They enable to construct the consistent integrated security environment by sharing the network vulnerable information among IDS (Intrusion Detection System), firewall and vulnerable scanner. The multiple IDSes coordinate by sharing attacker's information for the effective detection of the intrusion is the effective method for improving the intrusion detection performance. The system which uses BBA (Blackboard Architecture) for the information sharing can be easily expanded by adding new agents and increasing the number of BB (Blackboard) levels. Moreover the subdivided levels of blackboard enhance the sensitivity of the intrusion detection. For the simulation, security models are constructed based on the DEVS (Discrete Event system Specification) formalism. The intrusion detection agent uses the ES (Expert System). The intrusion detection system detects the intrusions using the blackboard and the firewall responses to these detection information.

• Industrial Engineering and Management Systems
• /
• 제8권4호
• /
• pp.213-220
• /
• 2009

A revenue sharing contract is one of the mechanisms that coordinate decision makers in a decentralized supply chain toward the consensual goal. The transfer prices between different echelons in the supply chain influence the total supply chain profits. The study aims to explore various transfer pricing heuristics on the supply chain coordination in terms of the supply chain profits and their interactions with the revenue sharing rate. A model is proposed for formulating the collaborative production and distribution planning in a decentralized supply chain with the revenue sharing mechanism. Experiment results indicate that the transfer price and the revenue sharing rate affect significantly the coordination. Among the studied pricing heuristics, the variable-cost pricing method led to the best SC profits. Raising the revenue sharing rate reduced the SC profits no matter what heuristics were employed. Furthermore, the experiments provide us clues for finding the optimal transfer price for the supply chain.

• Journal of Information Processing Systems
• /
• 제17권6호
• /
• pp.1157-1169
• /
• 2021

Modern graphics processor unit (GPU) architectures offer significant hardware resource enhancements for parallel computing. However, without software optimization, GPUs continuously exhibit hardware resource underutilization. In this paper, we indicate the need to alter different warp scheduler schemes during different kernel execution periods to improve resource utilization. Existing warp schedulers cannot be aware of the kernel progress to provide an effective scheduling policy. In addition, we identified the potential for improving resource utilization for multiple-warp-scheduler GPUs by sharing stalling warps with selected warp schedulers. To address the efficiency issue of the present GPU, we coordinated the kernel-aware warp scheduler and warp sharing mechanism (KAWS). The proposed warp scheduler acknowledges the execution progress of the running kernel to adapt to a more effective scheduling policy when the kernel progress attains a point of resource underutilization. Meanwhile, the warp-sharing mechanism distributes stalling warps to different warp schedulers wherein the execution pipeline unit is ready. Our design achieves performance that is on an average higher than that of the traditional warp scheduler by 7.97% and employs marginal additional hardware overhead.

• 한국시뮬레이션학회논문지
• /
• 제11권4호
• /
• pp.91-105
• /
• 2002

The attackers on Internet-connected systems we are seeing today are more serious and technically complex than those in the past. So it is beyond the scope of amy one system to deal with the intrusions. That the multiple IDSes (Intrusion Detection System) coordinate by sharing attacker's information for the effective detection of the intrusion is the effective method for improving the intrusion detection performance. The system which uses BBA (BlackBoard Architecture) for the information sharing can be easily expanded by adding new agents and increasing the number of BB (BlackBoard) levels. Moreover the subdivided levels of blackboard enhance the sensitivity of the intrusion detection. For the simulation, security models are constructed based on the DEVS (Discrete EVent system Specification) formalism. The intrusion detection agent uses the ES (Expert System). The intrusion detection system detects the intrusions using the blackboard and the firewall responses these detection information.

• Industrial Engineering and Management Systems
• /
• 제8권1호
• /
• pp.1-13
• /
• 2009

This paper presents a coordinated planning model of price-dependent demand for a single-manufacturer and a single-retailer. The demand is assumed to be normally distributed, with its mean being price dependent. The manufacturer and retailer coordinate with each other to jointly and simultaneously determine the retail selling price and the retailer order quantity to maximize the joint expected total profit. This model is then compared to a 'returns' policy model where manufacturer buys back unsold items from the retailers. It is shown that the optimal total profit is higher for coordinated planning model than that for the returns policy model, in which the retail price is set by the retailer. A compensation or profit sharing scheme is then suggested and it is shown that the coordinated model with profit sharing yields a 'win-win' situation. Numerical results are presented to illustrate the profit patterns for both linear and nonlinear demand functions. The coordinated planning model, in addition, has a lower optimal price than for a returns policy model, which would result in higher sales, thus expanding the markets for the whole supply chain.

• ETRI Journal
• /
• 제31권1호
• /
• pp.89-91
• /
• 2009

This letter considers the problem of resource sharing among a relay and multiple user nodes in cooperative transmission networks. We formulate this problem as a sellers' market competition and use a noncooperative game to jointly consider the benefits of the relay and the users. We also develop a distributed algorithm to search the Nash equilibrium, the solution of the game. The convergence of the proposed algorithm is analyzed. Simulation results demonstrate that the proposed game can stimulate cooperative diversity among the selfish user nodes and coordinate resource allocation among the user nodes effectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5209-5228
• /
• 2016

Device-to-device (D2D) communication underlaying cellular networks can bring significate benefits for improving the performance of mobile services. However, it hinges on elaborate resource sharing scheme to coordinate interference between cellular users and D2D pairs. We formulate a joint mode selection, link allocation and power control optimization problem for D2D communication sharing uplink resources in a multi-user cellular network and consider the efficiency and the fairness simultaneously. Due to the non-convex difficulty, we propose a three-step scheme: firstly, we conduct mode selection for D2D pairs based on a minimum distance metric after an admission control and obtain some cellular candidates for them. And then, a cellular candidate will be paired to each D2D pair based on fairness. Finally, we use Lagrangian Algorithm to formulate a joint power control strategy for D2D pairs and their reused cellular users and a closed-form of solution is derived. Simulation results demonstrate that our proposed algorithms converge in a short time. Moreover, both the sum rate of D2D pairs and the energy efficiency of cellular users are improved.

• 한국컴퓨터산업학회논문지
• /
• 제5권2호
• /
• pp.251-260
• /
• 2004

네트워크 보안의 중요성과 필요성이 증대됨에 따라 많은 조직들이 다양한 보안 시스템을 네트워크에 적용하고 있다. 침입 차단 시스템, 침입 탐지 시스템, 취약점 스캐너와 같은 보안 시스템들이 취약성 정보를 공유하게 되면 일관된 통합 보안 환경을 구축할 수 있다. 본 논문에서는 침입탐지 에이전트와 방화벽 에이전트가 계약망 프로토콜(Contract Net Protocol)에 의해서 서로 연동할 수 있는 구조를 디자인하고 구축하려다 계약망 프로토콜은 분산 시스템과 같은 이 기종의 컴퓨터 시스템의 효과적인 연통을 위한 방법으로서 여러 에이전트들이 모여 서로 협력하며 하나의 문제를 해결하게 된다 계약망 프로토콜의 선택 알고리즘과 퍼지 제어기를 사용하였을 경우 성능을 비교함으로써 에이전트 선택에 있어서 보다 효과적인 방법을 제시할 것이다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제5권5호
• /
• pp.346-348
• /
• 2016

Coordinated multi-point transmission is a candidate technique for next-generation cellular communications systems. We consider a system with multiple cells in which base stations coordinate with each other by sharing user channel state information, which mitigates inter-cell interference (ICI), especially for users located at the cell edge. We introduce a new user scheduling method that considers both ICI and intra-cell orthogonality. Due to the influence of ICI cancellation and the loss reduction of effective channel gain during the beamforming process, the proposed method improves the system sum rate, when compared to the conventional method, by an average of 0.55bps/Hz for different numbers of total users per cell.