• Title/Summary/Keyword: Chain Operation

Search Result 426, Processing Time 0.023 seconds

Facility Location Planning with Realistic Operation Times in Supply Chain (공급사슬에서 실제 시설물 운영시간을 고려한 시설배치계획에 관한 연구)

  • Lee Sang Heon;Kim Sook Han
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.2
    • /
    • pp.143-156
    • /
    • 2005
  • Facility location planning (FLP) problem is the strategic level planning in supply chain. The FLP is significantly affected by the operation time of each facility. In most of the FLP researches, operation time of facility has been treated as a fixed value. However, the operation time is not a static factor in real situations and the fixed operation time may lead unrealistic FLP. In this paper, a mixed integer programming (MIP) model is proposed for solving the 3-stage FLP problem and operation times are adjusted by the results from the simulation model and an iterative approach combining the analytic model and simulation model is proposed to obtain more realistic operation plans for FLP problems.

Detection for Operation Chain: Histogram Equalization and Dither-like Operation

  • Chen, Zhipeng;Zhao, Yao;Ni, Rongrong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3751-3770
    • /
    • 2015
  • Many sorts of image processing software facilitate image editing and also generate a great number of doctored images. Forensic technology emerges to detect the unintentional or malicious image operations. Most of forensic methods focus on the detection of single operations. However, a series of operations may be used to sequentially manipulate an image, which makes the operation detection problem complex. Forensic investigators always want to know as much exhaustive information about a suspicious image's entire processing history as possible. The detection of the operation chain, consisting of a series of operations, is a significant and challenging problem in the research field of forensics. In this paper, based on the histogram distribution uniformity of a manipulated image, we propose an operation chain detection scheme to identify histogram equalization (HE) followed by the dither-like operation (DLO). Two histogram features and a local spatial feature are utilized to further determine which DLO may have been applied. Both theoretical analysis and experimental results verify the effectiveness of our proposed scheme for both global and local scenarios.

A Study of the Tenant Strategy for Chain Operation System - Focused on Discount Store - (체인오퍼레이션을 위한 테넌트 전략에 관한 연구)

  • Kim, Yoo-oh
    • Journal of Distribution Science
    • /
    • v.3 no.1
    • /
    • pp.43-67
    • /
    • 2005
  • Recently retail market has been rapidly expanded in the large cities of in Korea and the competition among individual companies in retail market is also being increased. Tenant MD of mixing is one of the most important factor for the company to continuously operate or to fail. The aim of this study is to examine the processes of systematically evaluating the merchandising of the established companies in retail market a part of chain operation in discount store. The basic problem of decision making in general and tenant MD of mixing in particular is to choose a best one in a set of competing alternatives that are evaluated under conflicting criteria. The purpose of research of a paper carries out a duty searching examination with making a tenant MD include by retail research, simultaneously defined when I will show an example for the tenant mix of the profitability side of the domestic discount store market which is tenant MD importance proposing the existing problem arrangement by chain operation management, and is intensifying - tenant MD of standardization in discount store of T-company.

  • PDF

A Study on Business Process Patterns for Integrated Supply Chain Planning : Based on Analysis of RFQ Types (통합 공급망계획을 위한 비즈니스 프로세스 패턴 연구 : 견적요청 유형 분석을 바탕으로)

  • Jeong, Han-Il;Chang, Tai-Woo
    • Journal of Information Technology Applications and Management
    • /
    • v.15 no.1
    • /
    • pp.83-97
    • /
    • 2008
  • Today's competitive global market makes most enterprise endeavor to specialize their business areas, and co-operate with trading partners in supply chain by the forms of collaboration, information and business process sharing. However, even the supply chain plan generated by co-operation often fails to be executed successfully, because it was generated without capacities of suppliers and more over nested suppliers. To overcome this limitation, the supply chain plan of an enterprise should be generated truly integrated way. In this paper, we classify business patterns based on scenarios about quotation processing and supply chain planning in self-integrated environment. And we present business process models about four business patterns and describe them, which are classified by whether request for quotation includes information about price, required time periods, and quantity for each required time period and whether it is received from customer or sent to supplier. In addition, we describe the types of supply chain planning problem.

  • PDF

SPCBC: A Secure Parallel Cipher Block Chaining Mode of Operation based on logistic Chaotic Map

  • El-Semary, Aly M.;Azim, Mohamed Mostafa A.;Diab, Hossam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3608-3628
    • /
    • 2017
  • Several block cipher modes of operation have been proposed in the literature to protect sensitive information. However, different security analysis models have been presented for attacking them. The analysis indicated that most of the current modes of operation are vulnerable to several attacks such as known plaintext and chosen plaintext/cipher-text attacks. Therefore, this paper proposes a secure block cipher mode of operation to thwart such attacks. In general, the proposed mode combines one-time chain keys with each plaintext before its encryption. The challenge of the proposed mode is the generation of the chain keys. The proposed mode employs the logistic map together with a nonce to dynamically generate a unique set of chain keys for every plaintext. Utilizing the logistic map assures the dynamic behavior while employing the nonce guarantees the uniqueness of the chain keys even if the same message is encrypted again. In this way, the proposed mode called SPCBC can resist the most powerful attacks including the known plaintext and chosen plaintext/cipher-text attacks. In addition, the SPCBC mode improves encryption time performance through supporting parallelized implementation. Finally, the security analysis and experimental results demonstrate that the proposed mode is robust compared to the current modes of operation.

Counter Chain: A New Block Cipher Mode of Operation

  • El-Semary, Aly Mohamed;Azim, Mohamed Mostafa A.
    • Journal of Information Processing Systems
    • /
    • v.11 no.2
    • /
    • pp.266-279
    • /
    • 2015
  • In this paper, we propose a novel block cipher mode of operation, which is known as the counter chain (CC) mode. The proposed CC mode integrates the cipher block chaining (CBC) block cipher mode of operation with the counter (CTR) mode in a consistent fashion. In the CC mode, the confidentiality and authenticity of data are assured by the CBC mode, while speed is achieved through the CTR mode. The proposed mode of operation overcomes the parallelization deficiency of the CBC mode and the chaining dependency of the counter mode. Experimental results indicate that the proposed CC mode achieves the encryption speed of the CTR mode, which is exceptionally faster than the encryption speed of the CBC mode. Moreover, our proposed CC mode provides better security over the CBC mode. In summary, the proposed CC block cipher mode of operation takes the advantages of both the Counter mode and the CBC mode, while avoiding their shortcomings.

Study of Integrated Production-Distribution Planning Using Simulation and Genetic Algorithm in Supply Chain Network (공급사슬네트워크에서 시뮬레이션과 유전알고리즘을 이용한 통합생산분배계획에 대한 연구)

  • Lim, Seok-Jin
    • Journal of the Korea Safety Management & Science
    • /
    • v.22 no.4
    • /
    • pp.65-74
    • /
    • 2020
  • Many of companies have made significant improvements for globalization and competitive business environment The supply chain management has received many attentions in the area of that business environment. The purpose of this study is to generate realistic production and distribution planning in the supply chain network. The planning model determines the best schedule using operation sequences and routing to deliver. To solve the problem a hybrid approach involving a genetic algorithm (GA) and computer simulation is proposed. This proposed approach is for: (1) selecting the best machine for each operation, (2) deciding the sequence of operation to product and route to deliver, and (3) minimizing the completion time for each order. This study developed mathematical model for production, distribution, production-distribution and proposed GA-Simulation solution procedure. The results of computational experiments for a simple example of the supply chain network are given and discussed to validate the proposed approach. It has been shown that the hybrid approach is powerful for complex production and distribution planning in the manufacturing supply chain network. The proposed approach can be used to generate realistic production and distribution planning considering stochastic natures in the actual supply chain and support decision making for companies.

Queueing System Operating in Random Environment as a Model of a Cell Operation

  • Kim, Chesoong;Dudin, Alexander;Dudina, Olga;Kim, Jiseung
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.2
    • /
    • pp.131-142
    • /
    • 2016
  • We consider a multi-server queueing system without buffer and with two types of customers as a model of operation of a mobile network cell. Customers arrive at the system in the marked Markovian arrival flow. The service times of customers are exponentially distributed with parameters depending on the type of customer. A part of the available servers is reserved exclusively for service of first type customers. Customers who do not receive service upon arrival, can make repeated attempts. The system operation is influenced by random factors, leading to a change of the system parameters, including the total number of servers and the number of reserved servers. The behavior of the system is described by the multi-dimensional Markov chain. The generator of this Markov chain is constructed and the ergodicity condition is derived. Formulas for computation of the main performance measures of the system based on the stationary distribution of the Markov chain are derived. Numerical examples are presented.

A Dynamic Adjustment Method of Service Function Chain Resource Configuration

  • Han, Xiaoyang;Meng, Xiangru;Yu, Zhenhua;Zhai, Dong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.8
    • /
    • pp.2783-2804
    • /
    • 2021
  • In the network function virtualization environment, dynamic changes in network traffic will lead to the dynamic changes of service function chain resource demand, which entails timely dynamic adjustment of service function chain resource configuration. At present, most researches solve this problem through virtual network function migration and link rerouting, and there exist some problems such as long service interruption time, excessive network operation cost and high penalty. This paper proposes a dynamic adjustment method of service function chain resource configuration for the dynamic changes of network traffic. First, a dynamic adjustment request of service function chain is generated according to the prediction of network traffic. Second, a dynamic adjustment strategy of service function chain resource configuration is determined according to substrate network resources. Finally, the resource configuration of a service function chain is pre-adjusted according to the dynamic adjustment strategy. Virtual network functions combination and virtual machine reusing are fully considered in this process. The experimental results show that this method can reduce the influence of service function chain resource configuration dynamic adjustment on quality of service, reduce network operation cost and improve the revenue of service providers.

Secure and Scalable Blockchain-Based Framework for IoT-Supply Chain Management Systems

  • Omimah, Alsaedi;Omar, Batarfi;Mohammed, Dahab
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.12
    • /
    • pp.37-50
    • /
    • 2022
  • Modern supply chains include multiple activities from collecting raw materials to transferring final products. These activities involve many parties who share a huge amount of valuable data, which makes managing supply chain systems a challenging task. Current supply chain management (SCM) systems adopt digital technologies such as the Internet of Things (IoT) and blockchain for optimization purposes. Although these technologies can significantly enhance SCM systems, they have their own limitations that directly affect SCM systems. Security, performance, and scalability are essential components of SCM systems. Yet, confidentiality and scalability are one of blockchain's main limitations. Moreover, IoT devices are lightweight and have limited power and storage. These limitations should be considered when developing blockchain-based IoT-SCM systems. In this paper, the requirements of efficient supply chain systems are analyzed and the role of both IoT and blockchain technologies in providing each requirement are discussed. The limitations of blockchain and the challenges of IoT integration are investigated. The limitations of current literature in the same field are identified, and a secure and scalable blockchain-based IoT-SCM system is proposed. The proposed solution employs a Hyperledger fabric blockchain platform and tackles confidentiality by implementing private data collection to achieve confidentiality without decreasing performance. Moreover, the proposed framework integrates IoT data to stream live data without consuming its limited resources and implements a dualstorge model to support supply chain scalability. The proposed framework is evaluated in terms of security, throughput, and latency. The results demonstrate that the proposed framework maintains confidentiality, integrity, and availability of on-chain and off-chain supply chain data. It achieved better performance through 31.2% and 18% increases in read operation throughput and write operation throughput, respectively. Furthermore, it decreased the write operation latency by 83.3%.