Multiparty Quantum Communication Using Multiqubit Entanglement and Teleportation

We propose a 2N qubit entangled channel that can be used to teleport N qubits in a network to a single receiver. We describe the structure of this channel and explicitly demonstrate how the protocol works. The channel can be used to implement a scheme in which all parties have to participate in order for the teleportation to be successful. This can be advantageous in various scenarios and we discuss the potential application of this protocol to voting

Determination of pesticides in the respirable fraction of airborne particulate matter by high-performance liquid chromatography–tandem mass spectrometry

Potential harmful effects of pesticides include risks to human health of workers involved in the wet spray application in cultivated areas. Inhalation exposure depends on several factors including pesticide concentrations in the respirable fraction of airborne particulate matter (PM4). To ensure a high level of protection, the use of tractors with cabins provides protection against dust, aerosols, and vapors. Since tractors not providing maximum protection are still in use, PM4 was sampled during spreading operations in agricultural fields inside and outside tractor cabins. Sample preparation technique based on accelerated solvent extraction and solid-phase extraction cleanup was optimized before analysis of nine pesticides in PM4. Meptyldinocap, deltamethrin, myclobutanil, fluopyram, methoxyfenozide, dimethomorph, fluopicolide, cyflufenamid, and metrafenone were simultaneously determined by high-performance liquid chromatography–electrospray ionization–tandem mass spectrometry (HPLC–ESI–MS–MS). The results demonstrated the efficacy of the tractor cabs used in the sampling sites. © 2017 Taylor & Francis

Searching by approximate personal-name matching

We discuss the design, building and evaluation of a method to access theinformation of a person, using his name as a search key, even if it has deformations. We present a similarity function, the DEA function, based on the probabilities of the edit operations accordingly to the involved letters and their position, and using a variable threshold. The efficacy of DEA is quantitatively evaluated, without human relevance judgments, very superior to the efficacy of known methods. A very efficient approximate search technique for the DEA function is also presented based on a compacted trie-tree structure.Postprint (published version

“A useful accessory to the infantry, but nothing more”: Tanks at the Battle of Flers-Courcelette, September 1916

The Battle of Flers-Courcelette is chiefly remembered as the combat introduction of tanks. The prevailing historiography maligns their performance as a lacklustre debut of a weapon which held so much promise for offensive warfare. However, unit war diaries and individual accounts of the battle suggest that the tank assaults of 15 September 1916 were far from total failures. This paper thus re-examines the role of tanks in the battle from the perspective of Canadian, British and New Zealand infantry. It finds that, rather than disappointing Allied combatants, the tanks largely lived up to their intended role of infantry support

Optimizing Emergency Transportation through Multicommodity Quickest Paths

In transportation networks with limited capacities and travel times on the arcs, a class of problems attracting a growing scientific interest is represented by the optimal routing and scheduling of given amounts of flow to be transshipped from the origin points to the specific destinations in minimum time. Such problems are of particular concern to emergency transportation where evacuation plans seek to minimize the time evacuees need to clear the affected area and reach the safe zones. Flows over time approaches are among the most suitable mathematical tools to provide a modelling representation of these problems from a macroscopic point of view. Among them, the Quickest Path Problem (QPP), requires an origin-destination flow to be routed on a single path while taking into account inflow limits on the arcs and minimizing the makespan, namely, the time instant when the last unit of flow reaches its destination. In the context of emergency transport, the QPP represents a relevant modelling tool, since its solutions are based on unsplittable dynamic flows that can support the development of evacuation plans which are very easy to be correctly implemented, assigning one single evacuation path to a whole population. This way it is possible to prevent interferences, turbulence, and congestions that may affect the transportation process, worsening the overall clearing time. Nevertheless, the current state-of-the-art presents a lack of studies on multicommodity generalizations of the QPP, where network flows refer to various populations, possibly with different origins and destinations. In this paper we provide a contribution to fill this gap, by considering the Multicommodity Quickest Path Problem (MCQPP), where multiple commodities, each with its own origin, destination and demand, must be routed on a capacitated network with travel times on the arcs, while minimizing the overall makespan and allowing the flow associated to each commodity to be routed on a single path. For this optimization problem, we provide the first mathematical formulation in the scientific literature, based on mixed integer programming and encompassing specific features aimed at empowering the suitability of the arising solutions in real emergency transportation plans. A computational experience performed on a set of benchmark instances is then presented to provide a proof-of-concept for our original model and to evaluate the quality and suitability of the provided solutions together with the required computational effort. Most of the instances are solved at the optimum by a commercial MIP solver, fed with a lower bound deriving from the optimal makespan of a splittable-flow relaxation of the MCQPP

Parameterized complexity of machine scheduling: 15 open problems

Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 open questions in this area whose resolution we expect to lead to the discovery of new approaches and techniques both in scheduling and parameterized complexity theory.Comment: Version accepted to Computers & Operations Researc

Algorithm Engineering in Robust Optimization

Robust optimization is a young and emerging field of research having received a considerable increase of interest over the last decade. In this paper, we argue that the the algorithm engineering methodology fits very well to the field of robust optimization and yields a rewarding new perspective on both the current state of research and open research directions. To this end we go through the algorithm engineering cycle of design and analysis of concepts, development and implementation of algorithms, and theoretical and experimental evaluation. We show that many ideas of algorithm engineering have already been applied in publications on robust optimization. Most work on robust optimization is devoted to analysis of the concepts and the development of algorithms, some papers deal with the evaluation of a particular concept in case studies, and work on comparison of concepts just starts. What is still a drawback in many papers on robustness is the missing link to include the results of the experiments again in the design