When ESDP confronts ENP: security sector reform as a bridge in the EU’s foreign policy

The European Neighbourhood Policy’s birth has taken place in parallel with the renewed momentum of the European Security and Defence Policy, which has launched 14 operations since 2003. Both policies’ instruments have converged in the neighbouring area covered by ENP: Georgia, in the East and the Palestinian Territories in the South. In both cases, the Security Sector Reform strategies have been the main focus for ESDP and an important objective for ENP. In this paper, two objectives are pursued: first, to assess the EU’s involvement in both cases in SSR terms; and second, to analyse whether the convergence of ESDP operations with a broader EU neighbourhood policy implies that the former has become an instrument for the a EU external action.

Grothendieck topologies from unique factorisation systems

This article presents a way to associate a Grothendieck site structure to a category endowed with a unique factorisation system of its arrows. In particular this recovers the Zariski and Etale topologies and others related to Voevodsky's cd-structures. As unique factorisation systems are also frequent outside algebraic geometry, the same construction applies to some new contexts, where it is related with known structures dened otherwise. The paper details algebraic geometrical situations and sketches only the other contexts.

Estimation of electronic coupling in π -stacked donor-bridge-acceptor systems: correction of the two-state model

Comparison of donor-acceptor electronic couplings calculated within two-state and three-state models suggests that the two-state treatment can provide unreliable estimates of Vda because of neglecting the multistate effects. We show that in most cases accurate values of the electronic coupling in a π stack, where donor and acceptor are separated by a bridging unit, can be obtained as Ṽ da = (E2 - E1) μ12 Rda + (2 E3 - E1 - E2) 2 μ13 μ23 Rda2, where E1, E2, and E3 are adiabatic energies of the ground, charge-transfer, and bridge states, respectively, μij is the transition dipole moments between the states i and j, and Rda is the distance between the planes of donor and acceptor. In this expression based on the generalized Mulliken-Hush approach, the first term corresponds to the coupling derived within a two-state model, whereas the second term is the superexchange correction accounting for the bridge effect. The formula is extended to bridges consisting of several subunits. The influence of the donor-acceptor energy mismatch on the excess charge distribution, adiabatic dipole and transition moments, and electronic couplings is examined. A diagnostic is developed to determine whether the two-state approach can be applied. Based on numerical results, we showed that the superexchange correction considerably improves estimates of the donor-acceptor coupling derived within a two-state approach. In most cases when the two-state scheme fails, the formula gives reliable results which are in good agreement (within 5%) with the data of the three-state generalized Mulliken-Hush model

Topologies for poin distributions

The concepts of void and cluster for an arbitrary point distribution in a domain D are defined and characterized by some parameters such as volume, density, number of points belonging to them, shape, etc. After assigning a weight to each void and clusterwhich is a function of its characteristicsthe concept of distance between two point configurations S1 and S2 in D is introduced, both with and without the help of a lattice in the domain D. This defines a topology for the point distributions in D, which is different for the different characterizations of the voids and clusters.

Optimal network topologies for local search with congestion

The problem of searchability in decentralized complex networks is of great importance in computer science, economy, and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and we obtain expressions for the average search cost both in the presence and the absence of congestion. This formalism is used to obtain optimal network structures for a system using a local search algorithm. It is found that only two classes of networks can be optimal: starlike configurations, when the number of parallel searches is small, and homogeneous-isotropic configurations, when it is large.