Search results for "Algorithm"
showing 10 items of 4887 documents
Algorithms for the calculation of the projected area factors of seated and standing persons
1991
Moderate thermal environments, other than being affected by the mutual radiative heat exchange at low frequency among the internal surfaces, are often characterized by the presence of high intensity sources, that is, radiant sources showing a small area, a high emission temperature and a strongly directional beam. The sun's direct radiation can be considered to be among these radiant sources. In these cases, the computation of the mean radiant temperature and, consequently, the evaluation of the thermal comfort conditions, require knowledge of the “project area factor”, fp, of the subject. Moreover, the fp parameters are also applicable to derivation of the shape factors between subjects an…
Near-Real-Time Estimation of Water Vapor Column From MSG-SEVIRI Thermal Infrared Bands: Implications for Land Surface Temperature Retrieval
2015
The Meteosat Second Generation-Spinning Enhanced Visible and Infrared Imager (MSG-SEVIRI) instrument provides observations of half the globe every 15 min, at low spatial resolution. These data are an invaluable tool to observe daily to yearly cycle of land surface temperature (LST), as well as for various early warning systems. However, advanced algorithms for LST estimation requires a previous estimation of the water vapor (WV) column above the observed pixel, for which no instantaneous retrieval methods are yet available, and therefore hinders their implementation in a near-real-time processing chain for MSG-SEVIRI data. This work analyzes three different formulations for such WV retrieva…
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…
Disentangling the complexity of low complexity proteins
2020
Abstract There are multiple definitions for low complexity regions (LCRs) in protein sequences, with all of them broadly considering LCRs as regions with fewer amino acid types compared to an average composition. Following this view, LCRs can also be defined as regions showing composition bias. In this critical review, we focus on the definition of sequence complexity of LCRs and their connection with structure. We present statistics and methodological approaches that measure low complexity (LC) and related sequence properties. Composition bias is often associated with LC and disorder, but repeats, while compositionally biased, might also induce ordered structures. We illustrate this dichot…
Complex formation between the NS3 serine-type proteinase of the hepatitis C virus and NS4A and its importance for polyprotein maturation
1995
Processing of the hepatitis C virus polyprotein is mediated by host cell signalases and at least two virally encoded proteinases. Of these, the serine-type proteinase encompassing the amino-terminal one-third of NS3 is responsible for cleavage at the four sites carboxy terminal of NS3. The activity of this proteinase is modulated by NS4A, a 54-amino-acid polyprotein cleavage product essential for processing at the NS3/4A, NS4A/4B, and NS4B/5A sites and enhancing cleavage efficiency between NS5A and NS5B. Using the vaccinia virus-T7 hybrid system to express hepatitis C virus polypeptides in BHK-21 cells, we studied the role of NS4A in proteinase activation. We found that the NS3 proteinase a…
Reconstructing the free-energy landscape of Met-enkephalin using dihedral principal component analysis and well-tempered metadynamics
2013
Well-Tempered Metadynamics (WTmetaD) is an efficient method to enhance the reconstruction of the free-energy surface of proteins. WTmetaD guarantees a faster convergence in the long time limit in comparison with the standard metadynamics. It still suffers however from the same limitation, i.e. the non trivial choice of pertinent collective variables (CVs). To circumvent this problem, we couple WTmetaD with a set of CVs generated from a dihedral Principal Component Analysis (dPCA) on the Ramachadran dihedral angles describing the backbone structure of the protein. The dPCA provides a generic method to extract relevant CVs built from internal coordinates. We illustrate the robustness of this …