High Figure of Merit (FOM) of Bragg Modes in Au‐Coated Nanodisk Arrays for Plasmonic Sensing

Gold‐coated nanodisk arrays of nearly micron periodicity are reported that have high figure of merit (FOM) and sensitivity necessary for plasmonic refractometric sensing, with the added benefit of suitability for surface‐enhanced Raman scattering (SERS), large‐scale microfabrication using standard photolithographic techniques and a simple instrumental setup. Gold nanodisk arrays are covered with a gold layer to excite the Bragg modes (BM), which are the propagative surface plasmons localized by the diffraction from the disk array. This generates surface‐guided modes, localized as standing waves, leading to highly confined fields confirmed by a mapping of the SERS intensity and numerical simulations with 3D finite element method. The optimal gold‐coated nanodisk arrays are applied for refractometric sensing in transmission spectroscopy with better performance than nanohole arrays and they are integrated to a 96‐well plate reader for detection of IgY proteins in the nanometer range in PBS. The potential for sensing in biofluids is assessed with IgG detection in 1:1 diluted urine. The structure exhibits a high FOM of up to 46, exceeding the FOM of structures supporting surface plasmon polaritons and comparable to more complex nanostructures, demonstrating that subwavelength features are not necessary for high‐performance plasmonic sensing.     

Thermal modeling in electricity assisted incremental sheet forming

A thermal model was built to account for the effects of geometrical parameters of sheet specimen, process parameters and material parameters on the temperature increase of the sheet specimen in Electricity-Assisted Incremental Sheet Forming (EISF). In the EISF, the local area of sheet specimen contacting with a forming tool is heated by direct current, which flows through the forming tool to the sheet specimen. EISF experiments of two high strength steel sheets were carried out to validate the thermal model. The thermal model can be integrated into the control program of EISF system to achieve more accurate temperature control.     

Design theory at Bauhaus: teaching “splitting” knowledge

Recent advances in design theory help clarify the logic, forms and conditions of generativity. In particular, the formal model of forcing predicts that high-level generativity (so-called generic generativity) can only be reached if the knowledge structure meets the ‘splitting condition’. We test this hypothesis for the case of Bauhaus (1919–1933), where we can expect strong generativity and where we have access to the structures of knowledge provided by teaching. We analyse teaching at Bauhaus by focusing on the courses of Itten and Klee. We show that these courses aimed to increase students’ creative design capabilities by providing the students with methods of building a knowledge base with two critical features: (1) a knowledge structure that is characterized by non-determinism and non-modularity and (2) a design process that helps students progressively ‘superimpose’ languages on the object. From the results of the study, we confirm the hypothesis deduced from design theory; we reveal unexpected conditions on the knowledge structure required for generativity and show that the structure is different from the knowledge structure and design process of engineering systematic design and show that the conditions required for generativity, which can appear as a limit on generativity, can also be positively interpreted. The example of Bauhaus shows that enabling a splitting condition is a powerful way to increase designers’ generativity.     

A new methodology for Bayesian history matching using parallel interacting Markov chain Monte Carlo

This paper presents an innovative application of a new class of parallel interacting Markov chains Monte Carlo to solve the Bayesian history matching (BHM) problem. BHM consists of sampling a posterior distribution given by the Bayesian theorem. Markov chain Monte Carlo (MCMC) is well suited for sampling, in principle, any type of distribution; however the number of iteration required by the traditional single-chain MCMC can be prohibitive in BHM applications. Furthermore, history matching is typically a highly nonlinear inverse problem, which leads in very complex posterior distributions, characterized by many separated modes. Therefore, single chain can be trapped into a local mode. Parallel interacting chains is an interesting way to overcome this problem, as shown in this paper. In addition, we presented new approaches to define starting points for the parallel chains. For validation purposes, the proposed methodology is firstly applied in a simple but challenging cross section reservoir model with many modes in the posterior distribution. Afterwards, the application to a realistic case integrated to geostatistical modelling is also presented. The results showed that the combination of parallel interacting chain with the capabilities of distributed computing commonly available nowadays is very promising to solve the BHM problem.     

Hypercube sandwich approach to conferencing

This paper presents a novel cascaded conference network that provides distributed processing and signal transmission among members of disjoint sets of generic send/receive devices called conferees. It assumes an online request model in which idle groups of conferees may request the formation of a conference interconnection. Once a conference is established, all conferees remain connected until the entire conference is dissolved. The Hypercube Sandwich Network (HSN) consists of two components. A bidirectional permutation network is used for routing purposes to and from a hypercube of special processing elements for the purpose of conference formation. The HSN achieves strictly nonblocking performance for N conferees using O(Nlog N) processing elements, and this is shown to be tight to within a log ^1/4 N factor. Previous constructions required a quadratic number of processing elements for strictly nonblocking performance or could only provide wide-sense nonblocking conferencing. If the stronger requirement is made that the communication delay is logarithmic in the conference size, a simple algorithm is presented for wide-sense nonblocking conferencing in an HSN with O(N log N) processing elements.An earlier version of this paper was presented at the 1995 International Conference on Parallel Processing Techniques and Applications.     

Accuracy estimate and optimization techniques for SimRank computation

The measure of similarity between objects is a very useful tool in many areas of computer science, including information retrieval. SimRank is a simple and intuitive measure of this kind, based on a graph-theoretic model. SimRank is typically computed iteratively, in the spirit of PageRank. However, existing work on SimRank lacks accuracy estimation of iterative computation and has discouraging time complexity. In this paper, we present a technique to estimate the accuracy of computing SimRank iteratively. This technique provides a way to find out the number of iterations required to achieve a desired accuracy when computing SimRank. We also present optimization techniques that improve the computational complexity of the iterative algorithm from O(n ⁴) in the worst case to min(O(nl), O(n ³/ log₂ n)), with n denoting the number of objects, and l denoting the number object-to-object relationships. We also introduce a threshold sieving heuristic and its accuracy estimation that further improves the efficiency of the method. As a practical illustration of our techniques, we computed SimRank scores on a subset of English Wikipedia corpus, consisting of the complete set of articles and category links.     

Scaling the formation of slug bubbles in microfluidic flow-focusing devices

The present study aims at scaling the formation of slug bubbles in flow-focusing microfluidic devices using a high-speed digital camera and a micro particle image velocimetry (μ-PIV) system. Experiments were conducted in two different polymethyl methacrylate square microchannels of respectively 600 × 600 and 400 × 400 μm. N₂ bubbles were generated in glycerol–water mixtures with several concentrations of surfactant sodium dodecyl sulfate. The influence of gas and liquid flow rates, the viscosity of the liquid phase and the width of the microchannel on the bubble size were explored. The bubble size was correlated as a function of the width of the microchannel W _c, the ratio of the gas/liquid flow rates Q _g/Q _l and the liquid Reynolds number. During the pinch-off stage, the variation of the minimum width of the gaseous thread W _m with the remaining time could be scaled as _boxclose_boxclose ()^ - 0.15 (T - t)^1/3 . W_{\text{m}} \propto ({\frac{{Q_{\text{g}} }}{{Q_{\text{l}} }}})^{ - 0.15} (T - t)^{1/3} . The velocity fields in the liquid phase around the thread, determined by μ-PIV measurements, were obtained around a forming bubble to reveal the role of the liquid phase.     

Characterization of renal tumours based on Raman spectra classification

In this study, we propose to evaluate the potential of Raman spectroscopy (RS) to assess renal tumours at surgery. Different classes of Raman renal spectra acquired during a clinical protocol are discriminated using support vector machines classifiers. The influence on the classification scores of various preprocessing steps generally involved in RS are also investigated and evaluated in the particular context of renal tumour characterization. Encouraging results show the interest of RS to evaluate kidney cancer and suggest the potential of this technique as a surgical assistance during partial nephrectomy.     

Reliability versus performance for critical applications

Applications implemented on critical systems are subject to both safety critical and real-time constraints. Classically, applications are specified as precedence task graphs that must be scheduled onto a given target multiprocessor heterogeneous architecture. We propose a new method for simultaneously optimizing two objectives: the execution time and the reliability of the schedule. The problem is decomposed into two successive steps: a spatial allocation during which the reliability is maximized (randomized algorithm), and a scheduling during which the makespan is minimized (list scheduling algorithm). It allows us to produce several trade-off solutions, among which the user can choose the solution that best fits the application’s requirements. Reliability is increased by replicating adequate tasks onto well chosen processors. Our fault model assumes that processors are fail-silent, that they are subject to transient failures, and that the occurrences of failures follow a constant parameter Poisson law. We assess and validate our method by running extensive simulations on both random graphs and actual application graphs. They show that it is competitive, in terms of makespan, compared to existing reference scheduling methods for heterogeneous processors (HEFT), while providing a better reliability.