41 resultados para all substring common subsequence problem
em Consorci de Serveis Universitaris de Catalunya (CSUC), Spain
Resumo:
Cada vez es más habitual encontrar tanto el software como el hardware común de las empresas distribuido y gestionado en diferentes servidores que se encargan de servir al usuario aquello que necesita sólo cuando éste lo pide. Este sistema de distribución de la información se llama centralización. Este sistema de distribución requiere un mantenimiento constante para así poder atender todas las demandas de los usuarios. El mantenimiento se convierte, gracias a la centralización en algo relativamente sencillo puesto que sólo es en el servidor donde se tienen que realizar los cambios, actualizaciones o instalación de nuevo software. Es importante entonces comprobar que estas nuevas actualizaciones del servidor responderán correctamente cuando los usuarios las requieran remotamente. En este proyecto nos hemos encargado de analizar cómo se realizan las comprobaciones necesarias para asegurar el correcto funcionamiento de los servidores remotos considerando tanto el entorno en el que se realizan como las herramientas necesarias para llevarlo a cabo. Para completar la información nos hemos centrado en un ejemplo particular de test de carga.
Resumo:
We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F, there is an endomorphism Φ of F sending W to U. This work analyzes an approach due to C. Edmunds and improved by C. Sims. Here we prove that the approach provides an efficient algorithm for solving the endomorphism problem when W is a two- generator word. We show that when W is a two-generator word this algorithm solves the problem in time polynomial in the length of U. This result gives a polynomial-time algorithm for solving, in free groups, two-variable equations in which all the variables occur on one side of the equality and all the constants on the other side.
Resumo:
The paper is devoted to the study of a type of differential systems which appear usually in the study of some Hamiltonian systems with 2 degrees of freedom. We prove the existence of infinitely many periodic orbits on each negative energy level. All these periodic orbits pass near the total collision. Finally we apply these results to study the existence of periodic orbits in the charged collinear 3–body problem.
Resumo:
The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents with single-peaked preferences. A rule maps preference profiles into n shares of the amount to be allocated. A rule is bribe-proof if no group of agents can compensate another agent to misrepresent his preference and, after an appropriate redistribution of their shares, each obtain a strictly preferred share. We characterize all bribe-proof rules as the class of efficient, strategy-proof, and weak replacement monotonic rules. In addition, we identify the functional form of all bribe-proof and tops-only rules.
Resumo:
The division problem consists of allocating an amount M of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, the uniform rule is the unique strategy-proof, efficient, and anonymous rule. Ching and Serizawa (1998) extended this result by showing that the set of single-plateaued preferences is the largest domain, for all possible values of M, admitting a rule (the extended uniform rule) satisfying strategy-proofness, efficiency and symmetry. We identify, for each M and n, a maximal domain of preferences under which the extended uniform rule also satisfies the properties of strategy-proofness, efficiency, continuity, and "tops-onlyness". These domains (called weakly single-plateaued) are strictly larger than the set of single-plateaued preferences. However, their intersection, when M varies from zero to infinity, coincides with the set of single-plateaued preferences.
Resumo:
We analyze (non-deterministic) contests with anonymous contest success functions. There is no restriction on the number of contestants or on their valuations for the prize. We provide intuitive and easily verifiable conditions for the existence of an equilibrium with properties similar to the one of the (deterministic) all-pay auction. Since these conditions are fulfilled for a wide array of situations, the predictions of this equilibrium are very robust to the specific details of the contest. An application of this result contributes to fill a gap in the analysis of the popular Tullock rent- seeking game because it characterizes properties of an equilibrium for increasing returns to scale larger than two, for any number of contestants and in contests with or without a common value. Keywords: (non-) deterministic contest, all-pay auction, contest success functions. JEL Classification Numbers: C72 (Noncooperative Games), D72 (Economic Models of Political Processes: Rent-Seeking, Elections), D44 (Auctions).
Resumo:
In this study I try to explain the systemic problem of the low economic competitiveness of nuclear energy for the production of electricity by carrying out a biophysical analysis of its production process. Given the fact that neither econometric approaches nor onedimensional methods of energy analyses are effective, I introduce the concept of biophysical explanation as a quantitative analysis capable of handling the inherent ambiguity associated with the concept of energy. In particular, the quantities of energy, considered as relevant for the assessment, can only be measured and aggregated after having agreed on a pre-analytical definition of a grammar characterizing a given set of finite transformations. Using this grammar it becomes possible to provide a biophysical explanation for the low economic competitiveness of nuclear energy in the production of electricity. When comparing the various unit operations of the process of production of electricity with nuclear energy to the analogous unit operations of the process of production of fossil energy, we see that the various phases of the process are the same. The only difference is related to characteristics of the process associated with the generation of heat which are completely different in the two systems. Since the cost of production of fossil energy provides the base line of economic competitiveness of electricity, the (lack of) economic competitiveness of the production of electricity from nuclear energy can be studied, by comparing the biophysical costs associated with the different unit operations taking place in nuclear and fossil power plants when generating process heat or net electricity. In particular, the analysis focuses on fossil-fuel requirements and labor requirements for those phases that both nuclear plants and fossil energy plants have in common: (i) mining; (ii) refining/enriching; (iii) generating heat/electricity; (iv) handling the pollution/radioactive wastes. By adopting this approach, it becomes possible to explain the systemic low economic competitiveness of nuclear energy in the production of electricity, because of: (i) its dependence on oil, limiting its possible role as a carbon-free alternative; (ii) the choices made in relation to its fuel cycle, especially whether it includes reprocessing operations or not; (iii) the unavoidable uncertainty in the definition of the characteristics of its process; (iv) its large inertia (lack of flexibility) due to issues of time scale; and (v) its low power level.
Resumo:
Projecte de recerca elaborat a partir d’una estada a la Dublin Institute for Advanced Studies, Irlanda, entre setembre i desembre del 2009.En els últims anys s’ha realitzat un important avanç en la modelització tridimensional en magnetotel•lúrica (MT) gracies a l'augment d’algorismes d’inversió tridimensional disponibles. Aquests codis utilitzen diferents formulacions del problema (diferències finites, elements finits o equacions integrals), diverses orientacions del sistema de coordenades i, o bé en el conveni de signe, més o menys, en la dependència temporal. Tanmateix, les impedàncies resultants per a tots els valors d'aquests codis han de ser les mateixes una vegada que es converteixen a un conveni de signe comú i al mateix sistema de coordenades. Per comparar els resultats dels diferents codis hem dissenyat models diferents de resistivitats amb estructures tridimensional incrustades en un subsòl homogeni. Un requisit fonamental d’aquests models és que generin impedàncies amb valors importants en els elements de la diagonal, que no són menyspreables. A diferència dels casos del modelització de dades magnetotel.lúriques unidimensionals i bidimensionals, pel al cas tridimensional aquests elements de les diagonals del tensor d'impedància porten informació sobre l'estructura de la resistivitat. Un dels models de terreny s'utilitza per comparar els diferents algoritmes que és la base per posterior inversió dels diferents codis. Aquesta comparació va ser seguida de la inversió per recuperar el conjunt de dades d'una estructura coneguda.
Resumo:
Estudi retrospectiu per analitzar la incidència, factors de risc i tractament de la hemoglobinuria macroscòpica i oliguria després del tractament de malformacions venoses amb escleroteràpia. Un total de 475 procediments es van realitzar en 131 malalts usant etanol, sulfat tetradecil sòdic o ambdos. Hemoglobinuria temporal es va donar després del 34% de procediments i el 57% d’aquests es van asociar amb oliguria temporal. Aquest risc augmenta amb el increment de dosis. La resolució de la hemoglobinuria i oliguria va ser satisfactòria en tots els malalts. El risc d’hemoglobinuria augmenta a les malformacions que afecten les extremitats inferiors i a les de localitzacions mútiples.
Resumo:
Epipolar geometry is a key point in computer vision and the fundamental matrix estimation is the only way to compute it. This article surveys several methods of fundamental matrix estimation which have been classified into linear methods, iterative methods and robust methods. All of these methods have been programmed and their accuracy analysed using real images. A summary, accompanied with experimental results, is given
Resumo:
Recently, the surprising result that ab initio calculations on benzene and other planar arenes at correlated MP2, MP3, configuration interaction with singles and doubles (CISD), and coupled cluster with singles and doubles levels of theory using standard Pople’s basis sets yield nonplanar minima has been reported. The planar optimized structures turn out to be transition states presenting one or more large imaginary frequencies, whereas single-determinant-based methods lead to the expected planar minima and no imaginary frequencies. It has been suggested that such anomalous behavior can be originated by two-electron basis set incompleteness error. In this work, we show that the reported pitfalls can be interpreted in terms of intramolecular basis set superposition error (BSSE) effects, mostly between the C–H moieties constituting the arenes. We have carried out counterpoise-corrected optimizations and frequency calculations at the Hartree–Fock, B3LYP, MP2, and CISD levels of theory with several basis sets for a number of arenes. In all cases, correcting for intramolecular BSSE fixes the anomalous behavior of the correlated methods, whereas no significant differences are observed in the single-determinant case. Consequently, all systems studied are planar at all levels of theory. The effect of different intramolecular fragment definitions and the particular case of charged species, namely, cyclopentadienyl and indenyl anions, respectively, are also discussed
Resumo:
El dolor crònic pediàtric és un problema molt important. Malgrat que la informació disponible és molt menor que en adults, els informes publicats no deixen lloc a cap mena de dubte. Per una banda els treballs epidemiològics realitzats en la població general mostren que els problemes de dolor crònic són habituals entre la població infantil i adolescent, mentre que, per una altra, els estudis fets amb població clínica apunten que el dolor crònic pediàtric és causa important de desajust social i un dels problemes que més perjudiquen la qualitat de vida dels nens, i dels seus familiars, a tots els nivells. L’objectiu fonamental d’aquest treball era avançar en el oneixement dels factors psicosocials relacionats amb l’experiència del dolor crònic, de manera que a llarg termini aquesta informació ens permetés plantejar i contrastar programes de prevenció secundària pel dolor i la discapacitat crònics. Han participat un total de 92 joves amb edats compreses entre els 14 i 16 anys (79% de resposta positiva), dels quals el 64.2% eren noies. Majoritàriament experimentaven problemes de dolor abdominal. Els resultats han mostrat que, en efecte, els adolescents amb dolor crònic (dolor igual o superior a tres mesos) tenenuna pitjor qualitat de vida que els nois d’edat semblant però sense problemes crònics de dolor. Específicament, destaquen d’entre els factors estudiats: els pensaments catastròfics, l’estat afectiu, i certes actituds i alguns tipus d’estratègies d’afrontament dels nens. Les reaccions dels pares davant la conducta de dolor dels seus fills també resulta ser un factor de risc que cal considerar: les conductes dels pares tendents a minimitzar el problema estaven relacionades significativament amb el dolor i la discapacitat dels seus fills/es.
Resumo:
Delivery context-aware adaptative heterogenous systems. Currently, many types of devices that have gained access to the network is large and diverse. The different capabilities and characteristics of them, in addition to the different characteristics and preferences of users, have generated a new goal to overcome: how to adapt the contents taking into account this heterogeneity, known as the “delivery context.” The concepts of adaptation and accessibility have been widely discussed and have resulted in many proposals, standards and techniques designed to solve the problem, making it necessary to refine the analysis of the issue to be considered in the process of adaptation. We present a tour of the various proposals and standards that have marked the area of heterogeneous systems works, and others who have worked since the real-time interaction through agents based platforms. All targeted to solve a common goal: the delivery context
Resumo:
The Computational Biophysics Group at the Universitat Pompeu Fabra (GRIB-UPF) hosts two unique computational resources dedicated to the execution of large scale molecular dynamics (MD) simulations: (a) the ACMD molecular-dynamics software, used on standard personal computers with graphical processing units (GPUs); and (b) the GPUGRID. net computing network, supported by users distributed worldwide that volunteer GPUs for biomedical research. We leveraged these resources and developed studies, protocols and open-source software to elucidate energetics and pathways of a number of biomolecular systems, with a special focus on flexible proteins with many degrees of freedom. First, we characterized ion permeation through the bactericidal model protein Gramicidin A conducting one of the largest studies to date with the steered MD biasing methodology. Next, we addressed an open problem in structural biology, the determination of drug-protein association kinetics; we reconstructed the binding free energy, association, and dissaciociation rates of a drug like model system through a spatial decomposition and a Makov-chain analysis. The work was published in the Proceedings of the National Academy of Sciences and become one of the few landmark papers elucidating a ligand-binding pathway. Furthermore, we investigated the unstructured Kinase Inducible Domain (KID), a 28-peptide central to signalling and transcriptional response; the kinetics of this challenging system was modelled with a Markovian approach in collaboration with Frank Noe’s group at the Freie University of Berlin. The impact of the funding includes three peer-reviewed publication on high-impact journals; three more papers under review; four MD analysis components, released as open-source software; MD protocols; didactic material, and code for the hosting group.
Resumo:
In a distributed key distribution scheme, a set of servers helps a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some servers and some users has no information about the key of a noncorrupted group. In this work, we formalize the security analysis of one such scheme which was not considered in the original proposal. We prove the scheme is secure in the random oracle model, assuming that the Decisional Diffie-Hellman (DDH) problem is hard to solve. We also detail a possible modification of that scheme and the one in which allows us to prove the security of the schemes without assuming that a specific hash function behaves as a random oracle. As usual, this improvement in the security of the schemes is at the cost of an efficiency loss.