Serveur d'exploration sur l'Université de Trèves - Curation (Istex)

Index « AbsEn.i » - entrée « necessarily »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
neatly < necessarily < necessary  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 10.
Ident.Authors (with country if any)Title
000796 (1996) Maurice Kogan [Royaume-Uni]Comparing higher education systems
000945 (1975) W. Kr LikowskiCoqruarks
000A73 (2005) Kurt D. Fenstermacher [États-Unis]A Process for Delivering Information Just in Time
001142 (1996) Michael Nast [Allemagne]Subdivision of simplices relative to a cutting plane and finite concave minimization
001285 (1994) C. Kirschbaum [Allemagne] ; G. Scherer [Allemagne] ; C. J. Strasburger [Allemagne]Pituitary and adrenal hormone responses to pharmacological, physical, and psychological stimulation in habitual smokers and nonsmokers
001319 (2007) Gerben G. Meyer [Pays-Bas] ; Nick B. Szirbik [Pays-Bas]Agent Behavior Alignment: A Mechanism to Overcome Problems in Agent Interactions During Runtime
001412 (2000) Axel Buchner [Allemagne] ; Werner Wippich [Allemagne]On the Reliability of Implicit and Explicit Memory Measures
001542 (2005) Mykola Pechenizkiy [Finlande] ; Alexey Tsymbal [Irlande (pays)] ; Seppo Puuronen [Finlande] ; Michael Shifrin [Russie] ; Irina Alexandrova [Russie]Knowledge Discovery from Microbiology Data: Many-Sided Analysis of Antibiotic Resistance in Nosocomial Infections
001775 (2010) Ralf Hendrix [Allemagne] ; J. Susanne Hauswaldt [Allemagne] ; Michael Veith [Allemagne] ; Sebastian Steinfartz [Allemagne]Strong correlation between cross‐amplification success and genetic distance across all members of ‘True Salamanders’ (Amphibia: Salamandridae) revealed by Salamandra salamandra‐specific microsatellite loci
001783 (2002) Eran Halperin [Israël] ; Uri Zwick [Israël]A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation
HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i -k "necessarily" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Curation/AbsEn.i  \
                -Sk "necessarily" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Istex
   |étape=   Curation
   |type=    indexItem
   |index=    AbsEn.i
   |clé=    necessarily
}}

Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024