An industrial scale dehydration process for natural gas involving membranes

An industrial scale dehydration process based on hollow fiber membranes for lowering the dew point of natural gas is described in this paper. A pilot test with the feed flux scale of 12x10(4) Nm(3)/d was carried out. Dew points of -8 degreesC-13 degreesC at a gas transport pressure in the pipeline of 4.6M Pa and methane recovery of more than 98% were attained. The water vapor content of the product gas could be maintained around 0.01 vol% during a continuous run of about 700 hours. The effects of feed flux and operation pressure on methane recovery and water vapor content were also investigated. Additionally, some auxiliary technologies, such as a full-time engine using natural gas as fuel and the utilization of vent gas in the process, are also discussed. A small amount of the vent gas from the system was used as a fuel for an engine to drive vacuum pumps, and the heat expelled from the engine was used to warm up the natural gas feed. The whole system can be operated in a self-sustainable manner from an energy point of view, and has a relatively high efficiency in the utilization of natural gas.

Research and development of catalytic processes for petroleum and natural gas conversions in the Dalian Institute of Chemical Physics

The Dalian Institute of Chemical Physics (DICP) of the Chinese Academy of Sciences has a long history in the R&D of catalysts and catalytic processes for petroleum and natural gas conversions in China. In this paper, results and features of some commercialized petrochemical catalysts and processes as well as newly developed processes for natural gas conversion in the pilot-plant stage are described. (C) 1999 Elsevier Science B.V. All rights reserved.

An integrated air-POM syngas/dimethyl ether process from natural gas

A Cu-Zn-Al methanol catalyst combined with HZSM-5 was used for dimethyl ether (DME) synthesis from a syngas containing nitrogen, which was produced by air-partial oxidation of methane (air-POM). Air-POM occurred at 850 degreesC, 0.8 MPa, CH4/air/H2O/CO2 ratio of 1/2.4/0.8/0.4 over a Ni-based catalyst modified by magnesia and lanthanum oxide with 96% CH4 conversion and constantly gave syngas with a H-2/CO ratio of 2/1 during a period of 450 h. The obtained N-2-containing syngas was used directly for DME synthesis. About 90% CO per-pass conversion, 78% DME selectivity and 70% DME yield could be achieved during 450 h stability testing under the pressure of 5.0 MPa. the temperature of 240 degreesC and the space velocity of 1000 h(-1). (C) 2002 Elsevier Science B. V. All rights reserved.

Suscetibilidade a inseticidas e parasitismo natural por Trichogramma sp. em Traça-do-tomateiro.

A traça-do-tomateiro é uma praga importante do tomate e inseticidas são freqüentemente empregados para o seu controle. Porém, devido ao impacto ambiental e a possibilidade de resistência aos produtos utilizados para o controle do inseto, o controle biológico com o uso de Trichogramma pode ser uma alternativa para eliminar os dois problemas. Neste trabalho foi avaliada em bioensaios de laboratório a eficiência da dose recomendada de inseticidas do grupo químico dos organofosforados, piretróides e benzoiluréia para o controle da traça-do-tomateiro. Foi também avaliada a ocorrência natural de Trichogramma sp. em áreas pulverizadas ou não pulverizadas com inseticidas. A ocorrência do parasitismo natural foi determinada por meio da coleta de folhas em campo contendo ovos de traça-do-tomateiro, a fim de determinar, em avaliações de laboratório, a percentagem de ovos parasitados. Os resultados mostraram que todos os inseticidas testados causaram uma mortalidade de larvas menor que 70%, o que sugere uma eficiência reduzida dos produtos. O parasitóide Trichogramma sp. ocorreu naturalmente em todas as áreas, mas a percentagem de parasitismo foi menor nas áreas pulverizadas. Outros estudos devem ser realizados a fim de avaliar o potencial dos parasitóides locais, provavelmente mais bem adaptados as condições locais, para o controle da traça-do-tomateiro. Se esses organismos forem efetivos, o uso de inseticidas em lavouras de tomate pode ser reduzido.

Monitoramento das alterações da cobertura natural em duas situações distintas da Amazônia Brasileira.

Divulga o mapeamento e identificação das alterações provocadas por atividades antrópicas, relacionando os ecossistemas mais visados com as diferentes atividades implantadas, em duas áreas da Região Amazônica.

Avaliação do sistema radicular e de rizomas de um campo natural diferido em Bagé, RS.

A utilização do Campo Sulino natural na pecuária de forma cada vez mais intensa e constante tem provocado a diminuição da sua condição produtiva. A excessiva remoção da parte aérea afeta o desenvolvimento das raízes. Um sistema radicular bem desenvolvido permite às plantas forrageiras explorar maior volume de solo, melhorando a absorção de água e nutrientes. As raízes também funcionam como órgão de reserva, assegurando rápida rebrota e produtividade das plantas forrageiras. O diferimento é uma prática de manejo de pastagens que pode ajudar a recuperar o campo por meio de descanso programado durante um tempo determinado. Este trabalho avaliou o efeito do tratamento de diferimento sobre o sistema radicular de campo natural após três anos de aplicação (agosto de 2000 a julho de 2003) na Embrapa Pecuária Sul (Bagé, RS). As avaliações foram realizadas no campo com presença animal durante todo o ano e sob diferimento de verão/outono (sem animais na área de março a junho). Foram coletadas 18 amostras de solo em cada tratamento, nas profundidades de 0?10 cm e 10?20 cm. As raízes e os rizomas foram separados do solo e entre si, secos e pesados. Houve diferença (p<0,05) para a porcentagem de raízes e a massa da matéria seca de rizomas. A testemunha apresentou 83,98% das raízes na camada de 0?10 cm e o diferimento, 77,5%. Na camada de 10?20 cm, sob diferimento houve aumento de 35% de raízes em relação à testemunha. A maior massa de matéria seca de rizomas foi obtida em pastagem sob diferimento, com 106% a mais em comparação à testemunha. Os resultados indicam vantagem do descanso da pastagem dos Campos Sulinos, tanto no acúmulo de reservas (maior quantidade de rizomas) voltado à propagação de gramíneas rizomatosas de interesse, quanto também no desenvolvimento de raízes na camada de 10?20 cm.

Natural Language Syntax and First Order Preference

We have argued elsewhere that first order inference can be made more efficient by using non-standard syntax for first order logic. In this paper we show how a fragment of English syntax under Montague semantics provides the foundation of a new inference procedure. This procedure seems more effective than corresponding procedures based on either classical syntax of our previously proposed taxonomic syntax. This observation may provide a functional explanation for some of the syntactic structure of English.

Gestão ambiental de estabelecimentos rurais no entorno da Reserva Particular do Patrimônio Natural (RPPN) Feliciano Miguel Abdala, Município de Caratinga, MG

2010

Surface Reflectance Estimation and Natural Illumination Statistics

Humans recognize optical reflectance properties of surfaces such as metal, plastic, or paper from a single image without knowledge of illumination. We develop a machine vision system to perform similar recognition tasks automatically. Reflectance estimation under unknown, arbitrary illumination proves highly underconstrained due to the variety of potential illumination distributions and surface reflectance properties. We have found that the spatial structure of real-world illumination possesses some of the statistical regularities observed in the natural image statistics literature. A human or computer vision system may be able to exploit this prior information to determine the most likely surface reflectance given an observed image. We develop an algorithm for reflectance classification under unknown real-world illumination, which learns relationships between surface reflectance and certain features (statistics) computed from a single observed image. We also develop an automatic feature selection method.

Type-alpha DPLs

This paper introduces Denotational Proof Languages (DPLs). DPLs are languages for presenting, discovering, and checking formal proofs. In particular, in this paper we discus type-alpha DPLs---a simple class of DPLs for which termination is guaranteed and proof checking can be performed in time linear in the size of the proof. Type-alpha DPLs allow for lucid proof presentation and for efficient proof checking, but not for proof search. Type-omega DPLs allow for search as well as simple presentation and checking, but termination is no longer guaranteed and proof checking may diverge. We do not study type-omega DPLs here. We start by listing some common characteristics of DPLs. We then illustrate with a particularly simple example: a toy type-alpha DPL called PAR, for deducing parities. We present the abstract syntax of PAR, followed by two different kinds of formal semantics: evaluation and denotational. We then relate the two semantics and show how proof checking becomes tantamount to evaluation. We proceed to develop the proof theory of PAR, formulating and studying certain key notions such as observational equivalence that pervade all DPLs. We then present NDL, a type-alpha DPL for classical zero-order natural deduction. Our presentation of NDL mirrors that of PAR, showing how every basic concept that was introduced in PAR resurfaces in NDL. We present sample proofs of several well-known tautologies of propositional logic that demonstrate our thesis that DPL proofs are readable, writable, and concise. Next we contrast DPLs to typed logics based on the Curry-Howard isomorphism, and discuss the distinction between pure and augmented DPLs. Finally we consider the issue of implementing DPLs, presenting an implementation of PAR in SML and one in Athena, and end with some concluding remarks.

Type-omega DPLs

Type-omega DPLs (Denotational Proof Languages) are languages for proof presentation and search that offer strong soundness guarantees. LCF-type systems such as HOL offer similar guarantees, but their soundness relies heavily on static type systems. By contrast, DPLs ensure soundness dynamically, through their evaluation semantics; no type system is necessary. This is possible owing to a novel two-tier syntax that separates deductions from computations, and to the abstraction of assumption bases, which is factored into the semantics of the language and allows for sound evaluation. Every type-omega DPL properly contains a type-alpha DPL, which can be used to present proofs in a lucid and detailed form, exclusively in terms of primitive inference rules. Derived inference rules are expressed as user-defined methods, which are "proof recipes" that take arguments and dynamically perform appropriate deductions. Methods arise naturally via parametric abstraction over type-alpha proofs. In that light, the evaluation of a method call can be viewed as a computation that carries out a type-alpha deduction. The type-alpha proof "unwound" by such a method call is called the "certificate" of the call. Certificates can be checked by exceptionally simple type-alpha interpreters, and thus they are useful whenever we wish to minimize our trusted base. Methods are statically closed over lexical environments, but dynamically scoped over assumption bases. They can take other methods as arguments, they can iterate, and they can branch conditionally. These capabilities, in tandem with the bifurcated syntax of type-omega DPLs and their dynamic assumption-base semantics, allow the user to define methods in a style that is disciplined enough to ensure soundness yet fluid enough to permit succinct and perspicuous expression of arbitrarily sophisticated derived inference rules. We demonstrate every major feature of type-omega DPLs by defining and studying NDL-omega, a higher-order, lexically scoped, call-by-value type-omega DPL for classical zero-order natural deduction---a simple choice that allows us to focus on type-omega syntax and semantics rather than on the subtleties of the underlying logic. We start by illustrating how type-alpha DPLs naturally lead to type-omega DPLs by way of abstraction; present the formal syntax and semantics of NDL-omega; prove several results about it, including soundness; give numerous examples of methods; point out connections to the lambda-phi calculus, a very general framework for type-omega DPLs; introduce a notion of computational and deductive cost; define several instrumented interpreters for computing such costs and for generating certificates; explore the use of type-omega DPLs as general programming languages; show that DPLs do not have to be type-less by formulating a static Hindley-Milner polymorphic type system for NDL-omega; discuss some idiosyncrasies of type-omega DPLs such as the potential divergence of proof checking; and compare type-omega DPLs to other approaches to proof presentation and discovery. Finally, a complete implementation of NDL-omega in SML-NJ is given for users who want to run the examples and experiment with the language.