1,364 research outputs found
Secure and linear cryptosystems using error-correcting codes
A public-key cryptosystem, digital signature and authentication procedures
based on a Gallager-type parity-check error-correcting code are presented. The
complexity of the encryption and the decryption processes scale linearly with
the size of the plaintext Alice sends to Bob. The public-key is pre-corrupted
by Bob, whereas a private-noise added by Alice to a given fraction of the
ciphertext of each encrypted plaintext serves to increase the secure channel
and is the cornerstone for digital signatures and authentication. Various
scenarios are discussed including the possible actions of the opponent Oscar as
an eavesdropper or as a disruptor
Multi-Choice Minority Game
The generalization of the problem of adaptive competition, known as the
minority game, to the case of possible choices for each player is
addressed, and applied to a system of interacting perceptrons with input and
output units of the type of -states Potts-spins. An optimal solution of this
minority game as well as the dynamic evolution of the adaptive strategies of
the players are solved analytically for a general and compared with
numerical simulations.Comment: 5 pages, 2 figures, reorganized and clarifie
The influence of feature selection methods on accuracy, stability and interpretability of molecular signatures
Motivation: Biomarker discovery from high-dimensional data is a crucial
problem with enormous applications in biology and medicine. It is also
extremely challenging from a statistical viewpoint, but surprisingly few
studies have investigated the relative strengths and weaknesses of the plethora
of existing feature selection methods. Methods: We compare 32 feature selection
methods on 4 public gene expression datasets for breast cancer prognosis, in
terms of predictive performance, stability and functional interpretability of
the signatures they produce. Results: We observe that the feature selection
method has a significant influence on the accuracy, stability and
interpretability of signatures. Simple filter methods generally outperform more
complex embedded or wrapper methods, and ensemble feature selection has
generally no positive effect. Overall a simple Student's t-test seems to
provide the best results. Availability: Code and data are publicly available at
http://cbio.ensmp.fr/~ahaury/
Lack of cardiac differentiation in c-kit-enriched porcine bone marrow and spleen hematopoietic cell cultures using 5-azacytidine
The adult spleen is a source of early hematopoietic stem cells (HSC). We therefore studied whether culturing spleen or bone marrow (BM) HSC in medium containing 5-azacytidine could induce a cardiac phenotype. c-kit enrichment and depletion of adult pig spleen and BM mononuclear cells were obtained by magnetic bead separation using biotinylated pig stem cell factor (c-kit ligand). Cells were incubated with 5-azacytidine for 24 h and refreshed with 5-azacytidine-free medium every 48 h. Western blot was used to detect cardiac troponin and myosin heavy chains. Alth
Fast approximation of centrality and distances in hyperbolic graphs
We show that the eccentricities (and thus the centrality indices) of all
vertices of a -hyperbolic graph can be computed in linear
time with an additive one-sided error of at most , i.e., after a
linear time preprocessing, for every vertex of one can compute in
time an estimate of its eccentricity such that
for a small constant . We
prove that every -hyperbolic graph has a shortest path tree,
constructible in linear time, such that for every vertex of ,
. These results are based on an
interesting monotonicity property of the eccentricity function of hyperbolic
graphs: the closer a vertex is to the center of , the smaller its
eccentricity is. We also show that the distance matrix of with an additive
one-sided error of at most can be computed in
time, where is a small constant. Recent empirical studies show that
many real-world graphs (including Internet application networks, web networks,
collaboration networks, social networks, biological networks, and others) have
small hyperbolicity. So, we analyze the performance of our algorithms for
approximating centrality and distance matrix on a number of real-world
networks. Our experimental results show that the obtained estimates are even
better than the theoretical bounds.Comment: arXiv admin note: text overlap with arXiv:1506.01799 by other author
Does the biomarker search paradigm need re-booting?
The clinical problem of bladder cancer is its high recurrence and progression, and that the most sensitive and specific means of monitoring is cystoscopy, which is invasive and has poor patient compliance. Biomarkers for recurrence and progression could make a great contribution, but in spite of decades of research, no biomarkers are commercially available with the requisite sensitivity and specificity. In the post-genomic age, the means to search the entire genome for biomarkers has become available, but the conventional approaches to biomarker discovery are entirely inadequate to yield results with the new technology. Finding clinically useful biomarker panels with sensitivity and specificity equal to that of cystoscopy is a problem of systems biology
- …