• Title/Summary/Keyword: Integer program

Search Result 122, Processing Time 0.026 seconds

An Optimal Mission Assignment Model for Determining a Minimum Required Level of Nuclear-powered Submarines (원자력 추진 잠수함 최소 소요량 결정을 위한 임무 할당 최적화 모델)

  • Lee, Dong-Gyun;Park, Seung-Joo;Lee, Jinho
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.21 no.2
    • /
    • pp.235-245
    • /
    • 2018
  • This study first analyzes the necessity and the validity of procuring nuclear-powered submarines, and presents an optimization model as an integer program to determine a minimum required level of them. For an optimization model, we characterize a submarine's mission, ability and availability, and apply these to the model by constraints. Then, we assign the submarines available currently and the nuclear-powered submarines, that will be newly introduced, to the predefined missions over the planning time periods in a way that the number of nuclear-powered submarines be minimized. Randomly generated missions are employed to solve a mission assignment problem, and the results show that our integer programming model provides an optimal solution as designed, and this can provide a guideline for other weapon system procurement processes.

Design and Implementation of Arbitrary Precision Class for Public Key Crypto API based on Java Card (자바카드 기반 공개키 암호 API를 위한 임의의 정수 클래스 설계 및 구현)

  • Kim, Sung-Jun;Lee, Hei-Gyu;Cho, Han-Jin;Lee, Jae-Kwang
    • The KIPS Transactions:PartC
    • /
    • v.9C no.2
    • /
    • pp.163-172
    • /
    • 2002
  • Java Card API porvide benifit for development program based on smart card using limmited resource. This APIs does not support arithmetic operations such as modular arithmetic, greatest common divisor calculation, and generation and certification of prime number, which is necessary arithmetic in PKI algorithm implementation. In this paper, we implement class BigInteger acted in the Java Card platform because that Java Card APIs does not support class BigInteger necessary in implementation of PKI algorithm.

A Direction-Adaptive Watermarking Technique Based on 2DCT in the Buyer-Seller Watermarking Protocol (구매자-판매자 워터마킹 프로토콜상에서 DCT 기반의 방향성 적응 워터마킹)

  • Seong, Teak-Young;Kwon, Ki-Chang;Lee, Suk-Hwan;Kwon, Ki-Ryong;Woo, Chong-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.7
    • /
    • pp.778-786
    • /
    • 2014
  • Buyer-seller watermarking protocol is one of the copyright protection techniques which combine a cryptographic protocol used in electronic commerce with a digital wetermarking scheme aiming at proving the ownership of multimedia contents and preventing the illegal reproduction and redistribution of digital contents. In this paper, it is proposed a new watermarking scheme in an encrypted domain in an image that is based on the block-DCT framework. In order to implement watermarking scheme in a public-key cryptosystem, it is divided that frequency coefficients exist as real number into integer and decimal layer. And the decimal layer is modified integer type through integral-processing. Also, for robustness and invisibility required in watermarking scheme, it is designed a direction-adaptive watermarking scheme based on locally edge-properties of each block in an image through analyzing distribution property of the frequency coefficients in a block using JND threshold.

Workforce Planning Model for the Parcel Sorting Area in a Mail Processing Center (우편집중국 소포구분 작업장 인력계측 수립모형)

  • Park, Chul-Soon;Bae, Sung-Moon;Cha, Byung-Chul;Cha, Chun-Nam
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.32 no.3
    • /
    • pp.1-9
    • /
    • 2009
  • Processing mail objects in a mail processing center involves several steps and operations, in particular dispatching as well as sorting by destination. The purpose of this paper is to present a model for the part-time worker staffing and allocation problem as it arises at the parcel sorting area in a mail processing center. The problem is formulated as a mixed integer linear program model to minimize the variable part-time workforce related cost. Hot only the characteristics of the sorting operations but also the dispatching requirements of the vehicles are reflected into the model. Six example problems with three different daily amounts of arriving mail are solved with LINGO to demonstrate the effectiveness of the 7-level induction option for the parcel sorting machine over the current 3-level one. The results indicate that measurable savings can be achieved by departing from current practice.

DCT and Homomorphic Encryption based Watermarking Scheme in Buyer-seller Watermarking Protocol

  • Seong, Teak-Young;Kwon, Ki-Chang;Lee, Suk-Hwan;Moon, Kwang-Seok;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.12
    • /
    • pp.1402-1411
    • /
    • 2014
  • Buyer-seller watermarking protocol is defined as the practice of imperceptible altering a digital content to embed a message using watermarking in the encryption domain. This protocol is acknowledged as one kind of copyright protection techniques in electronic commerce. Buyer-seller watermarking protocol is fundamentally based on public-key cryptosystem that is operating using the algebraic property of an integer. However, in general usage, digital contents which are handled in watermarking scheme mostly exist as real numbers in frequency domain through DCT, DFT, DWT, etc. Therefore, in order to use the watermarking scheme in a cryptographic protocol, digital contents that exist as real number must be transformed into integer type through preprocessing beforehand. In this paper, we presented a new watermarking scheme in an encrypted domain in an image that is based on the block-DCT framework and homomorphic encryption method for buyer-seller watermarking protocol. We applied integral-processing in order to modify the decimal layer. And we designed a direction-adaptive watermarking scheme by analyzing distribution property of the frequency coefficients in a block using JND threshold. From the experimental results, the proposed scheme was confirmed to have a good robustness and invisibility.

Implementation and Analysis of Multi-precision Multiplication for Public Key Cryptography Based on NDK (NDK 기반 공개키 암호를 위한 곱셈기 구현 및 분석)

  • Seo, Hwa-Jeong;Kim, Ho-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.11
    • /
    • pp.2347-2354
    • /
    • 2012
  • On Android environment, program development is conducted with JAVA SDK. However, using JAVA, it is operated over virtual machine which shows lower performance in terms of speed than traditional C language programming. The method writes program in C language, which conducts operation efficiently. In the paper, we implement multiplication using NDK and SDK to analyze the public key cryptography over Android environment. In case of SDK, we used BigInteger package and in case of NDK, we used Comb method. Moreover, execution time of arithmetic, branch and call operations over Android environment is compared to understand performance enhancement using NDK package.

Joint Transmission Slot Assignment, FSO Links Allocation and Power Control for Hybrid RF/FSO Wireless Mesh Networks

  • Zhao, Yan;Shi, Wenxiao;Shi, Hanyang;Liu, Wei;Wu, Pengxia
    • Current Optics and Photonics
    • /
    • v.1 no.4
    • /
    • pp.325-335
    • /
    • 2017
  • Hybrid radio frequency/free space optical (RF/FSO) wireless mesh networks have attracted increasing attention for they can overcome the limitations of RF and FSO communications and significantly increase the throughput of wireless mesh networks (WMNs). In this article, a resource assignment optimization scheme is proposed for hybrid RF/FSO wireless mesh networks. The optimization framework is proposed for the objective of maximizing throughput of overall hybrid networks through joint transmission slot assignment, FSO links allocation and power control with the consideration of the fading nature of RF and FSO links. The scheme is formulated as an instance of mixed integer linear program (MILP) and the optimal solutions are provided using CPLEX and Gurobi optimizers. How to choose the appropriate optimizer is discussed by comparing their performance. Numerous simulations are done to demonstrate that the performance of our optimization scheme is much better than the current case of having the same topology.

Dynamic Survivable Routing for Shared Segment Protection

  • Tapolcai, Janos;Ho, Pin-Han
    • Journal of Communications and Networks
    • /
    • v.9 no.2
    • /
    • pp.198-209
    • /
    • 2007
  • This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

Economics of Self-Generation by Natural Gas Industry Using the Mixed Integer Program (혼합정수계획법을 이용한 천연가스(LNG) 산업의 자가발전소 건설에 대한 경제성 분석)

  • Lee, Jeong-Dong;Byun, Sang-Kyu;Kim, Tai-Yoo
    • IE interfaces
    • /
    • v.13 no.4
    • /
    • pp.658-667
    • /
    • 2000
  • Seasonal variation of natural gas demand coupled with rigid and stable import pattern of gas represents the characteristic feature of the Korean Liquified Natural Gas(LNG) industry. This attribute has required a huge amount of investment for the construction of storage facility. Thus, to minimize the supply cost, it is legitimate to reduce storage requirement itself. In this study, we combine three alternative methods to deal with the storage requirement to minimize the supply cost. Those are (1) adding additional storage tanks, (2) inducing large firm customers, and (3) constructing gas-turbine self generation facilities. Methodologically, we employ the mixed integer program (MIP) to optimize the system. The model also consider demand and price-setting scheme in separate modules. From the results, it is shown that if alternatives are combined optimally, a number of storage tanks can be reduced substantially compared with the original capacity plan set by the industry authorities. We perform various sensitivity analyses to check the robustness of the results. The methodology presented in this study can be applied to the other physical network industry, such as hydraulics. The empirical results will shed some light on the rationalization of capacity planning of the Korean natural gas industry.

  • PDF

Integrating Machine Reliability and Preventive Maintenance Planning in Manufacturing Cell Design

  • Das, Kanchan;Lashkari, R.S.;Sengupta, S.
    • Industrial Engineering and Management Systems
    • /
    • v.7 no.2
    • /
    • pp.113-125
    • /
    • 2008
  • This paper presents a model for designing cellular manufacturing systems (CMS) by integrating system cost, machine reliability, and preventive maintenance (PM) planning. In a CMS, a part is processed using alternative process routes, each consisting of a sequence of visits to machines. Thus, a level of 'system reliability' is associated with the machines along the process route assigned to a part type. Assuming machine reliabilities to follow the Weibull distribution, the model assigns the machines to cells, and selects, for each part type, a process route which maximizes the overall system reliability and minimizes the total costs of manufacturing operations, machine underutilization, and inter-cell material handling. The model also incorporates a reliability based PM plan and an algorithm to implement the plan. The algorithm determines effective PM intervals for the CMS machines based on a group maintenance policy and thus minimizes the maintenance costs subject to acceptable machine reliability thresholds. The model is a large mixed integer linear program, and is solved using LINGO. The results point out that integrating PM in the CMS design improves the overall system reliability markedly, and reduces the total costs significantly.