Modelagem e simulação da solubilização da parafina em tubos circulares e em regime laminar

O óleo produzido nos novos campos de petróleo está cada vez mais parafínico e viscoso, com isso, à medida que o óleo é escoado, parafinas são depositadas sobre as paredes internas do tubo, e ao longo do tempo, tendem a reduzir drasticamente a área transversal ao escoamento. Visando estudar o processo de solubilização da parafina em dutos, esse trabalho objetiva desenvolver modelos matemáticos que represente o processo, com base nos fenômenos envolvidos no mesmo tais como transferência de massa, transferência de energia e equilíbrio sólido-líquido, implementando-os em um ambiente de desenvolvimento VBA (Visual Basic) for Excel ®. O presente trabalho foi realizado em quatro etapas: i) modelagem dos fenômenos de transferência de calor e massa, ii) modelagem da rotina dos coeficientes de atividade através do modelo UNIFAC e modelagem do sistema de equilíbrio sólido-líquido; iii) modelagem matemática do processo de solubilização e cálculo da espessura da parafina ao longo do tempo; iv) implementação dos modelos em um ambiente de desenvolvimento VBA for Excel® e criação de um simulador com uma interface gráfica, para simular o processo de solubilização da parafina depositada em dutos e sua otimização. O simulador conseguiu produzir soluções bastante adequadas, mantendo continuidade das equações diferenciáveis do balanço de energia e de massa, com uma interpretação física viável, sem a presença de dissipação de oscilações nos perfis de temperatura e massa. Além disso, esse simulador visa permitir a simulação nas diversas condições de escoamento, bem como compreender a importância das variáveis (vazão, temperatura de entrada, temperatura externa, cadeia carbônica do solvente). Através dos resultados foram possíveis verificar os perfis de temperatura, fração molar e o de solubilização

Projeto cartográfico e implementação de um protótipo de atlas escolar interativo

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

Desenvolvimento de um protótipo de um atlas escolar interativo: projeto e produção

This paper aims at presenting an Interactive School Atlas prototype which was developed for cartography and environmental education. The methodology was based on the theoretical study about child mental development of Piaget theory, in order to elaborate strategies that allow the student a better comprehension about the spatial information understanding. It was defined as study case of sixth grade students, because they belong to the Formal Operation stage, in which the children reach the needed mental operations for understanding cartographic key concepts. This Atlas was developed in two stages: cartographic design and Atlas production. The Atlas implementation was developed seeking the use of Multimedia Cartography and animation resources that may attract students and teachers, instigating them to explore the tools and strategies to lead users to a correct interpretation of map contents. The Atlas was implemented by using the Macromedia Flash and Visual Basic softwares and the MapObjects library. Though the map has bot been evaluated yet, one should point out that it was designed according to the theoretical and methodological knowledge of the cognitive development and its relationship to cartographic conceptions, aiming at adapting the product to children cognitive skills.

BSmart: desenvolvimento rigoroso de aplicações Java Card com base no método formal B

Java Card technology allows the development and execution of small applications embedded in smart cards. A Java Card application is composed of an external card client and of an application in the card that implements the services available to the client by means of an Application Programming Interface (API). Usually, these applications manipulate and store important information, such as cash and confidential data of their owners. Thus, it is necessary to adopt rigor on developing a smart card application to improve its quality and trustworthiness. The use of formal methods on the development of these applications is a way to reach these quality requirements. The B method is one of the many formal methods for system specification. The development in B starts with the functional specification of the system, continues with the application of some optional refinements to the specification and, from the last level of refinement, it is possible to generate code for some programming language. The B formalism has a good tool support and its application to Java Card is adequate since the specification and development of APIs is one of the major applications of B. The BSmart method proposed here aims to promote the rigorous development of Java Card applications up to the generation of its code, based on the refinement of its formal specification described in the B notation. This development is supported by the BSmart tool, that is composed of some programs that automate each stage of the method; and by a library of B modules and Java Card classes that model primitive types, essential Java Card API classes and reusable data structures

Java-XSC : módulo complexo e complexo intervalar

This work aims to develop modules that will increase the computational power of the Java-XSC library, and XSC an acronym for "Language Extensions for Scientific Computation . This library is actually an extension of the Java programming language that has standard functions and routines elementary mathematics useful interval. in this study two modules were added to the library, namely, the modulus of complex numbers and complex numbers of module interval which together with the modules original numerical applications that are designed to allow, for example in the engineering field, can be used in devices running Java programs

Geração automática de hardware a partir de especificações formais: estendendo uma abordagem de tradução

Removing inconsistencies in a project is a less expensive activity when done in the early steps of design. The use of formal methods improves the understanding of systems. They have various techniques such as formal specification and verification to identify these problems in the initial stages of a project. However, the transformation from a formal specification into a programming language is a non-trivial task and error prone, specially when done manually. The aid of tools at this stage can bring great benefits to the final product to be developed. This paper proposes the extension of a tool whose focus is the automatic translation of specifications written in CSPM into Handel-C. CSP is a formal description language suitable for concurrent systems, and CSPM is the notation used in tools support. Handel-C is a programming language whose result can be compiled directly into FPGA s. Our extension increases the number of CSPM operators accepted by the tool, allowing the user to define local processes, to rename channels in a process and to use Boolean guards on external choices. In addition, we also propose the implementation of a communication protocol that eliminates some restrictions on parallel composition of processes in the translation into Handel-C, allowing communication in a same channel between multiple processes to be mapped in a consistent manner and that improper communication in a channel does not ocurr in the generated code, ie, communications that are not allowed in the system specification

Utilizando programação orientada a aspectos no projeto de sistemas hardware desenvolvidos com SystemC

New programming language paradigms have commonly been tested and eventually incorporated into hardware description languages. Recently, aspect-oriented programming (AOP) has shown successful in improving the modularity of object-oriented and structured languages such Java, C++ and C. Thus, one can expect that, using AOP, one can improve the understanding of the hardware systems under design, as well as make its components more reusable and easier to maintain. We apply AOP in applications developed using the SystemC library. Several examples will be presented illustrating how to combine AOP and SystemC. During the presentation of these examples, the benefits of this new approach will also be discussed

C programs for solving the time-dependent Gross-Pitaevskii equation in a fully anisotropic trap

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

Development of an open case-based decision-support system for diagnosis in oral pathology

Making diagnoses in oral pathology are often difficult and confusing in dental practice, especially for the lessexperienced dental student. One of the most promising areas in bioinformatics is computer-aided diagnosis, where a computer system is capable of imitating human reasoning ability and provides diagnoses with an accuracy approaching that of expert professionals. This type of system could be an alternative tool for assisting dental students to overcome the difficulties of the oral pathology learning process. This could allow students to define variables and information, important to improving the decision-making performance. However, no current open data management system has been integrated with an artificial intelligence system in a user-friendly environment. Such a system could also be used as an education tool to help students perform diagnoses. The aim of the present study was to develop and test an open case-based decisionsupport system.Methods: An open decision-support system based on Bayes' theorem connected to a relational database was developed using the C++ programming language. The software was tested in the computerisation of a surgical pathology service and in simulating the diagnosis of 43 known cases of oral bone disease. The simulation was performed after the system was initially filled with data from 401 cases of oral bone disease.Results: the system allowed the authors to construct and to manage a pathology database, and to simulate diagnoses using the variables from the database.Conclusion: Combining a relational database and an open decision-support system in the same user-friendly environment proved effective in simulating diagnoses based on information from an updated database.

Tensor3D: A computer graphics program to simulate 3D real-time deformation and visualization of geometric bodies

Tensor3D is a geometric modeling program with the capacity to simulate and visualize in real-time the deformation, specified through a tensor matrix and applied to triangulated models representing geological bodies. 3D visualization allows the study of deformational processes that are traditionally conducted in 2D, such as simple and pure shears. Besides geometric objects that are immediately available in the program window, the program can read other models from disk, thus being able to import objects created with different open-source or proprietary programs. A strain ellipsoid and a bounding box are simultaneously shown and instantly deformed with the main object. The principal axes of strain are visualized as well to provide graphical information about the orientation of the tensor's normal components. The deformed models can also be saved, retrieved later and deformed again, in order to study different steps of progressive strain, or to make this data available to other programs. The shape of stress ellipsoids and the corresponding Mohr circles defined by any stress tensor can also be represented. The application was written using the Visualization ToolKit, a powerful scientific visualization library in the public domain. This development choice, allied to the use of the Tcl/Tk programming language, which is independent on the host computational platform, makes the program a useful tool for the study of geometric deformations directly in three dimensions in teaching as well as research activities. (C) 2007 Elsevier Ltd. All rights reserved.

Expert system for hot forging design

Planning hot forging processes is a time-consuming activity with high costs involved because of the trial-and-error iterative methods used to design dies and to choose equipment and process conditions. Some processes demand many months to produce forged parts with controlled shapes, dimensions and microstructure. This paper shows how expert systems can help engineers to reduce the time needed to design precision forged parts and dies from machined parts. The software ADHFD interfacing MS Visual Basic v.5.0 and SolidEdge v.3.0 was used to design flashless hot forged gears, chosen from families of gears. © 1998 Elsevier Science S.A. All rights reserved.

Open and standardized tools for smart transducer networking

IEEE 1451 Standard is intended to address the smart transducer interfacing problematic in network environments. Usually, proprietary hardware and software is a very efficient solution to in planent the IEEE 1451 normative, although can be expensive and inflexible. In contrast, the use of open and standardized tools for implementing the IEEE 1451 normative is proposed in this paper. Tools such as Java and Phyton programming languages, Linux, programmable logic technology, Personal Computer resources and Ethernet architecture were integrated in order to constructa network node based on the IEEE 1451 standards. The node can be applied in systems based on the client-server communication model The evaluation of the employed tools and expermental results are presented. © 2005 IEEE.

Automatic system for thermal damage detection in manufacturing process with Internet monitoring

This work involved the development of a smart system dedicated to surface burning detection in the grinding process through constant monitoring of the process by acoustic emission and electrical power signals. A program in Visual Basic® for Windows® was developed, which collects the signals through an analog-digital converter and further processes them using burning detection algorithms already known. Three other parameters are proposed here and a comparative study carried out. When burning occurs, the newly developed software program sends a control signal warning the operator or interrupting the process, and delivers process information via the Internet. Parallel to this, the user can also interfere in the process via Internet, changing parameters and/or monitoring the grinding process. The findings of a comparative study of the various parameters are also discussed here. Copyright © 2006 by ABCM.

Context-sensitive analysis of obfuscated x86 executables

A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipulate stack instead of using native call and ret instructions to achieve equivalent behavior. Since definition of context-sensitivity and algorithms for context-sensitive analysis have thus far been based on the specific semantics associated to procedure call and return operations, classic interprocedural analyses cannot be used reliably for analyzing programs in which these operations cannot be discerned. A new notion of context-sensitivity is introduced that is based on the state of the stack at any instruction. While changes in 'calling'-context are associated with transfer of control, and hence can be reasoned in terms of paths in an interprocedural control flow graph (ICFG), the same is not true of changes in 'stack'-context. An abstract interpretation based framework is developed to reason about stack-contexts and to derive analogues of call-strings based methods for the context-sensitive analysis using stack-context. The method presented is used to create a context-sensitive version of Venable et al.'s algorithm for detecting obfuscated calls. Experimental results show that the context-sensitive version of the algorithm generates more precise results and is also computationally more efficient than its context-insensitive counterpart. Copyright © 2010 ACM.

Context-sensitive analysis without calling-context

Since Sharir and Pnueli, algorithms for context-sensitivity have been defined in terms of 'valid' paths in an interprocedural flow graph. The definition of valid paths requires atomic call and ret statements, and encapsulated procedures. Thus, the resulting algorithms are not directly applicable when behavior similar to call and ret instructions may be realized using non-atomic statements, or when procedures do not have rigid boundaries, such as with programs in low level languages like assembly or RTL. We present a framework for context-sensitive analysis that requires neither atomic call and ret instructions, nor encapsulated procedures. The framework presented decouples the transfer of control semantics and the context manipulation semantics of statements. A new definition of context-sensitivity, called stack contexts, is developed. A stack context, which is defined using trace semantics, is more general than Sharir and Pnueli's interprocedural path based calling-context. An abstract interpretation based framework is developed to reason about stack-contexts and to derive analogues of calling-context based algorithms using stack-context. The framework presented is suitable for deriving algorithms for analyzing binary programs, such as malware, that employ obfuscations with the deliberate intent of defeating automated analysis. The framework is used to create a context-sensitive version of Venable et al.'s algorithm for analyzing x86 binaries without requiring that a binary conforms to a standard compilation model for maintaining procedures, calls, and returns. Experimental results show that a context-sensitive analysis using stack-context performs just as well for programs where the use of Sharir and Pnueli's calling-context produces correct approximations. However, if those programs are transformed to use call obfuscations, a contextsensitive analysis using stack-context still provides the same, correct results and without any additional overhead. © Springer Science+Business Media, LLC 2011.