• Title/Summary/Keyword: 0/1 constraint

Search Result 170, Processing Time 0.032 seconds

Integer Programming Model and Heuristic on the Guided Scrambling Encoding for Holographic Data Storage (홀로그래픽 저장장치에 대한 GS 인코딩의 정수계획법 모형 및 휴리스틱)

  • Park, Taehyung;Lee, Jaejin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.8
    • /
    • pp.656-661
    • /
    • 2013
  • In Guided Scrambling (GS) encoding for the holographic storage, after scrambling augmented source word into codeword, the best codeword satisfying modulation constraint is determined. Modulation constraints considered in this paper are strength which is the minimum number of transition between '0' and '1' in each row and column of codeword array and the symbol balancedness of codeword array. In this paper, we show that GS encoding procedure can be formulated as an integer programming model and develop a fast neighborhood search heuristic for fast computation of control bits. In the simulation, we compared the performance of heuristic algorithm with the integer programming model for various array and control bit size combinations.

Inter-layer Texture and Syntax Prediction for Scalable Video Coding

  • Lim, Woong;Choi, Hyomin;Nam, Junghak;Sim, Donggyu
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.6
    • /
    • pp.422-433
    • /
    • 2015
  • In this paper, we demonstrate inter-layer prediction tools for scalable video coders. The proposed scalable coder is designed to support not only spatial, quality and temporal scalabilities, but also view scalability. In addition, we propose quad-tree inter-layer prediction tools to improve coding efficiency at enhancement layers. The proposed inter-layer prediction tools generate texture prediction signal with exploiting texture, syntaxes, and residual information from a reference layer. Furthermore, the tools can be used with inter and intra prediction blocks within a large coding unit. The proposed framework guarantees the rate distortion performance for a base layer because it does not have any compulsion such as constraint intra prediction. According to experiments, the framework supports the spatial scalable functionality with about 18.6%, 18.5% and 25.2% overhead bits against to the single layer coding. The proposed inter-layer prediction tool in multi-loop decoding design framework enables to achieve coding gains of 14.0%, 5.1%, and 12.1% in BD-Bitrate at the enhancement layer, compared to a single layer HEVC for all-intra, low-delay, and random access cases, respectively. For the single-loop decoding design, the proposed quad-tree inter-layer prediction can achieve 14.0%, 3.7%, and 9.8% bit saving.

Newly discovered galaxy overdensities and large scale structures at z~1

  • Hyun, Minhee;Im, Myungshin;Kim, Jae-Woo;Lee, Seong-Kook
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.44 no.1
    • /
    • pp.39.2-39.2
    • /
    • 2019
  • Galaxy clusters are the largest gravitationally bound structures in the universe and located in the densest peak of the dark matter. They can constraint cosmologicals model from their dark matter halo distribution and they are good laboratories to study how galaxy evolution varies with their environment. Especially, studies of galaxy clusters at z1 are important because (i) galaxy evolution at z >1 is still controversial (Elbaz et al. 2007; Faloon et al. 2013) and (ii) some studies show that mass of galaxy clusters at z>1 seems to be higher than expected value from the concordance LCDM cosmological model (Kang & Im 2009; Gonzales et al. 2012). In spite of their significance, there have not been many studies of galaxy clusters at z1 because of the lack of wide and deep multi-wavelength data. We newly found galaxy cluster candidates at 0.2 < z < 1.4 and a LSS spanning over 100Mpc at z~0.9 in the ELAIS-N1 field which is one of the IMS (Infrared Medium-deep Survey; Im et al. 2019, in preparation) fields. Thanks to K-GMT science program, we performed spectroscopic follow-up observation for a z~1 galaxy cluster candidates with GMOS of Gemini North and for z~0.9 supercluster candidates with Hectospec of MMT in 2018A and confirmed the large scale structures. We present the newly discovered galaxy overdensities from the observation and the analysis result.

  • PDF

Optimum Process Condition of Noodles with Sea Tangle Single Cell Detritus (SCD) (다시마 Single Cell Detritus(SCD)를 첨가한 국수의 최적화 가공조건)

  • Bang, Sang-Jin;Shin, Il-Shik;Kim, Sang-Moo
    • Korean Journal of Food Science and Technology
    • /
    • v.38 no.1
    • /
    • pp.68-74
    • /
    • 2006
  • To utilize sea tangle single cell detritus (SCD) as food additive, SCD noodle was developed using mixture model. Flour improved, whereas water decreased texture of SCD noodles. Texture of SCD noodle decreased initially and then increased as SCD content increased. Flour and SCD increased, whereas water decreased L and b values of dried and cooked noodles. Flour decreased a values of dried and cooked noodles, while SCD increased a value of cooked noodle. Response constraint coefficient showed SCD influence on texture, and L and b values of dried and cooked noodles was higher than those of flour and water, whereas water influence on a value was higher than those of flour and SCD. Texture and color values fitted nonlinear model with interaction terms for flour-water, flour-SCD, and water-SCD. Optimum mixing ratio value of flour : water : SCD was 63.3 : 31.0 : 3.7%. Sensory evaluation value of SCD noodles was lower than those of industrial and electrolyzed SCD noodles.

About fully polynomial approximability of the generalized knapsack problem

  • Hong, Sung-Pil;Park, Bum-Hwan
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.11a
    • /
    • pp.93-96
    • /
    • 2003
  • The generalized knapsack problem, or gknap is the combinatorial optimization problem of optimizing a nonnegative linear functional over the integral hull of the intersection of a polynomially separable 0 - 1 polytope and a knapsack constraint. Among many potential applications, the knapsack, the restricted shortest path, and the restricted spanning tree problem are such examples. We establish some necessary and sufficient conditions for a gknap to admit a fully polynomial approximation scheme, or FPTAS, To do so, we recapture the scaling and approximate binary search techniques in the framework of gknap. This also enables us to find a condition that a gknap does not have an FP-TAS. This condition is more general than the strong NP-hardness.

  • PDF

A study on the column subtraction method applied to ship scheduling problem

  • Hwang, Hee-Su;Lee, Hee-Yong;Kim, Si-Hwa
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2004.04a
    • /
    • pp.401-405
    • /
    • 2004
  • Column subtraction, originally proposed by Harche and Thompson(]994), is an exact method for solving large set covering, packing and partitioning problems. Since the constraint set of ship scheduling problem(SSP) have a special structure, most instances of SSP can be solved by LP relaxation. This paper aims at applying the column subtraction method to solve SSP which can not be solved by LP relaxation. For remained instances of unsolvable ones, we subtract columns from the finale simplex table to get another integer solution in an iterative manner. Computational results having up to 10,000 0-1 variables show better performance of the column subtraction method solving the remained instances of SSP than complex branch-and-bound algorithm by LINDO.

  • PDF

An Efficient Scheduling Technique for High Level Synthesis under Timing Constraints (시간 제약 조건하에서 상위 수준 합성을 위한 효율적인 스케줄링 기법)

  • Kim, Ji-Woong;Jeong, Woo-Seong;Shin, Hyun-Chul
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.453-454
    • /
    • 2008
  • Modern VLSI designs get increasingly complex and time-to-market constraints get tighter. Using high level languages is one of the most promising solutions for improving design productivity by raising the level of abstraction. In high level synthesis process, most important step is scheduling. In this paper, we propose fast and efficient scheduling method under timing constraint based on list scheduling. Experimental results on well known data path intensive designs show fast execution times (less than 0.5 sec) and similar results when compared to optimal solutions [1].

  • PDF

External Force Control for Two Dimensional Contour Following ; Part 1. A Linear Control Approach

  • Park, Young-Chil;Kim, Sungkwun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.130-134
    • /
    • 1992
  • The ability of a robot system to comply to an environment via the control of tool-environment interaction force is of vital for the successful task accomplishment in many robot application. This paper presents the implementation of external force control for two dimensional contour following task using a commercial robot system. Force accommodation is used since a constraint imposed in our work is not to modify the commercial robot system. A linear, decoupled model of two dimensional contour following system in the discrete time domain is derived first. Then the experimental verification of linear control is obtained using a PUMA 560 manipulator with standard Unimation controller, Astek FS6-120A six axis wrist force sensor attached externally to the arm and LSI-11173 microcomputer. Experimentally obtained data shows that the RMS contact force error is 0.8246 N when following the straight edge and 2.3768 N when following 40 mm radius curved contour.

  • PDF

The Design and Construction Consideration for Developing the Human Powered Aircraft (인력비행기 개발을 위한 설계 및 제작 고려 요소)

  • Lee, Ki-Young;Choi, Seong-Ok
    • Journal of the Korean Society for Aviation and Aeronautics
    • /
    • v.17 no.1
    • /
    • pp.29-38
    • /
    • 2009
  • This paper surveys the historical perspective and design considerations for developing the human powered aircraft(HPA). Especially the weight and materials, aerodynamics, flight controls, and power trains are focused. The average power a human can produce and sustain is approximately 200250 W which is a critical design constraint of HPA. The survey shows that the empty weight of HPA was in the 3040 kg range(90110 kg include pilot). Thus, in order to design a successful HPA, the value of power to weight ratio should be 2.0 W/kg or above. The HPA design technique could be applied directly to the development of an unmanned high altitude airplanes used for atmospheric research, where light structures, low Reynolds number aerodynamics and high efficiency propeller design are required as well.

  • PDF

Customer Satisfaction Strategy of the College Considering Capital Budgeting (자본투자를 고려한 전문대학의 고객만족전략)

  • Woo, Tae-Hee
    • Journal of the Korea Safety Management & Science
    • /
    • v.9 no.6
    • /
    • pp.113-122
    • /
    • 2007
  • Quality function deployment(QFD) is becoming a widely used customer oriented approach. The aim of this paper is to present an analytic method of quality function deployment that is to maximize customer satisfaction, using a customer satisfaction survey conducted in the college in Korea. Combining weights and satisfaction indices, "performance/important" diagrams are to develop and this grid can be used in order to identify priorities for decision making. Also, this paper shows a 0-1 integer programming model for maximizing customer satisfaction subject to a budget constraint in QFD planning process with case study.