The Polish Competition Authority Submits a Draft Amendment to the Polish Competition Act: Revolution or Fine-Tuning?

This piece highlights and offers a brief analysis of the most important of the
proposed changes to Polish competition law. The draft proposal envisages introduction of, inter alia, financial penalties for individuals, two-stage merger review process, important changes to the leniency program (including introduction of leniency plus), as well as such new tools as remedies and settlements.

The Polish Competition Authority Publishes its Annual Report for 2012

In May 2013 the President of the Office of Competition and Consumer Protection (UOKiK), the Polish Competition Authority, published its Annual Report for 2012. This piece provides an overview of the reported activities within the competition law & policy domain, and comments on some of them.

University Competition, Grading Standards, and Grade Inflation

We develop a model of strategic grade determination by universities distinguished by their distributions of student academic abilities. Universities choose grading standards to maximize the total wages of graduates, taking into account how the grading standards affect firms' productivity assessment and job placement. We identify conditions under which better universities set lower grading standards, exploiting the fact that firms cannot distinguish between good and badA''s. In contrast, a social planner sets stricter standards at better universities. We show how increases in skilled jobs drive grade inflation, and determine when grading standards fall faster at better schools. (JEL I21)

Trait directed de novo population transcriptome dissects genetic regulation of a balanced polymorphism in phosphorus nutrition/arsenate tolerance in a wild grass Holcus lanatus

The aim of this study was to characterize the transcriptome of a balanced polymorphism, under the regulation of a single gene, for phosphate fertilizer responsiveness/arsenate toler- ance in wild grass Holcus lanatus genotypes screened from the same habitat.

De novo transcriptome sequencing, RNAseq (RNA sequencing) and single nucleotide poly- morphism (SNP) calling were conducted on RNA extracted from H.lanatus. Roche 454 sequencing data were assembled into c. 22 000 isotigs, and paired-end Illumina reads for phosphorus-starved (P) and phosphorus-treated (P+) genovars of tolerant (T) and nontoler- ant (N) phenotypes were mapped to this reference transcriptome.

Heatmaps of the gene expression data showed strong clustering of each P+/P treated genovar, as well as clustering by N/T phenotype. Statistical analysis identified 87 isotigs to be significantly differentially expressed between N and T phenotypes and 258 between P+ and P treated plants. SNPs and transcript expression that systematically differed between N and T phenotypes had regulatory function, namely proteases, kinases and ribonuclear RNA- binding protein and transposable elements.

A single gene for arsenate tolerance led to distinct phenotype transcriptomes and SNP pro- files, with large differences in upstream post-translational and post-transcriptional regulatory genes rather than in genes directly involved in P nutrition transport and metabolism per se.

The forgiving tree: a self-healing distributed data structure

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up to n rounds where n is the total number of nodes initially in the network: the adversary deletesan arbitrary node from the network, then the network responds by quickly adding a small number of new edges.

We present a distributed data structure that ensures two key properties. First, the diameter of the network is never more than O(log Delta) times its original diameter, where Delta is the maximum degree of the network initially. We note that for many peer-to-peer systems, Delta is polylogarithmic, so the diameter increase would be a O(loglog n) multiplicative factor. Second, the degree of any node never increases by more than 3 over its original degree. Our data structure is fully distributed, has O(1) latency per round and requires each node to send and receive O(1) messages per round. The data structure requires an initial setup phase that has latency equal to the diameter of the original network, and requires, with high probability, each node v to send O(log n) messages along every edge incident to v. Our approach is orthogonal and complementary to traditional topology-based approaches to defending against attack.