Regular population monotonic allocation schemes and the core

A subclass of games with population monotonic allocation schemes is studied, namelygames with regular population monotonic allocation schemes (rpmas). We focus on theproperties of these games and we prove the coincidence between the core and both theDavis-Maschler bargaining set and the Mas-Colell bargaining set

Regular wave propagation out of noise in chemical active media

A pacemaker, regularly emitting chemical waves, is created out of noise when an excitable photosensitive Belousov-Zhabotinsky medium, strictly unable to autonomously initiate autowaves, is forced with a spatiotemporal patterned random illumination. These experimental observations are also reproduced numerically by using a set of reaction-diffusion equations for an activator-inhibitor model, and further analytically interpreted in terms of genuine coupling effects arising from parametric fluctuations. Within the same framework we also address situations of noise-sustained propagation in subexcitable media.

Central configurations of nested rotated regular tetrahedra

In this paper we prove that there are only two different classes of central configura- tions with convenient masses located at the vertices of two nested regular tetrahedra: either when one of the tetrahedra is a homothecy of the other one, or when one of the tetrahedra is a homothecy followed by a rotation of Euler angles = = 0 and = of the other one. We also analyze the central configurations with convenient masses located at the vertices of three nested regular tetrahedra when one them is a homothecy of the other one, and the third one is a homothecy followed by a rotation of Euler angles = = 0 and = of the other two. In all these cases we have assumed that the masses on each tetrahedron are equal but masses on different tetrahedra could be different.

Central configurations of nested regular polyhedra for the spatial 2n–body problem

We consider 2n masses located at the vertices of two nested regular polyhedra with the same number of vertices. Assuming that the masses in each polyhedron are equal, we prove that for each ratio of the masses of the inner and the outer polyhedron there exists a unique ratio of the length of the edges of the inner and the outer polyhedron such that the configuration is central.

Central configurations of three nested regular polyhedra for the spatial 3n–body problem

Three regular polyhedra are called nested if they have the same number of vertices n, the same center and the positions of the vertices of the inner polyhedron ri, the ones of the medium polyhedron Ri and the ones of the outer polyhedron Ri satisfy the relation Ri = ri and Ri = Rri for some scale factors R > > 1 and for all i = 1, . . . , n. We consider 3n masses located at the vertices of three nested regular polyhedra. We assume that the masses of the inner polyhedron are equal to m1, the masses of the medium one are equal to m2, and the masses of the outer one are equal to m3. We prove that if the ratios of the masses m2/m1 and m3/m1 and the scale factors and R satisfy two convenient relations, then this configuration is central for the 3n–body problem. Moreover there is some numerical evidence that, first, fixed two values of the ratios m2/m1 and m3/m1, the 3n–body problem has a unique central configuration of this type; and second that the number of nested regular polyhedra with the same number of vertices forming a central configuration for convenient masses and sizes is arbitrary.

Efficiency of informational transfer in regular and complex networks

We analyze the process of informational exchange through complex networks by measuring network efficiencies. Aiming to study nonclustered systems, we propose a modification of this measure on the local level. We apply this method to an extension of the class of small worlds that includes declustered networks and show that they are locally quite efficient, although their clustering coefficient is practically zero. Unweighted systems with small-world and scale-free topologies are shown to be both globally and locally efficient. Our method is also applied to characterize weighted networks. In particular we examine the properties of underground transportation systems of Madrid and Barcelona and reinterpret the results obtained for the Boston subway network.

Via-configurable transistor array: a regular design technique to improve ICs yield

Process variations are a major bottleneck for digital CMOS integrated circuits manufacturability and yield. That iswhy regular techniques with different degrees of regularity are emerging as possible solutions. Our proposal is a new regular layout design technique called Via-Configurable Transistors Array (VCTA) that pushes to the limit circuit layout regularity for devices and interconnects in order to maximize regularity benefits. VCTA is predicted to perform worse than the Standard Cell approach designs for a certain technology node but it will allow the use of a future technology on an earlier time. Ourobjective is to optimize VCTA for it to be comparable to the Standard Cell design in an older technology. Simulations for the first unoptimized version of our VCTA of delay and energy consumption for a Full Adder circuit in the 90 nm technology node are presented and also the extrapolation for Carry-RippleAdders from 4 bits to 64 bits.

A note on the degree sequences of graphs with restrictions

Degree sequences of some types of graphs will be studied and characterizedin this paper.

Generating hard SAT/CSP instances using expander graphs

In this paper we provide a new method to generate hard k-SAT instances. We incrementally construct a high girth bipartite incidence graph of the k-SAT instance. Having high girth assures high expansion for the graph, and high expansion implies high resolution width. We have extended this approach to generate hard n-ary CSP instances and we have also adapted this idea to increase the expansion of the system of linear equations used to generate XORSAT instances, being able to produce harder satisfiable instances than former generators.

Controlling the spin of metal atoms adsorbed on oxide surfaces: Ni on regular and defective sites of the MgO(001) surface

We have analyzed the relative energy of nonmagnetic and magnetic low-lying electronic states of Ni atoms adsorbed on regular and defective sites of the MgO(001) surface. To this end cluster and periodic surface models are used within density functional theory. For Ni atoms adsorbed on oxygen vacancies at low coverage, the interaction energy between the metal and the support is much larger than on regular sites. Strong bonding results in a diamagnetic adsorbed species and the energy required to reach the high-spin state increases. Moreover, a correlation appears between the low-spin to high-spin energy difference and the interaction energy hypothesizing that it is possible to prepare the surface to tune the high-spin to low-spin energy difference. Magnetic properties of adsorbed thin films obtained upon increasing coverage are more difficult to interpret. This is because the metallic bond is readily formed and dominates over the effect of the atoms directly bound to the vacancy.

Anonymizing Graphs: Measuring Quality for Clustering

Peer-reviewed