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.

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

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.

Improving Pitch Tracking Performance in Hard Noise Conditions by a Preprocessing Based on Mathematical Morphology

In this paper we show how a nonlinear preprocessing of speech signal -with high noise- based on morphological filters improves the performance of robust algorithms for pitch tracking (RAPT). This result happens for a very simple morphological filter. More sophisticated ones could even improve such results. Mathematical morphology is widely used in image processing and has a great amount of applications. Almost all its formulations derived in the two-dimensional framework are easily reformulated to be adapted to one-dimensional context

Universality of the 1/3 shot-noise suppression factor in nondegenerate diffusive conductors

Shot-noise suppression is investigated in nondegenerate diffusive conductors by means of an ensemble Monte Carlo simulator. The universal 1/3 suppression value is obtained when transport occurs under elastic collision regime provided the following conditions are satisfied: (i) The applied voltage is much larger than the thermal value; (ii) the length of the device is much greater than both the elastic mean free path and the Debye length. By fully suppressing carrier-number fluctuations, long-range Coulomb interaction is essential to obtain the 1/3 value in the low-frequency limit.

Self-consistent theory of current and voltage noise in multimode ballistic conductors

Electron transport in a self-consistent potential along a ballistic two-terminal conductor has been investigated. We have derived general formulas which describe the nonlinear current-voltage characteristics, differential conductance, and low-frequency current and voltage noise assuming an arbitrary distribution function and correlation properties of injected electrons. The analytical results have been obtained for a wide range of biases: from equilibrium to high values beyond the linear-response regime. The particular case of a three-dimensional Fermi-Dirac injection has been analyzed. We show that the Coulomb correlations are manifested in the negative excess voltage noise, i.e., the voltage fluctuations under high-field transport conditions can be less than in equilibrium.

Automatització d'un procés de fabricació de peces plàstiques

RESUM L'automatització s'utilitza des de fa molts anys, tot i que va començar a agafar la definició que coneixem actualment al voltant dels anys seixanta i setanta, moment en què es comencen a comercialitzar els primers PLC. A partir d'aquí, el seu creixement ha estat exponencial. En aquest sentit, la tecnologia ha anat avançant i ha augmentat els components que la forma, per això a hores d'ara encara no sabem fins on podrà arribar i què aconseguirà. Per a la indústria tot això ha significat l'automatització de processos que fins ara utilitzaven molt mà d'obra, reduint-la dràsticament. Una de les indústries que més s'ha beneficiat de tots aquests avenços ha estat la de l'automoció, concretament les seves grans línies de producció, automatitzades a uns nivells que fins fa poc temps eren impensables. Aquest projecte forma part d'aquesta indústria, no directament per a la construcció de l'automòbil, sinó indirectament, ja que l'empresa per a la qual s'ha fet l'automatització fabrica peces plàstiques per a automòbils. Concretament, unes peces amb uns injerts metàl•lics conductors que es munten a tots els vehicles i s'utilitzen per accionar els neteja vidres dels cotxes. Aquest fet implica que la fabricació i el disseny de la peça sigui curosament vigilat i controlat per al client final, amb uns controls de qualitat extremadament exigents. El funcionament del procés de fabricació es fa a partir d'unes peces de plàstic produïdes per una injectora que es fan passar per unes estacions automatitzades, cada una de les quals fa una acció concreta per aconseguir el muntatge final.