Maskless Preparation of Spatially-Resolved Plasmonic Nanoparticles on Polydimethylsiloxane via In Situ Fluoride-Assisted Synthesis

Here, a fluoride-assisted route for the controlled in-situ synthesis of metal nanoparticles (NPs) (i.e., AgNPs, AuNPs) on polydimethylsiloxane (PDMS) is reported. The size and coverage of the NPs on the PDMS surface are modulated with time and over space during the synthetic process, leveraging the improved yield (10×) and faster kinetics (100×) of NP formation in the presence of F⁻ ions, compared to fluoride-free approaches. This enables the maskless preparation of both linear and step gradients and patterns of NPs in 1D and 2D on the PDMS surface. As an application in flexible plasmonics/photonics, continuous and step-wise spatial modulations of the plasmonic features of PDMS slabs with 1D and 2D AgNP gradients on the surface are demonstrated. An excellent spatially resolved tuning of key optical parameters, namely, optical density from zero to 5 and extinction ratio up to 100 dB, is achieved with AgNP gradients prepared in AgF solution for 12 minutes; the performance are comparable to those of commercial dielectric/interference filters. When used as a rejection filter in optical fluorescence microscopy, the AgNP-PDMS slabs are able to reject the excitation laser at 405 nm and retain the green fluorescence of microbeads (100 µm) used as test cases.     

DCOP FOR SMART HOMES: A CASE STUDY

The aim of this article is to bring forth the issue of integrating the services provided by intelligent artifacts in Ambient Intelligence applications. Specifically, we propose a Distributed Constraint Optimization procedure for achieving a functional integration of intelligent artifacts in a smart home. To this end, we employ Adopt-N , a state-of-the-art algorithm for solving Distributed Constraint Optimization Problems (DCOP). This article attempts to state the smart home coordination problem in general terms, and provides the details of a DCOP-based approach by describing a case study taken from the RoboCare project. More specifically, we show how (1) DCOP is a convenient metaphor for casting smart home coordination problems, and (2) the specific features which distinguish Adopt-N from other algorithms for DCOP represent a strong asset in the smart home domain.     

A chloride method for the determination of the enthalpy of steam/water mixtures discharged from geothermal wells

Chloride concentrations and pressures (or temperatures) in two points of a geothermal test line have been used to determine the enthalpy of the steam/water mixture discharged from Nisyros I geothermal well (Greece). The results are in agreement with those obtained by the Russell James method. The chloride method described in this paper is fast, requires cheap, portable equipment and is thus particularly suitable for short-term well testing during drilling or immediately after well completion, especially in steam-rich mixtures.     

Insect antifeedant activity associated with compounds isolated from species ofLonchocarpus andTephrosia

The antifeedant activity of a series of 21 chalcones, flavanes, and flavanones isolated from the generaLonchocarpus andTephrosia (Leguminosae) was assessed by behavioral and electrophysiological bioassays against larvae ofSpodoptera littoralis andS. exempta. The antifeedant activity is related to the molecular structure of the compounds, and possible modes of interaction with the insect taste receptors are discussed.     

Optimal Operating Conditions For Lab-Scale Ozonation Reactors

A method for the assessment of the optimal operating conditions for a mechanically stirred gas–liquid reactor is presented. The method exploits both fluid dynamic and chemical information. First, the behavior of the specific stirring power as a function of the stirrer speed allows singling out the dispersion region, in which the most efficient gas–liquid mass transfer is achieved. Inside this region, the analysis of experimental data obtained when considering a chemical system reacting at moderate Hatta numbers (i.e., Ha < about 2) allows determination of the rate constants and the fluid dynamic parameters (i.e., the mass transfer coefficient in the absence of chemical reaction and the characteristic diffusion time).     

Biclustering meets triadic concept analysis

Biclustering numerical data became a popular data-mining task at the beginning of 2000’s, especially for gene expression data analysis and recommender systems. A bicluster reflects a strong association between a subset of objects and a subset of attributes in a numerical object/attribute data-table. So-called biclusters of similar values can be thought as maximal sub-tables with close values. Only few methods address a complete, correct and non-redundant enumeration of such patterns, a well-known intractable problem, while no formal framework exists. We introduce important links between biclustering and Formal Concept Analysis (FCA). Indeed, FCA is known to be, among others, a methodology for biclustering binary data. Handling numerical data is not direct, and we argue that Triadic Concept Analysis (TCA), the extension of FCA to ternary relations, provides a powerful mathematical and algorithmic framework for biclustering numerical data. We discuss hence both theoretical and computational aspects on biclustering numerical data with triadic concept analysis. These results also scale to n-dimensional numerical datasets.     

Generating Rare Association Rules Using the Minimal Rare Itemsets Family

Rare association rules correspond to rare, or infrequent, itemsets, as opposed to frequent ones that are targeted by conventional pattern miners. Rare rules reflect regularities of local, rather than global, scope that can nevertheless provide valuable insights to an expert, especially in areas such as genetics and medical diagnosis where some specific deviations/illnesses occur only in a small number of cases. The work presented here is motivated by the long-standing open question of efficiently mining strong rare rules, i.e., rules with high confidence and low support. We also propose an efficient solution for finding the set of minimal rare itemsets. This set serves as a basis for generating rare association rules.     

Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis

This paper presents a heuristic algorithm for solving a job-shop scheduling problem with sequence dependent setup times and min/max separation constraints among the activities (SDST-JSSP/max). The algorithm relies on a core constraint-based search procedure, which generates consistent orderings of activities that require the same resource by incrementally imposing precedence constraints on a temporally feasible solution. Key to the effectiveness of the search procedure is a conflict sampling method biased toward selection of most critical conflicts and coupled with a non-deterministic choice heuristic to guide the base conflict resolution process. This constraint-based search is then embedded within a larger iterative-sampling search framework to broaden search space coverage and promote solution optimization. The efficacy of the overall heuristic algorithm is demonstrated empirically both on a set of previously studied job-shop scheduling benchmark problems with sequence dependent setup times and by introducing a new benchmark with setups and generalized precedence constraints.