dataesr/scientific-paragraphs-categorization huggingface dataset:
For each affiliation string with an extracted country or state name, we also match the city name against GeoName database  45  corresponding to its country or US state. 92. 6% of affiliation strings with extracted city names are subsequently verified with Google Map API. Finally, a total of 425, 233 publication articles successfully pass the filters we describe here. The dataset also provides 4, 710, 548 records of citations between articles published in APS journals. To build citation networks at the city level, we merge the citation links from the same source node to the same target node, and put the total citations on this link as the weight. For articles with multiple city names, the weight will be equally distributed to the links of these nodes. There are totally 2, 765, 565 links for city-to-city citation networks from 1960 to 2009.
In this paper, we consider flow and transport in highly heterogeneous porous media. Because of the widelyscattered medium heterogeneity, velocity values of groundwater span several orders of magnitudes. Particles are advected by the velocity field along the flow lines and can switch from flow lines because of diffusion and hydrodynamic dispersion and their spreading creates a so-called plume. The development of the plume has been analyzed for a finitely-correlated permeability field  [13] ,  [25] ,  [38]. Thanks to the software PARADIS  [20] , the full development of the plume was simulated for the first time in large 2D domains and asymptotic dispersion was computed with no ambiguity  [14] ,  [15] ,  [18]. Numerical models with random input data have been extensively studied recently. Stochastic finite element methods as well as collocation stochastic methods or multilevel Monte Carlo methods were developed, see for example  [2] ,  [3] ,  [4] ,  [9] ,  [11] ,  [12] ,  [22] ,  [24] ,  [27] ,  [31] ,  [33] ,  [40] ,  [42].
Parallel algorithms and numerical software Because the domain is very large, simulations must rely on high performance computing. In order to cope with high memory and CPU requirements, parallel versions of the algorithms were designed and implemented in the parallel software PARADIS  [20]. A distributed memory approach is used, with a message passing programming model. The domain is decomposed into subdomains and ghost cells are used in order to communicate data at the interfaces. By using this domain decomposition and allocating one subdomain to each process, conductivity is generated in parallel and the matrix is built in parallel. Then, the distributed flow linear system is an input to a parallel sparse linear solver, which may use internally another data distribution, but keeps the same distribution for output.
Choice of the sparse linear solver The most CPU time consuming part of the PARADIS software is the sparse linear solver. We discuss first some numerical experiments with Preconditioned Conjugate Gradient, preconditioned by incomplete Cholesky, for 2D domains. In Figure  1 , we plot the convergence history of PCG for varying system size and several values of σ. Clearly, the number of iterations increases quite rapidly with heterogeneity and very rapidly with the size of the domain. Thus a multilevel approach is necessary to handle the large system size. We thus switch to multigrid methods, using Hypre library, with SMG (structured or geometric) and AMG (algebraic) multigrid solvers. Experiments were done on a parallel cluster of the Grid'5000 computing resource installed at Inria in Rennes.
5Ghz for the second group), and with 16 Go of RAM. It runs a Linux system. Generating the conductivity field is very fast and takes less than one second. In order to validate the generated conductivity field, we analyze the convergence of the expectation and the variance versus the number of Monte Carlo simulations. Recall that the exact expectation of Y = log K is µ = 0 and the exact variance is σ = 1. We compute for each realization l, the discrete mean value of Y over the physical domain: We check the property that lim Ns→∞ ν = µ and that this convergence is fast thanks to the ergodic properties of Y and to the large domain. In Figure  4 , we plot ν versus the number N s of simulations. Clearly, only a few Monte Carlo iterations are required to get an accurate value, close to 0. We also compute the discrete variance of Y over the physical domain: σl = 1 N N i=1 (Y 2 i,l -μ2 l ).
In both Figures  7  and 8 , we observe that the macro spreadings converge quite rapidly when increasing the number of simulations, provided that the number of particles is large enough. This saves CPU time since each new sample requires computing a velocity field, thus solving a large linear system. Thus, it seems that convergence of macro spreading is governed by N p and N s in a more efficient way than predicted by the theory. We assume that this behavior is related to the ergodic properties of the physical data. Thanks to the software PARADIS, it is possible to study in 3D domains the macro dispersion and its asymptotic behavior. The impact of the heterogeneity can be well shown, by varying the variance σ and the numerical results can be compared with those from a perturbation theory  [5].
h The Mizar proof checker is closed-source; the MML is free. i Common Algebraic Specification Language. 'CASL/TPTP' denotes our use of CASL as an input language for automated FOL provers (here: SPASS, E, Darwin) using the TPTP  [32]  exchange language. CASL features some second-order features, e. g. inductive datatypes. j The proof is largely automatic. However, Vickrey's theorem is too complex to for automated proving in one step. Thus, the proof script introduces auxiliary lemmas and selects suitable axioms and provers for proving them. Proof times range from fractions of seconds if the exact list of axioms used is known beforehand to hours if not. However, once a proof is found, the prover can output the list of axioms used and thus speed up subsequent replays of the proof. k Heterogeneous tool set; gives access to a wide range of automated theorem provers.
Isabelle's prover configuration is editable within the formalisation source. Theorema stores it in hidden fields within the formalisation and exposes it via a dedicated GUI. Configuring proof tools in Hets is separate from the formalisation: the proof management GUI does not currently store settings persistently; however one can write scripts to be processed on the command line. Just as Isabelle requires complex statements to be proved in multiple steps, involving different proof methods, the automated provers of Theorema  24  and Hets also require guidance by explicit configuration at times, as can be seen from the *. hpf proof scripts in our Hets formalisation  [23]. Often, a theorem c : A ⇒ C was too complex for automated proving, whereas the job could be done by a script that first proved auxiliary lemmas a : A ⇒ B and b : B ⇒ C, possibly with different provers, and then proved c providing only a and b as axioms.
This is conceptually the same as in Isabelle but has four significant user experience differences: 1. Each additional 'proof step' has to be stated as a lemma with full assumptions on the left hand side (similar to the example in §4. 2), 2. CASL, originally a specification rather than a prover language, does not syntactically distinguish theorems from lemmas, 3. the scripts have to be maintained separately from the formalisation, and 4. a multi-step proof takes many seconds longer, as Hets translates the input theory from CASL to the respective prover's native language before each proof. 25 This gives a clear incentive to eliminate unnecessary proof steps from a CASL formalisation. This experience also influenced our Isabelle formalisation, where writing multi-step proofs is comparatively painless.
There, one lemma had a three-step proof, until experiments with the CASL formalisation made us attempt an automated proof. Thus we realised that we could reduce the Isabelle proof to a single step. 26 izar differs by focusing, instead of built-in tactics and automated proof methods, on a natural deduction style which 'tries to "keep a low profile" in its logical foundations' and aims at 'clarity, human readability and closeness to standard mathematical proofs'  [38]. Influenced by Mizar, the Isar language ('intelligible semi-automated reasoning') replaced Isabelle's original tactic interface. In the name of its readability focus, Mizar deliberately prevents users from extending the verifier's power  [38, §2. 1] , often forcing them to justify trivial passages. Mizar's registrations do allow for custom automation  [4] ; however, these at times involute exploits often push registrations beyond their intended scope  [20]  and may result in implicit inferences and less readable proofs.
Term Input Syntax (req. C1b) Conversations with auction designers suggest that they find Theorema's term input syntax most accessible. The two-dimensional notation in Mathematica notebooks is similar to textbook notation, and our target audience is largely familiar with Mathematica. The syntax of Isabelle and CASL is closer to programming languages. Isabelle's functional type syntax f : A ⇒ B ⇒ C looks less closely related to textbook notation than CASL's f : A * B → C. Isabelle, CASL and Mizar allow for defining custom 'mixfix' operator notations. Isabelle provides rich translation mechanisms beyond that, but the layout remains onedimensional, e. g. ∀x ∈ A. B(x) instead of Theorema's ∀ x∈A B[x] for bounded quantification. Isabelle Proof General and Isabelle/jEdit approximate textbook notation by Unicode symbols.
Isabelle, Mizar and Hets can export L A T E X. Mizar uses ASCII; its lack of binders makes mathematical concepts such as limits and sums cumbersome to denote  [43]. A major reason for us not to cover the TPTP language is its technical, non-extensible ASCII syntax (using, e. g. , !/? for ∀/∃). Theorema, CASL and Mizar support sharing common quantified variables across multiple statements, corresponding to the practice of starting a textbook section even of several axioms like 'let n, the number of participants, be a natural number ≥ 1'. This helps to avoid redundancy but is prone to copy/paste errors. For example, our CASL formalisation has sections with global quantifiers ∀i, j (e. g. to accommodate the maximum and second-price auction definitions of §3. 2), but these include axioms that only use i.
5 Related Work §1 mentioned earlier efforts to formalise economics. Particularly Arrow's impossibility theorem, one of the most striking results in theoretical economics, has been a focus for formalisation efforts, including Nipkow's Isabelle and Wiedijk's Mizar formalisation  [30, 42]. As in our case (cf. §3. 2), they required initial paper elaboration; additionally, it helped them to identify omissions in their source  [9]. This source states three alternative proofs, but Tang's/Lin's fourth, inductionbased proof, allowed for obtaining insights on the general structure of social choice impossibility results using computer support  [36]. The formal verification technique of model checking has been applied to auctions. Tadjouddine et al. proved the strategy statement of Vickrey's theorem via two abstractions to reduce the model checker's search space: program slicing to remove variables irrelevant w.
r. t. the property, and discretising bid values (e. g. 'higher than someone's valuation v i ')  [35]. Our formalisation is, to the best of our knowledge, the first for theorem provers; in the more expressive languages it has the comprehensibility advantage of preserving the structure of the original domain problem. From earlier economics formalisation efforts cited above, it differs in its goal to (ultimately) help economists to use formal methods themselves. Our focus thus lies on comparing different provers by full parallel formalisation. Wiedijk compared Isabelle/HOL, Mizar, Theorema, and 14 other provers by general, technical criteria, studying the code resulting from experts formalising a pure mathematics theorem ( √ 2 / ∈ Q), and comparing it to a detailed paper proof  [44]. We complement this with the end user's perspective: our observations, e.
g. , on the closeness of the input syntax to textbook notation or the comprehensibility of the output are general, but we emphasised these criteria as they are important to auction designers. Griffioen's/Huisman's 1998 PVS and Isabelle/HOL comparison is, like Wiedijk's, independent from a specific application but closer to ours in its look at systems' weaknesses from a user's perspective  [12]. Like us, they rate proof management and user support, but go into more detail up to the 'time it takes to fix a bug'. Their findings on user interfaces have been obsoleted by progress in developing textbook-like proof languages and editors with random access and asynchronous validation.
For a concrete application, our findings confirm the widespread intuitions that formalisation benefits from an initial paper elaboration, that the 'automated vs. interactive' distinction proves of little importance in practice, and that no single system satisfies all requirements. For now, our comparison results in Tab. 2 guide auction designers in choosing a system, given their formalisation requirements and experience. The ideal theorem proving environment would feature a library as versatile as in Isabelle or Mizar, a prover as efficient as those of Isabelle or Mizar, giving error messages as informative as in Isabelle/jEdit, further a proof input language as close to textbook style as those of Isabelle or Mizar, or an interface to explore automated proofs as informative as Theorema's, a textbook-like term syntax as Theorema's, an integration of diverse tools as in Isabelle or Hets, and a community as lively as Isabelle's.
We have not yet exploited all strengths of the systems evaluated: maintaining a growing ATT with increasingly complex dependencies will benefit from stronger modularisation, as supported by Isabelle and even more so by the theory graph management of Hets/CASL. Regarding auction practice, we are working towards ways to check that formal definitions of auctions are well-defined functions ('for each admissible bid input there is a unique outcome, modulo some randomness'). Given a constructive proof of this property, it should be possible to obtain verified program code that determines the outcome of an auction given the bids. This may work using Isabelle's code generator, but we will also explore provers based on constructive type theory. Broader conclusions about auction theory require further research.
TASK AND DATA COLLECTION Anonymous paper and pencil questionnaires were used. The questionnaire started with socio-demographic questions to collect anonymous data on gender, familyhood, age, level of education, work, marital status, children, religion, and mother tongue. After reading each dilemma, the participant had to answer successively two questions by Yes or No: "Is it acceptable to. ?" (Judgment condition) and "Would you. ?" (Choice of action condition). Participants were instructed to imagine each hypothetical situation as vividly and realistically as they could and to be as honest as possible in their decision. In addition, we insisted on the anonymous nature of the questionnaires and instructed participants not to go back to check and/or change any of their prior responses.
Acknowledgements The Mosaic of Life workshop would have not been possible without the generous help of Aboagora and the  University of Turku. We thank the  Center for Research and Interdisciplinarity (Paris)  for the development of the initial workshop ideas and for starting a stimulating cooperation with Aboagora. We thank the speakers  Dr Ilppo Vuorinen  and Environmental Coordinator at  Åbo Akademi University Ea Blomqvist  who dedicated their time to explain their research and views on the Baltic Sea to the participants,  Asko Nivala  for organizing the workshop and to the people working in the  Archipelago Research Institute at Seili , who interacted very positively with us. And last but not least, a big thanks to all the participants for having a positive attitude and for their intellectual contribution to the workshop.
Protein Analysis Determination of protein concentrations, Blue Native PAGE analysis, redox titration, protein activation due to the bound endogenous oxaloacetate and subsequent activity measurements were performed as described previously  [14]. In addition, the enzyme activity was assayed at 30uC in the presence of DCPIP (2,6-dichlorophenolindophenol), 0. 05 mM nonyl-4-hydroxyquinoline-N-oxide (NQNO) and Vit. K 3 , DQ (duroquinone), 1,4-NQ (1,4-naphthoquinone) or p-BQ (p-benzoquinone) at concentrations of 0-1 mM. Circular dichroism (CD) analysis was performed using a Chirascan CD spectrometer (Applied Photophysics) and Chirascan Pro-Data acquisition software. For the CD analysis in the far UV range (180 to 280 nm), quartz suprasil (QS) cuvettes of 0. 1 mm path length (Hellma GmbH) were used.
plantmineral nutrition. net/Geochem/Geochem%20Download. htm) (Shaff et al. 2010 ) and the MINEQL?4. 62. 2 software (http://www. mineql. com/) (Kraepiel et al. 1999). The algae species used were obtained from the Roscoff culture collection (http://www. sb-roscoff. fr/Phyto/ RCC/index. php): P. tricornutum RCC69, O. tauri RCC745 and E. huxleyi RCC1242 (a calcifying strain of E. huxleyi).
Iron speciation The theoretical speciation of iron (0. 1 lM), added as ferric citrate (1:20) or ferric EDTA (1: 1. 1) in a medium containing 10 mM CaCl 2 and 10 mM MgSO 4 at pH 7. 5 is as follows [estimations based on the use of the GEOCHEM-EZ software  (Shaff et al. 2010) ]: 97. 45 % of the iron is expected to precipitate when added as ferric citrate (1:20), with only 2. 03 % soluble iron-citrate complex and 0. 52 % of iron complexed with OH -; 88. 58 % of the iron would precipitate when added as ferric EDTA (1:1. 1, i. e. a 10 % excess of the EDTA ligand), with 10. 9 % soluble ferric EDTA complex and 0. 52 % of iron complexed with OH -. The ligand/iron ratio of ferric EDTA (using 25. 1 as the log K for ferric EDTA) has to be increased to twenty for the theoretical concentration of soluble ferric EDTA to increase to 99.
Effect of the iron source on cell yields and chlorophylls We compared ferric EDTA and ferric citrate (1:20) in a wide range of concentrations (1 Nm-10 lM), for their ability to sustain growth of O. tauri, P. tricornutum and E. huxleyi. We also measured the mean fluorescence intensity of chlorophylls (''FL3'' channel, excitation 488 nm, emission C670 nm), at different time points, as an indication of the amount of cell chlorophylls. Full data are presented in Table  S1. Figure  1a  shows selected growth curves of O. tauri precultured for 1 week in a medium with no iron and then inoculated in media containing various amounts of either ferric EDTA or ferric citrate (full data are presented in Table  S1 ). Cells of this species progressively died a few days after strict iron deprivation (no iron added, Fig.
Acknowledgments We thank  William Schecher  ( Environmental Research Software ) for his help in the use of MINEQL software. This work was funded by the  French ''Agence Nationale de la Recherche''  ( grant ''PhytoIron'' ANR   11 BSV7 018 02 ),  Czech Science Foundation  ( 13-25349S ),  Marie Curie European Reintegration  Grant (within the 7th European Community Framework Program), the  European Social Fund  and the state budget of the  Czech Republic  ( CZ. 1. 07/2. 3. 00/30. 0061 ),by the project '' BIOCEV -Biotechnology and Biomedicine Centre of the Academy of Sciences and Charles University '' ( CZ. 1. 05/1. 1. 00/02. 0109 ),from the  European Regional Development Fund  and by  CNRS BDI  fellowship (to HB). Open Access This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
Data collection procedure All of the data tied to the form and quantity of the inputs (raw materials, chemicals, energy, etc. ), the outputs, and the emissions to air, soil and water throughout the vegetable oil life-cycle has to be collected. The reliability of the environmental information given to stakeholders hinges on quality data collection. However, data collection can prove a long and tedious task. The data were collected for the purpose of providing results applicable to all rapeseed and sunflower oils produced in mainland France. This data and the procedures used to integrate the impacts of farming rapeseed and sunflower seed crops were essentially borrowed from the ADEME's biofuel study  (ADEME 2010). The CETIOM (French technical center for oilseed crops and industrial hemp) lent support to the project steering committee and the ITERG on interpreting this data, and completed the LCIs where necessary.
Concerning industrial oil production, all the data was collected based on 2006-2010 figures for edible oil production plants run by Saipol and Lesieur. The project steering committee deemed that this panel of industrial-scale plants was representative of French sector as a whole. This industrial data made it possible to integrate the mean consumptions and emissions figures recorded in France over the 2006-2010 period. The oils modelled do not, therefore, correspond to real-world brand oils on sale, but instead give a generic picture of sector practices in 2010. The "1L" PET bottle format represents the majority of rapeseed and sunflower oil sales in France, and was consequently the only packaging system assessed. The packaging end-of-life scenarios used were drawn based on our hypotheses and published papers  (ADEME 2009; ADEME 2010; RDC Environnement 2010; Shen 2011 ) and completed by following the recommendations given in the "methodology for assessing the environmental impacts of foods" master guideline validated by the ADEME/AFNOR platform (AFNOR 2012).
LCAs rarely integrate the water consumption indicator. Data on water consumption in the processes transforming oilseed into oil is easy to collect (direct consumption), whereas water consumption tied to manufacturing production-process inputs (indirect consumption) is far more difficult to identify and so has to be adapted from databases. This indicator is very tricky to interpret. Note too that it reflects water use in its quantitative dimension but fails to capture the qualitative dimensions of local conditions and water stress. To illustrate, a French citizen consumes an estimated 151 L of water per day in the course of their everyday activities, as showering, flushing the toilet, washing up, the washing machine, drinking, and cooking all take their toll (CGDD [Department of the Commissioner-General for Sustainable Development] 2011).
This simplified method substantially reduces the data collection effort by proposing default values for certain data items that are not readily accessible or that have little impact on the LCA results, and by proposing a list of data that can be excluded from scope of the study. At European level, the EC is currently finalizing a protocol designed to propose a multicriteria environmental impact assessment method for foods through inter-company coordination and dialog with consumers. The EC also plans to release versions of this protocol for different product categories, and to publish the allied databases and impact calculation tools.
Acknowledgements. The authors thank the ONIDOL and the  GTOM  for funding support. The authors also thank the project steering committee members who contributed to this study:  Mireille Besson-Giordano  ( St Hubert ),  Hubert Bocquelet  (FNCG),  Jean-Marc Buteux  (Lesieur),  Julien Coignac  (Sofiprotéol),  Sylvie Dauguet  (CETIOM),  Pauline Robert  (FNCG),  Bernard Ticot  (ONIDOL) and  Sylvain Tostain  (Saipol). A401, page 10 of 11 L. Badey et al. : OCL 2013, 20(4)  A401.