A Systematic Uncertainty Analysis of an Evaluative Fate and Exposure Model

Multimedia fate and exposure models are widely used to regulate the release of toxic chemicals, to set cleanup standards for contaminated sites, and to evaluate emissions in life-cycle assessment. CalTOX, one of these models, is used to calculate the potential dose, an outcome that is combined with the toxicity of the chemical to determine the Human Toxicity Potential (HTP), used to aggregate and compare emissions. The comprehensive assessment of the uncertainty in the potential dose calculation in this article serves to provide the information necessary to evaluate the reliability of decisions based on the HTP A framework for uncertainty analysis in multimedia risk assessment is proposed and evaluated with four types of uncertainty. Parameter uncertainty is assessed through Monte Carlo analysis. The variability in landscape parameters is assessed through a comparison of potential dose calculations for different regions in the United States. Decision rule uncertainty is explored through a comparison of the HTP values under open and closed system boundaries. Model uncertainty is evaluated through two case studies, one using alternative formulations for calculating the plant concentration and the other testing the steady state assumption for wet deposition. This investigation shows that steady state conditions for the removal of chemicals from the atmosphere are not appropriate and result in an underestimate of the potential dose for 25% of the 336 chemicals evaluated.     

Intergenerational and International Discounting

A discount rate for the consumption of future generations is typically composed of two parts. One is a "pure" time preference for immediate over postponed consumption, the other a declining marginal utility as consumption increases. The costs of greenhouse abatement, however, for at least the first 50 years, will be borne by the developed countries; the benefits will accrue to the presently undeveloped. Pure time preference always relates to one's own consumption; it has no relevance here. Consumption transfers over time will be from richer to poorer, from lower to higher marginal utility. It is a foreign aid program and it ought to have to compete with more direct foreign aid, which can benefit the very poor rather than their much-better-off descendants.     

Global product development projects: measuring performance and monitoring the risks

Abstract

This article investigates the development and application of key performance indicators for global product development. Two in-depth, longitudinal case studies with multinational Danish manufacturing companies were conducted, and highlight how key performance indicators, typically used for collocated, cross-functional product development, do not provide the predictive insight required to avoid the additional risks encountered in the global product development environment. Grounded in the case study results and building on established methodologies in performance measurement literature, a framework was developed and validated in two additional Danish companies to support project managers to develop: preventive indicators, which support the avoidance of identified risks, and outcome indicators, which support the measurement towards the attainment of project objectives. The study is unique as it is one of the very few longitudinal studies of engineering design activities in a global context, providing the in-depth contextual understanding towards key risks and their influence on performance; an important step to support researchers and practitioners with the development of preventive measures.     

Constructing Trustworthy Historical Narratives: Criteria,Principles and Techniques

Organizational scholars increasingly recognize the value of employing historical research. Yet the fields of history and organization studies struggle to reconcile. In this paper, the authors contend that a closer connection between these two fields is possible if organizational historians bring their role in the construction of historical narratives to the fore and open up their research decisions for discussion. They provide guidelines to support this endeavor, drawing on four criteria that are prevalent within interpretive organization studies for developing the trustworthiness of research: credibility; confirmability; dependability; and transferability. In contrast to the traditional use of trustworthiness criteria to evaluate the quality of research, the authors advance the criteria to encourage historians to generate more transparent narratives. Such transparency allows others to comprehend and comment on the construction of narratives, thereby building trust and understanding. Each criterion is converted into a set of guiding principles to enhance the trustworthiness of historical research, pairing each principle with a practical technique gleaned from a range of disciplines within the social sciences to provide practical guidance.     

On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions

Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g. in phylogenomics. In this context symbolic ultrametrics play a crucial role. Symbolic ultrametrics define an edge-colored complete graph that allows to represent the topology of this graph as a vertex-colored tree. Here, we are interested in the structure and the complexity of certain combinatorial problems resulting from considerations based on symbolic ultrametrics, and on algorithms to solve them.This includes, the characterization of symbolic ultrametrics that additionally distinguishes between edges and non-edges of arbitrary edge-colored graphs G and thus, yielding a tree representation of G, by means of so-called cographs. Moreover, we address the problem of finding “closest” symbolic ultrametrics and show the NP-completeness of the three problems: symbolic ultrametric editing, completion and deletion. Finally, as not all graphs are cographs, and hence, do not have a tree representation, we ask, furthermore, what is the minimum number of cotrees needed to represent the topology of an arbitrary non-cograph G. This is equivalent to find an optimal cograph edge k-decomposition \(\{E_1,\dots ,E_k\}\) of E so that each subgraph \((V,E_i)\) of G is a cograph. We investigate this problem in full detail, resulting in several new open problems, and NP-hardness results.For all optimization problems proven to be NP-hard we will provide integer linear program formulations to solve them.     

Bounds on the domination number of a digraph

A vertex subset S of a digraph D is called a dominating set of D if every vertex not in S is adjacent from at least one vertex in S. The domination number of D, denoted by \(\gamma (D)\), is the minimum cardinality of a dominating set of D. The Slater number \(s\ell (D)\) is the smallest integer t such that t added to the sum of the first t terms of the non-increasing out-degree sequence of D is at least as large as the order of D. For any digraph D of order n with maximum out-degree \(\Delta ^+\), it is known that \(\gamma (D)\ge \lceil n/(\Delta ^++1)\rceil \). We show that \(\gamma (D)\ge s\ell (D)\ge \lceil n/(\Delta ^++1)\rceil \) and the difference between \(s\ell (D)\) and \(\lceil n/(\Delta ^++1)\rceil \) can be arbitrarily large. In particular, for an oriented tree T of order n with \(n_0\) vertices of out-degree 0, we show that \((n-n_0+1)/2\le s\ell (T)\le \gamma (T)\le 2s\ell (T)-1\) and moreover, each value between the lower bound \(s\ell (T)\) and the upper bound \(2s\ell (T)-1\) is attainable by \(\gamma (T)\) for some oriented trees. Further, we characterize the oriented trees T for which \(s\ell (T)=(n-n_0+1)/2\) hold and show that the difference between \(s\ell (T)\) and \((n-n_0+1)/2\) can be arbitrarily large. Some other elementary properties involving the Slater number are also presented.     

Deterministic construction of compressed sensing matrices based on semilattices

A central problem in compressed sensing is the construction of sensing matrices. In this paper, we show how to construct sensing matrices by using semilattices, and give many examples of sensing matrices constructed from specific semilattices. Moreover, we show that the new construction for some examples with small parameters gives better sensing matrices compared with previously known constructions.     

Online MapReduce processing on two identical parallel machines

In this work we investigate the online over-list MapReduce processing problem on two identical parallel machines, aiming at minimizing the makespan. Jobs are revealed one by one, and each job consists of one map task and one reduce task. The map task can be arbitrarily split and processed on both machines simultaneously, while the reduce task has to be processed on a single machine and it cannot be started unless the map task has been completed. We first show that the general case of the problem reduces to the classical two machine online scheduling model with an optimal competitive ratio of 3/2. For a special case where the map task is at least as long as the reduce task, we prove that no online algorithm can be less than 4/3-competitive. An optimal Greedy algorithm with a matching competitive ratio is proposed as well.     

A characterization of linearizable instances of the quadratic minimum spanning tree problem

We investigate special cases of the quadratic minimum spanning tree problem (QMSTP) on a graph \(G=(V,E)\) that can be solved as a linear minimum spanning tree problem. We give a characterization of such problems when G is a complete graph, which is the standard case in the QMSTP literature. We extend our characterization to a larger class of graphs that include complete bipartite graphs and cactuses, among others. Our characterization can be verified in \(O(|E|^2)\) time. In the case of complete graphs and when the cost matrix is given in factored form, we show that our characterization can be verified in O(|E|) time. Related open problems are also indicated.     

Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays

We revise existing and introduce new mixed-integer programming models for the Multiprocessor scheduling problem with communication delays. The basis for both is the identification of two major modeling strategies one of which can be considered ordering-based, and the other assignment-based. We first reveal redundancies in the encoding of feasible solutions found in present formulations and discuss how they can be avoided. For the assignment-based approach, we propose new inequalities that lead to provably stronger continuous relaxations and better performance in practice. Moreover, we derive a third, novel modeling strategy and show how to more compactly linearize assignment formulations with quadratic constraints. In a comprehensive experimental comparison of representative models that reflect the state-of-the-art in terms of strength and size, we evaluate not only running times but also the obtained lower and upper bounds on the makespan for the harder instances of a large scale benchmark set.