Molds and Resists Studies for Nanoimprint Lithography of Electrodes in Low-Voltage Polymer Thin-Film Transistors

A low-cost patterning of electrodes was investigated looking forward to replacing conventional photolithography for the processing of low-operating voltage polymeric thin-film transistors. Hard silicon, etched by sulfur hexafluoride and oxygen gas mixture, and flexible polydimethylsiloxane imprinting molds were studied through atomic force microscopy (AFM) and field emission gun scanning electron microscopy. The higher the concentration of oxygen in reactive ion etching, the lower the etch rate, sidewall angle, and surface roughness. A concentration around 30 % at 100 mTorr, 65 W and 70 sccm was demonstrated as adequate for submicrometric channels, presenting a reduced etch rate of 176 nm/min. Imprinting with positive photoresist AZ1518 was compared to negative SU-8 2002 by optical microscopy and AFM. Conformal results were obtained only with the last resist by hot embossing at 120 °C and 1 kgf/cm² for 2 min, followed by a 10 min post-baking at 100 °C. The patterning procedure was applied to define gold source and drain electrodes on oxide-covered substrates to produce bottom-gate bottom-contact transistors. Poly(3-hexylthiophene) (P3HT) devices were processed on high-κ titanium oxynitride (TiO _x N _y ) deposited by radiofrequency magnetron sputtering over indium tin oxide-covered glass to achieve low-voltage operation. Hole mobility on micrometric imprinted channels may approach amorphous silicon (～0.01 cm²/V s) and, since these devices operated at less than 5 V, they are not only suitable for electronic applications but also as sensors in aqueous media.     

Generalized Hermitian Radial Basis Functions Implicits from polygonal mesh constraints

In this work we investigate a generalized interpolation approach using radial basis functions to reconstruct implicit surfaces from polygonal meshes. With this method, the user can define with great flexibility three sets of constraint interpolants: points, normals, and tangents; allowing to balance computational complexity, precision, and feature modeling. Furthermore, this flexibility makes possible to avoid untrustworthy information, such as normals estimated on triangles with bad aspect ratio. We present results of the method for applications related to the problem of modeling 2D curves from polygons and 3D surfaces from polygonal meshes. We also apply the method to problems involving subdivision surfaces and front-tracking of moving boundaries. Finally, as our technique generalizes the recently proposed HRBF Implicits technique, comparisons with this approach are also conducted.     

Parallelization of the FMM on distributed-memory GPGPU systems for acoustic-scattering prediction

In this work, we carry out the parallelization of the single level Fast Multipole Method (FMM) for solving acoustic-scattering problems (using the Helmholtz equation) on distributed-memory GPGPU systems. With the aim of enlarging the scope of feasible simulations, the presented solution combines the techniques developed for our distributed-memory CPU solver with our shared-memory GPGPU solver. The performance of the developed solution is proved using two different GPGPU clusters: the first one consists of two workstations with NVIDIA GTX 480 GPUs linked by a Gigabit Ethernet network, and the second one comprises four nodes with NVIDIA Tesla M2090 GPUs linked by an Infiniband network.     

Dynamic Epistemic Logic for Implicit and Explicit Beliefs

Epistemic logic with its possible worlds semantic model is a powerful framework that allows us to represent an agent’s information not only about propositional facts, but also about her own information. Nevertheless, agents represented in this framework are logically omniscient: their information is closed under logical consequence. This property, useful in some applications, is an unrealistic idealisation in some others. Many proposals to solve this problem focus on weakening the properties of the agent’s information, but some authors have argued that solutions of this kind are not completely adequate because they do not look at the heart of the matter: the actions that allow the agent to reach such omniscient state. Recent works have explored how acts of observation, inference, consideration and forgetting affect an agent’s implicit and explicit knowledge; the present work focuses on acts that affect an agent’s implicit and explicit beliefs. It starts by proposing a framework in which these two notions can be represented, and then it looks into their dynamics, first by reviewing the existing notion of belief revision, and then by introducing a rich framework for representing diverse forms of inference that involve both knowledge and beliefs.     

Forecasting Financial Failure of Firms via Genetic Algorithms

Given a wide amount of possible ratios available for constructing a LOGIT model for forecasting bankruptcy, this paper provides a computational search methodology, only guided by data, for selecting the financial ratios employed in the model. This procedure is based on genetic algorithms which are used to explore the universe of models made available by all possible existing financial ratios (with very redundant information). This search process of the correct model is guided by the Schwarz information criterion. As an empirical illustration, the methodology is applied to forecasting the failure of firms in the Spanish building industry using annual public accounting information.     

An efficient algorithm for optimal routing applied to convoy merging manoeuvres in urban environments

This paper describes an innovative routing strategy for intelligent transportation units willing to perform merging manoeuvres with a moving convoy. In particular, we consider a transportation unit located inside a city (pursuer unit), and which wishes to join a convoy that is constantly moving around the city. We first describe a solution that considers idealistic conditions, i.e., the traveling time along each street is constant. We then go on to improve our first approach to deal with the realistic random nature of the traveling times experienced by the pursuer and by the convoy leader. Our search strategy applies Dynamic Programming to achieve a meeting point that is optimal in two ways: on one hand, the optimal destination is the one closest to the current pursuer??s position; on the other hand, the optimal meeting point must minimize the time that elapses until the pursuer meets the convoy (considering that the pursuer must always arrive first). Calculating the optimal path to every possible destination is highly inefficient, error prone and time consuming. On the contrary, we propose an efficient search strategy that will achieve the meeting point and the path to it, both optimally and in a very short time. This enables the real-time application of our approach either for finding new solutions or for re-planning old ones owing to unexpected real-conditions.     

Astringency sub-qualities of red wines and the influence of wine–saliva aggregates

Astringency is a sensory attribute, related to the quality and mouthfeel of red wines. However, the origin of astringency sub-qualities, such as the typical drying astringency found in immature grapes, is still unknown. Astringency of red wines with similar tannin content but different astringency sub-qualities, from different harvest dates, is studied. Astringency was characterised in terms of friction coefficient, polyphenol content, sensory analysis and tannin/salivary–proteins aggregates characterisation. A different evolution during ripening was found for both Cabernet Sauvignon and Carménère, and tannin–protein aggregates showed differences in size, shape and surface. The velvety sub-quality appears to be related to aggregates with low precipitation, and with specific surface characteristics as roundness and Feret diameter. Results from this work propose an effect of aggregates on sensory perception and opens the possibility to explore their effect on oral lubrication.