Quantum and variational monte-carlo interaction potentials for li2 (x1-sigma-g+)

Optimized trial functions are used in quantum Monte Carlo and variational Monte Carlo calculations of the Li₂(X ¹Σ⁺_g) potential curve. The trial functions used are a product of a Slater determinant of molecular orbitals multiplied by correlation functions of electron—nuclear and electron—electron separation. The parameters of the determinant and correlation functions are optimized simultaneously by reducing the deviations of the local energy E_L (E_L  Ψ⁻¹_THΨ_T, where Ψ_T denotes a trial function) over a fixed sample. At the equilibrium separation, the variational Monte Carlo and quantum Monte Carlo methods recover 68% and 98% of the correlation energy, respectively. At other points on the curves, these methods yield similar accuracies.

源于G.I.Taylor工作的现代经典物理学

一位科学家的工作提供了一门完整课程的素材，涉及从流体动力学稳定性、湍流到流体电动力学、微生物的运动．

Starting Nozzle Flow Simulation Using K-G Two-Equation Turbulence Model

The starting process of two-dimensional nozzle flows has been simulated with Euler, laminar and k - g two-equation turbulence Navier-Stokes equations. The flow solver is based on a combination of LUSGS subiteration implicit method and five spatial discretized schemes, which are Roe, HLLE, MHLLE upwind schemes and AUSM+, AUSMPW schemes. In the paper, special attention is for the flow differences of the nozzle starting process obtained from different governing equations and different schemes. Two nozzle flows, previously investigated experimentally and numerically by other researchers, are chosen as our examples. The calculated results indicate the carbuncle phenomenon and unphysical oscillations appear more or less near a wall or behind strong shock wave except using HLLE scheme, and these unphysical phenomena become more seriously with the increase of Mach number. Comparing the turbulence calculation, inviscid solution cannot simulate the wall flow separation and the laminar solution shows some different flow characteristics in the regions of flow separation and near wall.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Histoire de Portugal : contenant les enterprises, navigations, & gestes memorables des Portugallois, tant en la cõqueste des Indes Orientales par eux descouvertes, qu'és guerres d'Afrique & autres exploits, depuis l'an mil quatre cens nonãte six, jusques à l'an mil cinq cens septante huit, sous Emmanuel premier, Jean troisieme, & Sebastian premier du nom / Pour Antoine Chuppin, ed. ; comprinse en vingt livres, dont les douze premiers sont traduits du latin de Ierosme Osorius, Euesque de Sylues en Algarve, les huit suivans prins de Lopez de Castagnede & d'autres historiensNouvellement mise en françois, par S.G.S. avec un discours du fruit qu'on peut recueillir de la lecture de cette histoire, & ample indice des matieres principales y contenues

Contém os empreendimentos, as navegações e os gestos memoráveis dos portugueses, inclusive em suas colônias.

Lagerversuch von frischem bzw. tief gefrorenen gelagerten kalt geräuchertem Atlantischem Lachs (Salmo salar) in 200-g-Fertigpackungen mit sensorischer Beurteilung in Abhängigkeit von der Lagerzeit

After 4 months frozen storage at –18 °C cold smoked Atlantic salmon in consumer packages can hardly be differentiated from the freshly smoked product by sensory assessment by an expert panel and cannot be differentiated by consumers.

Role of G protein coupled inwardly rectifier K+ channels (GIRK) on the neurobiology depression

353 págs.

液氮温区G-M制冷机的数值分析及新型结构制冷机的研制

G-M制冷机是回热式的小型低温制冷机，它利用绝热放气膨胀原理（又称为西蒙膨胀法）获得低温，具有振动小、运行稳定、寿命长、操作方便等特点，在对效率、重量、尺寸等没有太高要求的场合应用非常广泛。在八十年代末，G-M制冷机已经突破了液氦温度，非常适合在液氦温区为超导器件或电子元件提供冷量，在低温真空泵、MRI超导磁体冷却系统、SQUID再冷凝系统等方面有良好的应用前景，推广其应用已属当务之急。本文围绕着探索氦温区G-M制冷机工作机理、提高低温蓄冷器性能及新型结构G-M制冷机的研制等方面，进行了系统地理论分析和纳归纳，以及初步地实验研究：一. 首次比较完善地建立了液氦温区G-M型制冷机整机数值模拟方法，数值模拟方法给出了制冷机内工质参数瞬态分布及动态变化曲线，为分析制冷机独特的循环特性提供了直观的依据，为探讨运行及结构参数对制冷性能的影响机理提供了强有力的工具。模型中考虑了制冷机中的阻力、实际进排气角、物性变化及蓄冷器内空隙率的存在等多种实际因素：解决了一、二级耦合及部件交界处物性变化不连续对计算影响等问题；采取网格非均匀化、牛顿迭代法以及负反馈原理等措施，提高了计算精度和收敛性。在微机上成功地模拟了液氦温区G-M制冷机的工作过程，程序采用模块化编程，具有一定通用性。二. 运用液氦温区整套机数值模拟方法，计算了制冷机内工质参数（氦流温度、压力、流速等）周期性变化和空间分布，采用一级蓄冷器与低温蓄冷器工作特性对比法，从整机内工质参数动态变化规律分析的角度，验证了液氦温区G-M制冷机工质氦的循环主要分为两部分：常规循环、低温循环。并详细地讨论了运行参数（频率、工作压力）及一级制冷机结构参数对整机内工数动态变化的影响规律以及制冷机性能的影响机理。三. 首次建立了较完善的液氦温区多层混合填料型低温蓄冷器的数值模拟方法，运用数值模拟方法，首次详细地研究了常用填料的不同组合、一定组合下填料比例以及蓄冷器结构对制冷机性能的影响机理，提出了不同填料的最佳节组合及一定组合下填料最佳比例的确定和低温蓄冷器结构和填料优化的原则，为合理有效地设计高性能液氦温区低温蓄冷器提供了依据。四. 提出并设计、加工了一种新型结构的液氦温区双级G-M型制冷机，该机结构在国内外属于首创。其具有以下主要结构特点：一、二级分别独立驱动；一、二级之间通过热桥连接；二级蓄冷器外置于汽缸等。同时建立了新型结构液氦温区双级G-M型制冷机实验系统，为今后整机性能和内部动态过程的研究奠定了基础。五. 新型结构双级G-M型制冷机二级单机动转频率为0.6Hz时，制冷温度为13.6K，且在20K时有4.4W的制冷量；制冷机已达到液氦温区，f = 0.4Hz时，最低温度为4.6K；f = 1Hz，制冷温度为10K时，制冷量大于6W，上述结果目前均未见有文献报道。在新型G-M制冷机上，初步进行了低温蓄冷器性能测试实验及运行参数对制冷机性能影响的实验研究。

La gestión de las actividades musicales del G-9 en contextos de educación fornal y no formal

479 p.

Length weight relationship, condition factors and fecundity of Chrysichthys nigrodigitatus and Chrysichthys walkeri in Asejire Lake

Sex ratio and fecundity variations of Chrysichthys nigrodigitatus and Chrysichthys walkeri from Asejire Lake (Nigeria) were examined. The Logarithm transformation of weight (W) against standard length (SL) gave a straight-line graph represented by the following equations: 1) C. nigrodigitatus LogW =-0.66 + 2.13 Log SL; = 0.854; (P < 0.001) n = 209; 2) C. walkeri LogW = -1.23 + 2.63 Log SL; = 0.759; (P < 0.001) n = 237. Males were generally more than females in both species. The ratio of males:females was higher in C. nigrodigitatus (1:0.18) than in C. walkeri (1:0.8). C. walkeri attained sexual maturity at a smaller size of 20.0 g (12.0 cm Standard Length) compared with C. nigrodigitatus maturity size of 45.0 g (14.0 cm Standard Length). Relative fecundity was not dependent on body weight and standard length for C. walkeri but it was significant at P < 0.05 and P < 0.01 respectively for C. nigrodigitatus