• Title/Summary/Keyword: Cost Sharing

Search Result 533, Processing Time 0.029 seconds

An Inventory Rationing Method in a M-Store Regional Supply Chain Operating under the Order-up-to Level System

  • Monthatipkul, Chumpol
    • Industrial Engineering and Management Systems
    • /
    • v.8 no.2
    • /
    • pp.80-92
    • /
    • 2009
  • This paper addresses the inventory rationing issue embedded in the regional supply chain inventory replenishment problem (RSIRP). The concerned supply chain, which was fed by the national supply chain, consisted of a single warehouse distributing a single product to multiple stores (M-stores) with independent and normally distributed customer demand. It was assumed that the supply chain operated under the order-up-to level inventory replenishment system and had only one truck at the regional warehouse. The truck could make one replenishment trip to one store per period (a round trip per period). Based on current inventories and the vehicle constraint, the warehouse must make two decisions in each period: which store in the region to replenish and what was the replenishment quantity? The objective was to position inventories so as to minimize lost sales in the region. The warehouse inventory was replenished in every fixed-interval from a source outside the region, but the store inventory could be replenished daily. The truck destination (store) in each period was selected based on its maximum expected shortage. The replenishment quantity was then determined based on the predetermined order-up-to level system. In case of insufficient warehouse inventories to fulfill all projected store demands, an inventory rationing rule must be applied. In this paper, a new inventory rationing rule named Expected Cost Minimization (ECM) was proposed based on the practical purpose. The numerical results based on real data from a selective industry show that its performance was better and more robust than the current practice and other sharing rules in the existing literature.

MMJoin: An Optimization Technique for Multiple Continuous MJoins over Data Streams (데이타 스트림 상에서 다중 연속 복수 조인 질의 처리 최적화 기법)

  • Byun, Chang-Woo;Lee, Hun-Zu;Park, Seog
    • Journal of KIISE:Databases
    • /
    • v.35 no.1
    • /
    • pp.1-16
    • /
    • 2008
  • Join queries having heavy cost are necessary to Data Stream Management System in Sensor Network where plural short information is generated. It is reasonable that each join operator has a sliding-window constraint for preventing DISK I/O because the data stream represents the infinite size of data. In addition, the join operator should be able to take multiple inputs for overall results. It is possible for the MJoin operator with sliding-windows to do so. In this paper, we consider the data stream environment where multiple MJoin operators are registered and propose MMJoin which deals with issues of building and processing a globally shared query considering characteristics of the MJoin operator with sliding-windows. First, we propose a solution of building the global shared query execution plan. Second, we solved the problems of updating a window size and routing for a join result. Our study can be utilized as a fundamental research for an optimization technique for multiple continuous joins in the data stream environment.

Document Management Monitoring System in P2P Environment (P2P 환경에서 문서관리 모니터링 시스템)

  • Kim, Jong-Tae;Kim, Dong-Keun;Maeng, Seung-Ryol
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.3
    • /
    • pp.1402-1408
    • /
    • 2013
  • Document managements are very important in internal communication for good performance on projects. In case of small scale projects, the document management criteria often have very different from each of the cooperation departments and changes of document structure of work process are frequent over a project period. In this thesis, we propose a monitoring system of document management which is based on P2P(Peer-to-Peer). The proposed monitoring system of document management, which is based on P2P, makes up for time limits and a specific work process in small scale project groups. It can be managed focusing on work process and can monitor effectively the status of creations, sharing and distributions of documents. We can be installed at a low cost by using P2P in a small scale project.

Analysis of Multi-Agent-Based Adaptive Droop-Controlled AC Microgrids with PSCAD: Modeling and Simulation

  • Li, Zhongwen;Zang, Chuanzhi;Zeng, Peng;Yu, Haibin;Li, Hepeng;Li, Shuhui
    • Journal of Power Electronics
    • /
    • v.15 no.2
    • /
    • pp.455-468
    • /
    • 2015
  • A microgrid (MG) with integrated renewable energy resources can benefit both utility companies and customers. As a result, they are attracting a great deal of attention. The control of a MG is very important for the stable operation of a MG. The droop-control method is popular since it avoids circulating currents among the converters without using any critical communication between them. Traditional droop control methods have the drawback of an inherent trade-off between power sharing and voltage and frequency regulation. An adaptive droop control method is proposed, which can operate in both the island mode and the grid-connected mode. It can also ensure smooth switching between these two modes. Furthermore, the voltage and frequency of a MG can be restored by using the proposed droop controller. Meanwhile, the active power can be dispatched appropriately in both operating modes based on the capacity or running cost of the Distributed Generators (DGs). The global information (such as the average voltage and output active power of the MG and so on) required by the proposed droop control method to restore the voltage and frequency deviations can be acquired distributedly based on the Multi Agent System (MAS). Simulation studies in PSCAD demonstrate the effectiveness of the proposed control method.

An Improved Method of the Prime Number Labeling Scheme for Dynamic XML Documents (빈번히 갱신되는 XML 문서에 대한 프라임 넘버 레이블링 기법)

  • Yoo, Ji-You;Yoo, Sang-Won;Kim, Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.129-137
    • /
    • 2006
  • An XML labeling scheme is an efficient encoding method to determine the ancestor-descendant relationships of elements and the orders of siblings. Recently, many dynamic XML documents have appeared in the Web Services and the AXML(the Active XML), so we need to manage them with a dynamic XML labeling scheme. The prime number labeling scheme is a representative scheme which supports dynamic XML documents. It determines the ancestor-descendant relationships between two elements with the feature of prime numbers. When a new element is inserted into the XML document using this scheme, it has an advantage that an assigning the label of new element don't change the label values of existing nodes. But it has to have additional expensive operations and data structure for maintaining the orders of siblings. In this paper, we suggest the order number sharing method and algorithms categorized by the insertion positions of new nodes. They greatly minimize the existing method's sibling order maintenance cost.

Effects Analysis of Electronic Journal Subscription on Special Library Operation : A Case Study in KIST (전자 학술지가 전문도서관 운영에 미치는 영향 분석 : KIST 사례를 중심으로)

  • Kang, Dae-Shin;Shin, Yong-Su;Shin, Mal-Suk;Yoon, Hyea-Jeong
    • Journal of Information Management
    • /
    • v.34 no.3
    • /
    • pp.69-85
    • /
    • 2003
  • This case study analyzed how electronic journal subscription had an effect on special library management including budget, information behavior, library operations, facilities, space et al. in KIST. This study suggests the followings; 1) Since electronic journals has an effect on overall operations of special libraries, draw big pictures not by functions. 2) Though the most method for subscription is consortium, it is necessary to build cooperation network for information sharing and vary cost architecture of information use. 3) Through job analysis, redesign jobs. 4) Reconstruct stacks and facilities. 5) It is necessary paradigm shift that it is more important to use than preserve materials in the special libraries.

Performance Measurement of Residential Broadband Network with Monarch (Monarch를 이용한 주택내 초고속 인터넷망의 성능 측정)

  • Choi, Soon-Byoung;Lee, Young-Seok
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.5
    • /
    • pp.369-375
    • /
    • 2009
  • Residential broadband networks (RBN) are quickly evolving from xDSL/Cable networks to FTTH services with lOOMbps bandwidth. With the high-speed Internet services, subscribers tend to use web, multimedia, game or file sharing applications. Therefore, performance of RBN is important to the quality of services for users. Typically, Internet service providers (ISPs) are providing their RBN performance results that are measured by subscribers with the dedicated measurement tools. However, they do not make their results public to people. In order to obtain the performance results measured by users, we have to induce a lot of subscribers, which will take a lot of cost and time. Monarch, that is used in this paper, could provide the 3rd party measurement method without the help of ISPs and subscribers. With the extensive experiments through Monarch, we have shown that 3rd party measurement results are not much different from those of user-initiated measurement. In addition, we have observed that bandwidth is around $80{\sim}90Mbps$ and RTT is less than 30ms in FTTH services provided by three major Korean ISPs.

Household Out-of-Pocket Payments and Trend in Korea (가계직접부담 비용의 현황과 추이)

  • Park, Yoonsik;Park, Eun-Cheol
    • Health Policy and Management
    • /
    • v.29 no.3
    • /
    • pp.374-378
    • /
    • 2019
  • After the announcement of Moon Jae-in Government's plan (Moon's Care) for Benefit Expansion in National Health Insurance in August 2017, it is necessary to monitor the effects of the policy, especially household out-of-pocket payments (OOP). This paper aims to observe the current status and trend of OOP in Korea. Current health expenditure (CHE) was 144.4 trillion won in 2018, which accounts for 8.1% of gross domestic product (GDP) increased 9.7% from the previous year. Although GDP's share of CHE has been close to the average of the Organization for Economic Cooperation and Development (OECD) countries, the public fund's share was 59.8% of the total in 2018, which was lower than the OECD average of 73.5%. OOP's share was 32.9% in 2018, which decreased from 37.4% in 2008. The share of OOP of non-covered services was 20.0% in 2018, which decreased from 22.9% in 2008. The share of cost-sharing with third-party payers was 12.9% in 2018, which decreased from 14.5% in 2008. The OOP of non-covered services was significantly decreased in hospital and inpatient curative care, but the OOP of non-covered services was significantly increased in the medical clinic. The effect of Moon's Care was not showed in OOP through the results of 2017 and 2018, but further monitoring is needed because the Moon's Care is progressing and the observational period is short.

A Repository Utilization System to optimize maintenance of IIoT-based main point Utilities (IIoT 기반한 핵심유틸리티의 유지보수 최적화를 위한 공동 활용 시스템)

  • Lee, Byung-Ok;Lee, Kun-Woo;Kim, Young-Gon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.5
    • /
    • pp.89-94
    • /
    • 2021
  • Recently, manufacturing companies are introducing many intelligent production processes that apply IIoT/ICT to improve competitiveness, and a system that maintains availability, improves productivity, and optimizes management costs is needed as a preventive measure using environmental data generated from air ejectors. Therefore, in this study, a dedicated control board was developed and LoRa communication module was applied to remotely control it to collect and manage information about compressors from cloud servers and to ensure that all operators and administrators utilize common data in real time. This dramatically reduced M/S steps, increased system operational availability, and reduced local server operational burden. It dramatically reduced maintenance latency by sharing system failure conditions and dramatically improved cost and space problems by providing real-time status detection through wired and mobile utilization by maintenance personnel.

De-Centralized Information Flow Control for Cloud Virtual Machines with Blowfish Encryption Algorithm

  • Gurav, Yogesh B.;Patil, Bankat M.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.12
    • /
    • pp.235-247
    • /
    • 2021
  • Today, the cloud computing has become a major demand of many organizations. The major reason behind this expansion is due to its cloud's sharing infrastructure with higher computing efficiency, lower cost and higher fle3xibility. But, still the security is being a hurdle that blocks the success of the cloud computing platform. Therefore, a novel Multi-tenant Decentralized Information Flow Control (MT-DIFC) model is introduced in this research work. The proposed system will encapsulate four types of entities: (1) The central authority (CA), (2) The encryption proxy (EP), (3) Cloud server CS and (4) Multi-tenant Cloud virtual machines. Our contribution resides within the encryption proxy (EP). Initially, the trust level of all the users within each of the cloud is computed using the proposed two-stage trust computational model, wherein the user is categorized bas primary and secondary users. The primary and secondary users vary based on the application and data owner's preference. Based on the computed trust level, the access privilege is provided to the cloud users. In EP, the cipher text information flow security strategy is implemented using the blowfish encryption model. For the data encryption as well as decryption, the key generation is the crucial as well as the challenging part. In this research work, a new optimal key generation is carried out within the blowfish encryption Algorithm. In the blowfish encryption Algorithm, both the data encryption as well as decryption is accomplishment using the newly proposed optimal key. The proposed optimal key has been selected using a new Self Improved Cat and Mouse Based Optimizer (SI-CMBO), which has been an advanced version of the standard Cat and Mouse Based Optimizer. The proposed model is validated in terms of encryption time, decryption time, KPA attacks as well.