Design and implementation of a modular interface to integrate CLP and tabled execution

Logic programming (LP) is a family of high-level programming languages which provides high expressive power. With LP, the programmer writes the properties of the result and / or executable specifications instead of detailed computation steps. Logic programming systems which feature tabled execution and constraint logic programming have been shown to increase the declarativeness and efficiency of Prolog, while at the same time making it possible to write very expressive programs. Tabled execution avoids infinite failure in some cases, while improving efficiency in programs which repeat computations. CLP reduces the search tree and brings the power of solving (in)equations over arbitrary domains. Similarly to the LP case, CLP systems can also benefit from the power of tabling. Previous implementations which take ful advantage of the ideas behind tabling (e.g., forcing suspension, answer subsumption, etc. wherever it is necessary to avoid recomputation and terminate whenever possible) did not offer a simple, well-documented, easy-to-understand interface. This would be necessary to make the integratation of arbitrary CLP solvers into existing tabling systems possible. This clearly hinders a more widespread usage of the combination of both facilities. In this thesis we examine the requirements that a constraint solver must fulfill in order to be interfaced with a tabling system. We propose and implement a framework, which we have called Mod TCLP, with a minimal set of operations (e.g., entailment checking and projection) which the constraint solver has to provide to the tabling engine. We validate the design of Mod TCLP by a series of use cases: we re-engineer a previously existing tabled constrain domain (difference constraints) which was connected in an ad-hoc manner with the tabling engine in Ciao Prolog; we integrateHolzbauer’s CLP(Q) implementationwith Ciao Prolog’s tabling engine; and we implement a constraint solver over (finite) lattices. We evaluate its performance with several benchmarks that implement a simple abstract interpreter whose fixpoint is reached by means of tabled execution, and whose domain operations are handled by the constraint over (finite) lattices, where TCLP avoids recomputing subsumed abstractions.---ABSTRACT---La programación lógica con restricciones (CLP) y la tabulación son extensiones de la programación lógica que incrementan la declaratividad y eficiencia de Prolog, al mismo tiempo que hacen posible escribir programasmás expresivos. Las implementaciones anteriores que integran completamente ambas extensiones, incluyendo la suspensión de la ejecución de objetivos siempre que sea necesario, la implementación de inclusión (subsumption) de respuestas, etc., en todos los puntos en los que sea necesario para evitar recomputaciones y garantizar la terminación cuando sea posible, no han proporcionan una interfaz simple, bien documentada y fácil de entender. Esta interfaz es necesaria para permitir integrar resolutores de CLP arbitrarios en el sistema de tabulación. Esto claramente dificulta un uso más generalizado de la integración de ambas extensiones. En esta tesis examinamos los requisitos que un resolutor de restricciones debe cumplir para ser integrado con un sistema de tabulación. Proponemos un esquema (y su implementación), que hemos llamadoMod TCLP, que requiere un reducido conjunto de operaciones (en particular, y entre otras, entailment y proyección de almacenes de restricciones) que el resolutor de restricciones debe ofrecer al sistema de tabulación. Hemos validado el diseño de Mod TCLP con una serie de casos de uso: la refactorización de un sistema de restricciones (difference constraints) previamente conectado de un modo ad-hoc con la tabulación de Ciao Prolog; la integración del sistema de restricciones CLP(Q) de Holzbauer; y la implementación de un resolutor de restricciones sobre retículos finitos. Hemos evaluado su rendimiento con varios programas de prueba, incluyendo la implementación de un intérprete abstracto que alcanza su punto fijo mediante el sistema de tabulación y en el que las operaciones en el dominio son realizadas por el resolutor de restricciones sobre retículos (finitos) donde TCLP evita la recomputación de valores abstractos de las variables ya contenidos en llamadas anteriores.

Integration of modular process simulators under the Generalized Disjunctive Programming framework for the structural flowsheet optimization

The optimization of chemical processes where the flowsheet topology is not kept fixed is a challenging discrete-continuous optimization problem. Usually, this task has been performed through equation based models. This approach presents several problems, as tedious and complicated component properties estimation or the handling of huge problems (with thousands of equations and variables). We propose a GDP approach as an alternative to the MINLP models coupled with a flowsheet program. The novelty of this approach relies on using a commercial modular process simulator where the superstructure is drawn directly on the graphical use interface of the simulator. This methodology takes advantage of modular process simulators (specially tailored numerical methods, reliability, and robustness) and the flexibility of the GDP formulation for the modeling and solution. The optimization tool proposed is successfully applied to the synthesis of a methanol plant where different alternatives are available for the streams, equipment and process conditions.

Development of Educational Ontology for C-Programming

Development of educational ontologies is a step towards creation of sharable and reusable adaptive educational systems. Ontology as a conceptual courseware structure may work as a mind tool for effective teaching and as a visual navigation interface to the learning objects. The paper discusses an approach to the practical ontology development and presents the designed ontology for teaching/learning C programming.

Uma interface para o controle de robôs móveis por intermédio de gestos

The main objective of this work was to enable the recognition of human gestures through the development of a computer program. The program created captures the gestures executed by the user through a camera attached to the computer and sends it to the robot command referring to the gesture. They were interpreted in total ve gestures made by human hand. The software (developed in C ++) widely used the computer vision concepts and open source library OpenCV that directly impact the overall e ciency of the control of mobile robots. The computer vision concepts take into account the use of lters to smooth/blur the image noise reduction, color space to better suit the developer's desktop as well as useful information for manipulating digital images. The OpenCV library was essential in creating the project because it was possible to use various functions/procedures for complete control lters, image borders, image area, the geometric center of borders, exchange of color spaces, convex hull and convexity defect, plus all the necessary means for the characterization of imaged features. During the development of the software was the appearance of several problems, as false positives (noise), underperforming the insertion of various lters with sizes oversized masks, as well as problems arising from the choice of color space for processing human skin tones. However, after the development of seven versions of the control software, it was possible to minimize the occurrence of false positives due to a better use of lters combined with a well-dimensioned mask size (tested at run time) all associated with a programming logic that has been perfected over the construction of the seven versions. After all the development is managed software that met the established requirements. After the completion of the control software, it was observed that the overall e ectiveness of the various programs, highlighting in particular the V programs: 84.75 %, with VI: 93.00 % and VII with: 94.67 % showed that the nal program performed well in interpreting gestures, proving that it was possible the mobile robot control through human gestures without the need for external accessories to give it a better mobility and cost savings for maintain such a system. The great merit of the program was to assist capacity in demystifying the man set/machine therefore uses an easy and intuitive interface for control of mobile robots. Another important feature observed is that to control the mobile robot is not necessary to be close to the same, as to control the equipment is necessary to receive only the address that the Robotino passes to the program via network or Wi-Fi.

Transactions and schema evolution in a persistent object-oriented programming system

Applications are subject of a continuous evolution process with a profound impact on their underlining data model, hence requiring frequent updates in the applications' class structure and database structure as well. This twofold problem, schema evolution and instance adaptation, usually known as database evolution, is addressed in this thesis. Additionally, we address concurrency and error recovery problems with a novel meta-model and its aspect-oriented implementation. Modern object-oriented databases provide features that help programmers deal with object persistence, as well as all related problems such as database evolution, concurrency and error handling. In most systems there are transparent mechanisms to address these problems, nonetheless the database evolution problem still requires some human intervention, which consumes much of programmers' and database administrators' work effort. Earlier research works have demonstrated that aspect-oriented programming (AOP) techniques enable the development of flexible and pluggable systems. In these earlier works, the schema evolution and the instance adaptation problems were addressed as database management concerns. However, none of this research was focused on orthogonal persistent systems. We argue that AOP techniques are well suited to address these problems in orthogonal persistent systems. Regarding the concurrency and error recovery, earlier research showed that only syntactic obliviousness between the base program and aspects is possible. Our meta-model and framework follow an aspect-oriented approach focused on the object-oriented orthogonal persistent context. The proposed meta-model is characterized by its simplicity in order to achieve efficient and transparent database evolution mechanisms. Our meta-model supports multiple versions of a class structure by applying a class versioning strategy. Thus, enabling bidirectional application compatibility among versions of each class structure. That is to say, the database structure can be updated because earlier applications continue to work, as well as later applications that have only known the updated class structure. The specific characteristics of orthogonal persistent systems, as well as a metadata enrichment strategy within the application's source code, complete the inception of the meta-model and have motivated our research work. To test the feasibility of the approach, a prototype was developed. Our prototype is a framework that mediates the interaction between applications and the database, providing them with orthogonal persistence mechanisms. These mechanisms are introduced into applications as an {\it aspect} in the aspect-oriented sense. Objects do not require the extension of any super class, the implementation of an interface nor contain a particular annotation. Parametric type classes are also correctly handled by our framework. However, classes that belong to the programming environment must not be handled as versionable due to restrictions imposed by the Java Virtual Machine. Regarding concurrency support, the framework provides the applications with a multithreaded environment which supports database transactions and error recovery. The framework keeps applications oblivious to the database evolution problem, as well as persistence. Programmers can update the applications' class structure because the framework will produce a new version for it at the database metadata layer. Using our XML based pointcut/advice constructs, the framework's instance adaptation mechanism is extended, hence keeping the framework also oblivious to this problem. The potential developing gains provided by the prototype were benchmarked. In our case study, the results confirm that mechanisms' transparency has positive repercussions on the programmer's productivity, simplifying the entire evolution process at application and database levels. The meta-model itself also was benchmarked in terms of complexity and agility. Compared with other meta-models, it requires less meta-object modifications in each schema evolution step. Other types of tests were carried out in order to validate prototype and meta-model robustness. In order to perform these tests, we used an OO7 small size database due to its data model complexity. Since the developed prototype offers some features that were not observed in other known systems, performance benchmarks were not possible. However, the developed benchmark is now available to perform future performance comparisons with equivalent systems. In order to test our approach in a real world scenario, we developed a proof-of-concept application. This application was developed without any persistence mechanisms. Using our framework and minor changes applied to the application's source code, we added these mechanisms. Furthermore, we tested the application in a schema evolution scenario. This real world experience using our framework showed that applications remains oblivious to persistence and database evolution. In this case study, our framework proved to be a useful tool for programmers and database administrators. Performance issues and the single Java Virtual Machine concurrent model are the major limitations found in the framework.

Spotter: towards a unified search interface in IDEs

Program comprehension requires developers to reason about many kinds of highly interconnected software entities. Dealing with this reality prompts developers to continuously intertwine searching and navigation. Nevertheless, most integrated development environments (IDEs) address searching by means of many disconnected search tools, making it difficult for developers to reuse search results produced by one search tool as input for another search tool. This forces developers to spend considerable time manually linking disconnected search results. To address this issue we propose Spotter, a model for expressing and combining search tools in a unified way. The current implementation shows that Spotter can unify a wide range of search tools. More information about Spotter can be found at scg.unibe.ch/research/moldablespotter

Interface Between Intellectual Disability And Mental Health: Hermeneutic Review.

A literature review was conducted aiming to understand the interface between the Intellectual Disability and Mental Health fields and to contribute to mitigating the path of institutionalizing individuals with intellectual deficiencies. The so-called dual diagnosis phenomenon remains underestimated in Brazil but is the object of research and specific public policy internationally. This phenomenon alerts us to the prevalence of mental health problems in those with intellectual disabilities, limiting their social inclusion. The findings reinforce the importance of this theme and indicate possible diagnostic invisibility of the development of mental illness in those with intellectual disabilities in Brazil, which may contribute to sustaining psychiatric institutionalization of this population. 

Quantificação de fluxos de mercúrio gasoso na interface solo/atmosfera utilizando câmara de fluxo dinâmica: aplicação na bacia do Rio Negro

Gaseous mercury sampling conditions were optimized and a dynamic flux chamber was used to measure the air/surface exchange of mercury in some areas of the Negro river basin with different vegetal coverings. At the two forest sites (flooding and non-flooding), low mercury fluxes were observed: maximum of 3 pmol m-2 h-1 - day and minimum of -1 pmol m-2 h-1 - night. At the deforested site, the mercury fluxes were higher and always positive: maximum of 26 pmol m-2 h-1 - day and 17 pmol m-2 h-1 - night. Our results showed that deforestation could be responsible for significantly increasing soil Hg emissions, mainly because of the high soil temperatures reached at deforested sites.

Ultrastructure of the Interface between Periodontal Tissues and Titanium Mini-Implants

Objective: To describe the ultrastructure of the interface between periodontal tissues and titanium mini-implants in rat mandibles. Materials and Methods: A titanium mini-implant was placed between the buccal roots of the mandibular first molar of 24 adult rats. After 21, 30, 45, 60, 90, and 120 days of implantation, the mandibular portion was removed and fixed in cacodylate-buffered 2% glutaraldehyde + 2.5% formaldehyde. The material was decalcified and processed for scanning and transmission electron microscopy. Results: Ultrastructural analysis revealed a thin cementum-like layer at longer times after implantation at the areas in which the periodontal ligament was in contact with the implant. Conclusions: The alveolar bone and the periodontal ligament reorganized their constituents around the implant, and a thin cementum-like layer was formed at longer times after implantation at the areas in which the periodontal ligament was in contact with the implant. (Angle Orthod. 2010;80:459-435.)

Accurate prediction of the Si/SiO(2) interface band offset using the self-consistent ab initio DFT/LDA-1/2 method

We use the density functional theory/local-density approximation (DFT/LDA)-1/2 method [L. G. Ferreira , Phys. Rev. B 78, 125116 (2008)], which attempts to fix the electron self-energy deficiency of DFT/LDA by half-ionizing the whole Bloch band of the crystal, to calculate the band offsets of two Si/SiO(2) interface models. Our results are similar to those obtained with a ""state-of-the-art"" GW approach [R. Shaltaf , Phys. Rev. Lett. 100, 186401 (2008)], with the advantage of being as computationally inexpensive as the usual DFT/LDA. Our band gap and band offset predictions are in excellent agreement with experiments.

Atomistic molecular dynamics study of interface formation: Al on poly(p-phenylene vinylene)

We model interface formation by metal deposition on the conjugated polymer poly-para-phenylene vinylene, studying direct aluminum and layered aluminum-calcium structures Al/PPV and Al/Ca/PPV. To do that we use classical molecular dynamics simulations, checked by ab initio density-functional theory calculations, for selected relevant configurations. We find that Al not only migrates easily into the film, with a strong charge transfer to the neighboring chains, but also promotes rearrangement of the polymer in the interfacial region to the hexagonal structure. On the other hand, our results indicate that a thin Ca layer is sufficient to protect the film and maintain a well-defined metal/polymer interface, and that also a thin Al capping layer may protect the whole from environmental degradation.

Soliton dynamics at an interface between a uniform medium and a nonlinear optical lattice

We study trapping and propagation of a matter-wave soliton through the interface between uniform medium and a nonlinear optical lattice. Different regimes for transmission of a broad and a narrow solitons are investigated. Reflections and transmissions of solitons are predicted as a function of the lattice phase. The existence of a threshold in the amplitude of the nonlinear optical lattice, separating the transmission and reflection regimes, is verified. The localized nonlinear surface state, corresponding to the soliton trapped by the interface, is found. Variational approach predictions are confirmed by numerical simulations for the original Gross-Pitaevskii equation with nonlinear periodic potentials.

Substrate/semiconductor interface effects on the emission efficiency of luminescent polymers

The importance of interface effects for organic devices has long been recognized, but getting detailed knowledge of the extent of such effects remains a major challenge because of the difficulty in distinguishing from bulk effects. This paper addresses the interface effects on the emission efficiency of poly(p-phenylene vinylene) (PPV), by producing layer-by-layer (LBL) films of PPV alternated with dodecylbenzenesulfonate. Films with thickness varying from similar to 15 to 225 nm had the structural defects controlled empirically by converting the films at two temperatures, 110 and 230 degrees C, while the optical properties were characterized by using optical absorption, photoluminescence (PL), and photoluminescence excitation spectra. Blueshifts in the absorption and PL spectra for LBL films with less than 25 bilayers (<40-50 nm) pointed to a larger number of PPV segments with low conjugation degree, regardless of the conversion temperature. For these thin films, the mean free-path for diffusion of photoexcited carriers decreased, and energy transfer may have been hampered owing to the low mobility of the excited carriers. The emission efficiency was then found to depend on the concentration of structural defects, i.e., on the conversion temperature. For thick films with more than 25 bilayers, on the other hand, the PL signal did not depend on the PPV conversion temperature. We also checked that the interface effects were not caused by waveguiding properties of the excited light. Overall, the electronic states at the interface were more localized, and this applied to film thickness of up to 40-50 nm. Because this is a typical film thickness in devices, the implication from the findings here is that interface phenomena should be a primary concern for the design of any organic device. (C) 2011 American Institute of Physics. [doi:10.1063/1.3622143]