7,356 research outputs found
Quasi-exact solvability beyond the SL(2) algebraization
We present evidence to suggest that the study of one dimensional
quasi-exactly solvable (QES) models in quantum mechanics should be extended
beyond the usual \sla(2) approach. The motivation is twofold: We first show
that certain quasi-exactly solvable potentials constructed with the \sla(2)
Lie algebraic method allow for a new larger portion of the spectrum to be
obtained algebraically. This is done via another algebraization in which the
algebraic hamiltonian cannot be expressed as a polynomial in the generators of
\sla(2). We then show an example of a new quasi-exactly solvable potential
which cannot be obtained within the Lie-algebraic approach.Comment: Submitted to the proceedings of the 2005 Dubna workshop on
superintegrabilit
GAMES: A new Scenario for Software and Knowledge Reuse
Games are a well-known test bed for testing search algorithms and learning methods, and many authors have presented numerous reasons for the research in this area. Nevertheless, they have not received the attention they deserve as software projects.
In this paper, we analyze the applicability of software
and knowledge reuse in the games domain. In spite of the
need to find a good evaluation function, search algorithms
and interface design can be said to be the primary concerns.
In addition, we will discuss the current state of the main
statistical learning methods and how they can be addressed
from a software engineering point of view. So, this paper
proposes a reliable environment and adequate tools, necessary in order to achieve high levels of reuse in the games domain
Advanced Design of Semantic Web Portal: ODESeW2
This poster presents a rapid web application development framework to build semantic por-tals. This framework is composed of reusable views of semantic information, ontology views and an intelligent controller, as elements of the Model-View-Controller design paradigm
Genetic study in patients operated dentally and anesthetized with articaine-epinephrine
Aims: In this study we wanted to figure out if there was a correlation between OPRM1 N40D, TRPV1 I316M, TRPV1 I585V, NOS3 −786T>C and IL6 −174C>G polymorphisms and the response to locally applied articaine-epinephrine anesthetic.
Methods: In this observational study, 114 oral cell samples of patients anesthetized with articaine-epinephrine (54 from men 60 from women), were collected from dental centers in Madrid (Spain). High molecular weight DNA was obtained from oral mucosa cells. The analysis of OPRM1 N40D (rs1799971), TRPV1 I316M (rs222747), TRPV1 I585V (rs8065080) and IL6 −174C>G polymorphism was performed through real-time PCR allelic discrimination using TaqMan probes. Polymorphism NOS3 −786T> C (rs2070744) was analyzed using RFLP-PCR.
Results: The studied polymorphisms are involved neither in the response to the anesthetic, nor in the intensity of perceived dental pain. However, in a subset of female patients we found that TRPV1 I316M was associated with a delayed onset of anesthesia.
Conclusions: There is no association among these polymorphisms and the time elapsed between the application of the anesthetic and the onset of its effect
An approach to emotion recognition in single-channel EEG signals: a mother child interaction
In this work, we perform a first approach to emotion recognition from EEG single channel signals extracted in four (4) mother-child dyads experiment in developmental psychology -- Single channel EEG signals are analyzed and processed using several window sizes by performing a statistical analysis over features in the time and frequency domains -- Finally, a neural network obtained an average accuracy rate of 99% of classification in two emotional states such as happiness and sadness20th Argentinean Bioengineering Society Congress, SABI 2015 (XX Congreso Argentino de Bioingeniería y IX Jornadas de Ingeniería Clínica)28–30 October 2015, San Nicolás de los Arroyos, Argentin
Searching for a Time Ontology for Semantic Web Applications
We present our experience on reusing time ontologies in Fund Finder, a semantic web application of the EU Esperonto project. On the one hand, we show a set of time ontologies implemented in different machine readable languages. Such ontologies are analyzed considering a series of features typical of time models (e.g., if they consider different granularities or different time zones). On the other hand, we present the specification of time modeling necessities for Fund Finder. Finally, we choose the ontology which fits best with the specifications
- …