Local size segregation in polydisperse hard sphere fluids

The structure of polydisperse hard sphere fluids, in the presence of a wall, is studied by the Rosenfeld density functional theory. Within this approach, the local excess free energy depends on only four combinations of the full set of density fields. The case of continuous polydispersity thereby becomes tractable. We predict, generically, an oscillatory size segregation close to the wall, and connect this, by a perturbation theory for narrow distributions, with the reversible work for changing the size of one particle in a monodisperse reference fluid.

Adaptive diversity in heterogeneous environments for populations regulated by a mixture of soft and hard selection

The stable co-existence of two haploid genotypes or two species is studied in a spatially heterogeneous environment submitted to a mixture of soft selection (within-patch regulation) and hard selection (outside-patch regulation) and where two kinds of resource are available. This is analysed both at an ecological time-scale (short term) and at an evolutionary time-scale (long term). At an ecological scale, we show that co-existence is very unlikely if the two competitors are symmetrical specialists exploiting different resources. In this case, the most favourable conditions are met when the two resources are equally available, a situation that should favour generalists at an evolutionary scale. Alternatively, low within-patch density dependence (soft selection) enhances the co-existence between two slightly different specialists of the most available resource. This results from the opposing forces that are acting in hard and soft regulation modes. In the case of unbalanced accessibility to the two resources, hard selection favours the most specialized genotype, whereas soft selection strongly favours the less specialized one. Our results suggest that competition for different resources may be difficult to demonstrate in the wild even when it is a key factor in the maintenance of adaptive diversity. At an evolutionary scale, a monomorphic invasive evolutionarily stable strategy (ESS) always exists. When a linear trade-off exists between survival in one habitat versus that in another, this ESS lies between an absolute adjustment of survival to niche size (for mainly soft-regulated populations) and absolute survival (specialization) in a single niche (for mainly hard-regulated populations). This suggests that environments in agreement with the assumptions of such models should lead to an absence of adaptive variation in the long term.

Metal complexation by electroanalytical techniques: hard- and soft-modelling approaches

En la investigació de la complexació de metalls mitjançant eines electroanalítiques són emprades dues aproximacions generals. La primera, anomenada de modelatge dur (hardmodelling), es basa en la formulació d'un model fisicoquímic conjunt per als processos electròdic i de complexació i en la resolució analítica o numèrica del model. Posteriorment, l'ajust dels paràmetres del model a les dades experimentals donarà la informació desitjada sobre el procés de complexació. La segona aproximació, anomenada de modelatge tou (soft-modelling), es basa en la identificació d'un model de complexació a partir de l'anàlisi numèrica i estadística de les dades, sense cap assumpció prèvia d'un model. Aquesta aproximació, que ha estat extensivament emprada amb dades espectroscòpiques, ho ha estat poquíssim amb dades electroquímiques. En aquest article tractem de la formulació d'un model (hard-modelling) per a la complexació de metalls en sistemes amb mescles de lligands, incloent-hi lligands macromoleculars, i de l'aplicació d

Consumer Advisory: The Drive to Destroy: Removing data from computer hard drives, storage devices & wireless phones, June 2014

The Attorney General’s Consumer Protection Division receives hundreds of calls and consumer complaints every year. Follow these tips to avoid unexpected expense and disappointments. This record is about: The Drive to Destroy: Removing data from computer hard drives, storage devices & wireless phones

Hydro-Surface Preparation and Coating for Painted Structural Steel, TR-407, 1999

Cities and counties in Iowa have more than 8,890 steel bridges, most of which are painted with red lead paint. The Iowa Department of Transportation (Iowa DOT) maintains less than 35 bridges coated with red lead paint, including seven of the large border bridges over the Mississippi and Missouri Rivers. Because of the federal and state regulations for bridge painting, many governmental agencies have opted not to repaint, or otherwise maintain, lead paint coatings. Consequently, the paint condition on many of these bridges is poor, and some bridges are experiencing severe rusting of structural members. This research project was developed with two objectives: 1) to evaluate the effectiveness of preparing the structural steel surface of a bridge with high pressure water jetting instead of abrasive blasting and 2) to coat the structural steel surface with a moisture-cured polyurethane paint under different surface preparation conditions.

Monitoring and information reporting through regulation : an inter-jurisdictional comparison of forestry-related hard laws

[Abstract]

Local optima networks of hard combinatorial landscapes

Combinatorial optimization involves finding an optimal solution in a finite set of options; many everyday life problems are of this kind. However, the number of options grows exponentially with the size of the problem, such that an exhaustive search for the best solution is practically infeasible beyond a certain problem size. When efficient algorithms are not available, a practical approach to obtain an approximate solution to the problem at hand, is to start with an educated guess and gradually refine it until we have a good-enough solution. Roughly speaking, this is how local search heuristics work. These stochastic algorithms navigate the problem search space by iteratively turning the current solution into new candidate solutions, guiding the search towards better solutions. The search performance, therefore, depends on structural aspects of the search space, which in turn depend on the move operator being used to modify solutions. A common way to characterize the search space of a problem is through the study of its fitness landscape, a mathematical object comprising the space of all possible solutions, their value with respect to the optimization objective, and a relationship of neighborhood defined by the move operator. The landscape metaphor is used to explain the search dynamics as a sort of potential function. The concept is indeed similar to that of potential energy surfaces in physical chemistry. Borrowing ideas from that field, we propose to extend to combinatorial landscapes the notion of the inherent network formed by energy minima in energy landscapes. In our case, energy minima are the local optima of the combinatorial problem, and we explore several definitions for the network edges. At first, we perform an exhaustive sampling of local optima basins of attraction, and define weighted transitions between basins by accounting for all the possible ways of crossing the basins frontier via one random move. Then, we reduce the computational burden by only counting the chances of escaping a given basin via random kick moves that start at the local optimum. Finally, we approximate network edges from the search trajectory of simple search heuristics, mining the frequency and inter-arrival time with which the heuristic visits local optima. Through these methodologies, we build a weighted directed graph that provides a synthetic view of the whole landscape, and that we can characterize using the tools of complex networks science. We argue that the network characterization can advance our understanding of the structural and dynamical properties of hard combinatorial landscapes. We apply our approach to prototypical problems such as the Quadratic Assignment Problem, the NK model of rugged landscapes, and the Permutation Flow-shop Scheduling Problem. We show that some network metrics can differentiate problem classes, correlate with problem non-linearity, and predict problem hardness as measured from the performances of trajectory-based local search heuristics.

Enzyme convertedstarch in pigment coating

Tämän diplomityön tavoitteena oli selvittää entsyymikonvertoinnin mahdollisuudet vaikuttaa sideainetärkkelyksen toiminnallisiin ominaisuuksiin. Tärkein tehtävä oli etsiä vastaukset kysymykseen, kuinka paljon entsyymikonvertointia optimoimalla voidaan maksimoida tärkkelyksen positiivisia vaikutuksia. Tavoitteena oli myös tutkia, voiko lisäaineita käyttämällä ja tärkkelystä plastisoimalla säilyttää tärkkelyksen vaikutus paperin jäykkyyteen ja saada tärkkelysfilmille joustavuutta. Kirjallisuusosassa tarkasteltiin tärkkelyksen entsyymikonvertointiin vaikuttavia tekijöitä, eri tärkkelysraaka-aineiden eroja, sekä konvertoinnissa käytettävien entsyymien ominaisuuksia. Kirjallisuusosassa tarkasteltiin myöstärkkelyksen käyttöä sideaineena pigmenttipäällystyksessä. Kokeellisessa osassakeskityttiin selvittämään entsyymikonvertoinnin olosuhteiden, käytettävän raakatärkkelyksen ja entsyymin vaikutusta konvertoidun tärkkelyksen ominaisuuksiin. Konvertoiduista tärkkelyksistä valmistettiin päällystyspastat, ja tutkittiin niinpastan kuin päällystetyn paperin ominaisuuksia. Myös erilaisten pehmentimien vaikutusta niin päällystyspastaan, kuin paperin pinnalle tutkittiin. Havaittiin, että konvertoimalla tärkkelysketjua entsymaattisesti, voidaan tärkkelysketjun pituutta säädellä. Tarkoituksena oli konvertoida tärkkelystä niin, että tärkkelyksen molekyyliketjujakaumat sisältävät lyhyitä, keskipitkiä sekäpitkiä molekyylejä. Päällystämisen havaittiin olevan vaikeaa Helicoaterilla varsinkin pitkäketjuista tärkkelystä suuren määrän sisältävillä pastoilla. Myös tärkkelys/lateksi-suhde vaihteli eri pastoilla. Päällystyspastojen reologisia ominaisuuksia testattaessa huomattiin, että tärkkelysketjun pituuden kasvaessa pastanviskositeetti lisääntyy ja vesiretentio vähenee. Havaittiin vain muutamia teknisiä paperiominaisuuksia, jotka korreloivat hyvin tärkkelysketjun pituuden kanssa. Näitä olivat kiilto, Gurley-Hill huokoisuus, taivutusvastus, taivutuspituus sekä IGT pintalujuus. Pehmentimien ei havaittu vaikuttavan moneenkaan paperin eri tekniseen ominaisuuteen. Suurimmat erot huomattiin paperin taivutuspituudessa ja taivutusvastuksessa.

Spray coating technique asa surface treatment for woodcontaining paper grades

The objective of this work was to introduce the emerging non-contacting spray coating process and compare it to the existing coating techniques. Particular emphasis was given to the details of the spraying process of paper coating colour and the base paper requirements set by the new coating method. Spraying technology itself is nothing new, but the atomisation process of paper coating colour is quite unknown to the paper industry. The differences between the rheology of painting and coating colours make it very difficult to utilise the existing information from spray painting research. Based on the trials, some basic conclusion can be made:The results of this study suggest that the Brookfield viscosity of spray coating colour should be as low as possible, presently a 50 mPas level is regarded as an optimum. For the paper quality and coater runnability, the solids level should be as high as possible. However, the graininess of coated paper surface and the nozzle wear limits the maximum solids level to 60 % at the moment. Most likelydue to the low solids and low viscosity of the coating colour the low shear Brookfield viscosity correlates very well with the paper and spray fan qualities. High shear viscosity is also important, but yet less significant than the low shear viscosity. Droplet size should be minimized and besides keeping the brrokfield viscosity low that can be helped by using a surfactant or dispersing agent in the coating colour formula. Increasing the spraying pressure in the nozzle can also reduce the droplet size. The small droplet size also improves the coating coverage, since there is hardly any levelling taking place after the impact with the base paper. Because of the lack of shear forces after the application, the pigment particles do not orientate along the paper surface. Therefore the study indicates that based on the present know-how, no quality improvements can be obtained by the use of platy type of pigments. The other disadvantage of them is the rapid deterioration of the nozzle lifetime. Further research in both coating colour rheology and nozzle design may change this in the future, but so far only round shape pigments, like typically calcium carbonate is, can be used with spray coating. The low water retention characteristics of spray coating, enhanced by the low solids and low viscosity, challenge the base paper absorption properties.Filler level has to be low not to increase the number of small pores, which have a great influence on the absorption properties of the base paper. Hydrophobic sizing reduces this absorption and prevents binder migration efficiently. High surface roughness and especially poor formation of the base paper deteriorate thespray coated paper properties. However, pre-calendering of the base paper does not contribute anything to the finished paper quality, at least at the coating colour solids level below 60 %. When targeting a standard offset LWC grade, spraycoating produces similar quality to film coating, but yet blade coating being on a slightly better level. However, because of the savings in both investment and production costs, spray coating may have an excellent future ahead. The porousnature of the spray coated surface offers an optimum substrate for the coldset printing industry to utilise the potential of high quality papers in their business.

Generating highly balanced sudoku problems as hard problems

Sudoku problems are some of the most known and enjoyed pastimes, with a never diminishing popularity, but, for the last few years those problems have gone from an entertainment to an interesting research area, a twofold interesting area, in fact. On the one side Sudoku problems, being a variant of Gerechte Designs and Latin Squares, are being actively used for experimental design, as in [8, 44, 39, 9]. On the other hand, Sudoku problems, as simple as they seem, are really hard structured combinatorial search problems, and thanks to their characteristics and behavior, they can be used as benchmark problems for refining and testing solving algorithms and approaches. Also, thanks to their high inner structure, their study can contribute more than studies of random problems to our goal of solving real-world problems and applications and understanding problem characteristics that make them hard to solve. In this work we use two techniques for solving and modeling Sudoku problems, namely, Constraint Satisfaction Problem (CSP) and Satisfiability Problem (SAT) approaches. To this effect we define the Generalized Sudoku Problem (GSP), where regions can be of rectangular shape, problems can be of any order, and solution existence is not guaranteed. With respect to the worst-case complexity, we prove that GSP with block regions of m rows and n columns with m = n is NP-complete. For studying the empirical hardness of GSP, we define a series of instance generators, that differ in the balancing level they guarantee between the constraints of the problem, by finely controlling how the holes are distributed in the cells of the GSP. Experimentally, we show that the more balanced are the constraints, the higher the complexity of solving the GSP instances, and that GSP is harder than the Quasigroup Completion Problem (QCP), a problem generalized by GSP. Finally, we provide a study of the correlation between backbone variables – variables with the same value in all the solutions of an instance– and hardness of GSP.

Generating hard SAT/CSP instances using expander graphs

In this paper we provide a new method to generate hard k-SAT instances. We incrementally construct a high girth bipartite incidence graph of the k-SAT instance. Having high girth assures high expansion for the graph, and high expansion implies high resolution width. We have extended this approach to generate hard n-ary CSP instances and we have also adapted this idea to increase the expansion of the system of linear equations used to generate XORSAT instances, being able to produce harder satisfiable instances than former generators.

How hard is a commercial puzzle: the eternity II challenge

Recently, edge matching puzzles, an NP-complete problem, have received, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.

Edge matching puzzles as hard SAT/CSP benchmarks

Recently, edge matching puzzles, an NP-complete problem, have rececived, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.