A functional equation related to the product in a quadratic number field

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

Social capital and the equilibrium number of entrepreneurs

Social capital is viewed either as a proprietary asset that serves private interests, including those of entrepreneurs, or as a collective asset that supports trust-based transactions saving on transaction costs both in markets and within the boundaries of firms, and benefiting society as a whole. This paper explains the relative specialization between entrepreneurs and market-governed exchanges as a result of the interaction between social capital that lowers transaction costs, and the scale economies of ability in managerial jobs (Lucas 1978). The main hypothesis formulated in the paper is that higher social capital will benefit the hierarchy relatively more than the market as a governance mechanism, and therefore in economies with higher social capital, the equilibrium number of entrepreneurs will be lower and their average span of control larger than in economies with lower social capital. The empirical evidence, with data from the Spanish Autonomous Communities, is consistent with this prediction.

Prominent use of distal 5’ transcription start sites and discovery of a large number of additional exons in ENCODE regions

This report presents systematic empirical annotation of transcript products from 399 annotated protein-coding loci across the 1% of the human genome targeted by the Encyclopedia of DNA elements (ENCODE) pilot project using a combination of 5' rapid amplification of cDNA ends (RACE) and high-density resolution tiling arrays. We identified previously unannotated and often tissue- or cell-line-specific transcribed fragments (RACEfrags), both 5' distal to the annotated 5' terminus and internal to the annotated gene bounds for the vast majority (81.5%) of the tested genes. Half of the distal RACEfrags span large segments of genomic sequences away from the main portion of the coding transcript and often overlap with the upstream-annotated gene(s). Notably, at least 20% of the resultant novel transcripts have changes in their open reading frames (ORFs), most of them fusing ORFs of adjacent transcripts. A significant fraction of distal RACEfrags show expression levels comparable to those of known exons of the same locus, suggesting that they are not part of very minority splice forms. These results have significant implications concerning (1) our current understanding of the architecture of protein-coding genes; (2) our views on locations of regulatory regions in the genome; and (3) the interpretation of sequence polymorphisms mapping to regions hitherto considered to be "noncoding," ultimately relating to the identification of disease-related sequence alterations.

Assembling genes from predicted exons in linear time with dynamic programming

In a number of programs for gene structure prediction in higher eukaryotic genomic sequences, exon prediction is decoupled from gene assembly: a large pool of candidate exons is predicted and scored from features located in the query DNA sequence, and candidate genes are assembled from such a pool as sequences of nonoverlapping frame-compatible exons. Genes are scored as a function of the scores of the assembled exons, and the highest scoring candidate gene is assumed to be the most likely gene encoded by the query DNA sequence. Considering additive gene scoring functions, currently available algorithms to determine such a highest scoring candidate gene run in time proportional to the square of the number of predicted exons. Here, we present an algorithm whose running time grows only linearly with the size of the set of predicted exons. Polynomial algorithms rely on the fact that, while scanning the set of predicted exons, the highest scoring gene ending in a given exon can be obtained by appending the exon to the highest scoring among the highest scoring genes ending at each compatible preceding exon. The algorithm here relies on the simple fact that such highest scoring gene can be stored and updated. This requires scanning the set of predicted exons simultaneously by increasing acceptor and donor position. On the other hand, the algorithm described here does not assume an underlying gene structure model. Indeed, the definition of valid gene structures is externally defined in the so-called Gene Model. The Gene Model specifies simply which gene features are allowed immediately upstream which other gene features in valid gene structures. This allows for great flexibility in formulating the gene identification problem. In particular it allows for multiple-gene two-strand predictions and for considering gene features other than coding exons (such as promoter elements) in valid gene structures.

Multiuser detection with an unknown number of active users: receiver design

In multiuser detection, the set of users active at any time may be unknown to the receiver. In these conditions, optimum reception consists of detecting simultaneously the set of activeusers and their data, problem that can be solved exactly by applying random-set theory (RST) and Bayesian recursions (BR). However, implementation of optimum receivers may be limited by their complexity, which grows exponentially with the number of potential users. In this paper we examine three strategies leading to reduced-complexity receivers.In particular, we show how a simple approximation of BRs enables the use of Sphere Detection (SD) algorithm, whichexhibits satisfactory performance with limited complexity.

Asymptotic capacity of static multiuser channels with an unknown number of users

We examine a multiple-access communication system in which multiuser detection is performed without knowledge of the number of active interferers. Using a statistical-physics approach, we compute the single-user channel capacity and spectral efficiency in the large-system limit.