Minority Games, Local Interactions, and Endogenous Networks

We study a local version of the Minority Game, where agents are placed on the nodes of a directed graph. Agents care about being in the minority of the group of agents they are currently linked to and employ myopic best-reply rules to choose their next-period state. We show that, in this benchmark case, the smaller the size of local networks, the larger long-run population-average payoffs. We then explore the collective behavior of the system when agents can: (i) assign weights to each link they hold and modify them over time in response to payoff signals; (ii) delete badly performing links (i.e., opponents) and replace them with randomly chosen ones. Simulations suggest that, when agents are allowed to weigh links but cannot delete/replace them, the system self-organizes into networked clusters that attain very high payoff values. These clustered configurations are not stable and can easily be disrupted, generating huge subsequent payoff drops. If, however, agents can (and are sufficiently willing to) discard badly performing connections, the system quickly converges to stable states where all agents get the highest payoff, independently of the size of the networks initially in place.JEL Classification:s C72, C73.     

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.     

Blends of biodegradable polyesters by reactive blending: preparation, characterisation and properties

Blends of poly--caproIactone (PCL) and poly--hydroxybutyrate (PHB) were prepared by mixing the two polymers in the presence of dicumylperoxide (DCPO) in solution of chlorobenzene. Similarly blends were obtained by mixing the two polymers with no peroxide added. The blends were prepared in a break of composition, from 85% wt PHB/15% wt PCL to 15% wt PHB/85% wt PCL, respectively. Also pure polymers were reacted with DCPO in the same way of the blends. Thermal (DSC), spectroscopic, mechanical (tensile tests) and morphological SEM)analyses were performed on the blends and on the pure polymers. Significant differences were found in the chemical-physical characteristics of the blends with and without peroxide.     

Active centers, catalytic behavior, symbiosis and redox properties of MoV(Nb,Ta)TeO ammoxidation catalysts

Selective as well as waste forming active centers were defined for MoVNbTeO and MoVTaTeO catalysts in the ammoxidation of propane to acrylonitrile and all catalytic functionalities were assigned to specific elements at the respective active centers. Symbiosis between M1 and M2 phases of these catalysts was observed, with phase cooperation being more extensive in the Nb than Ta containing compositions. The difference in catalytic effectiveness arises most likely because contact and surface area exposure of the two respective, cooperating phase pairs are not equal. The M1 phase of the catalysts is reducible by propane and ammonia in the absence of dioxygen and is regenerable to its original, fully oxidized state by dioxygen (air). No structural collapse is observed even after 120 C₃H₈ + NH₃ reduction pulses. The so induced reduction of the catalyst extends up to 70 layers deep. The product distribution over the first few pulses is very similar to that under catalytic conditions, supporting the concept that lattice oxygen is involved in the catalytic ammoxidation process. Therefore, the ammoxidation of paraffins is a redox process, as is of course the well-known olefin ammoxidation process.     

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.     

Age-dependent MRI-detected lesions at early stages of transient global ischemia in rat brain

Although ischemic stroke has higher incidence and severity in aged than in young humans, the age factor is generally neglected in ischemia animal models. This study was aimed at comparing age-dependent effects at early stages of transient global cerebral ischemia (TGCI) in rats. TGCI was induced in two groups of rats (3–6 and 20–24 months old, respectively) by exposure to 15% oxygen and 15 min occlusion of the two common carotid arteries. Brains were analysed in vivo by MRI–apparent diffusion coefficient (ADC) and T₂ maps–at 1–3 h post-TGCI and in vitro by histochemical examination of triphenyltetrazolium chloride (TTC)-stained slices. At 1–3 h post-TGCI, a higher incidence of lesions was found in aged than in young rats especially in the hippocampus and cortex (occipital plus parietal) but not in the thalamus. The lesioned regions showed lower ADC values in aged than in younger rats. The most substantial ADC decreases were associated with enhanced spin-spin relaxation and lower TTC staining. The different responses of the two age groups support the use of aged animals for investigations on different ischemia models. Our model of brain ischemia appears appropriate for further studies including drug effects.     

Application of multi-way models to the time-resolved fluorescence of polycyclic aromatic hydrocarbons mixtures in water

The time-resolved laser-induced fluorescence of a series of polycyclic aromatic compounds (PAHs) and mixtures of these latter in aqueous solution was measured by means of an apparatus equipped with optical fibers, which allows their real time in situ monitoring. The potential of such spectroscopic technique, yielding 4-way fluorescence data arrays, together with the application of multi-way models to the matricized data, was tested for the resolution of complex aqueous mixtures containing low concentrations of PAHs, as typical fluorescent pollutants in aquatic systems. PARAllel FACtors analysis was employed for the qualitative resolution of PAHs mixtures and for calculating the fluorescence lifetimes of single PAHs; n-way partial least squares analysis was applied for evaluating the concentration of the single PAHs in the aqueous mixtures.     

Integrated methodology for forensic oil spill identification

A new integrated methodology for forensic oil spill identification is presented. It consists of GC-MS analysis, chromatographic data processing, variable-outlier detection, multivariate data analysis, estimation of uncertainties, and statistical evaluation. The methodology was tested on four groups of diagnostic ratios composed of petroleum biomarkers and ratios within homologous PAH categories. Principal component analysis (PCA) was employed and enabled the simultaneous analysis of many diagnostic ratios. Weathering was taken into account by considering the sampling uncertainties estimated from replicate spill samples. Statistical evaluation ensured an objective matching of oil spill samples with suspected source oils as well as classification into positive match, probable match, and nonmatch. The data analysis is further refined if two or more source oils are classified as probable match by using weighted least squares fitting of the principal components, local PCA models, and additional information relevant to the spill case. The methodology correctly identified the source of two spill samples (i.e., crude oils from Oseberg East and Oseberg Field Centre) and distinguished them from closely related source oils.     

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.     

Variable-gradient generator for micro- and nano-HPLC

A new, simple device generates accurate nano- and microflow rate gradients from any conventional HPLC system. The core of the new device is represented by an electric-actuated, computer-controlled, multiposition HPLC valve. The valve hosts six reservoirs for as many different mobile-phase compositions of increasing strength. A low flow rate stream pushes the weakest solvent through the column as long as required and at the desired flow rate, until the chromatographic run is started. From this time on, the electric actuation allows one to select which reservoir will be on-line with the column and for how long, thus generating a specific solvent gradient, through a sequence of controlled segments of precise mobile-phase composition. This permits one not only to exactly reproduce the programmed slope but also to achieve different gradient shapes (i.e., linear, convex, concave) for different separation needs. The new device has proven to be reliable and reproducible even at the lowest flow rate tested (250 nL x min(-1)) and in different chromatographic conditions.