Filetype
We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. In order to do this, we recall the analogy between Markov Chains and electrical resistive networks. By exploiting this analogy, we are able to rewrite the performance cost as the average effective resistance on a suitable network
Decision-making in requirements engineering often needs to be done in the presence of uncertainty. Rigorous methods can help to increase the probability of making the most appropriate decisions under the given circumstances. Robustness is a measure for the degree of stability of a solution in case of changes in the problem parameters. This paper presents a method (called DECIDERelease) that applie
In this paper, we present a method of constructing new families of LDPC block code ensembles formed by terminating irregular protograph-based LDPC convolutional codes. Using the accumulate-repeat-by-4-jagged-accumulate (AR4JA) protograph as an example, a density evolution analysis for the binary erasure channel shows that this flexible design technique gives rise to a large selection of LDPC block
Product codes, due to their relatively large minimum distance, are often seen as a natural solution for applications requiring low error floors. In this paper, we show by means of an ensemble weight enumerator analysis that the minimum distance multiplicities of product codes are much higher than those obtainable by other generalized LDPC (GLDPC) constructions employing the same component codes. W
In an attempt to identify diagnostically meaningful subgroups in a group of sixty women 18–34 years of age, 19 of them having a DSM-IV diagnosis of anorexia nervosa and 41 of bulimia nervosa, a hierarchical cluster analysis was performed on their data obtained from the Defense Mechanism Technique modified (DMTm) and the Eating Disorder Inventory (EDI). Variables also taken into account in the clus
In an attempt to identify subtypes of breast cancer and pinpoint patterns of cell cycle regulatory defects associated with clinical behaviour, proliferation and other transformation associated events, a multitude of cell cycle regulatory proteins were analysed in a material of 113 primary breast cancers. Increased proliferation was observed in two different scenarios; (1) with high cyclin D1 and e
Lectotypes are designated for 174 names of taxa described based on material from the Swedish province of Dalarna and accepted to belong to Hieracium sect. Hieracium, sect. Bifida and sect. Vulgata. The taxonomic and nomenclatural implications, i.e. taxonomic synonyms and infraspecific taxa not worthy of taxonomic recognition, of the lectotypifications are discussed. Three new combinations, H. mund
Background Combined oral contraceptives are classified by the International Agency for Research on Cancer as a cause of cervical cancer. As the incidence of cervical cancer increases with age, the public-health implications of this association depend largely on the persistence of effects long after use of oral contraceptives has ceased. Information from 24 studies worldwide is pooled here to inves
Early signal relay steps upon ligand binding to the receptor tyrosine kinase Flt3, i.e. sites of Flt3 autophosphorylation and subsequent docking partners, are mainly unresolved. By immunoprecipitation of specific tryptic peptides contained in the juxtamembrane region of human Flt3 and subsequent radiosequencing we identified the tyrosine residues 572, 589, 591 and 599 as in vivo autophosphorylatio
In a prospective pilot study nested in the EPIC-Oxford cohort, we examined the seroprevalence of antibodies against the L1 antigen of 38 human papilloma virus (HPV) types among 39 cases of cutaneous squamous cell carcinoma (SCC) for whom plasma was collected prior to diagnosis (incident) and 80 controls. Fifteen cases having already developed SCC at blood collection (prevalent) were also tested. T
Generalized frequency division multiplexing (GFDM) is a new digital multicarrier concept. The GFDM modulation technique is extremely attractive for applications in a fragmented spectrum, as it provides the flexibility to choose a pulse shape and thus allows reduction of the out-of-band leakage of opportunistic cognitive radio signals into incumbent frequency space. However, this degree of freedom
Generalized frequency division multiplexing (GFDM) is a new concept that can be seen as a generalization of traditional OFDM. The scheme is based on the filtered multi-carrier approach and can offer an increased flexibility, which will play a significant role in future cellular applications. In this paper we present the benefits of the pulse shaped carriers in GFDM. We show that based on the FFT/I
Codes constructed from connected spatially coupled low-density parity-check code (SC-LDPCC) chains are proposed and analyzed. It is demonstrated that connecting coupled chains results in improved iterative decoding performance. The constructed protograph ensembles have better iterative decoding thresholds compared to an individual SC-LDPCC chain and require less computational complexity per bit wh
In this paper the impact of different meals and rapid insulin were estimated as Finite Impulse Response Models from a data set of 18 patients. Based on these models short-term individualized predictors were tested for 20 and 60 minute prediction. The predictors were evaluated using Clarke Grid Analysis and had on average more than 94 % and 75 % in the A zone and less than 1 % and 3 % in the erroro
Network re-optimization is a process that must be triggered periodically in order to improve the inefficient resource allocation of online routing heuristics due to the uncertainty of online lightpath demand arrivals and departures. Network re-optimization involves two tasks: a) finding new lightpaths for a (sub)set of current demands, i.e. rerouting, and b) migrating the current traffic to the ne
Families of asymptotically regular LDPC block code ensembles can be formed by terminating (J, K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles with varying code rates, minimum distance that grows linearly with block length, and capacity approaching iterative decoding thresholds, despite the fact that t
In this paper we investigate the frame-error correcting performance of two newly developed, non-binary belief propagation based, soft-in/soft-out decoding algorithms when decoding Reed-Solomon codes. We present results for the AWGN channel indicating that non-binary belief propagation can come close to the performance of the binary adaptive Belief-Propagation algorithm or even slightly better when
A threshold analysis of terminated braided block codes (BBCs) is presented for the binary erasure channel. Protograph based BBCs (PG-BBCs) are considered, which can be derived by lifting the Tanner graph of a tightly braided block code. They can be interpreted as GLDPC convolutional codes that are structured in a particular way. It is shown that the terminated PG-BBCs have better thresholds than t
