Threshold optimization for weighted voting classifiers

Weighted voting classifiers considered in this paper consist of N units each providing individual classification decisions. The entire system output is based on tallying the weighted votes for each decision and choosing the one which has total support weight exceeding a certain threshold. Each individual unit may abstain from voting. The entire system may also abstain from voting if no decision support weight exceeds the threshold. Existing methods of evaluating the reliability of weighted voting systems can be applied to limited special cases of these systems and impose some restrictions on their parameters. In this paper a universal generating function method is suggested which allows the reliability of weighted voting classifiers to be exactly evaluated without imposing constraints on unit weights. Based on this method, the classifier reliability is determined as a function of a threshold factor, and a procedure is suggested for finding the threshold which minimizes the cost of damage caused by classifier failures (misclassification and abstention may have different price.) Dynamic and static threshold voting rules are considered and compared. A method of analyzing the influence of units' availability on the entire classifier reliability is suggested, and illustrative examples are presented. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 322–344, 2003.     

基于高阶累积量与神经网络的干扰识别算法

研究了一种基于高阶累积量和神经网络的干扰识别算法。该方法把卫星通信中常见的各种干扰信号的归一化高阶累积量作为分类特征参数,应用神经网络对特征参数进行分类训练,将接收干扰信号的归一化高阶累积量输入已训练的神经网络进行干扰类型的识别。试验结果表明:该算法在低干信比的情况下具有较高的识别准确率。     

MIMO-OFDM最优训练序列设计

推导得到了宽带 MIMO-OFDM 信道模型。在空间相关情况下推导了非盲信道估计的 Bayesian CRB及 Bayesian MMSE。利用 Bayesian CRB 准则对发送的训练序列进行了功率分配,而后利用一种线性规划的方法对带有保护带宽 MIMO-OFDM 训练符号进行子载波功率分配,并利用发端酉矩阵进行最优相位设计。     

Capacitated warehouse location model with risk pooling

In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

An asymptotically optimal greedy heuristic for the multiperiod single‐sourcing problem: The cyclic case

The dynamics of the environment in which supply chains evolve requires that companies frequently redesign their logistics distribution networks. In this paper we address a multiperiod single‐sourcing problem that can be used as a strategic tool for evaluating the costs of logistics network designs in a dynamic environment. The distribution networks that we consider consist of a set of production and storage facilities, and a set of customers who do not hold inventories. The facilities face production capacities, and each customer's demand needs to be delivered by a single facility in each period. We deal with the assignment of customers to facilities, as well as the location, timing, and size of inventories. In addition, to mitigate start and end‐of‐study effects, we view the planning period as a typical future one, which will repeat itself. This leads to a cyclic model, in which starting and ending inventories are equal. Based on an assignment formulation of the problem, we propose a greedy heuristic, and prove that this greedy heuristic is asymptotically feasible and optimal in a probabilistic sense. We illustrate the behavior of the greedy heuristic, as well as some improvements where the greedy heuristic is used as the starting point of a local interchange procedure, on a set of randomly generated test problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 412–437, 2003     

Environmental regulation in project‐based industries

We study the environmental regulation of industrial activities that are organized as projects. Applications arise in construction, ship and aircraft building, and film making, among other industries. Relative to manufacturing, environmental regulation is different in project‐based industries, due to the uniqueness and geographical diversity of projects, and a lack of product takeback programs. Because the amount of waste and pollution generated by project companies can be large, regulators need environmental policies to ensure reduction of waste and pollution. We consider a regulator who attempts to maximize social welfare. We model this problem as a bilevel nonlinear program. The upper level regulator specifies waste reduction targets, which the lower level project companies meet using waste stream reduction and remediation of pollution, while attempting to control their project costs. We find that high waste diversion targets lead to outcomes with little pollution, but excessive project costs and only modest waste stream reduction. Projects that have lower task precedence density, or that have pollutants with different environmental impacts, show larger increases in project cost and time resulting from regulation. We describe a subsidy for waste stream reduction that coordinates the system, and we estimate the value of coordination. We also describe a bonus that encourages truthful reporting by project companies, and evaluate the relative cost and effectiveness of the subsidy and the bonus. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 228–247, 2015     

Proportionate flow shop: New complexity results and models with due date assignment

It is known that the proportionate flow shop minimum makespan $Fm/prpt/C_{\max }$ problem is solved optimally by any permutation job sequence. We show that the $Fm/prpt/C_{\max }$ problem is at least ordinary NP‐hard when missing operations are allowed and present some solvable cases. We then consider the standard proportionate flow shop problem (with no missing operations) and show that the solution algorithms for a class of single‐machine due date assignment problems can be extended/generalized to the corresponding proportionate flow shop problems. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 98–106, 2015     

Leaderless Global Jihadism: The Paradox of Discriminate Violence

Jihadist violence is typically associated with being particularly indiscriminate. Often, as in variations of the ‘new terrorism’ thesis, this characteristic is proposed to correspond in some way to its other attributes such as its globalised, decentralised and ‘postmodern’ religious nature. Recent work appears to give more substance to such claims, by claiming to show a relationship between indiscriminate violence and decentralised group organisation. However, in this paper we show, based on an analysis of jihadist targeting in Western Europe and America from 2001 to 2013, that targeting choices by jihadists unconnected to organised militant groups have in fact been consistently more, rather than less discriminate in their targeting choices than their better-integrated peers. Drawing on this finding, as well as a broader reading of jihadist targeting discourses, we argue for a more complex understanding of the relationship between radicalisation, extremist ideology, decentralisation, and targeting choice.