• Title/Summary/Keyword: Service chain

Search Result 914, Processing Time 0.03 seconds

The Trend of e-Business and hereafter development direction (e-Business의 동향과 향후 전개 방향)

  • Lee, Hyun-Sik
    • International Commerce and Information Review
    • /
    • v.3 no.1
    • /
    • pp.7-24
    • /
    • 2001
  • 많은 기업들이 e-Business를 적극 추진하고 있으나, 기대한 만큼의 경영성과를 올리고 있는 기업은 거의 없는 실정이며, 더 나아가 e-Business의 회의론까지 대두되고 있는 실정이다. 그럼에도 불구하고 e-Business는 Product & Service Leadership, Operational Excellence, Customer Intimacy 확보 차원에서 지속적으로 성장할 것으로 예상된다. 따라서 Off-line 기업의 IT 설비투자 확대, Off-line 기업과 온라인 기업간의 적절한 조화, 기업간 협력 활성화, 닷컴 기업의 경쟁력 확보 등이 갖춰지면 e-business는 향후 우리에게 새로운 도전과 기회를 제공할 것이다.

  • PDF

System Architecture of Networked Digital Recorder for Digital TV Broadcasting Applied Services (서버형 디지털방송 응용서비스를 위한 네트워크 디지털 레코더 기술 개발)

  • Park, Byoung-Ha;Hong, Sung-Hye;Kim, Chan-Gyu;Hong, In-Hwa
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.288-290
    • /
    • 2004
  • Networked Digital Recorder(NDR) Platform is a system that owns contents jointly between tv viewers connected by the broadcast broadband convergence network. NDR suggests a new content distribution chain model that users can receive broadcast contents, share contents and sends contents by convergence network. This paper looks at the system requirements, service model and the overall system architecture of NDR platform.

  • PDF

Performance Analysis of a Loss Retrial BMAP/PH/N System

  • Kim Che-Soong;Oh Young-Jin
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.9 no.3
    • /
    • pp.32-37
    • /
    • 2004
  • This paper investigates the mathematical model of multi-server retrial queueing system with the Batch Markovian Arrival Process (BMAP), the Phase type (PH) service distribution and the finite buffer. The sufficient condition for the steady state distribution existence and the algorithm for calculating this distribution are presented. Finally, a formula to solve loss probability in the case of complete admission discipline is derived.

  • PDF

THE M/G/1 QUEUE WITH MARKOV MODULATED FEEDBACK

  • Han, Dong-Hwan;Park, Chul-Geun
    • Journal of applied mathematics & informatics
    • /
    • v.5 no.3
    • /
    • pp.827-837
    • /
    • 1998
  • We consider the M/G/1 queue with instantaneous feed-back. The probabilities of feedback are determined by the state of the underlaying Markov chain. by using the supplementary variable method we derive the generating function of the number of customers in the system. In the analysis it is required to calculate the matrix equations. To solve the matrix equations we use the notion of Ex-tended Laplace Transform.

COGNITIVE RADIO SPECTRUM ACCESS WITH CHANNEL PARTITIONING FOR SECONDARY HANDOVER CALLS

  • Lee, Yutae
    • Journal of applied mathematics & informatics
    • /
    • v.33 no.1_2
    • /
    • pp.211-217
    • /
    • 2015
  • A dynamic spectrum access scheme with channel partitioning for secondary handover calls in cognitive radio networks is proposed to reduce forced termination probability due to spectrum handover failure. A continuous-time Markov chain method for evaluating its performance such as blocking probability, forced termination probability, and throughput is presented. Numerical and simulation results are provided to demonstrate the effectiveness of the proposed scheme with channel partitioning.

COVID -19: Protection of Workers at the Workplace in Singapore

  • Ng, Wee Tong
    • Safety and Health at Work
    • /
    • v.12 no.1
    • /
    • pp.133-135
    • /
    • 2021
  • The COVID-19 pandemic has resulted in movement restrictions being instituted globally and the cessation of work at many workplaces. However, during this period, essential services such as healthcare, law enforcement, and critical production and supply chain operations have been required to continue to function. In Singapore, measures were put in place to protect the workers from infection at the workplace, as well as to preserve the operational capability of the essential service in a COVID-19 pandemic environment. This paper critically analyses the measures that were implemented and discusses the extension to broader general industry.

An Evaluation of Cold Chain Cluster Competitiveness in the Metropolitan Area (수도권 콜드체인 클러스터 경쟁력 평가에 관한 연구)

  • Ahn, Kil-Seob;Park, Sung-Hoon;Lee, Hae-Chan;Yeo, Gi-Tae
    • Journal of Digital Convergence
    • /
    • v.18 no.10
    • /
    • pp.181-194
    • /
    • 2020
  • Due to the changes in the distribution market, issues related to storage and distribution of agricultural, aquatic and livestock products, and storage and transportation of processed and fresh food are rapidly emerging, and as a result, Cold Chain is naturally receiving attention as one of the logistics services. The purpose of this study is to evaluate the competitiveness of location in the construction of a cold chain cluster centered on the metropolitan area, which has attracted attention in relation to the distribution of cold chains, such as recently refrigerated frozen foods. To this end, this study evaluated the competitiveness of cold chain cluster candidates in the metropolitan area by utilizing the CFPR (Consistent Fuzzy Preference Relations) method that can efficiently extract and quantify expert knowledge. As a result, the location competitiveness was found to be superior to Incheon New Port's hinterland, Gyeonggi South Area (Yongin), Gyeonggi West Area (Gimpo Logistics Complex), and Pyeongtaek Oseong Logistics Complex. In particular, this study extracted the knowledge of refrigerated and refrigerated logistics warehouse operation experts, and conducted detailed competitiveness assessments for cold chain cluster candidates in the metropolitan area, and suggested the optimal cluster candidates. In the future research, it is necessary to classify the questionnaire into the owner, large business group, and public business group, etc., who have the right to purchase and build to secure ownership of the fresh food distribution center.

Prevalence and genotypes of pestivirus in Korean goats

  • Yang, Dong-Kun;Kweon, Chang-Hee;Kim, Byoung-Han;Choi, Cheong-Up;Kang, Mun-Il;Hyun, Bang-Hun;Hwang, In-Jin;Lee, Cheong-San;Cho, Kyoung-Oh
    • Korean Journal of Veterinary Research
    • /
    • v.48 no.1
    • /
    • pp.83-88
    • /
    • 2008
  • In total, 1,142 serum samples were collected from 223 goat flocks rising in five different regions of Korea. These samples were screened for the presence of border disease virus (BDV) antibodies using an enzyme linked immunosorbent assay. Of the 1,142 samples, we found 47 bovine viral diarrhea virus (BVDV) positive cases (4.1%). These positive serum samples were also examined further by using the virus neutralization test against BDV. In addition, samples were tested for both BVDV and classical swine fever virus (CSFV). All of the samples that were seropositive for BDV also demonstrated positive antibody titers against BVDV and CSFV. Due to their common antigenicity, we also determined further the prevalence and carried out virus neutralization test against three pestiviruses: 314 of the goat samples were screened using reverse transcription polymerase chain reaction with primer pairs specific to common pestivirus genome regions. Overall, 1.6% (5/314) of the samples tested was positive for pestivirus. Based on the nucleotide sequence data and the phylogenetic analysis, three isolates were characterized as BVDV type 1 and two isolates as BVDV type 2. However, none of the isolates could be classified as BDV. These results indicate that BVDV-1 and BVDV-2 are the pestivirus strains circulating among Korean goat populations.

Performance Analysis of a Congestion cControl Mechanism Based on Active-WRED Under Multi-classes Traffic (멀티클래스 서비스 환경에서 Active-WRED 기반의 혼잡 제어 메커니즘 및 성능 분석)

  • Kim, Hyun-Jong;Kim, Jong-Chan;Choi, Seong-Gon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.5
    • /
    • pp.125-133
    • /
    • 2008
  • In this paper, we propose active queue management mechanism (Active-WRED) to guarantee quality of the high priority service class in multi-class traffic service environment. In congestion situation, this mechanism increases drop probability of low priority traffic and reduces the drop probability of the high priority traffic, therefore it can improve the quality of the high priority service. In order to analyze the performance of our mechanism we introduce the stochastic analysis of a discrete-time queueing systems for the performance evaluation of the Active Queue Management (AQM) based congestion control mechanism called Weighted Random Early Detection (WRED) using a two-state Markov-Modulated Bernoulli arrival process (MMBP-2) as the traffic source. A two-dimensional discrete-time Harkov chain is introduced to model the Active-WRED mechanism for two traffic classes (Guaranteed Service and Best Effort Service) where each dimension corresponds to a traffic class with its own parameters.

A Heuristic for Service-Parts Lot-Sizing with Disassembly Option (분해옵션 포함 서비스부품 로트사이징 휴리스틱)

  • Jang, Jin-Myeong;Kim, Hwa-Joong;Son, Dong-Hoon;Lee, Dong-Ho
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.44 no.2
    • /
    • pp.24-35
    • /
    • 2021
  • Due to increasing awareness on the treatment of end-of-use/life products, disassembly has been a fast-growing research area of interest for many researchers over recent decades. This paper introduces a novel lot-sizing problem that has not been studied in the literature, which is the service-parts lot-sizing with disassembly option. The disassembly option implies that the demands of service parts can be fulfilled by newly manufactured parts, but also by disassembled parts. The disassembled parts are the ones recovered after the disassembly of end-of-use/life products. The objective of the considered problem is to maximize the total profit, i.e., the revenue of selling the service parts minus the total cost of the fixed setup, production, disassembly, inventory holding, and disposal over a planning horizon. This paper proves that the single-period version of the considered problem is NP-hard and suggests a heuristic by combining a simulated annealing algorithm and a linear-programming relaxation. Computational experiment results show that the heuristic generates near-optimal solutions within reasonable computation time, which implies that the heuristic is a viable optimization tool for the service parts inventory management. In addition, sensitivity analyses indicate that deciding an appropriate price of disassembled parts and an appropriate collection amount of EOLs are very important for sustainable service parts systems.