Adaptivity in programming languages

A programming style can be seen as a particular model of shaping thought or a special way of codifying language to solve a problem. An adaptive device is made up of an underlying formalism, for instance, an automaton, a grammar, a decision tree, etc., and an adaptive mechanism, responsible for providing features for self-modification. Adaptive languages are obtained by using some programming language as the device’s underlying formalism. The conception of such languages calls for a new programming style, since the application of adaptive technology in the field of programming languages suggests a new way of thinking. Adaptive languages have the basic feature of allowing the expression of programs which self-modifying through adaptive actions at runtime. With the adaptive style, programming language codes can be structured in such a way that the codified program therein modifies or adapts itself towards the needs of the problem. The adaptive programming style may be a feasible alternate way to obtain self-modifying consistent codes, which allow its use in modern applications for self-modifying code.

Adaptive device with underlying mechanism defined by a programming language

An adaptive device is made up of an underlying mechanism, for instance, an automaton, a grammar, a decision tree, etc., to which is added an adaptive mechanism, responsible for allowing a dynamic modification in the structure of the underlying mechanism. This article aims to investigate if a programming language can be used as an underlying mechanism of an adaptive device, resulting in an adaptive language.

Conception of adaptive programming languages

Adaptive devices show the characteristic of dynamically change themselves in response to input stimuli with no interference of external agents. Occasional changes in behaviour are immediately detected by the devices, which right away react spontaneously to them. Chronologically such devices derived from researches in the field of formal languages and automata. However, formalism spurred applications in several other fields. Based on the operation of adaptive automata, the elementary ideas generanting programming adaptive languages are presented.

Adaptive languages and a new programming style

A programming style can be seen as a particular model of shaping thought or a special way of codifying language to solve a problem. Adaptive languages have the basic feature of allowing the expression of programs which self-modifying through adaptive actions at runtime. The conception of such languages calls for a new programming style, since the application of adaptive technology in the field of programming languages suggests a new way of thinking. With the adaptive style, programming language codes can be structured in such a way that the codified program therein modifies or adapts itself towards the needs of the problem. The adaptive programming style may be a feasible alternate way to obtain self-modifying consistent codes, which allow its use in modern applications for self-modifying code.

Using adaptive automata in a multi-paradigm programming environment

In this paper the architecture of an experimental multiparadigmatic programming environment is sketched, showing how its parts combine together with application modules in order to perform the integration of program modules written in different programming languages and paradigms. Adaptive automata are special self-modifying formal state machines used as a design and implementation tool in the representation of complex systems. Adaptive automata have been proven to have the same formal power as Turing Machines. Therefore, at least in theory, arbitrarily complex systems may be modeled with adaptive automata. The present work briefly introduces such formal tool and presents case studies showing how to use them in two very different situations: the first one, in the name management module of a multi-paradigmatic and multi-language programming environment, and the second one, in an application program implementing an adaptive automaton that accepts a context-sensitive language.

A review of particle transport theory in a binary stochastic medium

A finalidade deste trabalho ´e apresentar uma revis˜ao da teoria do transporte de part´ıculas em meios compostos por uma mistura aleat´oria bin´aria. Para atingir este objetivo n´os apresentamos brevemente alguns conceitos b´asicos de teoria do transporte, e ent˜ao discutimos em detalhes a deriva¸c˜ao de duas abordagens desenvolvidas para a solu¸c˜ao de tais problemas: os modelos de mistura atˆomica e de Levermore-Pomraning. Providenciamos ainda, com o uso da formula¸c˜ao LTSN, compara ¸c˜oes num´ericas destes modelos com resultados de benchmark gerados atrav´es de um processo de Monte Carlo.

Generalized linear mixed models for the genetic evaluation of binary reproductive traits: a simulation study

The objective of this study was to evaluate the use of probit and logit link functions for the genetic evaluation of early pregnancy using simulated data. The following simulation/analysis structures were constructed: logit/logit, logit/probit, probit/logit, and probit/probit. The percentages of precocious females were 5, 10, 15, 20, 25 and 30% and were adjusted based on a change in the mean of the latent variable. The parametric heritability (h²) was 0.40. Simulation and genetic evaluation were implemented in the R software. Heritability estimates (ĥ²) were compared with h² using the mean squared error. Pearson correlations between predicted and true breeding values and the percentage of coincidence between true and predicted ranking, considering the 10% of bulls with the highest breeding values (TOP10) were calculated. The mean ĥ² values were under- and overestimated for all percentages of precocious females when logit/probit and probit/logit models used. In addition, the mean squared errors of these models were high when compared with those obtained with the probit/probit and logit/logit models. Considering ĥ², probit/probit and logit/logit were also superior to logit/probit and probit/logit, providing values close to the parametric heritability. Logit/probit and probit/logit presented low Pearson correlations, whereas the correlations obtained with probit/probit and logit/logit ranged from moderate to high. With respect to the TOP10 bulls, logit/probit and probit/logit presented much lower percentages than probit/probit and logit/logit. The genetic parameter estimates and predictions of breeding values of the animals obtained with the logit/logit and probit/probit models were similar. In contrast, the results obtained with probit/logit and logit/probit were not satisfactory. There is need to compare the estimation and prediction ability of logit and probit link functions.

Enumeração de espectro de distâncias de esquemas de modulação codificada em treliça empregando codificação turbo

In this work, a performance analysis of transmission schemes employing turbo trellis coded modulation. In general, the performance analysis of such schemes is guided by evaluating the error probability of these schemes. The exact evaluation of this probability is very complex and inefficient from the computational point of view, a widely used alternative is the use of union bound of error probability, because of its easy implementation and computational produce bounds that converge quickly. Since it is the union bound, it should use to expurge some elements of distance spectrum to obtain a tight bound. The main contribution of this work is that the listing proposal is carried out from the puncturing at the level of symbol rather than bit-level as in most works of literature. The main reason for using the symbol level puncturing lies in the fact that the enummerating function of the turbo scheme is obtained directly from complex sequences of signals through the trellis and not indirectly from the binary sequences that require further binary to complex mapping, as proposed by previous works. Thus, algorithms can be applied through matrix from the adjacency matrix, which is obtained by calculating the distances of the complex sequences of the trellis. This work also presents two matrix algorithms for state reduction and the evaluation of the transfer function of this. The results presented in comparisons of the bounds obtained using the proposed technique with some turbo codes of the literature corroborate the proposition of this paper that the expurgated bounds obtained are quite tight and matrix algorithms are easily implemented in any programming software language

Three-Dimensional Semiautomatic Road Extraction From a High-Resolution Aerial Image by Dynamic-Programming Optimization in the Object Space

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Rheological, mechanical and mucoadhesive properties of thermoresponsive, bioadhesive binary mixtures composed of poloxamer 407 and carbopol 974P designed as platforms for implantable drug delivery systems for use in the oral cavity

This study described the formulation and characterisation of the viscoelastic, mechanical and mucoadhesive properties of thermoresponsive, binary polymeric systems composed of poloxamer (P407) and poly(acrylic acid, C974P) that were designed for use as a drug delivery platform within the oral cavity. Monopolymeric and binary polymeric formulations were prepared containing 10, 15 and 20% (w/w) poloxamer (407) and 0.10-0.25% (w/w) poly(acrylic acid, 934P). The flow theological and viscoelastic properties of the formulations were determined using controlled stress and oscillatory rheometry, respectively, the latter as a function of temperature. The mechanical and mucoadhesive properties (namely the force required to break the bond between the formulation and a pre-hydrated mucin disc) were determined using compression and tensile analysis, respectively. Binary systems composed of 10% (w/w) P407 and C934P were elastoviscous, were easily deformed under stress and did not exhibit mucoadhesion. Formulations containing 15 or 20% (w/w) Pluronic P407 and C934P exhibited a sol-gel temperature T(sol/gel), were viscoelastic and offered high elasticity and resistance to deformation at 37 degrees C. Conversely these formulations were elastoviscous and easily deformed at temperatures below the sol-gel transition temperature. The sol-gel transition temperatures of systems containing 15% (w/w) P407 were unaffected by the presence of C934P; however, increasing the concentration of C934P decreased the T(sol/gel) in formulations containing 20%(w/w) P407. Rheological synergy between P407 and C934P at 37 degrees C was observed and was accredited to secondary interactions between these polymers, in addition to hydrophobic interactions between P407 micelles. Importantly, formulations composed of 20% (w/w) P407 and C934P exhibited pronounced mucoadhesive properties. The ease of administration (below the T(sol/gel)) in conjunction with the viscoelastic (notably high elasticity) and mucoadhesive properties (at body temperature) render the formulations composed of 20% (w/w) P407 and C934P as potentially useful platforms for mucoadhesive, controlled topical drug delivery within the oral cavity. (c) 2009 Published by Elsevier B.V.

Influence of Heat Treatment and Oxygen Doping on the Mechanical Properties and Biocompatibility of Titanium-Niobium Binary Alloys

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Influence of the Substitutional Solute on the Mechanical Properties of Ti-Nb Binary Alloys for Biomedical Use

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)