• Title/Summary/Keyword: Optimization Matching

Search Result 235, Processing Time 0.025 seconds

Complexity and Algorithms for Optimal Bundle Search Problem with Pairwise Discount

  • Chung, Jibok;Choi, Byungcheon
    • Journal of Distribution Science
    • /
    • v.15 no.7
    • /
    • pp.35-41
    • /
    • 2017
  • Purpose - A product bundling is a marketing approach where multiple products or components are packaged together into one bundle solution. This paper aims to introduce an optimal bundle search problem (hereinafter called "OBSP") which may be embedded with online recommendation system to provide an optimized service considering pairwise discount and delivery cost. Research design, data, and methodology - Online retailers have their own discount policy and it is time consuming for online shoppers to find an optimal bundle. Unlike an online system recommending one item for each search, the OBSP considers multiple items for each search. We propose a mathematical formulation with numerical example for the OBSP and analyzed the complexity of the problem. Results - We provide two results from the complexity analysis. In general case, the OBSP belongs to strongly NP-Hard which means the difficulty of the problem while the special case of OBSP can be solved within polynomial time by transforming the OBSP into the minimum weighted perfect matching problem. Conclusions - In this paper, we propose the OBSP to provide a customized service considering bundling price and delivery cost. The results of research will be embedded with an online recommendation system to help customers for easy and smart online shopping.

Complete 3D Surface Reconstruction from Unstructured Point Cloud (조직화되지 않은 점군으로부터의 3차원 완전 형상 복원)

  • Li Rixie;Kim Seokil
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.4 s.235
    • /
    • pp.570-577
    • /
    • 2005
  • In this study a complete 3D surface reconstruction method is proposed based on the concept that the vertices of surface model can be completely matched to the unstructured point cloud. In order to generate the initial mesh model from the point cloud, the mesh subdivision of bounding box and shrink-wrapping algorithm are introduced. The control mesh model for well representing the topology of point cloud is derived from the initial mesh model by using the mesh simplification technique based on the original QEM algorithm, and the parametric surface model for approximately representing the geometry of point cloud is derived by applying the local subdivision surface fitting scheme on the control mesh model. And, to reconstruct the complete matching surface model, the insertion of isolated points on the parametric surface model and the mesh optimization are carried out Especially, the fast 3D surface reconstruction is realized by introducing the voxel-based nearest-point search algorithm, and the simulation results reveal the availability of the proposed surface reconstruction method.

A Study on the Stereo Image Matching using MRF model and segmented image (MRF 모델과 분할 영상을 이용한 영상정합에 관한 연구)

  • 변영기;한동엽;김용일
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2004.03a
    • /
    • pp.511-516
    • /
    • 2004
  • 수치표고모델, 정사영상과 같은 공간영상정보를 구축하기 위해서는 입체영상을 이동한 영상정합(image matching)의 과정이 필수적이며, 단영상 또는 스테레오 영상을 이용하여 대상물의 3차원 정보를 재구성하고 복원하는 기술은 사진측량 및 컴퓨터 비전 분야의 주요 연구 중의 하나이다. 본 연구에서는 화소값의 유사성과 상호관계성을 고려하는 MRF 모델을 이용하여 영상정합을 수행하였다. MRF 모델은 공간분석이나 물리적 현상의 전후관계(contextural dependencies)의 분석을 위한 확률이론의 한 분야로 다양한 공간정보를 통합할 수 있는 방법을 제공한다. 본 연구에서는 기준영상의 화소에 시차를 할당하는 접근 방법으로 확률모델의 일종인 마르코프 랜덤필드(MRF)모델에 기반한 영상정합기법을 제안하였고, 공간내 화소의 상호관계를 고려해주므로 대상물의 경계부분에서의 매칭 정확도를 향상시켰다. 영상정합문제에서의 MRF 기본가정은 영상 내 특정화소의 시차는 그 주위화소의 시차에 의한 부분정보에 따라 결정이 가능하다는 것이다. 깁스분포(gibbs distribution)를 사용하여 사후(posteriori) 확률값을 유도해내고, 이를 최대사후확률(MAP: Maximum a Posteriori)추정법을 이용하여 에너지함수를 생성하였다. 생성된 에너지함수의 최적화(Optimization)를 위하여 본 연구에서는 전역최적화기법인 multiway cut 기법을 사용하여 영상정합에 있어 에너지함수를 최소로 하는 이미지화소에 대한 시차레이블을 구하여 영상정합을 수행하였다.

  • PDF

Improving a Digital Redesign for Time-Varying Trackers (시변 추종제어기를 위한 디지털 재설계의 개선)

  • Song, Hyun-Seok;Lee, Ho-Jae;Kim, Do-Wan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.4
    • /
    • pp.289-294
    • /
    • 2011
  • Digital redesign is yet another efficient tool to convert a pre-designed analog controller into a sampled-data one to maintain the analog closed-loop performance in the sense of state matching. A rising difficulty in developing a digital redesign technique for trackers with time-varying references is the unavailability of a closed-form discrete-time model of a system, even if it is linear time-invariant. A way to resolve this is to approximate the time-varying reference as a piecewise constant one, which deteriorates the state matching performance. Another remedy may be to decrease a sampling period, which however could numerically destabilize the optimization-based digital redesign condition. In this paper, we develop a digital redesign condition for time-varying trackers by approximating the time-varying reference through a triangular hold and by introducing delta-operated discrete-time models. It is shown that the digitally redesigned sampled-data tracker recovers the performance of the pre-designed analog tracker under a fast sampling limit. Simulation results on the formation flying of satellites convincingly show the effectiveness of the development.

Intelligent Digital Redesign of Biodynamic Model of HIV-1 (HIV-1 바이오 동역학 모델의 지능형 디지털 재설계)

  • Kim Do-Wan;Joo Young-Hoon;Park Jin-Bae
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.6
    • /
    • pp.547-553
    • /
    • 2006
  • This paper studies digital control of biodynamic model of HIV-1 via intelligent digital redesign (IDR). The purpose of the IDR is to develop an equivalent digital fuzzy controller maintaining the satisfactory performance of an existing continuous-time fuzzy controller in the sense of the state-matching. Some conditions for the stability as well as the global state-matching are provided.. They are given by the form of the linear matrix inequalities (LMIs) and thereby easily tractable by the convex optimization techniques. The main features of the proposed method are that 1) the generalized control scheme is provided for the multirate as well as the single-rate digital controllers; 2) a new compensated block-pulse function method is applied to closely match the states of the continuous-time and the sampled-data fuzzy systems in the discrete-time domain; 3) the two-step procedure of IDR is presented to prevent the performance degradation caused by the additional stability conditions. The applicability of the proposed approach is shown through the biodynamic model of HIV-1.

Socially Aware Device-to-multi-device User Grouping for Popular Content Distribution

  • Liu, Jianlong;Zhou, Wen'an;Lin, Lixia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.11
    • /
    • pp.4372-4394
    • /
    • 2020
  • The distribution of popular videos incurs a large amount of traffic at the base stations (BS) of networks. Device-to-multi-device (D2MD) communication has emerged an efficient radio access technology for offloading BS traffic in recent years. However, traditional studies have focused on synchronous user requests whereas asynchronous user requests are more common. Hence, offloading BS traffic in case of asynchronous user requests while considering their time-varying characteristics and the quality of experience (QoE) of video request users (VRUs) is a pressing problem. This paper uses social stability (SS) and video loading duration (VLD)-tolerant property to group VRUs and seed users (SUs) to offload BS traffic. We define the average amount of data transmission (AADT) to measure the network's capacity for offloading BS traffic. Based on this, we formulate a time-varying bipartite graph matching optimization problem. We decouple the problem into two subproblems which can be solved separately in terms of time and space. Then, we propose the socially aware D2MD user selection (SA-D2MD-S) algorithm based on finite horizon optimal stopping theory, and propose the SA-D2MD user matching (SA-D2MD-M) algorithm to solve the two subproblems. The results of simulations show that our algorithms outperform prevalent algorithms.

An Improved LBP-based Facial Expression Recognition through Optimization of Block Weights (블록가중치의 최적화를 통해 개선된 LBP기반의 표정인식)

  • Park, Seong-Chun;Koo, Ja-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.11
    • /
    • pp.73-79
    • /
    • 2009
  • In this paper, a method is proposed that enhances the performance of the facial expression recognition using template matching of Local Binary Pattern(LBP) histogram. In this method, the face image is segmented into blocks, and the LBP histogram is constructed to be used as the feature of the block. Block dissimilarity is calculated between a block of input image and the corresponding block of the model image. Image dissimilarity is defined as the weighted sum of the block dissimilarities. In conventional methods, the block weights are assigned by intuition. In this paper a new method is proposed that optimizes the weights from training samples. An experiment shows the recognition rate is enhanced by the proposed method.

Uniaxial tensile test integrated design considering mould-fixture for UHPC

  • Zhang, Xiaochen;Shen, Chao;Zhang, Xuesen;Wu, Xiangguo;Faqiang, Qiu;Mitobaba, Josue G.
    • Advances in Computational Design
    • /
    • v.7 no.4
    • /
    • pp.281-295
    • /
    • 2022
  • Tensile property is one of the excellent properties of ultra-high performance concrete (UHPC), and uniaxial tensile test is an important and challenging mechanical performance test of UHPC. Traditional uniaxial tensile tests of concrete materials have inherent defects such as initial eccentricity, which often lead to cracks and failure in non-test zone, and affect the testing accuracy of tensile properties of materials. In this paper, an original integrated design scheme of mould and end fixture is proposed, which achieves seamless matching between the tension end of specimen and the test fixture, and minimizes the cumulative eccentricity caused by the difference in the matching between the tension end of specimen and the local stress concentration at the end. The stress analysis and optimization design are carried out by finite element method. The curve transition in the end of specimen is preferred compared to straight line transition. The rationality of the new integrated design is verified by uniaxial tensile test of strain hardening UHPC, in which the whole stress-strain curve was measured, including the elastic behavior before cracking,strain hardening behavior after cracking and strain softening behavior.

A New Image Quality Optimization System for Mobile TFT-LCD (모바일 TFT-LCD를 위한 새로운 화질 최적화 시스템)

  • Ryu, Jee-Youl;Noh, Seok-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.734-737
    • /
    • 2008
  • This paper presents a new automatic TFT-LCD image quality optimization system. We also have developed new algorithms using 6-point programmable matching technique with reference gamma curve, and automatic power setting sequence. It optimizes automatically gamma adjustment and power setting registers in mobile TFT-LCD driver IC to reduce gamma correction error, adjusting time, and flicker. Developed algorithms and programs are generally applicable for most of the TFT-LCD modules. The proposed optimization system contains module-under-test (MUT, TFT-LCD module), control program, multimedia display tester for measuring luminance and flicker, and control board for interface between PC and TFT-LCD module. The control board is designed with DSP, and it supports various interfaces such as RGB and CPU. Developed automatic image quality optimization system showed significantly reduced gamma adjusting time, reduced flicker, and much less average gamma error than competing system. We believe that the proposed system is very useful to provide high image quality TFT-LCD and to reduce developing process time using optimized gamma-curve setting and automatic power setting.

  • PDF

The Bytecode Optimizer (바이트코드 최적화기)

  • 이야리;홍경표;오세만
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.1_2
    • /
    • pp.73-80
    • /
    • 2003
  • The Java programming language is designed for developing effective applications in a heterogeneous network environment. Major problem in Java is its performance. many attractive features of Java make the development of software easy, but also make it expensive to support ; applications written in Java are often much slower than their counterparts written in C or C++. To use Java`s attractive features without the performance penalty, sophisticated optimizations and runtime systems are required. Optimising Java bytecode has several advantages. First, the bytecode is independent of any compiler that is used to generate it. Second, the bytecode optimization can be performed as a pre=pass to Just-In-Time(JIT) compilation. Many attractive features of Java make the development of software easy, but also make it expensive to support. The goal of this work is to develop automatic construction of code optimizer for Java bytecode. We`ve designed and implemented a Bytecode Optimizer that performs the peephole optimization, bytecode-specific optimization, and method-inlining techniques. Using the Classfile optimizer, we see up to 9% improvement in speed and about 20% size reduction in Java class files, when compared to average code using the interpreter alone.