Avanços tecnológicos em hematologia laboratorial

O recente avanço científico e tecnológico direcionado à identificação imuno-hematológica de produtos celulares (ex.: citocinas, interleucinas, interferons, entre outros) sintetizados por determinadas células sanguíneas, bem como na identificação de antígenos de membrana de leucócitos e células progenitoras hematopoiéticas, promoveram excepcional desenvolvimento no diagnóstico laboratorial de diversas doenças hematológicas. Somam-se a esse fato as aplicações das técnicas de biologia molecular que se tornam cada vez mais instrumentos laboratoriais de grande definição no diagnóstico e na prevenção de doenças hematológicas, notadamente aquelas de origem hereditária. O presente artigo teve o objetivo de expor as principais aplicações de novas tecnologias que deverão ser adotadas rapidamente pela moderna hematologia laboratorial, bem como a de sensibilizar os profissionais hematologistas, clínicos e laboratoriais, para a necessidade de se atualizarem numa nova ciência, a dos produtos celulares.

Estruturação do conhecimento e relações semânticas: uma ontologia para o domínio da naonociência e nanotecnologia

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

Produção familiar e as estratégias de reprodução social no espaço rural do município de Indiana (SP)

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Tradução juramentada de contratos de compra e venda

Pós-graduação em Estudos Linguísticos - IBILCE

Desempenho de um controlador de fluxo com DGPS para máquinas de pulverização

Pós-graduação em Agronomia (Energia na Agricultura) - FCA

Heterogeneidades geológicas e o gerenciamento de áreas contaminadas em local situado na Interface da Serra do Mar com a Planície Aluvionar do Rio Cubatão (Cubatão/SP)

Pós-graduação em Geociências e Meio Ambiente - IGCE

Das ciências do léxico ao léxico nas ciências: uma proposta de dicionário português-espanhol de economia monetária

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Estudo da tradução de colocações especializadas na área de exportação e agronegócios baseado em um corpus paralelo

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

O apoio institucional como uma das faces da função apoio no Núcleo de Apoio à Saúde da Família (NASF): para além das diretrizes

The aim of this study was to add to the debate about Family Health Support Centers (FHSCs), starting from reflections about the support function. Support is generally presented, in official documents from the Ministry of Health and in academic-scientific publications, accompanied by descriptors that characterize it. Differences in terminology are commonly encountered: “institutional support”, “managerial support”, “matrix support” and so on. With regard to FHSCs, published papers have highlighted the central role played by matrix support. However, we pose the question: what are the faces that the support function has been taking on in implementing such programs? To reflect on this and other issues, we developed a study of qualitative nature within a FHSC team in Paraná, outside of the state capital, using the methodological tools of participant observation, semi-structured interviews and discussion groups. We sought to demonstrate that the dynamics of the support function in FHSCs make it possible for both matrix support and institutional support to emerge.

Discriminação de classes de cobertura vegetal utilizando técnicas de classificação digital de imagens de sensoriamento remoto

The aim of this work is to discriminate vegetation classes throught remote sensing images from the satellite CBERS-2, related to winter and summer seasons in the Campos Gerais region Paraná State, Brazil. The vegetation cover of the region presents different kinds of vegetations: summer and winter cultures, reforestation areas, natural areas and pasture. Supervised classification techniques like Maximum Likelihood Classifier (MLC) and Decision Tree were evaluated, considering a set of attributes from images, composed by bands of the CCD sensor (1, 2, 3, 4), vegetation indices (CTVI, DVI, GEMI, NDVI, SR, SAVI, TVI), mixture models (soil, shadow, vegetation) and the two first main components. The evaluation of the classifications accuracy was made using the classification error matrix and the kappa coefficient. It was defined a high discriminatory level during the classes definition, in order to allow separation of different kinds of winter and summer crops. The classification accuracy by decision tree was 94.5% and the kappa coefficient was 0.9389 for the scene 157/128. For the scene 158/127, the values were 88% and 0.8667, respectively. The classification accuracy by MLC was 84.86% and the kappa coefficient was 0.8099 for the scene 157/128. For the scene 158/127, the values were 77.90% and 0.7476, respectively. The results showed a better performance of the Decision Tree classifier than MLC, especially to the classes related to cultivated crops, indicating the use of the Decision Tree classifier to the vegetation cover mapping including different kinds of crops.

Enhancement of the Nonlinear Optical Absorption of the E7 Liquid Crystal at the Nematic-Isotropic Transition

We present an experimental study of the nonlinear optical absorption of the eutectic mixture E7 at the nematic-isotropic phase transition by the Z-scan technique, under continuous-wave excitation at 532 nm. In the nematic region, the effective nonlinear optical coefficient beta, which vanishes in the isotropic phase, is negative for the extraordinary beam and positive for an ordinary beam. The parameter , whose definition in terms of the nonlinear absorption coefficient follows the definition of the optical-order parameter in terms of the linear dichroic ratio, behaves like an order parameter with critical exponent 0.22 +/- 0.05, in good agreement with the tricritical hypothesis for the nematic-isotropic transition.

Plano de inovação para o Vocabulário Controlado do SIBIUSP: relato de experiência

Controlled vocabularies are tools of representation of information necessary to standardize the content description and classification of information, making information systems consistent and also minimizing the dispersion of information. One of the most critical points of controlled vocabularies is the need to constantly update, in terminology and the computer system. The purpose of this paper is to share the experience of the Sistema Integrado de Bibliotecas da Universidade de São Paulo - (SIBiUSP) in planning and developing an innovation plan for your Controlled Vocabulary, reporting their goals and actions. Such actions are in different stages of referral, so there are provisional results. The article also brings the description of his movements and the difficulties encountered as collaboration and knowledge for professionals that working and researching with the theme controlled vocabularies

Constraint handling rules. Compositional semantics and program transformation

This thesis intends to investigate two aspects of Constraint Handling Rules (CHR). It proposes a compositional semantics and a technique for program transformation. CHR is a concurrent committed-choice constraint logic programming language consisting of guarded rules, which transform multi-sets of atomic formulas (constraints) into simpler ones until exhaustion [Frü06] and it belongs to the declarative languages family. It was initially designed for writing constraint solvers but it has recently also proven to be a general purpose language, being as it is Turing equivalent [SSD05a]. Compositionality is the first CHR aspect to be considered. A trace based compositional semantics for CHR was previously defined in [DGM05]. The reference operational semantics for such a compositional model was the original operational semantics for CHR which, due to the propagation rule, admits trivial non-termination. In this thesis we extend the work of [DGM05] by introducing a more refined trace based compositional semantics which also includes the history. The use of history is a well-known technique in CHR which permits us to trace the application of propagation rules and consequently it permits trivial non-termination avoidance [Abd97, DSGdlBH04]. Naturally, the reference operational semantics, of our new compositional one, uses history to avoid trivial non-termination too. Program transformation is the second CHR aspect to be considered, with particular regard to the unfolding technique. Said technique is an appealing approach which allows us to optimize a given program and in more detail to improve run-time efficiency or spaceconsumption. Essentially it consists of a sequence of syntactic program manipulations which preserve a kind of semantic equivalence called qualified answer [Frü98], between the original program and the transformed ones. The unfolding technique is one of the basic operations which is used by most program transformation systems. It consists in the replacement of a procedure-call by its definition. In CHR every conjunction of constraints can be considered as a procedure-call, every CHR rule can be considered as a procedure and the body of said rule represents the definition of the call. While there is a large body of literature on transformation and unfolding of sequential programs, very few papers have addressed this issue for concurrent languages. We define an unfolding rule, show its correctness and discuss some conditions in which it can be used to delete an unfolded rule while preserving the meaning of the original program. Finally, confluence and termination maintenance between the original and transformed programs are shown. This thesis is organized in the following manner. Chapter 1 gives some general notion about CHR. Section 1.1 outlines the history of programming languages with particular attention to CHR and related languages. Then, Section 1.2 introduces CHR using examples. Section 1.3 gives some preliminaries which will be used during the thesis. Subsequentely, Section 1.4 introduces the syntax and the operational and declarative semantics for the first CHR language proposed. Finally, the methodologies to solve the problem of trivial non-termination related to propagation rules are discussed in Section 1.5. Chapter 2 introduces a compositional semantics for CHR where the propagation rules are considered. In particular, Section 2.1 contains the definition of the semantics. Hence, Section 2.2 presents the compositionality results. Afterwards Section 2.3 expounds upon the correctness results. Chapter 3 presents a particular program transformation known as unfolding. This transformation needs a particular syntax called annotated which is introduced in Section 3.1 and its related modified operational semantics !0t is presented in Section 3.2. Subsequently, Section 3.3 defines the unfolding rule and prove its correctness. Then, in Section 3.4 the problems related to the replacement of a rule by its unfolded version are discussed and this in turn gives a correctness condition which holds for a specific class of rules. Section 3.5 proves that confluence and termination are preserved by the program modifications introduced. Finally, Chapter 4 concludes by discussing related works and directions for future work.

Reverse Engineering tools: development and experimentation of innovative methods for physical and geometrical data integration and post-processing

In recent years, the use of Reverse Engineering systems has got a considerable interest for a wide number of applications. Therefore, many research activities are focused on accuracy and precision of the acquired data and post processing phase improvements. In this context, this PhD Thesis deals with the definition of two novel methods for data post processing and data fusion between physical and geometrical information. In particular a technique has been defined for error definition in 3D points’ coordinates acquired by an optical triangulation laser scanner, with the aim to identify adequate correction arrays to apply under different acquisition parameters and operative conditions. Systematic error in data acquired is thus compensated, in order to increase accuracy value. Moreover, the definition of a 3D thermogram is examined. Object geometrical information and its thermal properties, coming from a thermographic inspection, are combined in order to have a temperature value for each recognizable point. Data acquired by an optical triangulation laser scanner are also used to normalize temperature values and make thermal data independent from thermal-camera point of view.

Models and Algorihtm for the Optimization of Real-World Routing and Logistics Problems

Logistics involves planning, managing, and organizing the flows of goods from the point of origin to the point of destination in order to meet some requirements. Logistics and transportation aspects are very important and represent a relevant costs for producing and shipping companies, but also for public administration and private citizens. The optimization of resources and the improvement in the organization of operations is crucial for all branches of logistics, from the operation management to the transportation. As we will have the chance to see in this work, optimization techniques, models, and algorithms represent important methods to solve the always new and more complex problems arising in different segments of logistics. Many operation management and transportation problems are related to the optimization class of problems called Vehicle Routing Problems (VRPs). In this work, we consider several real-world deterministic and stochastic problems that are included in the wide class of the VRPs, and we solve them by means of exact and heuristic methods. We treat three classes of real-world routing and logistics problems. We deal with one of the most important tactical problems that arises in the managing of the bike sharing systems, that is the Bike sharing Rebalancing Problem (BRP). We propose models and algorithms for real-world earthwork optimization problems. We describe the 3DP process and we highlight several optimization issues in 3DP. Among those, we define the problem related to the tool path definition in the 3DP process, the 3D Routing Problem (3DRP), which is a generalization of the arc routing problem. We present an ILP model and several heuristic algorithms to solve the 3DRP.