Covering a line segment with variable radius discs

The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the disc covering problem on a line. The cost of each sensor includes a fixed component f, and a variable component that is a convex function of the diameter of the field-of-view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors, the problem becomes hard. A branch-and-bound algorithm as well as an efficient heuristic are developed for the special case in which the variable cost component of each sensor is proportional to the square of the measure of the field-of-view area. The heuristic very often obtains the optimal solution as shown in extensive computational testing.     

A new mixed integer linear programming model for product development using quality function deployment

Quality function deployment (QFD) is a product development process performed to maximize customer satisfaction. In the QFD, the design requirements (DRs) affecting the product performance are primarily identified, and product performance is improved to optimize customer needs (CNs). For product development, determining the fulfillment levels of design requirements (DRs) is crucial during QFD optimization. However, in real world applications, the values of DRs are often discrete instead of continuous. To the best of our knowledge, there is no mixed integer linear programming (MILP) model in which the discrete DRs values are considered. Therefore, in this paper, a new QFD optimization approach combining MILP model and Kano model is suggested to acquire the optimized solution from a limited number of alternative DRs, the values of which can be discrete. The proposed model can be used not only to optimize the product development but also in other applications of QFD such as quality management, planning, design, engineering and decision-making, on the condition that DR values are discrete. Additionally, the problem of lack of solutions in integer and linear programming in the QFD optimization is overcome. Finally, the model is illustrated through an example.     

An improved lossless data hiding scheme based on image VQ-index residual value coding

Copyright protection and information security have become serious problems due to the ever growing amount of digital data over the Internet. Reversible data hiding is a special type of data hiding technique that guarantees not only the secret data but also the cover media can be reconstructed without any distortion. Traditional schemes are based on spatial, discrete cosine transformation (DCT) and discrete wavelet transformation (DWT) domains. Recently, some vector quantization (VQ) based reversible data hiding schemes have been proposed. This paper proposes an improved reversible data hiding scheme based on VQ-index residual value coding. Experimental results show that our scheme outperforms two recently proposed schemes, namely side-match vector quantization (SMVQ)-based data hiding and modified fast correlation vector quantization (MFCVQ)-based data hiding.     

Supply chain network design using an integrated neuro-fuzzy and MILP approach: A comparative design study

In this study, an integrated supply chain (SC) design model is developed and a SC network design case is examined for a reputable multinational company in alcohol free beverage sector. Here, a three echelon SC network is considered under demand uncertainty and the proposed integrated neuro-fuzzy and mixed integer linear programming (MILP) approach is applied to this network to realize the design effectively. Matlab 7.0 is used for neuro-fuzzy demand forecasting and, the MILP model is solved using Lingo 10.0. Then Matlab 7.0 is used for artificial neural network (ANN) simulation to supply a comparative study and to show the applicability and efficiency of ANN simulation for this type of problem. By evaluating the output data, the SC network for this case is designed, and the optimal product flow between the factories, warehouses and distributors are calculated. Also it is proved that the ANN simulation can be used instead of analytical computations because of ensuring a simplified representation for this method and time saving.     

基于上下文的自适应运动搜索算法

通过分析序列编码结果,根据已编码帧预测模式分布和序列的运动信息,对运动特性不同的宏块选择不同的运动搜索方案。结合提前退出策略以及分层的搜索模式,提出一种新的运动搜索算法。实验结果表明,算法编码质量接近全搜索算法,算法执行时间小于全搜索算法,在速度和质量上都优于钻石搜索算法、新3步法、六边形搜索算法,适用于不同运动特性的视频序列。     

The influence of goal clarity,curiosity, and enjoyment on intention to code

The purpose of this study is to examine the influence of goal clarity, curiosity, and enjoyment – dimensions of flow theory – on the intention to write programming code. This research refines and extends previous information systems (IS) research in two significant ways: first, this research is focused specifically on systems development behaviour; second; this is the first research that isolates specific flow theory constructs associated with systems development behaviour. We used SmartPLS to test our model, as partial least squares is the appropriate statistical methodology for theory building and model testing. Findings are based on survey data from computer IS classes at two different universities. Goal clarity and curiosity independently and significantly contributed to enjoyment when programming, which significantly and positively influenced a future intention to code. Recommendations for practitioners and faculty include testing for curiosity characteristics, providing clear goals, and providing stimuli to pique curiosity.     

Compressed Multiresolution Hierarchies for High‐Quality Precomputed Shadows

The quality of shadow mapping is traditionally limited by texture resolution. We present a novel lossless compression scheme for high‐resolution shadow maps based on precomputed multiresolution hierarchies. Traditional multiresolution trees can compactly represent homogeneous regions of shadow maps at coarser levels, but require many nodes for fine details. By conservatively adapting the depth map, we can significantly reduce the tree complexity. Our proposed method offers high compression rates, avoids quantization errors, exploits coherency along all data dimensions, and is well‐suited for GPU architectures. Our approach can be applied for coherent shadow maps as well, enabling several applications, including high‐quality soft shadows and dynamic lights moving on fixed‐trajectories.     

The other side of ranking schemes: generating weights for specified outcomes

This paper treats the problem of how to determine weights in a ranking, which will cause a selected entity to attain the highest possible position. We establish that there are two types of entities in a ranking scheme: those which can be ranked as number one and those which cannot. These two types of entities can be identified using the “ranking hull” of the data; a polyhedral set that envelops the data. Only entities with data points on the boundary of this hull can attain the number one position. There are no weights that will make an entity whose data point is in the interior of the hull to ever attain the number one position. We deal with these two types of entities separately. In the first case, we propose an approach for finding a set of weights that, under special conditions, will result in a selected entity achieving the top of the ranking without ties and without ignoring any of the attributes. For the second category of entities, we devise a procedure to guarantee that these entities will attain their highest possible position in the ranking. The first case will require using interior point methods to solve a linear program (LP). The second case involves a binary mixed integer formulation. These two mathematical programs were tested on data from a well‐known university ranking.     

面向视频压缩的显著性协同检测JND模型

为了更好的将人眼感知特性用于视频压缩系统,提出了一种改进的基于显著性协同检测的恰可察觉失真模型（Just Noticeable Distortion,JND）.该模型通过像素域和变换域下联合建模计算得到的最优JND模型,基于上下文感知的显著性算法得到相应的显著图,并将检测结果用于JND模型权值分配.提出的JND残差滤波器可以嵌入到HEVC视频编码框架中.实验结果表明:在全I帧配置下,提出的算法编码结果与HM16相比,在视觉主观感知质量一致的情况下,平均码率可节省10.7%.     

An integer program and a hybrid genetic algorithm for the university timetabling problem

The university timetabling problem (UTP) has been studied by numerous research groups for decades. In addition to addressing hard and soft constraints, we extend the UTP by considering consecutiveness and periodicity constraints of multi-session lectures, which are common in many eastern Asian universities. Because schedulers can decide the consecutiveness and periodicity constraints for the multi-session lectures within a limited ratio, we consider these novel decision variables in our model. We develop a mixed integer linear program for the UTP. For the analysis, we convert the UTP into the three-dimensional container packing problem (3DCPP) and create a hybrid genetic algorithm (HGA), which has been shown to be efficient in solving the 3DCPP. We also develop a tabu search algorithm based on the existing UTP literature and compare the findings with that of our HGA. The results show that our HGA obtains a better solution than the tabu search algorithm in a reasonable amount of time.