Porphyrins with metal, metalloid or phosphorus atoms directly bonded to the carbon periphery

Organometallic porphyrins with a metal, metalloid or phosphorus fragment directly attached to their carbon framework emerged for the first time in 1976, and these macrocycles have been intensively investigated in the past decade. The present review summarises for the first time all reported examples as well as applications of these systems.

Selective growth of carbon nanotubes on bare silicon : MWNT sinthesys on patterned substrates without predeposition of metal catalyst

Carbon nanotubes (CNTs) are expected to become the ideal constituent of many technologes, in particular for future generation electronics. This considerable interest is due to their unique electrical and mechanical properties. They show indeed super-high current-carrying capacity, ballistic electron transport and good field-emission properties. Then, these superior features make CNTs the most promising building blocks for electronic devices, as organic solar cells and organic light emitting devices (OLED). By using Focused Ion Beam (FIB) patterning it is possible to a obtain a high control on position, relative distances and diameter of CNTs. The present work shows how to grow three-dimensional architecture made of vertical-aligned CNTs directly on silicon. Thanks to the higher activity of a pre-patterned surface the synthesis process results very quick, cheap and simple. Such large area growths of CNTs could be used in preliminary test for application as electrodes for organic solar cells.

Carbon nanotube synthesis from germanium nanoparticles on patterned substrates

Controlled synthesis of carbon nanotubes (CNTs) is highly desirable for nanoelectronic applications. To date, metallic catalyst particles have been deemed unavoidable for the nucleation and growth of any kind of CNTs. Ordered arrays of nanotubes have been obtained by controlled deposition of the metallic catalyst particles. However, the presence of metal species mixed with the CNTs represents a shortcoming for most electronic applications, as metal particles are incompatible with silicon semiconductor technology. In the present paper we report on a metal-catalyst-free synthesis of CNTs, obtained through Ge nanoparticles on a Si(001) surface patterned by nanoindentation. By using acetylene as the carbon feed gas in a low-pressure Chemical Vapor Deposition (CVD) system, multi-walled carbon nanotubes (MWNT) have been observed to arise from the smallest Ge islands. The CNTs and the Ge three-dimensional structures have been analysed by SEM, EDX and AFM in order to assess their elemental features and properties. EDX and SEM results allow confirmation of the absence of any metallic contamination on the surface, indicating that the origin of the CNT growth is due to the Ge nanocrystals.

Improved algebraic cryptanalysis of QUAD, Bivium and Trivium via graph partitioning on equation systems

We present a novel approach for preprocessing systems of polynomial equations via graph partitioning. The variable-sharing graph of a system of polynomial equations is defined. If such graph is disconnected, then the corresponding system of equations can be split into smaller ones that can be solved individually. This can provide a tremendous speed-up in computing the solution to the system, but is unlikely to occur either randomly or in applications. However, by deleting certain vertices on the graph, the variable-sharing graph could be disconnected in a balanced fashion, and in turn the system of polynomial equations would be separated into smaller systems of near-equal sizes. In graph theory terms, this process is equivalent to finding balanced vertex partitions with minimum-weight vertex separators. The techniques of finding these vertex partitions are discussed, and experiments are performed to evaluate its practicality for general graphs and systems of polynomial equations. Applications of this approach in algebraic cryptanalysis on symmetric ciphers are presented: For the QUAD family of stream ciphers, we show how a malicious party can manufacture conforming systems that can be easily broken. For the stream ciphers Bivium and Trivium, we nachieve significant speedups in algebraic attacks against them, mainly in a partial key guess scenario. In each of these cases, the systems of polynomial equations involved are well-suited to our graph partitioning method. These results may open a new avenue for evaluating the security of symmetric ciphers against algebraic attacks.

Partitioning composite web services for decentralized execution using a genetic algorithm

Composite web services comprise several component web services. When a composite web service is executed centrally, a single web service engine is responsible for coordinating the execution of the components, which may create a bottleneck and degrade the overall throughput of the composite service when there are a large number of service requests. Potentially this problem can be handled by decentralizing execution of the composite web service, but this raises the issue of how to partition a composite service into groups of component services such that each group can be orchestrated by its own execution engine while ensuring acceptable overall throughput of the composite service. Here we present a novel penalty-based genetic algorithm to solve the composite web service partitioning problem. Empirical results show that our new algorithm outperforms existing heuristic-based solutions.