A Genetic Search for Exploiting a Fuzzy Preference Model of Portfolio Problems with Public Projects

When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution.     

Isotopic production cross sections of residues in reactions induced by relativistic heavy ions with protons and deuterons

The isotopic production cross sections of heavy residues in relativistic heavy-ion collisions have been investigated in inverse kinematics. The primary reaction products were fully identified in mass and atomic number prior to beta decay using the fragment separator FRS. The huge collection of data obtained helps in the understanding of the two main reaction mechanisms involved: fragmentation and fission. These data provide basic information for future radioactive ion beam facilities and for technical applications like intense neutron sources by means of spallation targets.     

Monotone flows in N-dimensional partially saturated porous media: Lipschitz-continuity of the interface

Communicated by J. B. McLeod     

Studies on the metal-nuclotide (Co-5′IMP,Co-5′GMP) interaction via mössbauer emission spectroscopy and magnetic susceptibility measurements

By means of⁵⁷Co Mössbauer emission spectroscopy and magnetic susceptibility measurements, the local symmetries and electronic structure of the Co(II) ions in the Co-5IMO and Co-5GMP complexes in the hydrated and dehydrated forms have been determined.     

The Forwarding Indices of Random Graphs

A routing R of a graph G is a set of n(n ? 1) elementary paths R(u, v) specified for all ordered pairs (u, v) of vertices of G. The vertex-forwarding index ξ(G) of G, is defined by Where ξ(G, R) is the maximum number of paths of the routing R passing through any vertex of G and the minimum is taken over all the routings of G. Let G_p denote the random graph on n vertices with edge probability p and let m = np. It is proved among other things that, under natural growth conditions on the function p = p(n), the ratio Tends to 1 in probability as n tends to infinity.