FPT-algorithms for some problems related to integer programming

This paper studies a new version of the location problem called the mixed center location problem. Let P be a set of n points in the plane. We first consider the mixed 2-center problem, where one of the centers must be in P, and we solve it in \(O(n^2\log n)\) time. Second, we consider the mixed k-center problem, where m of the centers are in P, and we solve it in \(O(n^{m+O(\sqrt{k-m})})\) time. Motivated by two practical constraints, we propose two variations of the problem. Third, we present a 2-approximation algorithm and three heuristics solving the mixed k-center problem (\(k>2\)).     

A cross-cultural comparison of death anxiety: a brief note

Data are reported from samples of undergraduates around the world who have been administered Templer's Death Anxiety Scale. Data from 24 American samples and from 16 nations were identified. Strong sex differences were found and an association between the scores of men and women.     

Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement

In several areas like global optimization using branch-and-bound methods for mixture design, the unit n-simplex is refined by longest edge bisection (LEB). This process provides a binary search tree. For \(n>2\), simplices appearing during the refinement process can have more than one longest edge (LE). The size of the resulting binary tree depends on the specific sequence of bisected longest edges. The questions are how to calculate the size of one of the smallest binary trees generated by LEB and how to find the corresponding sequence of LEs to bisect, which can be represented by a set of LE indices. Algorithms answering these questions are presented here. We focus on sets of LE indices that are repeated at a level of the binary tree. A set of LEs was presented in Aparicio et al. (Informatica 26(1):17–32, 2015), for \(n=3\). An additional question is whether this set is the best one under the so-called \(m_k\)-valid condition.     

Risk analysis of PCB exposure via the soil-food crop pathway, and alternatives for remediation at Serpukhov, Russian Federation.

A risk assessment was conducted to determine the likelihood of certain health risks resulting from exposure to soils and food crops contaminated with polychlorinated biphenyl (PCBs). PCBs have contaminated soils, river sediments, and air in the past as a result of industrial activities at a capacitor plant located in the City of Serpukhov, Russian Federation. This risk assessment and suggestions for remediation are designed to aid in decision-making efforts by a joint Russian-American research team developing a community, national, and international response to industrial contamination. Bobovnikova et al. (The Science of the Total Environment 139/140, 357-364, [1993]) have reported that PCBs are elevated in soils and sediments, breast milk, and locally grown foods in the Serpukhov area. Data from these and other investigators have been used in this risk assessment to calculate a potential cancer risk resulting from exposure to PCBs. Our assessment indicates that members of the local population may be at increased risk of cancer, and possibly other adverse health effects, as a result of PCB contamination of their environment. Because previously unassessed environmental contamination is a common problem in the former Soviet Republics, as well as many other areas of the world, we believe this type of evaluation, using known methods, can serve as a model for assessment efforts in other parts of the globe and result in remediative efforts in regions constrained by faltering economies.     

Risk of Extreme Events in Multiobjective Decision Trees Part 1. Severe Events

Earlier work with decision trees identified nonseparability as an obstacle to minimizing the conditional expected value, a measure of the risk of extreme events, by the well-known method of averaging out and folding back. This first of two companion papers addresses the conditional expected value that is defined as the expected outcome assuming the exceedance of a threshold β, where β is preselected by the decision maker. An approach is proposed to overcome the need to evaluate all policies in order to identify the optimal policy. The approach is based on the insight that the conditional expected value is separable into two constituent elements of risk and can thus be optimized along with other objectives, including the unconditional expected value of the outcome, by using a multiobjective decision tree. An example of sequential decision making for improving highway capacity is given.     

Residential Building Codes,Affordability, and Health Protection: A Risk-Tradeoff Approach

Residential building codes intended to promote health and safety may produce unintended countervailing risks by adding to the cost of construction. Higher construction costs increase the price of new homes and may increase health and safety risks through income and stock effects. The income effect arises because households that purchase a new home have less income remaining for spending on other goods that contribute to health and safety. The stock effect arises because suppression of new-home construction leads to slower replacement of less safe housing units. These countervailing risks are not presently considered in code debates. We demonstrate the feasibility of estimating the approximate magnitude of countervailing risks by combining the income effect with three relatively well understood and significant home-health risks. We estimate that a code change that increases the nationwide cost of constructing and maintaining homes by $150 (0.1% of the average cost to build a single-family home) would induce offsetting risks yielding between 2 and 60 premature fatalities or, including morbidity effects, between 20 and 800 lost quality-adjusted life years (both discounted at 3%) each year the code provision remains in effect. To provide a net health benefit, the code change would need to reduce risk by at least this amount. Future research should refine these estimates, incorporate quantitative uncertainty analysis, and apply a full risk-tradeoff approach to real-world case studies of proposed code changes.     

Aggregation and Market Demand: An Exterior Differential Calculus Viewpoint

We analyze under which conditions a given vector field can be disaggregated as a linear combination of gradients. This problem is typical of aggregation theory, as illustrated by the literature on the characterization of aggregate market demand and excess demand. We argue that exterior differential calculus provides very useful tools to address these problems. In particular, we show, using these techniques, that any analytic mapping in Rⁿ satisfying Walras Law can be locally decomposed as the sum of n individual, utility-maximizing market demand functions. In addition, we show that the result holds for arbitrary (price-dependent) income distributions, and that the decomposition can be chosen such that it varies continuously with the mapping. Finally, when income distribution can be freely chosen, then decomposition requires only n/2 agents.     

Efficient Monte Carlo simulation via the generalized splitting method

We describe a new Monte Carlo algorithm for the consistent and unbiased estimation of multidimensional integrals and the efficient sampling from multidimensional densities. The algorithm is inspired by the classical splitting method and can be applied to general static simulation models. We provide examples from rare-event probability estimation, counting, and sampling, demonstrating that the proposed method can outperform existing Markov chain sampling methods in terms of convergence speed and accuracy.     

Spectral estimation for locally stationary time series with missing observations

Time series arising in practice often have an inherently irregular sampling structure or missing values, that can arise for example due to a faulty measuring device or complex time-dependent nature. Spectral decomposition of time series is a traditionally useful tool for data variability analysis. However, existing methods for spectral estimation often assume a regularly-sampled time series, or require modifications to cope with irregular or ‘gappy’ data. Additionally, many techniques also assume that the time series are stationary, which in the majority of cases is demonstrably not appropriate. This article addresses the topic of spectral estimation of a non-stationary time series sampled with missing data. The time series is modelled as a locally stationary wavelet process in the sense introduced by Nason et al. (J. R. Stat. Soc. B 62(2):271–292, 2000) and its realization is assumed to feature missing observations. Our work proposes an estimator (the periodogram) for the process wavelet spectrum, which copes with the missing data whilst relaxing the strong assumption of stationarity. At the centre of our construction are second generation wavelets built by means of the lifting scheme (Sweldens, Wavelet Applications in Signal and Image Processing III, Proc. SPIE, vol. 2569, pp. 68–79, 1995), designed to cope with irregular data. We investigate the theoretical properties of our proposed periodogram, and show that it can be smoothed to produce a bias-corrected spectral estimate by adopting a penalized least squares criterion. We demonstrate our method with real data and simulated examples.     

An omnibus lack of fit test in logistic regression with sparse data

The usefulness of logistic regression depends to a great extent on the correct specification of the relation between a binary response and characteristics of the unit on which the response is recoded. Currently used methods for testing for misspecification (lack of fit) of a proposed logistic regression model do not perform well when a data set contains almost as many distinct covariate vectors as experimental units, a condition referred to as sparsity. A new algorithm for grouping sparse data to create pseudo replicates and using them to test for lack of fit is developed. A simulation study illustrates settings in which the new test is superior to existing ones. Analysis of a dataset consisting of the ages of menarche of Warsaw girls is also used to compare the new and existing lack of fit tests.