Dynamic compact thermal models with multiple power sources: application to an ultrathin chip stacking technology

Whereas numerical modeling using finite-element methods (FEM) can provide transient temperature distribution in the component with enough accuracy, it is of the most importance the development of compact dynamic thermal models that can be used for electrothermal simulation. While in most cases single power sources are considered, here we focus on the simultaneous presence of multiple sources. The thermal model will be in the form of a thermal impedance matrix containing the thermal impedance transfer functions between two arbitrary ports. Eachindividual transfer function element ( ) is obtained from the analysis of the thermal temperature transient at node ¿ ¿ after a power step at node ¿ .¿ Different options for multiexponential transient analysis are detailed and compared. Among the options explored, small thermal models can be obtained by constrained nonlinear least squares (NLSQ) methods if the order is selected properly using validation signals. The methods are applied to the extraction of dynamic compact thermal models for a new ultrathin chip stack technology (UTCS).

Generalization of Vélu’s formulae for isogenies between elliptic curves

Given an elliptic curve E and a finite subgroup G, V ́lu’s formulae concern to a separable isogeny IG : E → E ′ with kernel G. In particular, for a point P ∈ E these formulae express the first elementary symmetric polynomial on the abscissas of the points in the set P + G as the difference between the abscissa of IG (P ) and the first elementary symmetric polynomial on the abscissas of the nontrivial points of the kernel G. On the other hand, they express Weierstraß coefficients of E ′ as polynomials in the coefficients of E and two additional parameters: w0 = t and w1 = w. We generalize this by defining parameters wn for all n ≥ 0 and giving analogous formulae for all the elementary symmetric polynomials and the power sums on the abscissas of the points in P +G. Simultaneously, we obtain an efficient way of performing computations concerning the isogeny when G is a rational group.

Price level convergence, purchasing power parity and multiple structural breaks: an application to US cities

This article provides a fresh methodological and empirical approach for assessing price level convergence and its relation to purchasing power parity (PPP) using annual price data for seventeen US cities. We suggest a new procedure that can handle a wide range of PPP concepts in the presence of multiple structural breaks using all possible pairs of real exchange rates. To deal with cross-sectional dependence, we use both cross-sectional demeaned data and a parametric bootstrap approach. In general, we find more evidence for stationarity when the parity restriction is not imposed, while imposing parity restriction provides leads toward the rejection of the panel stationar- ity. Our results can be embedded on the view of the Balassa-Samuelson approach, but where the slope of the time trend is allowed to change in the long-run. The median half-life point estimate are found to be lower than the consensus view regardless of the parity restriction.

Kinetics of martensitic transitions in Cu-Al-Mn under thermal cycling: Analysis at multiple length scales

In this paper we study the evolution of the kinetic features of the martensitic transition in a Cu-Al-Mn single crystal under thermal cycling. The use of several experimental techniques including optical microscopy, calorimetry, and acoustic emission, has enabled us to perform an analysis at multiple scales. In particular, we have focused on the analysis of avalanche events (associated with the nucleation and growth of martensitic domains), which occur during the transition. There are significant differences between the kinetics at large and small length scales. On the one hand, at small length scales, small avalanche events tend to sum to give new larger events in subsequent loops. On the other hand, at large length scales the large domains tend to split into smaller ones on thermal cycling. We suggest that such different behavior is the necessary ingredient that leads the system to the final critical state corresponding to a power-law distribution of avalanches.

An efficient algorithm to perform multiple testing in epistasis screening

Background: Research in epistasis or gene-gene interaction detection for human complex traits has grown over the last few years. It has been marked by promising methodological developments, improved translation efforts of statistical epistasis to biological epistasis and attempts to integrate different omics information sources into the epistasis screening to enhance power. The quest for gene-gene interactions poses severe multiple-testing problems. In this context, the maxT algorithm is one technique to control the false-positive rate. However, the memory needed by this algorithm rises linearly with the amount of hypothesis tests. Gene-gene interaction studies will require a memory proportional to the squared number of SNPs. A genome-wide epistasis search would therefore require terabytes of memory. Hence, cache problems are likely to occur, increasing the computation time. In this work we present a new version of maxT, requiring an amount of memory independent from the number of genetic effects to be investigated. This algorithm was implemented in C++ in our epistasis screening software MBMDR-3.0.3. We evaluate the new implementation in terms of memory efficiency and speed using simulated data. The software is illustrated on real-life data for Crohn’s disease. Results: In the case of a binary (affected/unaffected) trait, the parallel workflow of MBMDR-3.0.3 analyzes all gene-gene interactions with a dataset of 100,000 SNPs typed on 1000 individuals within 4 days and 9 hours, using 999 permutations of the trait to assess statistical significance, on a cluster composed of 10 blades, containing each four Quad-Core AMD Opteron(tm) Processor 2352 2.1 GHz. In the case of a continuous trait, a similar run takes 9 days. Our program found 14 SNP-SNP interactions with a multiple-testing corrected p-value of less than 0.05 on real-life Crohn’s disease (CD) data. Conclusions: Our software is the first implementation of the MB-MDR methodology able to solve large-scale SNP-SNP interactions problems within a few days, without using much memory, while adequately controlling the type I error rates. A new implementation to reach genome-wide epistasis screening is under construction. In the context of Crohn’s disease, MBMDR-3.0.3 could identify epistasis involving regions that are well known in the field and could be explained from a biological point of view. This demonstrates the power of our software to find relevant phenotype-genotype higher-order associations.

Robust power allocation algorithms for MIMO OFDM systems with imperfect CSI

This paper presents a Bayesian approach to the design of transmit prefiltering matrices in closed-loop schemes robust to channel estimation errors. The algorithms are derived for a multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) system. Two different optimizationcriteria are analyzed: the minimization of the mean square error and the minimization of the bit error rate. In both cases, the transmitter design is based on the singular value decomposition (SVD) of the conditional mean of the channel response, given the channel estimate. The performance of the proposed algorithms is analyzed,and their relationship with existing algorithms is indicated. As withother previously proposed solutions, the minimum bit error rate algorithmconverges to the open-loop transmission scheme for very poor CSI estimates.

Countervailing power? Collusion in markets with decentralized trade

We consider the collective incentives of buyers and sellers to form cartels in markets where trade is realized through decentralized pairwise bargaining. Cartels are coalitions of buyers or sellers that limit market participation and compensate inactive members for abstaining from trade. In a stable market outcome, cartels set Nash equilibrium quantities and cartel memberships are immune to defections. We prove that the set of stable market outcomes is non-empty and we provide its full characterization. Stable market outcomes are of two types: (i) at least one cartel actively restrains trade and the levels of market participation are balanced, or (ii) only one cartel, eventually the cartel that forms on the long side of the market, is active and it reduces trade slightly below the opponent's.

I want you! An experiment studying the selection effect when assigning distributive power.

We study whether selection affects motivation. In our experiment subjects first answer a personality questionnaire. They then play a 3-person game. One of the three players decides between an outside option assigning him a positive amount, but leaving the two others empty-handed and allowing one of the other two players to distribute a pie. Treatments differ in the procedure by which distributive power is assigned: to a randomly determined or to a knowingly selected partner. Before making her decision the selecting player could consult the personality questionnaire of the other two players. Results show that knowingly selected players keep less for themselves than randomly selected ones and reward the selecting player more generously.

Inverse Problems for multiple invariant curves

Planar polynomial vector fields which admit invariant algebraic curves, Darboux integrating factors or Darboux first integrals are of special interest. In the present paper we solve the inverse problem for invariant algebraic curves with a given multiplicity and for integrating factors, under generic assumptions regarding the (multiple) invariant algebraic curves involved. In particular we prove, in this generic scenario, that the existence of a Darboux integrating factor implies Darboux integrability. Furthermore we construct examples where the genericity assumption does not hold and indicate that the situation is different for these.

Demand elasticity and market power in the spanish electricity market

In this paper we check whether generator's bid behavior at the Spanish whosale electricity market is consistent with the hypothesis of profit maximization on their residual demands. Using OMEL data, we find the arc-elacticity of the residual demand around the system marginal price. The results suggest thet the larger firms are not actually profit-msximization. We argue how the regulatory environment may drive these results. Finally, we repeat the analysis for the first session of the intra-day market where presumably firms may not have the same incentives as in the day-ahead market.

Two algorithms to find a power integral basis

"Vegeu el resum a l'inici del fitxer adjunt."

Encryption methods using formal power series rings

Recently there has been a great deal of work on noncommutative algebraic cryptography. This involves the use of noncommutative algebraic objects as the platforms for encryption systems. Most of this work, such as the Anshel-Anshel-Goldfeld scheme, the Ko-Lee scheme and the Baumslag-Fine-Xu Modular group scheme use nonabelian groups as the basic algebraic object. Some of these encryption methods have been successful and some have been broken. It has been suggested that at this point further pure group theoretic research, with an eye towards cryptographic applications, is necessary.In the present study we attempt to extend the class of noncommutative algebraic objects to be used in cryptography. In particular we explore several different methods to use a formal power series ring R && x1; :::; xn && in noncommuting variables x1; :::; xn as a base to develop cryptosystems. Although R can be any ring we have in mind formal power series rings over the rationals Q. We use in particular a result of Magnus that a finitely generated free group F has a faithful representation in a quotient of the formal power series ring in noncommuting variables.

Aplicaciones Single Program Multiple Data (SPMD) en ambientes distribuidos

Un reto al ejecutar las aplicaciones en un cluster es lograr mejorar las prestaciones utilizando los recursos de manera eficiente, y este reto es mayor al utilizar un ambiente distribuido. Teniendo en cuenta este reto, se proponen un conjunto de reglas para realizar el cómputo en cada uno de los nodos, basado en el análisis de cómputo y comunicaciones de las aplicaciones, se analiza un esquema de mapping de celdas y un método para planificar el orden de ejecución, tomando en consideración la ejecución por prioridad, donde las celdas de fronteras tienen una mayor prioridad con respecto a las celdas internas. En la experimentación se muestra el solapamiento del computo interno con las comunicaciones de las celdas fronteras, obteniendo resultados donde el Speedup aumenta y los niveles de eficiencia se mantienen por encima de un 85%, finalmente se obtiene ganancias de los tiempos de ejecución, concluyendo que si se puede diseñar un esquemas de solapamiento que permita que la ejecución de las aplicaciones SPMD en un cluster se hagan de forma eficiente.

On extending Pollard's theorem for t-representable sums

"Vegeu el resum a l'inici del document del fitxer adjunt."