628 resultados para Algorismes paral·lels
Resumo:
[ANGLÈS] This project introduces GNSS-SDR, an open source Global Navigation Satellite System software-defined receiver. The lack of reconfigurability of current commercial-of-the-shelf receivers and the advent of new radionavigation signals and systems make software receivers an appealing approach to design new architectures and signal processing algorithms. With the aim of exploring the full potential of this forthcoming scenario with a plurality of new signal structures and frequency bands available for positioning, this paper describes the software architecture design and provides details about its implementation, targeting a multiband, multisystem GNSS receiver. The result is a testbed for GNSS signal processing that allows any kind of customization, including interchangeability of signal sources, signal processing algorithms, interoperability with other systems, output formats, and the offering of interfaces to all the intermediate signals, parameters and variables. The source code release under the GNU General Public License (GPL) secures practical usability, inspection, and continuous improvement by the research community, allowing the discussion based on tangible code and the analysis of results obtained with real signals. The source code is complemented by a development ecosystem, consisting of a website (http://gnss-sdr.org), as well as a revision control system, instructions for users and developers, and communication tools. The project shows in detail the design of the initial blocks of the Signal Processing Plane of the receiver: signal conditioner, the acquisition block and the receiver channel, the project also extends the functionality of the acquisition and tracking modules of the GNSS-SDR receiver to track the new Galileo E1 signals available. Each section provides a theoretical analysis, implementation details of each block and subsequent testing to confirm the calculations with both synthetically generated signals and with real signals from satellites in space.
Resumo:
This paper compares two well known scan matching algorithms: the MbICP and the pIC. As a result of the study, it is proposed the MSISpIC, a probabilistic scan matching algorithm for the localization of an Autonomous Underwater Vehicle (AUV). The technique uses range scans gathered with a Mechanical Scanning Imaging Sonar (MSIS), and the robot displacement estimated through dead-reckoning with the help of a Doppler Velocity Log (DVL) and a Motion Reference Unit (MRU). The proposed method is an extension of the pIC algorithm. Its major contribution consists in: 1) using an EKF to estimate the local path traveled by the robot while grabbing the scan as well as its uncertainty and 2) proposing a method to group into a unique scan, with a convenient uncertainty model, all the data grabbed along the path described by the robot. The algorithm has been tested on an AUV guided along a 600m path within a marina environment with satisfactory results
Resumo:
We present a rule-based Huet’s style anti-unification algorithm for simply-typed lambda-terms in ɳ long β normal form, which computes a least general higher-order pattern generalization. For a pair of arbitrary terms of the same type, such a generalization always exists and is unique modulo α equivalence and variable renaming. The algorithm computes it in cubic time within linear space. It has been implemented and the code is freely available
Resumo:
Nominal Unification is an extension of first-order unification where terms can contain binders and unification is performed modulo α equivalence. Here we prove that the existence of nominal unifiers can be decided in quadratic time. First, we linearly-reduce nominal unification problems to a sequence of freshness and equalities between atoms, modulo a permutation, using ideas as Paterson and Wegman for first-order unification. Second, we prove that solvability of these reduced problems may be checked in quadràtic time. Finally, we point out how using ideas of Brown and Tarjan for unbalanced merging, we could solve these reduced problems more efficiently
Resumo:
Des dels inicis dels ordinadors com a màquines programables, l’home ha intentat dotar-los de certa intel•ligència per tal de pensar o raonar el més semblant possible als humans. Un d’aquests intents ha sigut fer que la màquina sigui capaç de pensar de tal manera que estudiï jugades i guanyi partides d’escacs. En l’actualitat amb els actuals sistemes multi tasca, orientat a objectes i accés a memòria i gràcies al potent hardware del que disposem, comptem amb una gran varietat de programes que es dediquen a jugar a escacs. Però no hi ha només programes petits, hi ha fins i tot màquines senceres dedicades a calcular i estudiar jugades per tal de guanyar als millors jugadors del món. L’objectiu del meu treball és dur a terme un estudi i implementació d’un d’aquests programes, per això es divideix en dues parts. La part teòrica o de l’estudi, consta d’un estudi dels sistemes d’intel•ligència artificial que es dediquen a jugar a escacs, estudi i cerca d’una funció d’avaluació vàlida i estudi dels algorismes de cerca. La part pràctica del treball es basa en la implementació d’un sistema intel•ligent capaç de jugar a escacs amb certa lògica. Aquesta implementació es porta a terme amb l’ajuda de les llibreries SDL, utilitzant l’algorisme minimax amb poda alfa-beta i codi c++. Com a conclusió del projecte m’agradaria remarcar que l’estudi realitzat m’ha deixat veure que crear un joc d’escacs no era tan fàcil com jo pensava però m’ha aportat la satisfacció d’aplicar tot el que he après durant la carrera i de descobrir moltes altres coses noves.
Resumo:
ATP-gated P2X receptors and acid-sensing ion channels are two distinct ligand-gated ion channels that assemble into trimers. They are involved in many important physiological functions such as pain sensation and are recognized as important therapeutic targets. They have unrelated primary structures and respond to different ligands (ATP and protons) and are thus considered as two different ion channels. As a consequence, comparisons of the biophysical properties and underlying mechanisms have only been rarely made between these two channels. However, the recent determination of their molecular structures by X-ray crystallography has revealed unexpected parallels in the architecture of the two pores, providing a basis for possible functional analogies. In this review, we analyze the structural and functional similarities that are shared by these trimeric ion channels, and we outline key unanswered questions that, if addressed experimentally, may help us to elucidate how two unrelated ion channels have adopted a similar fold of the pore.
Resumo:
We present formulas for computing the resultant of sparse polyno- mials as a quotient of two determinants, the denominator being a minor of the numerator. These formulas extend the original formulation given by Macaulay for homogeneous polynomials.
Resumo:
The ability to regulate specific genes of energy metabolism in response to fasting and feeding is an important adaptation allowing survival of intermittent food supplies. However, little is known about transcription factors involved in such responses in higher organisms. We show here that gene expression in adipose tissue for adipocyte determination differentiation dependent factor (ADD) 1/sterol regulatory element binding protein (SREBP) 1, a basic-helix-loop-helix protein that has a dual DNA-binding specificity, is reduced dramatically upon fasting and elevated upon refeeding; this parallels closely the regulation of two adipose cell genes that are crucial in energy homeostasis, fatty acid synthetase (FAS) and leptin. This elevation of ADD1/SREBP1, leptin, and FAS that is induced by feeding in vivo is mimicked by exposure of cultured adipocytes to insulin, the classic hormone of the fed state. We also show that the promoters for both leptin and FAS are transactivated by ADD1/SREBP1. A mutation in the basic domain of ADD1/SREBP1 that allows E-box binding but destroys sterol regulatory element-1 binding prevents leptin gene transactivation but has no effect on the increase in FAS promoter function. Molecular dissection of the FAS promoter shows that most if not all of this action of ADD1/SREBP1 is through an E-box motif at -64 to -59, contained with a sequence identified previously as the major insulin response element of this gene. These results indicate that ADD1/SREBP1 is a key transcription factor linking changes in nutritional status and insulin levels to the expression of certain genes that regulate systemic energy metabolism.
Resumo:
INTRODUCTION The chemical senses smell and taste, detect and discriminate an enormous diversity of environmental stimuli and provide fascinating but challenging models to investigate how sensory cues are represented in the brain. Important stimulus-coding events occur in peripheral sensory neurons, which express specific combinations of chemosensory receptors with defined ligand-response profiles. These receptors convert ligand recognition into spatial and temporal patterns of neural activity that are transmitted to and interpreted in central brain regions. Drosophila provides an attractive model to study chemosensory coding, because it possesses relatively simple peripheral olfactory and gustatory systems that display many organizational parallels to those of vertebrates. Moreover, virtually all of the peripheral chemosensory neurons are easily accessible for physiological analysis, as they are exposed on the surface of sensory organs in specialized sensory hairs called sensilla. In recent years, improvements in microscopy and instrumentation for electrode manipulation have opened up the much smaller Drosophila system to electrophysiological techniques, powerfully complementing many years of molecular genetic studies. As with most electrophysiological methods, there is probably no substitute for learning this technique directly from a laboratory in which it is already established. This protocol describes the basics of setting up the electrophysiology rig and stimulus delivery device, sample preparation, and performing and analyzing recordings of stimulus-evoked activity from Drosophila taste sensilla.
Resumo:
[cat] Es presenta un estimador nucli transformat que és adequat per a distribucions de cua pesada. Utilitzant una transformació basada en la distribució de probabilitat Beta l’elecció del paràmetre de finestra és molt directa. Es presenta una aplicació a dades d’assegurances i es mostra com calcular el Valor en Risc.
Resumo:
[cat] Es presenta un estimador nucli transformat que és adequat per a distribucions de cua pesada. Utilitzant una transformació basada en la distribució de probabilitat Beta l’elecció del paràmetre de finestra és molt directa. Es presenta una aplicació a dades d’assegurances i es mostra com calcular el Valor en Risc.
Resumo:
We apply majorization theory to study the quantum algorithms known so far and find that there is a majorization principle underlying the way they operate. Grover's algorithm is a neat instance of this principle where majorization works step by step until the optimal target state is found. Extensions of this situation are also found in algorithms based in quantum adiabatic evolution and the family of quantum phase-estimation algorithms, including Shor's algorithm. We state that in quantum algorithms the time arrow is a majorization arrow.
Resumo:
A systematic assessment of global neural network connectivity through direct electrophysiological assays has remained technically infeasible, even in simpler systems like dissociated neuronal cultures. We introduce an improved algorithmic approach based on Transfer Entropy to reconstruct structural connectivity from network activity monitored through calcium imaging. We focus in this study on the inference of excitatory synaptic links. Based on information theory, our method requires no prior assumptions on the statistics of neuronal firing and neuronal connections. The performance of our algorithm is benchmarked on surrogate time series of calcium fluorescence generated by the simulated dynamics of a network with known ground-truth topology. We find that the functional network topology revealed by Transfer Entropy depends qualitatively on the time-dependent dynamic state of the network (bursting or non-bursting). Thus by conditioning with respect to the global mean activity, we improve the performance of our method. This allows us to focus the analysis to specific dynamical regimes of the network in which the inferred functional connectivity is shaped by monosynaptic excitatory connections, rather than by collective synchrony. Our method can discriminate between actual causal influences between neurons and spurious non-causal correlations due to light scattering artifacts, which inherently affect the quality of fluorescence imaging. Compared to other reconstruction strategies such as cross-correlation or Granger Causality methods, our method based on improved Transfer Entropy is remarkably more accurate. In particular, it provides a good estimation of the excitatory network clustering coefficient, allowing for discrimination between weakly and strongly clustered topologies. Finally, we demonstrate the applicability of our method to analyses of real recordings of in vitro disinhibited cortical cultures where we suggest that excitatory connections are characterized by an elevated level of clustering compared to a random graph (although not extreme) and can be markedly non-local.
Resumo:
The article reopens the file of sources, parallels and rewritings of 1 Cor 2.9, a saying that Paul attributes to some written source, when others sources put it into Jesus' mouth (e.g. GosThom 17). A state of research highlights that the hypothesis of an oral source is generally preferred but an accurate study of 1 Clem 34.8, a parallel too often neglected, supports the presence of a written source that existed before 1 Cor 2.9. GosJud 47.10-13 will help to understand the attribution of the saying to Jesus. The last important part of this article studies its parallel in Islamic traditions, a ḥadīth qudsī.
Resumo:
In this discussion, after a few general comments, I will propose a systems reading of the intervention so elegantly described by Kaija Puura. I will draw parallels between the therapeutic and the family groups as framing-developing systems and formalize the steps taken by the family toward healing under the influence of the therapist's team. En esta discusión, después de algunos comentarios generales, propongo una lectura sistemática de la intervención tan elegantemente descrita por Kaija Puura. Buscaré paralelos entre los grupos terapéuticos y de familia como sistemas de desarrollo enmarcado y formalizaré los pasos tomados por la familia hacia la cicatrización bajo la influencia del equipo del terapista. Après quelques commentaires généraux, je proposerai dans cette discussion une lecture systémique de l'intervention si élégamment décrite par Kaija Puura. J'établirai des parallèles entre les groupes thérapeutiques et familiaux en tant que systèmes d'encadrement-développement et je formaliserai les étapes de guérison franchies par la famille grâce à l'influence de l'équipe thérapeutique. In dieser Diskussion, werde ich nach einigen allgemeineren Aussagen, eine systemische Lesart der von Kaija Puura so eingängig beschriebenen Intervention vorschlagen. Ich werde darin Parallelen zwischen der therapeutischen und Rahmengebenden Familiengruppen ziehen, und die Schritte der Familien hin zu einer Heilung unter dem Einfluss des Therapeutenteams formalisieren.