A comparison of the performance and biological efficiency of new knapsack sprayers and a controlled droplet application (CDA) sprayer for the control of the diamondback moth, Plutella xylostella L. (Lepidoptera : Plutellidae)

Field trials and laboratory bioassays were undertaken to compare the performance and efficacy (mortality of diamondback moth larvae) of insecticides applied to cabbages with three high volume hydraulic knapsack sprayers (NS-16, PB-20 and Selecta 12V) and a controlled droplet application (CDA) sprayer. In field experiments, the high volume knapsack sprayers (application rate 500-600 L ha(-1)) provided better spray coverage on the upper and lower surfaces of inner leaves, the upper surfaces of middle and outer leaves, and greater biological efficacy than the CDA sprayer (application rate 20similar to40 L ha(-1)). The PB-20 provided better spray coverage on the upper surface of middle leaves and both surfaces of outer leaves when compared with the Selecta 12V. However, its biological efficacy in the field was not significantly different from that of the other high volume sprayers. Increasing the application rate from 20 to 40 L ha(-1) for the CDA sprayer significantly increased droplet density but had no impact on test insect mortality. Laboratory evaluations of biological efficacy yielded higher estimates than field evaluations and there was no significant difference between the performance of the PB-20 and the CDA sprayer. Significant positive relationships were detected between insect mortality and droplet density deposited for both the PB-20 and the CDA sprayers.

Solving large 0–1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm

The artificial fish swarm algorithm has recently been emerged in continuous global optimization. It uses points of a population in space to identify the position of fish in the school. Many real-world optimization problems are described by 0-1 multidimensional knapsack problems that are NP-hard. In the last decades several exact as well as heuristic methods have been proposed for solving these problems. In this paper, a new simpli ed binary version of the artificial fish swarm algorithm is presented, where a point/ fish is represented by a binary string of 0/1 bits. Trial points are created by using crossover and mutation in the different fi sh behavior that are randomly selected by using two user de ned probability values. In order to make the points feasible the presented algorithm uses a random heuristic drop item procedure followed by an add item procedure aiming to increase the profit throughout the adding of more items in the knapsack. A cyclic reinitialization of 50% of the population, and a simple local search that allows the progress of a small percentage of points towards optimality and after that refines the best point in the population greatly improve the quality of the solutions. The presented method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method can be an alternative method for solving these problems.

Aplicació web de generació i autoavaluació d'exàmens tipus test basat en el criptosistema knapsack

Creació d'una aplicació web que genera exàmens tipus test agafant les preguntes d'un banc de preguntes. Genera una versió per cada alumne del mateix exàmen, amb les preguntes desordenades i les opcions també desordenades. A cada resposta se li associa un número. El resultat de l'exàmen és la suma de les repostes. Mitjançant el criptosistema Knapsack ficant a l'aplicació el número resultat de l'exàmen s'obté la nota.

Knapsack sets for cryptography

The basic goal of this study is to extend old and propose new ways to generate knapsack sets suitable for use in public key cryptography. The knapsack problem and its cryptographic use are reviewed in the introductory chapter. Terminology is based on common cryptographic vocabulary. For example, solving the knapsack problem (which is here a subset sum problem) is termed decipherment. Chapter 1 also reviews the most famous knapsack cryptosystem, the Merkle Hellman system. It is based on a superincreasing knapsack and uses modular multiplication as a trapdoor transformation. The insecurity caused by these two properties exemplifies the two general categories of attacks against knapsack systems. These categories provide the motivation for Chapters 2 and 4. Chapter 2 discusses the density of a knapsack and the dangers of having a low density. Chapter 3 interrupts for a while the more abstract treatment by showing examples of small injective knapsacks and extrapolating conjectures on some characteristics of knapsacks of larger size, especially their density and number. The most common trapdoor technique, modular multiplication, is likely to cause insecurity, but as argued in Chapter 4, it is difficult to find any other simple trapdoor techniques. This discussion also provides a basis for the introduction of various categories of non injectivity in Chapter 5. Besides general ideas of non injectivity of knapsack systems, Chapter 5 introduces and evaluates several ways to construct such systems, most notably the "exceptional blocks" in superincreasing knapsacks and the usage of "too small" a modulus in the modular multiplication as a trapdoor technique. The author believes that non injectivity is the most promising direction for development of knapsack cryptosystema. Chapter 6 modifies two well known knapsack schemes, the Merkle Hellman multiplicative trapdoor knapsack and the Graham Shamir knapsack. The main interest is in aspects other than non injectivity, although that is also exploited. In the end of the chapter, constructions proposed by Desmedt et. al. are presented to serve as a comparison for the developments of the subsequent three chapters. Chapter 7 provides a general framework for the iterative construction of injective knapsacks from smaller knapsacks, together with a simple example, the "three elements" system. In Chapters 8 and 9 the general framework is put into practice in two different ways. Modularly injective small knapsacks are used in Chapter 9 to construct a large knapsack, which is called the congruential knapsack. The addends of a subset sum can be found by decrementing the sum iteratively by using each of the small knapsacks and their moduli in turn. The construction is also generalized to the non injective case, which can lead to especially good results in the density, without complicating the deciphering process too much. Chapter 9 presents three related ways to realize the general framework of Chapter 7. The main idea is to join iteratively small knapsacks, each element of which would satisfy the superincreasing condition. As a whole, none of these systems need become superincreasing, though the development of density is not better than that. The new knapsack systems are injective but they can be deciphered with the same searching method as the non injective knapsacks with the "exceptional blocks" in Chapter 5. The final Chapter 10 first reviews the Chor Rivest knapsack system, which has withstood all cryptanalytic attacks. A couple of modifications to the use of this system are presented in order to further increase the security or make the construction easier. The latter goal is attempted by reducing the size of the Chor Rivest knapsack embedded in the modified system. '

The knapsack problem approach in solving partial hedging problems of options

En option är ett finansiellt kontrakt som ger dess innehavare en rättighet (men medför ingen skyldighet) att sälja eller köpa någonting (till exempel en aktie) till eller från säljaren av optionen till ett visst pris vid en bestämd tidpunkt i framtiden. Den som säljer optionen binder sig till att gå med på denna framtida transaktion ifall optionsinnehavaren längre fram bestämmer sig för att inlösa optionen. Säljaren av optionen åtar sig alltså en risk av att den framtida transaktion som optionsinnehavaren kan tvinga honom att göra visar sig vara ofördelaktig för honom. Frågan om hur säljaren kan skydda sig mot denna risk leder till intressanta optimeringsproblem, där målet är att hitta en optimal skyddsstrategi under vissa givna villkor. Sådana optimeringsproblem har studerats mycket inom finansiell matematik. Avhandlingen "The knapsack problem approach in solving partial hedging problems of options" inför en ytterligare synpunkt till denna diskussion: I en relativt enkel (ändlig och komplett) marknadsmodell kan nämligen vissa partiella skyddsproblem beskrivas som så kallade kappsäcksproblem. De sistnämnda är välkända inom en gren av matematik som heter operationsanalys. I avhandlingen visas hur skyddsproblem som tidigare lösts på andra sätt kan alternativt lösas med hjälp av metoder som utvecklats för kappsäcksproblem. Förfarandet tillämpas även på helt nya skyddsproblem i samband med så kallade amerikanska optioner.

Drift from the use of handheld knapsack pesticide sprayers in Boyacá (Colombian Andes)

Offsite pesticide losses in tropical mountainous regions have been little studied. One example is measuring pesticide drift soil deposition, which can support pesticide risk assessment for surface water, soil, bystanders, off target plants and fauna. This is considered a serious gap, given the evidence of pesticide-related poisoning in those regions. Empirical data of drift deposition of a pesticide surrogate, Uranine tracer, within one of the highest potato producing regions in Colombia, characterized by small plots and mountain orography, is presented. High drift values encountered in our study reflect the actual spray conditions using handled knapsack sprayers. Comparison between measured and predicted drift values using three existing empirical equations showed important underestimation. However, after their optimization based on measured drift information, the equations showed a strong predictive power for this study area and the study conditions. The most suitable curve to assess mean relative drift was the IMAG calculator after optimization.

Simulating human and environmental exposure from hand-held knapsack pesticide application: Be-WetSpa-Pest, an integrative, spatially explicit modeling approach

This paper presents an integrative and spatially explicit modeling approach for analyzing human and environmental exposure from pesticide application of smallholders in the potato producing Andean region in Colombia. The modeling approach fulfills the following criteria: (i) it includes environmental and human compartments; (ii) it contains a behavioral decision-making model for estimating the effect of policies on pesticide flows to humans and the environment; (iii) it is spatially explicit; and (iv) it is modular and easily expandable to include additional modules, crops or technologies. The model was calibrated and validated for the Vereda La Hoya and was used to explore the effect of different policy measures in the region. The model has moderate data requirements and can be adapted relatively easy to other regions in developing countries with similar conditions.

The constrained compartmentalized knapsack problem: mathematical models and solution methods

The constrained compartmentalized knapsack problem can be seen as an extension of the constrained knapsack problem. However, the items are grouped into different classes so that the overall knapsack has to be divided into compartments, and each compartment is loaded with items from the same class. Moreover, building a compartment incurs a fixed cost and a fixed loss of the capacity in the original knapsack, and the compartments are lower and upper bounded. The objective is to maximize the total value of the items loaded in the overall knapsack minus the cost of the compartments. This problem has been formulated as an integer non-linear program, and in this paper, we reformulate the non-linear model as an integer linear master problem with a large number of variables. Some heuristics based on the solution of the restricted master problem are investigated. A new and more compact integer linear model is also presented, which can be solved by a branch-and-bound commercial solver that found most of the optimal solutions for the constrained compartmentalized knapsack problem. On the other hand, heuristics provide good solutions with low computational effort. (C) 2011 Elsevier BM. All rights reserved.

Efficiency of safety measures applied to a manual knapsack sprayer for paraquat application to Maize (Zea mays L.)

The objectives of the present study were to evaluate the safety of mixer/loaders and applicators of paraquat to maize crop by knapsack sprayers and to determine the efficacy of safety measures applied to the sprayers. Potential dermal exposure (PDE) was evaluated in 22 worker body parts. The Cu2+ cation of a copper-based fungicide was used as tracer in the spray solution. Sanitary pads and cotton gloves were used to collect the pesticide solution on the sampled body parts. It was observed that paraquat application in front of the applicator's body (0.5 and 1.0 m lance) is unsafe because PDE was 1,979.8 ml/day (for 0.5 m lance) and 1,290.4 ml/day (for 1.0 m lance) and needs 50-80% and 37-69% control of PDE respectively. Control can be achieved by the use of protective garment on the legs and feet only, which received 92-93% of the PDE. Switching the spray nozzle to the back of the operator reduced the PDE by 98% and was sufficient to make working conditions safe, while maintaining the efficiency of application and making the work lighter and more comfortable. Mixer/loaders received 86% of the PDE to the hands and the work condition was safe (MOS > 1), however impermeable gloves could be used as a further safety measure.

A knapsack problem as a tool to solve the production planning problem in small foundries

According to recent research carried out in the foundry sector, one of the most important concerns of the industries is to improve their production planning. A foundry production plan involves two dependent stages: (1) determining the alloys to be merged and (2) determining the lots that will be produced. The purpose of this study is to draw up plans of minimum production cost for the lot-sizing problem for small foundries. As suggested in the literature, the proposed heuristic addresses the problem stages in a hierarchical way. Firstly, the alloys are determined and, subsequently, the items that are produced from them. In this study, a knapsack problem as a tool to determine the items to be produced from furnace loading was proposed. Moreover, we proposed a genetic algorithm to explore some possible sets of alloys and to determine the production planning for a small foundry. Our method attempts to overcome the difficulties in finding good production planning presented by the method proposed in the literature. The computational experiments show that the proposed methods presented better results than the literature. Furthermore, the proposed methods do not need commercial software, which is favorable for small foundries. (C) 2010 Elsevier Ltd. All rights reserved.

Solving the logically constrained multiple choice multiple knapsack problem: A real case

In questa tesi viene analizzato un problema di ottimizzazione proposto da alcuni esercizi commerciali che hanno la necessita` di selezionare e disporre i propri ar- ticoli in negozio. Il problema nasce dall’esigenza di massimizzare il profitto com- plessivo atteso dei prodotti in esposizione, trovando per ognuno una locazione sugli scaffali. I prodotti sono suddivisi in dipartimenti, dai quali solo un ele- mento deve essere selezionato ed esposto. In oltre si prevede la possibilita` di esprimere vincoli sulla locazione e compatibilita` dei prodotti. Il problema risul- tante `e una generalizzazione dei gia` noti Multiple-Choice Knapsack Problem e Multiple Knapsack Problem. Dopo una ricerca esaustiva in letteratura si `e ev- into che questo problema non `e ancora stato studiato. Si `e quindi provveduto a formalizzare il problema mediante un modello di programmazione lineare intera. Si propone un algoritmo esatto per la risoluzione del problema basato su column generation e branch and price. Sono stati formulati quattro modelli differenti per la risoluzione del pricing problem su cui si basa il column generation, per individuare quale sia il piu` efficiente. Tre dei quattro modelli proposti hanno performance comparabili, mentre l’ultimo si `e rivelato piu` inefficiente. Dai risul- tati ottenuti si evince che il metodo risolutivo proposto `e adatto a istanze di dimensione medio-bassa.

Knapsack and rifle; or, Life in the grand army. War as seen from the ranks, pen pictures and sketches, personal reminiscenes and narratives, and a complete chronology of the war,

Dedication signed: Robert W. Patrick.

Carrying of the Cross: peasant with a knapsack on back

Pieter Bruegel the Elder; oil on oak