823 resultados para Boolean Computations
Resumo:
Very large scale computations are now becoming routinely used as a methodology to undertake scientific research. In this context, `provenance systems' are regarded as the equivalent of the scientist's logbook for in silico experimentation: provenance captures the documentation of the process that led to some result. Using a protein compressibility analysis application, we derive a set of generic use cases for a provenance system. In order to support these, we address the following fundamental questions: what is provenance? how to record it? what is the performance impact for grid execution? what is the performance of reasoning? In doing so, we define a technologyindependent notion of provenance that captures interactions between components, internal component information and grouping of interactions, so as to allow us to analyse and reason about the execution of scientific processes. In order to support persistent provenance in heterogeneous applications, we introduce a separate provenance store, in which provenance documentation can be stored, archived and queried independently of the technology used to run the application. Through a series of practical tests, we evaluate the performance impact of such a provenance system. In summary, we demonstrate that provenance recording overhead of our prototype system remains under 10% of execution time, and we show that the recorded information successfully supports our use cases in a performant manner.
Numerical Simulation Of Sediment Transport And Bedmorphology Around A Hydraulic Structure On A River
Resumo:
Scour around hydraulic structures is a critical problem in hydraulic engineering. Under prediction of scour depth may lead to costly failures of the structure, while over prediction might result in unnecessary costs. Unfortunately, up-to-date empirical scour prediction formulas are based on laboratory experiments that are not always able to reproduce field conditions due to complicated geometry of rivers and temporal and spatial scales of a physical model. However, computational fluid dynamics (CFD) tools can perform using real field dimensions and operating conditions to predict sediment scour around hydraulic structures. In Korea, after completing the Four Major Rivers Restoration Project, several new weirs have been built across Han, Nakdong, Geum and Yeongsan Rivers. Consequently, sediment deposition and bed erosion around such structures have became a major issue in these four rivers. In this study, an application of an open source CFD software package, the TELEMAC-MASCARET, to simulate sediment transport and bed morphology around Gangjeong weir, which is the largest multipurpose weir built on Nakdong River. A real bathymetry of the river and a geometry of the weir have been implemented into the numerical model. The numerical simulation is carried out with a real hydrograph at the upstream boundary. The bedmorphology obtained from the numerical results has been validated against field observation data, and a maximum of simulated scour depth is compared with the results obtained by empirical formulas of Hoffmans. Agreement between numerical computations, observed data and empirical formulas is judged to be satisfactory on all major comparisons. The outcome of this study does not only point out the locations where deposition and erosion might take place depending on the weir gate operation, but also analyzes the mechanism of formation and evolution of scour holes after the weir gates.
Resumo:
While the simulation of flood risks originating from the overtopping of river banks is well covered within continuously evaluated programs to improve flood protection measures, flash flooding is not. Flash floods are triggered by short, local thunderstorm cells with high precipitation intensities. Small catchments have short response times and flow paths and convective thunder cells may result in potential flooding of endangered settlements. Assessing local flooding and pathways of flood requires a detailed hydraulic simulation of the surface runoff. Hydrological models usually do not incorporate surface runoff at this detailedness but rather empirical equations are applied for runoff detention. In return 2D hydrodynamic models usually do not allow distributed rainfall as input nor are any types of soil/surface interaction implemented as in hydrological models. Considering several cases of local flash flooding during the last years the issue emerged for practical reasons but as well as research topics to closing the model gap between distributed rainfall and distributed runoff formation. Therefore, a 2D hydrodynamic model, depth-averaged flow equations using the finite volume discretization, was extended to accept direct rainfall enabling to simulate the associated runoff formation. The model itself is used as numerical engine, rainfall is introduced via the modification of waterlevels at fixed time intervals. The paper not only deals with the general application of the software, but intends to test the numerical stability and reliability of simulation results. The performed tests are made using different artificial as well as measured rainfall series as input. Key parameters of the simulation such as losses, roughness or time intervals for water level manipulations are tested regarding their impact on the stability.
Resumo:
Neste trabalho, nos propomos a estudar o desenvolvimento teórico de alguns modelos matemáticos básicos de doenças infecciosas causadas por macroparasitas, bem como as dificuldades neles envolvidas. Os modelos de transmissão, que descrevemos, referem-se ao grupo de parasitas com transmissão direta: os helmintos. O comportamento reprodutivo peculiar do helminto dentro do hospedeiro definitivo, no intuito de produzir estágios que serão infectivos para outros hospedeiros, faz com que a epidemiologia de infecções por helmintos seja fundamentalmente diferente de todos os outros agentes infecciosos. Uma característica importante nestes modelos é a forma sob a qual supõe-se que os parasitas estejam distribuídos nos seus hospedeiros. O tamanho da carga de parasitas (intensidade da infecção) em um hospedeiro é o determinante central da dinâmica de transmissão de helmintos, bem como da morbidade causada por estes parasitas. Estudamos a dinâmica de parasitas helmintos de ciclo de vida direto para parasitas monóicos (hermafroditas) e também para parasitas dióicos (machos-fêmeas) poligâmicos, levando em consideração uma função acasalamento apropriada, sempre distribuídos de forma binomial negativa. Através de abordagens analítica e numérica, apresentamos a análise de estabilidade dos pontos de equilíbrio do sistema. Cálculos de prevalências, bem como de efeitos da aplicação de agentes quimioterápicos e da vacinação, no controle da transmissão e da morbidade de parasitas helmintos de ciclo de vida direto, também são apresentados neste trabalho.
Resumo:
Esse artigo apresenta um modelo dinâmico de competição em precos que incorpora tanto custos de procura quanto custos de switching e onde que as decisões do consumidor e das firmas são simultâneas. Dadas as hipóteses feitas n ós veremos que este modelo possui equilí brio. As principais propriedades do equil íbrio deste modelo são: Se os custos de procura forem baixos o suficiente, em equilí brio o consumidor vai procurar todas as firmas no mercado enquanto que o aumento dos custos de procura vai reduzir a propor cão de firmas que o consumidor busca. Um resultado contraintuitivo e que os pre cos esperados pagos pelo consumidor normalmente decresce em nossas computa cões numéricas do equil íbrio quando os custos de procura aumentam. Enquanto que aumentar os custos de switching tamb ém vai produzir o resultado contraituitivo que as firmas unmatched vão diminuir suas ofertas de modo a atrair o consumidor.
Resumo:
This paper illustrates the use of the marginal cost of public funds concept in three contexts. First, we extend Parry’s (2003) analysis of the efficiency effects excise taxes in the U.K., primarily by incorporating the distortion caused by imperfect competition in the cigarette market and distinguishing between the MCFs for per unit and ad valorem taxes on cigarettes. Our computations show, contrary to the standard result in the literature, that the per unit tax on cigarettes has a slightly lower MCF than the ad valorem tax on cigarettes. Second, we calculate the MCF for a payroll tax in a labour market with involuntary unemployment, using the Shapiro and Stiglitz (1984) efficiency wage model as our framework. Our computations, based on Canadian labour market data, indicate that incorporating the distortion caused by involuntary unemployment raises the MCF by 25 to 50 percent. Third, we derive expressions for the distributionally-weighted MCFs for the exemption level and the marginal tax rate for a “flat tax”, such as the one that has been adopted by the province of Alberta. This allows us to develop a restricted, but tractable, version of the optimal income tax problem. Computations indicate that the optimal marginal tax rate may be quite high, even with relatively modest pro-poor distributional preferences.
Resumo:
Research of advanced technologies for energy generation contemplates a series of alternatives that are introduced both in the investigation of new energy sources and in the improvement and/or development of new components and systems. Even though significant reductions are observed in the amount of emissions, the proposed alternatives require the use of exhaust gases cleaning systems. The results of environmental analyses based on two configurations proposed for urban waste incineration are presented in this paper; the annexation of integer (Boolean) variables to the environomic model makes it possible to define the best gas cleaning routes based on exergetic cost minimisation criteria. In this first part, the results for steam cogeneration system analysis associated with the incineration of municipal solid wastes (MSW) is presented. (c) 2007 Elsevier Ltd. All rights reserved.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
The development of smart card applications requires a high level of reliability. Formal methods provide means for this reliability to be achieved. The BSmart method and tool contribute to the development of smart card applications with the support of the B method, generating Java Card code from B specifications. For the development with BSmart to be effectively rigorous without overloading the user it is important to have a library of reusable components built in B. The goal of KitSmart is to provide this support. A first research about the composition of this library was a graduation work from Universidade Federal do Rio Grande do Norte, made by Thiago Dutra in 2006. This first version of the kit resulted in a specification of Java Card primitive types byte, short and boolean in B and the creation of reusable components for application development. This work provides an improvement of KitSmart with the addition of API Java Card specification made in B and a guide for the creation of new components. The API Java Card in B, besides being available to be used for development of applications, is also useful as a documentation of each API class. The reusable components correspond to modules to manipulate specific structures, such as date and time. These structures are not available for B or Java Card. These components for Java Card are generated from specifications formally verified in B. The guide contains quick reference on how to specify some structures and how some situations were adapted from object-orientation to the B Method. This work was evaluated through a case study made through the BSmart tool, that makes use of the KitSmart library. In this case study, it is possible to see the contribution of the components in a B specification. This kit should be useful for B method users and Java Card application developers
Resumo:
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
Resumo:
Atualmente, há diferentes definições de implicações fuzzy aceitas na literatura. Do ponto de vista teórico, esta falta de consenso demonstra que há discordâncias sobre o real significado de "implicação lógica" nos contextos Booleano e fuzzy. Do ponto de vista prático, isso gera dúvidas a respeito de quais "operadores de implicação" os engenheiros de software devem considerar para implementar um Sistema Baseado em Regras Fuzzy (SBRF). Uma escolha ruim destes operadores pode implicar em SBRF's com menor acurácia e menos apropriados aos seus domínios de aplicação. Uma forma de contornar esta situação e conhecer melhor os conectivos lógicos fuzzy. Para isso se faz necessário saber quais propriedades tais conectivos podem satisfazer. Portanto, a m de corroborar com o significado de implicação fuzzy e corroborar com a implementação de SBRF's mais apropriados, várias leis Booleanas têm sido generalizadas e estudadas como equações ou inequações nas lógicas fuzzy. Tais generalizações são chamadas de leis Boolean-like e elas não são comumente válidas em qualquer semântica fuzzy. Neste cenário, esta dissertação apresenta uma investigação sobre as condições suficientes e necessárias nas quais três leis Booleanlike like — y ≤ I(x, y), I(x, I(y, x)) = 1 e I(x, I(y, z)) = I(I(x, y), I(x, z)) — se mantém válidas no contexto fuzzy, considerando seis classes de implicações fuzzy e implicações geradas por automorfismos. Além disso, ainda no intuito de implementar SBRF's mais apropriados, propomos uma extensão para os mesmos
Resumo:
This work shows a integrated study of modern analog to fluvial reservoirs of Açu Formation (Unit 3). The modern analog studied has been Assu River located in the same named city, Rio Grande do Norte State, Northeast of Brazil. It has been developed a new methodology to parameterizating the fluvial geological bodies by GPR profile (by central frequency antennas of 50, 100 and 200 MHz). The main parameters obtained were width and thickness. Still in the parameterization, orthophotomaps have been used to calculate the canal sinuosity and braided parameters of Assu River. These information are integrated in a database to supply input data in 3D geological models of fluvial reservoirs. It was made an architectural characterization of the deposit by trench description, GPR profile interpretation and natural expositions study to recognize and describe the facies and its associations, external and internal geometries, boundary surfaces and archtetural elements. Finally, a three-dimensional modeling has been built using all the acquired data already in association with real well data of a reservoir which Rio Assu is considered as analogous. Facies simulations have been used simple kriging (deterministic algorithm), SIS and Boolean (object-based, both stochastics). And, for modeling porosities have used the stochastic algorithm SGS
Resumo:
OBJETIVO: Realizar revisão sistemática de artigos que utilizaram o método de bissecção, para avaliar a percepção de tempo em idosos com doença de Alzheimer e analisar seus parâmetros. MÉTODO: As buscas dos artigos foram conduzidas no período de março a maio de 2011, nas seguintes bases de dados: Web of Science, Science Direct on Line, Biological Abstracts, PsychoInfo e Medline. As palavras-chave e operadores booleanos foram: interval timing ou perception of time ou time discrimination ou reproduction of time e Alzheimer's disease. Também foram realizadas buscas manuais nas referências dos artigos selecionados. RESULTADOS: Quatro artigos contemplavam todos os critérios de inclusão, nos quais foram encontradas grandes variações nos parâmetros utilizados no método. CONCLUSÃO: Pacientes com doença de Alzheimer apresentam prejuízos nas tarefas de bissecção de tempo, que podem ser explicados pelo declínio gradual nas habilidades que são utilizadas no teste de percepção de tempo. Há grandes variações nos intervalos de tempo utilizados. Neste contexto, há necessidade de mais estudos, controlados e randomizados, para investigar potenciais efeitos das variações nos intervalos de tempo do método de bissecção. Os resultados de tais estudos poderão contribuir para o estabelecimento de parâmetros mais adequados e fidedignos.
Resumo:
Large N topological string dualities have led to a class of proposed open/ closed dualities for superstrings. In the topological string context, the worldsheet derivation of these dualities has already been given. In this paper we take the first step in deriving the full ten-dimensional superstring dualities by showing how the dualities arise on the superstring worldsheet at the level of F terms. As part of this derivation, we show for F-term computations that the hybrid formalism for the superstring is equivalent to a (c) over cap = 5 topological string in ten-dimensional spacetime. Using the (c) over cap = 5 description, we then show that the D brane boundary state for the ten-dimensional open superstring naturally emerges on the worldsheet of the closed superstring dual.
Resumo:
Feynman integrals in the physical light-cone gauge are more difficult to solve than their covariant counterparts. The difficulty is associated with the presence of unphysical singularities due to the inherent residual gauge freedom in the intermediate boson propagators constrained within this gauge choice. In order to circumvent these non-physical singularities, the headlong approach has always been to call for mathematical devices - prescriptions - some successful and others not. A more elegant approach is to consider the propagator from its physical point of view, that is, an object obeying basic principles such as causality. Once this fact is realized and carefully taken into account, the crutch of prescriptions can be avoided altogether. An alternative, third approach, which for practical computations could dispense with prescriptions as well as avoiding the necessity of careful stepwise consideration of causality, would be of great advantage. and this third option is realizable within the context of negative dimensions, or as it has been coined, the negative dimensional integration method (NDIM).