Experimental and Theoretical Study on the One- and Two-Photon Absorption Properties of Novel Organic Molecules Based on Phenylacetylene and Azoaromatic Moieties

This Article reports a combined experimental and theoretical analysis on the one and two-photon absorption properties of a novel class of organic molecules with a pi-conjugated backbone based on phenylacetylene (JCM874, FD43, and FD48) and azoaromatic (YB3p2S) moieties. Linear optical properties show that the phenylacetylene-based compounds exhibit strong molar absorptivity in the UV and high fluorescence quantum yield with lifetimes of approximately 2.0 ns, while the azoaromatic-compound has a strong absorption in the visible region with very low fluorescence quantum yield. The two-photon absorption was investigated employing nonlinear optical techniques and quantum chemical calculations based on the response functions formalism within the density functional theory framework. The experimental data revealed well-defined 2PA spectra with reasonable cross-section values in the visible and IR. Along the nonlinear spectra we observed two 2PA allowed bands, as well as the resonance enhancement effect due to the presence of one intermediate one-photon allowed state. Quantum chemical calculations revealed that the 2PA allowed bands correspond to transitions to states that are also one-photon allowed, indicating the relaxation of the electric-dipole selection rules. Moreover, using the theoretical results, we were able to interpret the experimental trends of the 2PA spectra. Finally, using a few-energy-level diagram, within the sum-over-essential states approach, we observed strong qualitative and quantitative correlation between experimental and theoretical results.

Mapping virtual networks onto substrate networks

Network virtualization is a promising technique for building the Internet of the future since it enables the low cost introduction of new features into network elements. An open issue in such virtualization is how to effect an efficient mapping of virtual network elements onto those of the existing physical network, also called the substrate network. Mapping is an NP-hard problem and existing solutions ignore various real network characteristics in order to solve the problem in a reasonable time frame. This paper introduces new algorithms to solve this problem based on 0–1 integer linear programming, algorithms based on a whole new set of network parameters not taken into account by previous proposals. Approximative algorithms proposed here allow the mapping of virtual networks on large network substrates. Simulation experiments give evidence of the efficiency of the proposed algorithms.