Development of a sequential robust–tolerance design model for a destructive quality characteristic

Robust design (RD) and tolerance design (TD) have received much attention from researchers and practitioners for more than two decades, and a number of methodologies for modeling and optimizing the RD and TD processes have been studied. However, there is ample room for improvement. Because most existing research considers RD and TD as separate research fields, the primary objective of this paper is to develop a sequential robust–tolerance design method to jointly determine the best factor settings and the closed-form solutions for the optimal specification limits. We then apply the proposed method to a destructive quality characteristic. Finally, a case study and sensitivity analyses are performed for verification purposes, and further studies are discussed.     

H.264帧内预测模式选择快速算法的研究

提出一种适用于H.264帧内预测的快速算法,利用相邻像素间的梯度筛选预测模式来避免不必要的预测模式计算。实验结果表明:用全I帧编码,该算法在图像质量和输出码率基本不变的情况下,编码时间大约节省了60%。     

A computer-enabled solution procedure for food wholesalers’ distribution decision in cities with a circular transportation infrastructure

This paper addresses the food distribution decision from a wholesaler's perspective, as the wholesalers are often faced with thorny issues such as when, where, how to deliver products at the lowest costs to best satisfy the retailers’ changing needs. This research relies on a distribution problem encountered at Northern Grocery Company in Beijing as an example to develop a two-stage solution procedure and subsequent computer-enabled programs for identifying efficient vehicle routing alternatives. The solution process, which integrates heuristic search algorithms and an integer programming model, can be applied to a wide range of distribution problems with specified route durations and a circular transportation network structure as exemplified by City of Beijing.     

Parameterized computational complexity of control problems in voting systems

Voting systems are common tools in a variety of areas. This paper studies parameterized computational complexity of control of Plurality, Condorcet and Approval voting systems, respectively. The types of controls considered include adding or deleting candidates or voters, under constructive or destructive setting. We obtain the following results: (1) constructive control by adding candidates in Plurality voting is W[2]-hard with respect to the parameter “number of added candidates”, (2) destructive control by adding candidates in Plurality voting is W[2]-hard with respect to the parameter “number of added candidates”, (3) constructive control by adding voters in Condorcet voting is W[1]-hard with respect to the parameter “number of added voters”, (4) constructive control by deleting voters in Condorcet voting is W[1]-hard with respect to the parameter “number of deleted voters”, (5) constructive control by adding voters in Approval voting is W[1]-hard with respect to the parameter “number of added voters”, and (6) constructive control by deleting voters in Approval voting is W[2]-hard with respect to the parameter “number of deleted voters”.     

Illumination robust single sample face recognition based on ESRC

Multimedia Tools and Applications - The extended sparse representation classifier (ESRC) is one of the state-of-the-art solutions for single sample face recognition, but it performs...     

Multiplication fusion of sparse and collaborative representation for robust face recognition

Multimedia Tools and Applications - Sparse representation based classification (SRC) and collaborative representation based classification (CRC) are two well-known methods in representation-based...