This paper considers the computation of matrix chain products of the form M1 M2 Mn?1. The order in which the matrices are multiplied aaects the number of operations. The best sequential algorithm for computing an optimal order of matrix multiplication runs in O(n log n) time while the best known parallel NC algorithm runs in O(log 2 n) time using n 6 = log 6 n processors. This paper presents th...

Information Complexity Alexander Koza hinsky∗ ∗Mos ow State University, Fa ulty of Me hani s and Mathemati s kozla h mail.ru 2014 Abstra t We prove a version of "Reversed Newman Theorem" in ontext of information omplexity: every privateoin ommuni ation proto ol with information omplexity I and ommuni ation omplexity C an be repla ed by publi oin proto ol with the same behavior so that it's info...

Working papers of the Federal Reserve Bank of Cleveland are preliminary materials circulated to stimulate discussion and critical comment on research in progress. They may not have been subject to the formal editorial review accorded offi cial Federal Reserve Bank of Cleveland publications. The views stated herein are those of the authors and are not necessarily those of the Federal Reserve Ban...

Poly(ADP-ribosyl)ation is a posttranslational protein modification in which ADP-ribose (ADP-Rib) units derived from NAD(+) are attached to proteins by poly(ADP-Rib) polymerase (PARP) enzymes. ADP-Rib groups are removed from these polymer chains by the enzyme poly(ADP-Rib) glycohydrolase (PARG). In animals, poly(ADP-ribosyl)ation is associated with DNA damage responses and programmed cell death....

Poly(ADP-ribosyl)ation of the conserved multifunctional transcription factor CTCF was previously identified as important to maintain CTCF insulator and chromatin barrier functions. However, the molecular mechanism of this regulation and also the necessity of this modification for other CTCF functions remain unknown. In this study, we identified potential sites of poly(ADP-ribosyl)ation within t...

This paper relies on the new Keynesian model with in‡ation persistence to characterize the optimal monetary and …scal policy in a liquidity trap. It shows that, with a Phillips curve that is both forward and backward looking, the monetary policy that is implemented during a liquidity trap episode can lift the economy out of depression. The central bank does not need to commit beyond the end of ...

We document the presence of sizable distributional e¤ects from unexpected price level movements in the Euro Area (EA) using sectoral accounts and newly available data from the Household Finance and Consumption Survey. The EA as a whole is a net winner of unexpected price level increases, with Italy, Greece, Portugal and Spain being the biggest bene…ciaries, and Belgium and Malta being the large...

§1. Conjectures Let V be a variety over C and let B = ∑ biBi be an effective Q-Weil divisor on V such that bi ≤ 1 for any i. Such a pair (V,B) will be called a log variety. It is said to be log terminal if it has only weak log terminal singularities in the sense of [KMM]. In this case, the Q-bundle KV + B is called the log canonical bundle of (V,B) and will be denoted by K(V,B). A Q-bundle L on...

A partition (C1, C2, ..., Cq) ofG = (V,E) into clusters of strong (respectively, weak) diameter d, such that the supergraph obtained by contracting each Ci is l-colorable is called a strong (resp., weak) (d, l)network-decomposition. Network-decompositions were introduced in a seminal paper by Awerbuch, Goldberg, Luby and Plotkin in 1989. Awerbuch et al. showed that strong (exp{O(√logn log logn)...

In this paper we work in the framework of a k-dimensional vector of log-linear risks. Under weak conditions on the marginal tails and the dependence structure of a vector of positive risks, we derive the asymptotic tail behaviour of the aggregated risk and present an application concerning log-normal risks with stochastic volatility.