Nanostructured Materials for Room‐Temperature Gas Sensors

Sensor technology has an important effect on many aspects in our society, and has gained much progress, propelled by the development of nanoscience and nanotechnology. Current research efforts are directed toward developing high‐performance gas sensors with low operating temperature at low fabrication costs. A gas sensor working at room temperature is very appealing as it provides very low power consumption and does not require a heater for high‐temperature operation, and hence simplifies the fabrication of sensor devices and reduces the operating cost. Nanostructured materials are at the core of the development of any room‐temperature sensing platform. The most important advances with regard to fundamental research, sensing mechanisms, and application of nanostructured materials for room‐temperature conductometric sensor devices are reviewed here. Particular emphasis is given to the relation between the nanostructure and sensor properties in an attempt to address structure–property correlations. Finally, some future research perspectives and new challenges that the field of room‐temperature sensors will have to address are also discussed.     

High-performance wobbling subreflector for the Millimetre and Infrared Testa Grigia Observatory 2.6-m telescope

The Millimetre and Infrared Testa Grigia Observatory 2.6-m Cassegrain telescope has been designed to allow high-sensitivity observations in the millimeter spectral range. For this purpose, in order to reduce unwanted contributions from local foregrounds, we adopted a sky-chopping technique, by wobbling the telescope subreflector. We describe the design and performance of the wobbling system, which can endure external forced two and three fields square-wave modulation and includes features such as high frequency, high amplitude, high duty cycle, low microphonics, and high stability.     

Situating digital storytelling within African communities

We reflect on the methods, activities and perspectives we used to situate digital storytelling in two rural African communities in South Africa and Kenya. We demonstrate how in-depth ethnography in a village in the Eastern Cape of South Africa and a design workshop involving participants from that village allowed us to design a prototype mobile digital storytelling system suited to the needs of rural, oral users. By leveraging our prototype as a probe and observing villagers using it in two villages in South Africa and Kenya, we uncovered implications for situating digital storytelling within those communities. Finally, we distil observations relevant to localizing storytelling and their implications for transferring design into a different community.     

From Flow Logic to static type systems for coordination languages

Coordination languages are often used to describe open-ended systems. This makes it challenging to develop tools for guaranteeing the security of the coordinated systems and the correctness of their interaction. Successful approaches to this problem have been based on type systems with dynamic checks; therefore, the correctness properties cannot be statically enforced. By contrast, static analysis approaches based on Flow Logic usually guarantee properties statically. In this paper, we show how the insights from the Flow Logic approach can be used to construct a type system for statically ensuring secure access to tuple spaces and safe process migration for an extension of the language Klaim.     

Complexity issues in color-preserving graph embeddings

In the context of comparative analysis of protein–protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex (pattern graph) in the protein–protein interaction graph (target graph) of another species with respect to (w.r.t.) orthologous proteins. We give an efficient exponential-time randomized algorithm in case the occurrence of the pattern graph in the target graph is required to be exact. For approximate occurrences, we prove a tight inapproximability result and give four approximation algorithms that deal with bounded degree graphs, small ortholog numbers, linear forests and very simple yet hard instances, respectively.     

Exploration strategies based on multi-criteria decision making for searching environments in rescue operations

Some applications require autonomous robots to search an initially unknown environment for static targets, without any a priori information about environment structure and target locations. Targets can be human victims in search and rescue or materials in foraging. In these scenarios, the environment is incrementally discovered by the robots exploiting exploration strategies to move around in an autonomous and effective way. Most of the strategies proposed in literature are based on the idea of evaluating a number of candidate locations on the frontier between the known and the unknown portions of the environment according to ad hoc utility functions that combine different criteria. In this paper, we show some of the advantages of using a more theoretically-grounded approach, based on Multi-Criteria Decision Making (MCDM), to define exploration strategies for robots employed in search and rescue applications. We implemented some MCDM-based exploration strategies within an existing robot controller and we evaluated their performance in a simulated environment.     

Low-complexity FFT/IFFT IP hardware macrocells for OFDM and MIMO–OFDM CMOS transceivers

The paper presents an automated environment for fast design space exploration and automatic generation of FFT/IFFT macrocells with minimum circuit and memory complexity within the numerical accuracy budget of the target application. The effectiveness of the tool is demonstrated through FPGA and CMOS implementations (90 nm, 65 nm and 45 nm technologies) of the baseband processing in embedded OFDM transceivers. Compared with state-of-art FFT/IFFT IP cores, the proposed work provides macrocells with lower circuit complexity while keeping the same system performance (throughput, transform size and accuracy) and is the first addressing the requirements of all OFDM standards including MIMO systems: 802.11 WLAN, 802.16 WMAN, Digital Audio and Video Broadcasting in terrestrial, handheld and hybrid satellite-scenarios, Ultra Wide Band, Broadband on Power Lines, xDSL.     

The Internet’s impact on sexuality: A critical review of 15 years of research

The body of empirical research on Internet sexuality has grown steadily since 1993. The following paper provides an overview of the current state of research in this field in its full thematic breadth, addressing six areas of online sexuality: Pornography, sex shops, sex work, sex education, sex contacts, and sexual subcultures. Key research results are presented concerning Internet sexuality’s forms of manifestation, participant groups, opportunities, and risks. This paper shows that sexually related online activities have become routine in recent years for large segments of the population in the Western world. Internet sexuality also takes somewhat different forms based on the age, gender, and sexual orientation of the individual. Academic studies to date have focused overwhelmingly on the possible negative effects of Internet sexuality. By contrast, little research has been conducted on potential benefits. Consequently, a surprising number of gaps are evident in the scholarship on Internet sexuality.     

On the relation among answer set solvers

In this paper, we study the relation among Answer Set Programming (ASP) systems from a computational point of view. We consider smodels, dlv, and cmodels ASP systems based on stable model semantics, the first two being native ASP systems and the last being a SAT-based system. We first show that smodels, dlv, and cmodels explore search trees with the same branching nodes (assuming, of course, a same branching heuristic) on the class of tight logic programs. Leveraging on the fact that SAT-based systems rely on the deeply studied Davis–Logemann–Loveland (dll) algorithm, we derive new complexity results for the ASP procedures. We also show that on nontight programs the SAT-based systems are computationally different from native procedures, and the latter have computational advantages. Moreover, we show that native procedures can guarantee the “correctness” of a reported solution when reaching the leaves of the search trees (i.e., no stability check is needed), while this is not the case for SAT-based procedures on nontight programs. A similar advantage holds for dlv in comparison with smodels if the “well-founded” operator is disabled and only Fitting’s operator is used for negative inferences. We finally study the “cost” of achieving such advantages and comment on to what extent the results presented extend to other systems.