Columnar Fe2O3 arrays via plasma-enhanced growth: Interplay of fluorine substitution and photoelectrochemical properties

A single-step plasma enhanced-chemical vapor deposition (PE-CVD) route for the synthesis of F-doped iron(III) oxide nanomaterials is presented. Growth experiments, performed from a fluorinated Fe(II) β-diketonate precursor on Indium Tin Oxide (ITO) between 200 and 400 °C, yielded columnar β-Fe₂O₃ arrays with a preferential (100) growth direction. The fluorine content in the deposits could be adjusted by the sole variation of the deposition temperature controlling, in turn, the optical absorption and energy bandgap. Photocurrent measurements and Mott–Schottky analyses, carried out in Na₂SO₄ solution under one sun illumination, evidenced a conductivity switch from n- to p-type upon increasing fluorine amount in the obtained nanomaterials. The sample photocurrent density, donor content and flatband potential support the hypothesis that a progressive substitution of oxygen by fluorine in the iron(III) oxide lattice can alter electronic structure and extend charge carrier lifetimes, making anion-doped β-Fe₂O₃ an efficient water oxidation catalyst.     

Modern strategies for protein quantification in proteome analysis: advantages and limitations

Over the last 3 years, a number of mass spectrometry-based methods for the simultaneous identification and quantification of individual proteins within complex mixtures have been reported. Most, if not all, of such strategies apply a two-step approach: the first for the separation of proteins or peptides, and the second uses mass spectrometry to identify and quantify the individual components. To simplify the outcome of both steps, certain chemicals and heavy-isotope-labeling are commonly used in the early stages of sample preparation (except in differential fluorescence labeling protocols). The ultimate goal of these strategies is to be able to identify every protein expressed in a cell or tissue, and to determine each protein's abundance, state of modification, and possible involvement in multi-protein complexes. In this review, an attempt is made to highlight the salient characteristics of the existing strategies with particular attention to their strengths and weaknesses.     

Inverse Design of Mechanical Metamaterials That Undergo Buckling

Metamaterials are man‐made materials which get their properties from their structure rather than their chemical composition. Their mesostructure is specifically designed to create functionalities not found in nature. However, despite the broad variety of metamaterials developed in recent years, a straightforward procedure to design these complex materials with tailored properties has not yet been established. Here, the inverse design problem is tackled by introducing a general optimization tool to explore the range of material properties that can be achieved. Specifically, a stochastic optimization algorithm is applied and its applicability to disjoint problems is demonstrated, with a focus on tuning the buckling properties of mechanical metamaterials, including experimental verification of the predictions. Besides this problem, this algorithm can be applied to a large variety of systems that, because of their complexity, would be challenging otherwise. Potential applications range from the design of optomechanical resonators, acoustic band gap materials, to dielectric metasurfaces.     

Efficient inclusion for a class of XML types with interleaving and counting

Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleaving and counting can be decided in polynomial time in the presence of two important restrictions: no element appears twice in the same content model, and Kleene star is only applied to disjunctions of single elements.     

On measuring the accuracy of SLAM algorithms

In this paper, we address the problem of creating an objective benchmark for evaluating SLAM approaches. We propose a framework for analyzing the results of a SLAM approach based on a metric for measuring the error of the corrected trajectory. This metric uses only relative relations between poses and does not rely on a global reference frame. This overcomes serious shortcomings of approaches using a global reference frame to compute the error. Our method furthermore allows us to compare SLAM approaches that use different estimation techniques or different sensor modalities since all computations are made based on the corrected trajectory of the robot. We provide sets of relative relations needed to compute our metric for an extensive set of datasets frequently used in the robotics community. The relations have been obtained by manually matching laser-range observations to avoid the errors caused by matching algorithms. Our benchmark framework allows the user to easily analyze and objectively compare different SLAM approaches.     

A graph-based approach for extracting terminological properties from information sources with heterogeneous formats

The problem of handling both the integration and the cooperation of a large number of information sources characterised by heterogeneous representation formats is a challenging issue. In this context, a central role can be played by the knowledge about the semantic relationships holding between concepts belonging to different information sources (intersource properties). In this paper, we propose a semiautomatic approach for extracting two kinds of intersource properties, namely synonymies and homonymies, from heterogeneous information sources. In order to carry out the extraction task, we introduce both a conceptual model, for representing involved sources, and a metrics, for measuring the strength of the semantic relationships holding among concepts represented within the same source.     

On the design of efficient ATM routing schemes

In this paper we deal with the problem of designing virtual path layouts in ATM networks when the hop-count is given and the load has to be minimized. We first prove a lower bound for networks with arbitrary topology and arbitrary set of connection requests. This result is then applied to derive lower bounds for the following settings: (i) one-to-all (one node has to be connected to all other nodes of the network) in arbitrary networks; (ii) all-to-all (each node has to be connected to all other nodes in the network) in several classes of networks, including planar and k-separable networks and networks of bounded genus. We finally study the all-to-all setting on two-dimensional meshes and we design a virtual path layout for this problem. When the hop-count and the network degree are bounded by constants, our results show that the upper bounds proposed in this paper for the one-to-all problem in arbitrary networks and for the all-to-all problem in two-dimensional mesh networks are asymptotically optimal. Moreover, the general lower bound shows that the algorithm proposed in Gerstel (Ph.D. Thesis, Technion-Haifa, Israel, 1995) for the all-to-all problem in k-separable networks is also asymptotically optimal. The upper bound for mesh networks also shows that the lower bound presented in this paper for the all-to-all problem in planar networks is asymptotically tight.     

Effects of different doses of apomorphine on the glutamate decarboxylase activity of the substantia nigra and the medial basal hypothalamus

The activity of gamma-aminobutyric acid (GABA) synthesizing enzyme glutamic acid decarboxylase (GAD, EC 4.1.1.15) was assayed in the rat substantia nigra (SN) and medial basal hypothalamus (MBH) following systemic injection of different doses of the dopamine receptor agonist apomorphine. In SN, the highest dose of apomorphine (1000 micrograms/kg) causes an increase of the GAD activity whilst an opposite effect is observed with the lowest dose (35 micrograms/kg). Results obtained in SN are in accordance with previous neurochemical and behavioural data suggesting an opposite action of high (500 micrograms/kg) and low doses (100 micrograms/kg) of apomorphine in nigro-striatal system, probably due to the existence of two classes of dopamine receptors, i.e. classical postsynaptic dopamine receptors and presynaptic inhibitory dopamine autoreceptors. In MBH, the evidence for similar effects of low and high doses of apomorphine (the decrease of GAD activity) may suggest that, as already reported, at this level only one class of dopamine receptors is present.     

Constraint-Based Verification of Parameterized Cache Coherence Protocols

We propose a new method for the parameterized verification of formal specifications of cache coherence protocols. The goal of parameterized verification is to establish system properties for an arbitrary number of caches. In order to achieve this purpose we define abstractions that allow us to reduce the original parameterized verification problem to a control state reachability problem for a system with integer data variables. Specifically, the methodology we propose consists of the following steps. We first define an abstraction in which we only keep track of the number of caches in a given state during the execution of a protocol. Then, we use linear arithmetic constraints to symbolically represent infinite sets of global states of the resulting abstract protocol. For reasons of efficiency, we relax the constraint operations by interpreting constraints over real numbers. Finally, we check parameterized safety properties of abstract protocols using symbolic backward reachability, a strategy that allows us to obtain sufficient conditions for termination for an interesting class of protocols. The latter problem can be solved by using the infinite-state model checker HyTech: Henzinger, Ho, and Wong-Toi, A model checker for hybrid systems, Proc. of the 9th International Conference on Computer Aided Verification (CAV'97), Lecture Notes in Computer Science, Springer, Haifa, Israel, 1997, Vol. 1254, pp. 460–463. HyTech handles linear arithmetic constraints using the polyhedra library of Halbwachs and Proy, Verification of real-time systems using linear relation analysis, Formal Methods in System Design, Vol. 11, No. 2, pp. 157–185, 1997. By using this methodology, we have automatically validated parameterized versions of widely implemented write-invalidate and write-update cache coherence protocols like Synapse, MESI, MOESI, Berkeley, Illinois, Firefly and Dragon (Handy, The Cache Memory Book, Academic Press, 1993). With this application, we have shown that symbolic model checking tools like HyTech, originally designed for the verification of hybrid systems, can be applied successfully to new classes of infinite-state systems of practical interest.     

A Technique for Extracting Sub-source Similarities from Information Sources Having Different Formats

In this paper we propose a semi-automatic technique for deriving the similarity degree between two portions of heterogeneous information sources (hereafter, sub-sources). The proposed technique consists in two phases: the first one selects the most promising pairs of sub-sources, whereas the second one computes the similarity degree relative to each promising pair. We show that the detection of sub-source similarities is a special case (and a very interesting one, for semi-structured information sources) of the more general problem of Scheme Match. In addition, we present a real example case to clarify the proposed technique, a set of experiments we have conducted to verify the quality of its results, a discussion about its computational complexity and its classification in the context of related literature. Finally, we discuss some possible applications which can benefit by derived similarities.