Regular population monotonic allocation schemes

The paper introduces a refinement of the notion of population monotonic allocation scheme, called regular population monotonic allocation scheme (regularpmas). This refinement is based on economic situations in which players may have to select new partners from a set of potential players and in which there exist certain capacity constraints. A sufficient condition for the existence of a regularpmas is given. For the class of games with regularpmas, we prove that the core coincides with the Davis and Maschler and the Mas-Colell bargaining sets.     

On the Convenience to Form Coalitions or Partnerships in Simple Games

A partnership in a cooperative game is a coalition that possesses an internal structure and, simultaneously, behaves as an individual member. Forming partnerships leads to a modification of the original game which differs from the quotient game that arises when one or more coalitions are actually formed. In this paper, the Shapley value is used to discuss the convenience to form either coalitions or partnerships. To this end, the difference between the additive Shapley value of the partnership in the partnership game and the Shapley alliance value of the coalition, and also between the corresponding value of the internal and external players, are analysed. Simple games are especially considered. Research partially supported by Grant BFM 2003-01314 of the Science and Technology Spanish Ministry and the European Regional Development Fund.     

Monitoring the packet gap of real-time packet traffic

Real-time packet traffic is characterized by a strict deadline on the end-to-end time delay and an upper bound on the information loss. Due to the high correlation among consecutive packets, the individual packet loss does not well characterize the performance of real-time packet sessions. An additional measure of packet loss is necessary to adequately assess the quality of each real-time connection. The additional measure considered here is the average number of consecutively lost packets, also called the average packet gap. We derive a closed form for the average packet gap for the multiclassG/G/m/B queueing system in equilibrium and show that it only depends on the loss behavior of two consecutive packets. This result considerably simplifies the monitoring process of real-time packet traffic sessions. If the packet loss process is markovian, the consecutive packet loss has a geometric distribution.     

Exact Max-SAT solvers for over-constrained problems

We present a new generic problem solving approach for over-constrained problems based on Max-SAT. We first define a Boolean clausal form formalism, called soft CNF formulas, that deals with blocks of clauses instead of individual clauses, and that allows one to declare each block either as hard (i.e., must be satisfied by any solution) or soft (i.e., can be violated by some solution). We then present two Max-SAT solvers that find a truth assignment that satisfies all the hard blocks of clauses and the maximum number of soft blocks of clauses. Our solvers are branch and bound algorithms equipped with original lazy data structures, powerful inference techniques, good quality lower bounds, and original variable selection heuristics. Finally, we report an experimental investigation on a representative sample of instances (random 2-SAT, Max-CSP, graph coloring, pigeon hole and quasigroup completion) which provides experimental evidence that our approach is very competitive compared with the state-of-the-art approaches developed in the CSP and SAT communities. Research partially supported by projects TIN2004-07933-C03-03 and TIC2003-00950 funded by the Ministerio de Educación y Ciencia. The second author is supported by a grant Ramón y Cajal.     

Automorphisms and blocking in simple games

Different (proper as well as improper) simple games may share any nonseparating blocking family. An interesting question is whether all such proper games on one hand, and all improper ones on the other, are isomorphic. The answer is given here and the automorphisms of the blocking family help us to understand the structure and links of all such games.     

Extending the power line LAN up to the neighborhood transformer

This article reports on the performance of audio, video, multimedia, and other high-data-rate in-home networking applications. The article starts by describing the problems encountered in power line communication channels in terms of frequency response and noise characteristics, and explains how in-home power line LANs can be extended to the neighborhood transformer. OFDM physical layers providing speeds of 45 Mb/s and 200 Mb/s as well as QoS and security are introduced. Finally, the results of large tests involving several thousands of nodes are described.     

A high-frequency nonquasi-static analytical model including gate leakage effects for on-chip decoupling capacitors

This paper presents a compact model for on-chip decoupling capacitors (decaps) including gate-oxide leakage. The model makes use of only four parameters, namely, channel resistance, gate-oxide capacitance, and two parameters to quantify gate-oxide leakage, to predict the static and dynamic response of decaps. Quality indices have been defined to enable development of decap design guidelines and evaluation of performance of such capacitors. The model shows how the gate leakage and longer channel lengths severely affect the performance of on-chip decaps for both low and high frequencies. The model also shows that lumped models of decaps at high frequencies fail and have to be substituted by a distributed model. Application of the model uncovers tradeoffs for thin- and thick-oxide capacitors in an available 90-nm CMOS technology. For a general-purpose technology, a reference capacitance value has been realized using decaps with a discrete width and length. Our model predicts that thick-oxide n-channel (p-channel) capacitors require /spl sim/3.37x (/spl sim/3.31x) more silicon area and /spl sim/1.70x (/spl sim/1.17x) degraded time response as compared to their thin-oxide versions. The time response is even more degraded (/spl prop/L/sup 2/) when longer channel decaps are used. This paper contributes by defining performance benchmarks for decaps.     

N,N‐dimethylaminopyridine as initiator in the copolymerization of diglycidylether of bisphenol A with six‐membered cyclic carbonates

N,N‐Dimethylaminopyridine (DMAP) was used as initiator to cure mixtures of diglycidylether of bisphenol A (DGEBA) and 1,3‐dioxan‐2‐one (TMC) or 5,5‐dimethyl‐1,3‐dioxan‐2‐one (DMTMC). The curing was studied by differential scanning calorimetry (DSC) and Fourier transform infrared in the attenuated‐total‐reflection mode (FTIR/ATR). FTIR/ATR was used to monitor the competitive reactive processes and to quantify the evolution of the groups involved in the curing. We observed the formation of five‐membered cyclic carbonates and anionic carbonate groups that remain unreacted at the chain ends. The formation of these groups was explained by the attack of the anionic propagation species on the methylene carbon of the carbonate group, which leads to an alkyl‐oxygen rupture. By performing the cure in the thermobalance we could evaluate the loss of CO₂ produced in the samples containing carbonates. The kinetics were studied by DSC and analyzed with isoconversional procedures. The addition of carbonates slows down the curing rate. Thermogravimetric analysis (TGA) and dynamic mechanical thermal analysis (DMTA) experiments were used to evaluate the properties of the materials obtained. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 2873–2882, 2006