Dez anos de CLP : legislação participativa ou participação legislativa?

Analisa a atuação da Comissão de Legislação Participativa da Câmara dos Deputados (CLP) em sua primeira década de existência. A partir de dados referentes às atividades desenvolvidas pelo colegiado, aponta o perfil das entidades da sociedade civil organizada que atuaram na CLP, os resultados obtidos até então, bem como os entraves e as contribuições que o colegiado oferece à participação social no processo legislativo. Aborda conceitos referentes à participação popular e democracia direta e participativa como exercício de cidadania política.

Solução da equação de difusão-advecção para uma CLP não-homogênea e não-estacionária pelo método GILTT

Neste trabalho é apresentada a solução da equação de difusão-advecção transiente para simular a dispersão de poluentes na Camada Limite Planetária. A solução é obtida através do método analítico GILTT (Generalized Integral Laplace Transform Technique) e da técnica de inversão numérica da quadratura de Gauss. A validação da solução é comprovada utilizando as concentraçãos obtidas a partir do modelo com as obtidas experimentalmente pelo Experimento de Copenhagen. Nesta comparação foram utilizados os perfis de vento potencial e logaritmo e os parâmetros de turbulência propostos por Degrazia et al (1997) [19] e (2002) [17]. Os melhores resultados foram obtidos utilizando o perfil de vento potencial e o coeficiente de difusão propostos por Degrazia et al (1997). A influência da velocidade vertical é mostrada através do comportamento das concentrações de poluentes na pluma. Além disso, as velocidades verticais e longitudinais geradas pelo Large Eddy Simulation (LES) foram colocadas no modelo para poder simular uma camada limite turbulenta mais realística, a qual apresentou resultados satisfatórios quando comparados com os disponíveis na literatura.

Participação social no processo legislativo federal : um estudo da Comissão de Legislação Participativa (CLP), da Comissão de Direitos Humanos e Legislação Participativa (CDH) e da iniciativa popular de lei

Esta pesquisa tem como objetivo verificar se as Comissões de Legislação Participativa da Câmara dos Deputados e do Senado Federal facilitaram a participação social no processo legislativo frente ao tradicional instituto da Iniciativa Popular de lei. Essa investigação será pautada pelo estudo dogmático do processo legislativo federal; pela investigação de como a participação social está prescrita na Constituição Federal e nos Regimentos Internos das Casas do Legislativo, visando constatar como a participação política se implementa no processo de produção legislativa; ademais do estudo sobre a relação entre representação e participação. Para tanto, foi utilizada revisão bibliográfica, análise documental, levantamento de dados, estudo de caso e entrevistas. A pesquisa realizada permite afirmar que as Comissões facilitaram a participação social na produção legislativa no que se refere à eliminação de parte dos requisitos formais que a obstaculizavam via Iniciativa Popular; além de ampliar o rol dos tipos de proposições legislativas que a sociedade pode apresentar. Entretanto, esses novos mecanismos reproduziram limitações que a Iniciativa Popular apresenta, ademais de desconsiderar na sua estruturação elementos essenciais à consecução de um processo legislativo efetivamente participativo, os quais são contemplados pelo instituto tradicional, permitindo, então, afirmar que as Comissões são inovações institucionais limitadas frente ao instituto da Iniciativa Popular.

Construção,modelagem e controle de um pêndulo invertido com CLP e software scada

Pós-graduação em Engenharia Elétrica - FEIS

Febrile response induced by cecal ligation and puncture (CLP) in rats: involvement of prostaglandin E-2 and cytokines

The purpose of the present study was to better understand the events involved in the febrile response induced by cecal ligation and puncture (CLP), a complex infectious process. To this end, we conducted in vivo experiments in rats examining (1) fever development, (2) bacterial number in the infection focus and in blood, (3) peripheral and hypothalamic synthesis of cytokines, (4) hypothalamic and cerebrospinal fluid (CSF) synthesis of prostaglandin E-2 (PGE(2)), (5) the effect of anti-IL-6 antibody on fever, and (6) the effect of celecoxib on fever and hypothalamic synthesis of PGE(2) after CLP induction. We found that CLP promotes fever and animal death depending on the number of punctures. The peak of CLP-induced fever overlapped with the maximal increase in the number of bacteria in the infectious focus and blood, which occurred at 6 and 12 h. The peak of the febrile response also coincided with increased amounts of interleukin (IL)-1 beta, IL-6 and IL-10 in the peritoneal exudate and serum; IL-6 in the hypothalamus and PGE(2) in the CSF and predominantly in the hypothalamus. Moreover, intracerebroventricularly injected anti-IL-6 antibody reduced the febrile response while celecoxib reduced the fever and PGE(2) amount in the hypothalamus induced by CLP. Tumor necrosis factor (TNF)-alpha peaked at 3 h at all sites studied. Conversely, IL-10 concentration decreased in the hypothalamus. These findings show that the peak of CLP-induced fever is accompanied by an increase of bacteria in peritoneal fluid (local infection) and blood; local synthesis of pyrogenic (IL-1 beta, IL-6) and antipyretic (IL-10) cytokines and central production of IL-6 and PGE(2), suggesting that these last are the central mediators of this response.

Independence in CLP Languages

Studying independence of goals has proven very useful in the context of logic programming. In particular, it has provided a formal basis for powerful automatic parallelization tools, since independence ensures that two goals may be evaluated in parallel while preserving correctness and eciency. We extend the concept of independence to constraint logic programs (CLP) and prove that it also ensures the correctness and eciency of the parallel evaluation of independent goals. Independence for CLP languages is more complex than for logic programming as search space preservation is necessary but no longer sucient for ensuring correctness and eciency. Two additional issues arise. The rst is that the cost of constraint solving may depend upon the order constraints are encountered. The second is the need to handle dynamic scheduling. We clarify these issues by proposing various types of search independence and constraint solver independence, and show how they can be combined to allow dierent optimizations, from parallelism to intelligent backtracking. Sucient conditions for independence which can be evaluated \a priori" at run-time are also proposed. Our study also yields new insights into independence in logic programming languages. In particular, we show that search space preservation is not only a sucient but also a necessary condition for ensuring correctness and eciency of parallel execution.

CLP Projection for Constraint Handling Rules

This paper introduces and studies the notion of CLP projection for Constraint Handling Rules (CHR). The CLP projection consists of a naive translation of CHR programs into Constraint Logic Programs (CLP). We show that the CLP projection provides a safe operational and declarative approximation for CHR programs. We demónstrate moreover that a confluent CHR program has a least model, which is precisely equal to the least model of its CLP projection (closing henee a ten year-old conjecture by Abdenader et al.). Finally, we illustrate how the notion of CLP projection can be used in practice to apply CLP analyzers to CHR. In particular, we show results from applying AProVE to prove termination, and CiaoPP to infer both complexity upper bounds and types for CHR programs.

A generic persistence model for CLP systems (and two useful implementations)

This paper describes a model of persistence in (C)LP languages and two different and practically very useful ways to implement this model in current systems. The fundamental idea is that persistence is a characteristic of certain dynamic predicates (Le., those which encapsulate state). The main effect of declaring a predicate persistent is that the dynamic changes made to such predicates persist from one execution to the next one. After proposing a syntax for declaring persistent predicates, a simple, file-based implementation of the concept is presented and some examples shown. An additional implementation is presented which stores persistent predicates in an external datábase. The abstraction of the concept of persistence from its implementation allows developing applications which can store their persistent predicates alternatively in files or databases with only a few simple changes to a declaration stating the location and modality used for persistent storage. The paper presents the model, the implementation approach in both the cases of using files and relational databases, a number of optimizations of the process (using information obtained from static global analysis and goal clustering), and performance results from an implementation of these ideas.

A generic persistence model for CLP systems

This paper describes a model of persistence in (C)LP languages and two different and practically very useful ways to implement this model in current systems. The fundamental idea is that persistence is a characteristic of certain dynamic predicates (i.e., those which encapsulate state). The main effect of declaring a predicate persistent is that the dynamic changes made to such predicates persist from one execution to the next one. After proposing a syntax for declaring persistent predicates, a simple, file-based implementation of the concept is presented and some examples shown. An additional implementation is presented which stores persistent predicates in an external database. The abstraction of the concept of persistence from its implementation allows developing applications which can store their persistent predicates alternatively in files or databases with only a few simple changes to a declaration stating the location and modality used for persistent storage. The paper presents the model, the implementation approach in both the cases of using files and relational databases, a number of optimizations of the process (using information obtained from static global analysis and goal clustering), and performance results from an implementation of these ideas.

Towards independent and-parallelism in CLP

In this paper we propose a complete scheme for automatic exploitation of independent and-parallelism in CLP programs. We first discuss the new problems involved because of the different properties of the independence notions applicable to CLP. We then show how independence can be derived from a number of standard analysis domains for CLP. Finally, we perform a preliminary evaluation of the efficiency, accuracy, and effectiveness of the approach by implementing a parallehzing compiler for CLP based on the proposed ideas and applying it on a number of CLP benchmarks.

Towards a concurrent semantics-based analysis of CC and CLP. principles and practice of constraint programming

Abstract is not available.

A practical approach to the global analysis of CLP programs

This paper presents and illustrates with an example a practical approach to the dataflow analysis of programs written in constraint logic programming (CLP) languages using abstract interpretation. It is first argued that, from the framework point of view, it sufnces to propose relatively simple extensions of traditional analysis methods which have already been proved useful and practical and for which efncient fixpoint algorithms have been developed. This is shown by proposing a simple but quite general extensión of Bruynooghe's traditional framework to the analysis of CLP programs. In this extensión constraints are viewed not as "suspended goals" but rather as new information in the store, following the traditional view of CLP. Using this approach, and as an example of its use, a complete, constraint system independent, abstract analysis is presented for approximating definiteness information. The analysis is in fact of quite general applicability. It has been implemented and used in the analysis of CLP(R) and Prolog-III applications. Results from the implementation of this analysis are also presented.

html.pl: A simple HTML package for Prolog and CLP systems

We describe a simple, public domain, HTML package for LP/CLP systems. The package allows generating HTML documents easily from LP/CLP systems, including HTML forms. It also provides facilities for parsing the input provided by HTML forms, as well as for creating standalone form handlers. The purpose of this document is to serve as a user's manual as well as a short description of the capabilities of the package. The package was originally developed for SICStus Prolog and the UPM &-Prolog/CIAO systems, but has been adapted to a number of popular LP/CLP systems. The document is also a WWW/HTML primer, containing sufficient information for developing medium complexity WWW applications in Prolog and other LP and CLP languages.

An automatic translation scheme from CLP to AKL

The Andorra Kernel language scheme was aimed, in principle, at simultaneously supporting the programming styles of Prolog and committed choice languages. Within the constraint programming paradigm, this family of languages could also in principle support the concurrent constraint paradigm. This happens for the Agents Kernel Language (AKL). On the other hand, AKL requires a somewhat detailed specification of control by the user. This could be avoided by programming in CLP to run on AKL. However, CLP programs cannot be executed directly on AKL. This is due to a number of factors, from more or less trivial syntactic differences to more involved issues such as the treatment of cut and making the exploitation of certain types of parallelism possible. This paper provides a translation scheme which is a basis of an automatic compiler of CLP programs into AKL, which can bridge those differences. In addition to supporting CLP, our style of translation achieves independent and-parallel execution where possible, which is relevant since this type of parallel execution preserves, through the translation, the user-perceived "complexity" of the original program.

Automatic compile-time parallelization of CLP programs by analysis and transformation to a concurrent constraint language.

The concept of independence has been recently generalized to the constraint logic programming (CLP) paradigm. Also, several abstract domains specifically designed for CLP languages, and whose information can be used to detect the generalized independence conditions, have been recently defined. As a result we are now in a position where automatic parallelization of CLP programs is feasible. In this paper we study the task of automatically parallelizing CLP programs based on such analyses, by transforming them to explicitly concurrent programs in our parallel CC platform (CIAO) as well as to AKL. We describe the analysis and transformation process, and study its efficiency, accuracy, and effectiveness in program parallelization. The information gathered by the analyzers is evaluated not only in terms of its accuracy, i.e. its ability to determine the actual dependencies among the program variables, but also of its effectiveness, measured in terms of code reduction in the resulting parallelized programs. Given that only a few abstract domains have been already defined for CLP, and that none of them were specifically designed for dependency detection, the aim of the evaluation is not only to asses the effectiveness of the available domains, but also to study what additional information it would be desirable to infer, and what domains would be appropriate for further improving the parallelization process.