Search results for " algorithm"
showing 10 items of 2538 documents
Quantized Dissensus in switching networks with nodes death and duplication* *Research supported by MURST-PRIN “Robust Techniques for uncertain system…
2009
Abstract In this paper we discuss agents exchanging quantized flows to diverge one from the others according to a dissensus protocol. A Quantized Gossip algorithm is considered. Evolutions of the states during switching intervals and at switching instants and their property are described and analyzed. The modeling of switching systems describing networks where death and duplication processes occur is described. Some properties of the topology reached by the network when different rules of duplication and inheritance are implemented.
On Using the Theory of Regular Functions to Prove the ε-Optimality of the Continuous Pursuit Learning Automaton
2013
Published version of a chapter in the book: Recent Trends in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-38577-3_27 There are various families of Learning Automata (LA) such as Fixed Structure, Variable Structure, Discretized etc. Informally, if the environment is stationary, their ε-optimality is defined as their ability to converge to the optimal action with an arbitrarily large probability, if the learning parameter is sufficiently small/large. Of these LA families, Estimator Algorithms (EAs) are certainly the fastest, and within this family, the set of Pursuit algorithms have been considered to be the pioneering schemes. The…
Quantum Algorithm for Distribution-Free Junta Testing
2019
Inspired by a recent classical distribution-free junta tester by Chen, Liu, Serverdio, Sheng, and Xie (STOC’18), we construct a quantum tester for the same problem with complexity \(O(k/\varepsilon )\), which constitutes a quadratic improvement.
Quantum Dual Adversary for Hidden Subgroups and Beyond
2019
An explicit quantum dual adversary for the S-isomorphism problem is constructed. As a consequence, this gives an alternative proof that the query complexity of the dihedral hidden subgroup problem is polynomial.
Quantum Property Testing for Bounded-Degree Graphs
2011
We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion, we also prove an Omega(N^(1/4)) quantum query lower bound, thus ruling out the possibility of an exponential quantum speedup. Our quantum algorithms follow from a combination of classical property testing techniques due to Goldreich and Ron, derandomization, and the quantum algorithm for element distinctness. The quantum lower bound is obtained by the polynomial method, using novel algebraic techniques and combinatorial analysis to accommodate the graph s…
Widespread selection for high and low secondary structure in coding sequences across all domains of life
2019
AbstractCodon composition, GC-content and local RNA secondary structures can have a profound effect on gene expression and mutations affecting these parameters, even though they do not alter the protein sequence, are not neutral in terms of selection. Although evidence exists that in some cases selection favors more stable RNA secondary structures, we currently lack a concrete idea of how many genes are affected within a species, and if this is a universal phenomenon in nature.We searched for signs of structural selection in a global manner, analyzing a set of one million coding sequences from 73 species representing all domains of life, as well as viruses, by means of our newly developed s…
Comparison of classification methods that combine clinical data and high-dimensional mass spectrometry data
2013
Background The identification of new diagnostic or prognostic biomarkers is one of the main aims of clinical cancer research. Technologies like mass spectrometry are commonly being used in proteomic research. Mass spectrometry signals show the proteomic profiles of the individuals under study at a given time. These profiles correspond to the recording of a large number of proteins, much larger than the number of individuals. These variables come in addition to or to complete classical clinical variables. The objective of this study is to evaluate and compare the predictive ability of new and existing models combining mass spectrometry data and classical clinical variables. This study was co…
High frequency of BRAF V600E mutation in Iranian population ameloblastomas
2020
Background Ameloblastoma is a common locally invasive but slow-growing neoplasm of the jaws with an odontogenic origin. Association between BRAF V600E mutation and clinicopathologic features and behavior of ameloblastoma remains controversial. This study aimed to evaluate BRAF V600E gene mutation and expression of its related proteins with clinicopathologic parameters in conventional ameloblastoma. Material and Methods 50 Formalin-fixed paraffin-embedded blocks were included in this study. Immunohistochemistry was done using rabbit monoclonal BRAF V600E mutation-specific antibody VE1. Quantitative real-time polymerase chain reaction assay was used for evaluating of BRAF V600E mutation. Resu…
Online Closed-Loop Real-Time tES-fMRI for Brain Modulation: Feasibility, Noise/Safety and Pilot Study
2021
AbstractRecent studies suggest that transcranial electrical stimulation (tES) can be performed during functional magnetic resonance imaging (fMRI). The novel approach of using concurrent tES-fMRI to modulate and measure targeted brain activity/connectivity may provide unique insights into the causal interactions between the brain neural responses and psychiatric/neurologic signs and symptoms, and importantly, guide the development of new treatments. However, tES stimulation parameters to optimally influence the underlying brain activity in health and disorder may vary with respect to phase, frequency, intensity and electrode’s montage. Here, we delineate how a closed-loop tES-fMRI study of …
A Dynamic Distributed Algorithm for Multicast Path Setup
2005
In the past few years, there has been a considerable work on multicast route selection techniques, with the aim to design scalable protocols which can guarantee an efficient use of network resources. Steiner tree-based multicast algorithms produce optimal trees, but they are prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require a complete knowledge of the network topology. In this paper, we propose a new distributed approach that is efficient and suitable for real network adoption. Performance evaluation indicates that it outp…