862 resultados para Deadlock Analysis, Distributed Systems, Concurrent Systems, Formal Languages
Resumo:
Dissertação de mestrado em Português Língua Não Materna (MPLNM) Português Língua Estrangeira (PLE) e Língua Segunda (PL2)
Resumo:
Background. Sevelamer is a phosphate-binder used effectively for the treatment of hyperphosphatemia in patients treated with dialysis. Objectives. To describe the safety of sevelamer in children with hyperphosphatemia secondary to tumor lysis syndrome and the serum phosphate concentrations observed following its administration. Procedure. A retrospective chart review of all children with leukemia/lymphoma diagnosed between November 2002 and April 2004 who received sevelamer during their initial admission was conducted. We monitored the effects of sevelamer on serum phosphate concentration, calcium/phosphate product and renal function at hours 24, 48, and 72 from sevelamer initiation. Results. Thirteen patients received sevelamer during the Study period. Their median age was 13 years (range 2.7-17.9) and eight were boys. Nine children had acute lymphoblastic leukemia, one had acute myeloid leukemia and 3 had non-Hodgkin's lymphoma. The most frequently used dose of sevelamer was 400 mg orally twice daily. The median duration of sevelamer therapy was 2 days (range 1 -7). Two children were excluded from the efficacy analysis due to concurrent use of dialysis. Mean serum phosphate levels decreased after sevelamer administration, in eleven patients, from a baseline 2.2 mmol/L +/- 0.4 (95% Cl, 1.7-3.1) to 1.1 mmol/L +/- 0.2 at hour 72 (95%Cl, 0.6-1.5). The only toxicity attributed to sevelamer was mild vomiting in three patients. Conclusions. Sevelamer appears to be effective and tolerable for the treatment of hyperphosphatemia associated with tumor lysis syndrome.
Resumo:
La hiérarchie de Wagner constitue à ce jour la plus fine classification des langages ω-réguliers. Par ailleurs, l'approche algébrique de la théorie de langages formels montre que ces ensembles ω-réguliers correspondent précisément aux langages reconnaissables par des ω-semigroupes finis pointés. Ce travail s'inscrit dans ce contexte en fournissant une description complète de la contrepartie algébrique de la hiérarchie de Wagner, et ce par le biais de la théorie descriptive des jeux de Wadge. Plus précisément, nous montrons d'abord que le degré de Wagner d'un langage ω-régulier est effectivement un invariant syntaxique. Nous définissons ensuite une relation de réduction entre ω-semigroupes pointés par le biais d'un jeu infini de type Wadge. La collection de ces structures algébriques ordonnée par cette relation apparaît alors comme étant isomorphe à la hiérarchie de Wagner, soit un quasi bon ordre décidable de largeur 2 et de hauteur ω. Nous exposons par la suite une procédure de décidabilité de cette hiérarchie algébrique : on décrit une représentation graphique des ω-semigroupes finis pointés, puis un algorithme sur ces structures graphiques qui calcule le degré de Wagner de n'importe quel élément. Ainsi le degré de Wagner de tout langage ω-régulier peut être calculé de manière effective directement sur son image syntaxique. Nous montrons ensuite comment construire directement et inductivement une structure de n''importe quel degré. Nous terminons par une description détaillée des invariants algébriques qui caractérisent tous les degrés de cette hiérarchie. Abstract The Wagner hierarchy is known so far to be the most refined topological classification of ω-rational languages. Also, the algebraic study of formal languages shows that these ω-rational sets correspond precisely to the languages recognizable by finite pointed ω-semigroups. Within this framework, we provide a construction of the algebraic counterpart of the Wagner hierarchy. We adopt a hierarchical game approach, by translating the Wadge theory from the ω-rational language to the ω-semigroup context. More precisely, we first show that the Wagner degree is indeed a syntactic invariant. We then define a reduction relation on finite pointed ω-semigroups by means of a Wadge-like infinite two-player game. The collection of these algebraic structures ordered by this reduction is then proven to be isomorphic to the Wagner hierarchy, namely a well-founded and decidable partial ordering of width 2 and height $\omega^\omega$. We also describe a decidability procedure of this hierarchy: we introduce a graph representation of finite pointed ω-semigroups allowing to compute their precise Wagner degrees. The Wagner degree of every ω-rational language can therefore be computed directly on its syntactic image. We then show how to build a finite pointed ω-semigroup of any given Wagner degree. We finally describe the algebraic invariants characterizing every Wagner degree of this hierarchy.
Resumo:
PURPOSE: To compare two single-agent chemotherapy (ChT) regimens evaluating, in first-line treatment, response and side effects and, in final single-agent treatment, the outcomes, among Brazilian patients with low-risk gestational trophoblastic neoplasia (GTN), according to International Federation of Gynecology and Obstetrics (FIGO) 2002. METHODS: Retrospective analysis of two concurrent cohorts with 194 low-risk GTN patients: from 1992 to 2012, as first-line treatment, 115 patients received 4 intramuscular doses of methotrexate alternated with 4 oral doses of folinic acid (MTX/FA) repetead every 14 days and, since 1996, 79 patients received an endovenous bolus-dose of actinomycin D (Act-D), biweekly. At GTN diagnosis, patient opinion was taken into consideration when defining the initial single-agent ChT regimen, and when there was resistance or toxicity to one regimen, the other drug was used preferentially. This study was approved by the Irmandade da Santa Casa de Misericórdia de Porto Alegre Ethical Committee. RESULTS: Both groups were clinically similar (p>0.05). In first-line treatments, frequency of complete response was similar (75.7% with MTX/FA and 67.1% with bolus Act-D); the number of ChT courses -median 3 (range: 1-10) with MTX/FA and 2 (range: 1-6) with bolus Act-D - and the time to remission -median 9 weeks (range: 2-16) with MTX/FA and 10 weeks (range: 2-16) with bolus Act-D) - were not different between the groups. In both groups, first-line side effects frequency were high but intensity was low; stomatitis was higher with MTX/FA (p<0.01) and nausea and vomit with Act-D (p<0.01). Final single-agent ChT responses were high in both groups (94.8% with MTX/FA and 83.5% with bolus Act-D; p<0.01) and 13% higher in the group initially treated with MTX/FA. Rates of hysterectomy and of GTN recurrence were low and similar. No patient died due to GTN. CONCLUSION: The two regimens had similar first-line ChT response. Final single-agent response rates were high and similar in both groups but the final single-agent remission rate was higher in the MTX/FA group.
Resumo:
Die Fachgruppe AFS (früher Fachgruppe 0.1.5) der Gesellschaft für Informatik veranstaltet seit 1991 einmal im Jahr ein Treffen der Fachgruppe im Rahmen eines Theorietags, der traditionell eineinhalb Tage dauert. Seit dem Jahr 1996 wird dem eigentlichen Theorietag noch ein eintägiger Workshop zu speziellen Themen der theoretischen Informatik vorangestellt. In diesem Jahr wurde der Theorietag vom Fachgebiet "Theoretische Informatik" des Fachbereichs Elektrotechnik/Informatik der Universität Kassel organisiert. Er fand vom 29.9. bis 1.10.2010 in Baunatal bei Kassel statt. Dabei stand der begleitende Workshop unter dem allgemeinen Thema "Ausgewählte Themen der Theoretischen Informatik". Als Vortragende für diesen Workshop konnten Carsten Damm (Göttingen), Markus Holzer (Giessen), Peter Leupold (Kassel), Martin Plátek (Prag) und Heribert Vollmer (Hannover) gewonnen werden. Das Programm des eigentlichen Theorietags bestand aus 20 Vorträgen sowie der Sitzung der Fachgruppe AFS. In diesem Band finden sich die Zusammenfassungen aller Vorträge sowohl des Workshops als auch des Theorietags. Desweiteren enthält er das Programm und die Liste aller Teilnehmer.
Resumo:
Existen importantes pruebas de valoración que miden habilidades o competencias motoras en el niño; a pesar de ello Colombia carece de estudios que demuestren la validez y la confiabilidad de un test de medición que permita emitir un juicio valorativo relacionado con las competencias motoras infantiles, teniendo presente que la intervención debe basarse en la rigurosidad que exigen los procesos de valoración y evaluación del movimiento corporal. Objetivo. El presente estudio se centró en determinar las propiedades psicométricas del test de competencias motoras Bruininiks Oseretsky –BOT 2- segunda edición. Materiales y métodos. Se realizó una evaluación de pruebas diagnósticas con 24 niños aparentemente sanos de ambos géneros, entre 4 y 7 años, residentes en las ciudades de Chía y Bogotá. La evaluación fue realizada por 3 evaluadores expertos; el análisis para consistencia interna se realizó utilizando el Coeficiente Alfa de Cronbach, el análisis de reproducibilidad se estableció a través del Coeficiente de Correlación Intraclase –CCI- y para el análisis de la validez concurrente se utilizó el Coeficiente de Correlación de Pearson, considerando un alfa=0.05. Resultados. Para la totalidad de las pruebas, se encontraron altos índices de confiabilidad y validez. Conclusiones. El BOT 2 es un instrumento válido y confiable, que puede ser utilizado para la evaluación e identificación del nivel de desarrollo en que se encuentran las competencias motoras en el niño.
Resumo:
In the Brazilian legal scenario, the study of taxation has traditionally been restricted to positivist analysis, concerned with investigating the formal aspects of the tax legal rule. Despite its relevance to the formation of the national doctrine of tax, such formalist tradition limits the discipline, separating it from reality and the socioeconomic context in which the Tax Law is inserted. Thus, the proposal of the dissertation is to examine the fundamentals and nature of taxation and tax legal rules from the perspective of Law and Economics (Economic Analysis of Law). For this purpose, the work initially reconnects the Tax Law and Science of Finance (or Public Finance) and Fiscal Policy, undertaking not only a legal analysis, but also economic and financial analysis of the theme. The Economics of Public Sector (or Modern Public Finance) will contribute to the research through topics such as market failures and economic theory of taxation, which are essential to an economic approach to Tax Law. The core of the work lies in the application of Law and Economics instruments in the study of taxation, analyzing the effects of tax rules on the economic system. Accordingly, the dissertation examines the fundamental assumptions that make up the Economic Analysis of Law (as the concept of economic efficiency and its relation to equity), relating them to the tax phenomenon. Due to the nature of the Brazilian legal system, any worth investigation or approach, including Law and Economics, could not pass off the Constitution. Thus, the constitutional rules will serve as a limit and a prerequisite for the application of Law and Economics on taxation, particularly the rules related to property rights, freedom, equality and legal certainty. The relationship between taxation and market failures receives prominent role, particularly due to its importance to the Law and Economics, as well as to the role that taxation plays in the correction of these failures. In addition to performing a review of taxation under the approach of Economic Analysis of Law, the research also investigates the reality of Brazilian tax system, applying the concepts developed in relevant cases and issues to the national scene, such as the relationship between taxation and development, the compliance costs of taxation, the tax evasion and the tax enforcement procedure. Given the above, it is intended to lay the groundwork for a general theory of Economic Analysis of Tax Law, contextualizing it with the Brazilian tax system
Resumo:
Some programs may have their entry data specified by formalized context-free grammars. This formalization facilitates the use of tools in the systematization and the rise of the quality of their test process. This category of programs, compilers have been the first to use this kind of tool for the automation of their tests. In this work we present an approach for definition of tests from the formal description of the entries of the program. The generation of the sentences is performed by taking into account syntactic aspects defined by the specification of the entries, the grammar. For optimization, their coverage criteria are used to limit the quantity of tests without diminishing their quality. Our approach uses these criteria to drive generation to produce sentences that satisfy a specific coverage criterion. The approach presented is based on the use of Lua language, relying heavily on its resources of coroutines and dynamic construction of functions. With these resources, we propose a simple and compact implementation that can be optimized and controlled in different ways, in order to seek satisfaction the different implemented coverage criteria. To make the use of our tool simpler, the EBNF notation for the specification of the entries was adopted. Its parser was specified in the tool Meta-Environment for rapid prototyping
Resumo:
Symbolic power is discussed with reference to mathematics and formal languages. Two distinctions are crucial for establishing mechanical and formal perspectives: one between appearance and reality, and one between sense and reference. These distinctions include a nomination of what to consider primary and secondary. They establish the grammatical format of a mechanical and a formal world view. Such views become imposed on the domains addressed by means of mathematics and formal languages. Through such impositions symbolic power of mathematics becomes exercised. The idea that mathematics describes as it prioritises is discussed with reference to robotting and surveillance. In general, the symbolic power of mathematics and formal languages is summarised through the observations: that mathematics treats parts and properties as autonomous, that it dismembers what it addresses and destroys the organic unity around things, and that it simplifies things and reduces them to a single feature. But, whatever forms the symbolic power may take, it cannot be evaluated along a single good-bad axis.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Pós-graduação em Geografia - IGCE
Resumo:
The present dissertation relates to methodologies and technics about industrial and mechanical design. The author intends to give a complete idea about the world of design, showing the theories of Quality Function Deployment and TRIZ, of other methods just like planning, budgeting, Value Analysis and Engineering, Concurrent Engineering, Design for Assembly and Manufactoring, etc., and their applications to five concrete cases. In these cases there are also illustrated design technics as CAD, CAS, CAM; Rendering, which are ways to transform an idea into reality. The most important object of the work is, however, the birth of a new methodology, coming up from a comparison between QFD and TRIZ and their integration through other methodologies, just like Time and Cost Analysis, learned and skilled during an important experience in a very famous Italian automotive factory.
Resumo:
Está ampliamente aceptado que es fundamental desarrollar la habilidad de resolver problemas. El pensamiento computacional se basa en resolver problemas haciendo uso de conceptos fundamentales de la informática. Nada mejor para desarrollar la habilidad de resolver problemas usando conceptos informáticos que una asignatura de introducción a la programación. Este trabajo presenta nuestras reflexiones acerca de cómo iniciar a un estudiante en el campo de la programación de computadores. El trabajo no detalla los contenidos a impartir, sino que se centra en aspectos metodológicos, con la inclusión de experiencias y ejemplos concretos, a la vez que generales, extensibles a cualquier enseñanza de programación. En general, aunque se van desarrollado lenguajes cada vez más cercanos al lenguaje humano, la programación de ordenadores utilizando lenguajes formales no es una materia intuitiva y de fácil comprensión por parte de los estudiantes. A la persona que ya sabe programar le parece una tarea sencilla, pero al neófito no. Es más, dominar el arte de la programación es complejo. Por esta razón es indispensable utilizar todas las técnicas y herramientas posibles que faciliten dicha labor.
Resumo:
"Contract no. E(04-3)-34, PA 214."