Rocket engine numerical simulation

The topics are presented in view graph form and include the following: a definition of the rocket engine numerical simulator (RENS); objectives; justification; approach; potential applications; potential users; RENS work flowchart; RENS prototype; and conclusions

Over talen en tekens: bijdragen van jonge Gentse linguïsten

This volume in the annual series of the BGG presents contributions of four young linguists: Jesse Berwouts (on the construction "eat yourself thin"); Sara Delva (on "sollte", "moest" and "mocht" in conditional clauses); Dario Rens (on the transition from a dative construction to a prepositional construction in Dutch); and Doesjka Tilkin (on spelling issues in Scandinavian runic inscriptions)

Upgrading of Resolution Elastic Neutron Scattering (RENS)

An update of the Resolution Elastic Neutron Scattering (RENS) approach consisting in measuring the elastically scattered neutron intensity versus the instrumental energy resolution is presented. In particular it is shown that the measured elastic scattering law as a function of the logarithm of the instrumental energy of resolution gives rise to an increasing sigmoid trend whose inflection point can be connected with the system relaxation time. The validity of the RENS approach is supported by a numerical simulation, taking into account a Gaussian resolution function and a Lorentzian scattering law, and experimentally by integrated EINS and QENS measurements performed as a function of temperature on three homologous disaccharide/water mixtures showing different relaxation times. Furthermore, the most important advantages of the RENS approach are discussed; in particular, in comparison with QENS, the RENS approach requires a smaller amount of sample, which is an important point in dealing with biological and exotic systems, is not affected by the use of model functions for fitting spectra, and furnishes a direct access to the system relaxation time

An improved parser for data-oriented lexical-functional analysis

We present an LFG-DOP parser which uses fragments from LFG-annotated sentences to parse new sentences. Experiments with the Verbmobil and Homecentre corpora show that (1) Viterbi n best search performs about 100 times faster than Monte Carlo search while both achieve the same accuracy; (2) the DOP hypothesis which states that parse accuracy increases with increasing fragment size is confirmed for LFG-DOP; (3) LFG-DOP's relative frequency estimator performs worse than a discounted frequency estimator; and (4) LFG-DOP significantly outperforms Tree-DOP is evaluated on tree structures only.Comment: 8 page

Data parsing for optimized molecular geometry calculations

The purpose of this project is to optimize and streamline to process of using ADF and ReaxFF. There is no efficient way to effectively add constraints to a compound and run it through ADF, take the ADF output and create a file that can be run through Reaxff, then take that Reaxff output and come to conclusions on it. To streamline this process, scripts were developed using Python to parse information out of data generated by ADF