Author's reply to "comments on 'timing estimation and resynchronization for amplify-and-forward communication systems'"

published_or_final_versio

Timing estimation and resynchronization for amplify-and-forward communication systems

This paper proposes a general framework to effectively estimate the unknown timing and channel parameters, as well as design efficient timing resynchronization algorithms for asynchronous amplify-and-forward (AF) cooperative communication systems. In order to obtain reliable timing and channel parameters, a least squares (LS) estimator is proposed for initial estimation and an iterative maximum-likelihood (ML) estimator is derived to refine the LS estimates. Furthermore, a timing and channel uncertainty analysis based on the CramrRao bounds (CRB) is presented to provide insights into the system uncertainties resulted from estimation. Using the parameter estimates and uncertainty information in our analysis, timing resynchronization algorithms that are robust to estimation errors are designed jointly at the relays and the destination. The proposed framework is developed for different AF systems with varying degrees of timing misalignment and channel uncertainties and is numerically shown to provide excellent performances that approach the synchronized case with perfect channel information. © 2006 IEEE.published_or_final_versio

Using schedulers to test probabilistic distributed systems

This is the author's accepted manuscript. The final publication is available at Springer via http://dx.doi.org/10.1007/s00165-012-0244-5. Copyright © 2012, British Computer Society.Formal methods are one of the most important approaches to increasing the confidence in the correctness of software systems. A formal specification can be used as an oracle in testing since one can determine whether an observed behaviour is allowed by the specification. This is an important feature of formal testing: behaviours of the system observed in testing are compared with the specification and ideally this comparison is automated. In this paper we study a formal testing framework to deal with systems that interact with their environment at physically distributed interfaces, called ports, and where choices between different possibilities are probabilistically quantified. Building on previous work, we introduce two families of schedulers to resolve nondeterministic choices among different actions of the system. The first type of schedulers, which we call global schedulers, resolves nondeterministic choices by representing the environment as a single global scheduler. The second type, which we call localised schedulers, models the environment as a set of schedulers with there being one scheduler for each port. We formally define the application of schedulers to systems and provide and study different implementation relations in this setting

Development of a Tetrameric Streptavidin Mutein with Reversible Biotin Binding Capability: Engineering a Mobile Loop as an Exit Door for Biotin

A novel form of tetrameric streptavidin has been engineered to have reversible biotin binding capability. In wild-type streptavidin, loop3–4 functions as a lid for the entry and exit of biotin. When biotin is bound, interactions between biotin and key residues in loop3–4 keep this lid in the closed state. In the engineered mutein, a second biotin exit door is created by changing the amino acid sequence of loop7–8. This door is mobile even in the presence of the bound biotin and can facilitate the release of biotin from the mutein. Since loop7–8 is involved in subunit interactions, alteration of this loop in the engineered mutein results in an 11° rotation between the two dimers in reference to wild-type streptavidin. The tetrameric state of the engineered mutein is stabilized by a H127C mutation, which leads to the formation of inter-subunit disulfide bonds. The biotin binding kinetic parameters (koff of 4.28×10−4 s−1 and Kd of 1.9×10−8 M) make this engineered mutein a superb affinity agent for the purification of biotinylated biomolecules. Affinity matrices can be regenerated using gentle procedures, and regenerated matrices can be reused at least ten times without any observable reduction in binding capacity. With the combination of both the engineered mutein and wild-type streptavidin, biotinylated biomolecules can easily be affinity purified to high purity and immobilized to desirable platforms without any leakage concerns. Other potential biotechnological applications, such as development of an automated high-throughput protein purification system, are feasible

Preparation and characterization of in situ polymerized cyclic butylene terephthalate/graphene nanocomposites

Graphene reinforced cyclic butylene terephthalate (CBT) matrix nanocomposites were prepared and characterized by mechanical and thermal methods. These nanocomposites containing different amounts of graphene (up to 5 wt%) were prepared by melt mixing with CBT that was polymerized in situ during a subsequent hot pressing. The nanocomposites and the neat polymerized CBT (pCBT) as reference material were subjected to differential scanning calorimetry (DSC), dynamical mechanical analysis (DMA), thermogravimetrical analysis (TGA) and heat conductivity measurements. The dispersion of the grapheme nanoplatelets was characterized by transmission electron microscopy (TEM). It was established that the partly exfoliated graphene worked as nucleating agent for crystallization, acted as very efficient reinforcing agent (the storage modulus at room temperature was increased by 39 and 89% by incorporating 1 and 5 wt.% graphene, respectively). Graphene incorporation markedly enhanced the heat conductivity but did not influence the TGA behaviour due to the not proper exfoliation except the ash content

A polynomial time biclustering algorithm for finding approximate expression patterns in gene expression time series

<p>Abstract</p> <p>Background</p> <p>The ability to monitor the change in expression patterns over time, and to observe the emergence of coherent temporal responses using gene expression time series, obtained from microarray experiments, is critical to advance our understanding of complex biological processes. In this context, biclustering algorithms have been recognized as an important tool for the discovery of local expression patterns, which are crucial to unravel potential regulatory mechanisms. Although most formulations of the biclustering problem are NP-hard, when working with time series expression data the interesting biclusters can be restricted to those with contiguous columns. This restriction leads to a tractable problem and enables the design of efficient biclustering algorithms able to identify all maximal contiguous column coherent biclusters.</p> <p>Methods</p> <p>In this work, we propose <it>e</it>-CCC-Biclustering, a biclustering algorithm that finds and reports all maximal contiguous column coherent biclusters with approximate expression patterns in time polynomial in the size of the time series gene expression matrix. This polynomial time complexity is achieved by manipulating a discretized version of the original matrix using efficient string processing techniques. We also propose extensions to deal with missing values, discover anticorrelated and scaled expression patterns, and different ways to compute the errors allowed in the expression patterns. We propose a scoring criterion combining the statistical significance of expression patterns with a similarity measure between overlapping biclusters.</p> <p>Results</p> <p>We present results in real data showing the effectiveness of <it>e</it>-CCC-Biclustering and its relevance in the discovery of regulatory modules describing the transcriptomic expression patterns occurring in <it>Saccharomyces cerevisiae </it>in response to heat stress. In particular, the results show the advantage of considering approximate patterns when compared to state of the art methods that require exact matching of gene expression time series.</p> <p>Discussion</p> <p>The identification of co-regulated genes, involved in specific biological processes, remains one of the main avenues open to researchers studying gene regulatory networks. The ability of the proposed methodology to efficiently identify sets of genes with similar expression patterns is shown to be instrumental in the discovery of relevant biological phenomena, leading to more convincing evidence of specific regulatory mechanisms.</p> <p>Availability</p> <p>A prototype implementation of the algorithm coded in Java together with the dataset and examples used in the paper is available in <url>http://kdbio.inesc-id.pt/software/e-ccc-biclustering</url>.</p

Stability Analysis of Frame Slotted Aloha Protocol

Frame Slotted Aloha (FSA) protocol has been widely applied in Radio Frequency Identification (RFID) systems as the de facto standard in tag identification. However, very limited work has been done on the stability of FSA despite its fundamental importance both on the theoretical characterisation of FSA performance and its effective operation in practical systems. In order to bridge this gap, we devote this paper to investigating the stability properties of FSA by focusing on two physical layer models of practical importance, the models with single packet reception and multipacket reception capabilities. Technically, we model the FSA system backlog as a Markov chain with its states being backlog size at the beginning of each frame. The objective is to analyze the ergodicity of the Markov chain and demonstrate its properties in different regions, particularly the instability region. By employing drift analysis, we obtain the closed-form conditions for the stability of FSA and show that the stability region is maximised when the frame length equals the backlog size in the single packet reception model and when the ratio of the backlog size to frame length equals in order of magnitude the maximum multipacket reception capacity in the multipacket reception model. Furthermore, to characterise system behavior in the instability region, we mathematically demonstrate the existence of transience of the backlog Markov chain.Comment: 14 pages, submitted to IEEE Transaction on Information Theor

Subcellular localization of MC4R with ADCY3 at neuronal primary cilia underlies a common pathway for genetic predisposition to obesity.

Most monogenic cases of obesity in humans have been linked to mutations in genes encoding members of the leptin-melanocortin pathway. Specifically, mutations in MC4R, the melanocortin-4 receptor gene, account for 3-5% of all severe obesity cases in humans1-3. Recently, ADCY3 (adenylyl cyclase 3) gene mutations have been implicated in obesity4,5. ADCY3 localizes to the primary cilia of neurons 6 , organelles that function as hubs for select signaling pathways. Mutations that disrupt the functions of primary cilia cause ciliopathies, rare recessive pleiotropic diseases in which obesity is a cardinal manifestation 7 . We demonstrate that MC4R colocalizes with ADCY3 at the primary cilia of a subset of hypothalamic neurons, that obesity-associated MC4R mutations impair ciliary localization and that inhibition of adenylyl cyclase signaling at the primary cilia of these neurons increases body weight. These data suggest that impaired signaling from the primary cilia of MC4R neurons is a common pathway underlying&nbsp;genetic causes of obesity in humans

Breast cancer diagnosis using neural-based linear fusion strategies

Breast cancer is one of the leading causes of mortality among women, and the early diagnosis is of significant clinical importance. In this paper, we describe several linear fusion strategies, in particular the Majority Vote, Simple Average, Weighted Average, and Perceptron Average, which are used to combine a group of component multilayer perceptrons with optimal architecture for the classification of breast lesions. In our experiments, we utilize the criteria of mean squared error, absolute classification error, relative error ratio, and Receiver Operating Characteristic (ROC) curve to concretely evaluate and compare the performances of the four fusion strategies. The experimental results demonstrate that the Weighted Average and Perceptron Average strategies can achieve better diagnostic performance compared to the Majority Vote and Simple Average methods

A new approach for obtaining rapid uniformity in rice (Oryza sativa L.) via a 3x x 2x cross

A triploid (2n = 3x = 36) rice plant was obtained by screening a twin seedling population in which each seed germinated to two or three sprouts that were then crossed with diploid plants. One diploid plant was chosen among the various F1 progenies and developed into an F 2 population via self-pollination. Compared with the control variety Shanyou 63, this F 2 population had a stable agronomical performance in field trials, as confirmed by the F-test. The stability of the F 2 population was further substantiated by molecular analysis with simple sequence repeat markers. Specifically, of 160 markers assayed, 37 (covering all 12 chromosomes) were polymorphic between the parental lines. Testing the F 1 hybrid individually with these markers showed that each PCR product had only a single band instead of two bands from each parent. The bands were identical to either maternal (23 markers) or paternal (eight markers) bands or distinct from both parents (six markers). The amplified bands of all 60 randomly selected F 2 plants were uniform and identical to those of the F 1 hybrid. These results suggest that the F 1 plant is a non-segregating hybrid and that a stable F 2 population was obtained. This novel system provides an efficient means for shortening the cycle of hybrid rice seed production