Semi-automatic Column Type Inference for CSV Table Understanding

Author(s):  
Sara Bonfitto ◽  
Luca Cappelletti ◽  
Fabrizio Trovato ◽  
Giorgio Valentini ◽  
Marco Mesiti
1978 ◽  
Vol 43 (3) ◽  
pp. 713-718 ◽  
Author(s):  
Jaroslav Votruba ◽  
Miroslav Sobotka ◽  
Aleš Prokop

2001 ◽  
Vol 7 (S2) ◽  
pp. 920-921
Author(s):  
Yukihito Kondo ◽  
Kimiharu Okamoto ◽  
Mikio Naruse ◽  
Toshikazu Honda ◽  
Mike Kersker

Ultrahigh-vacuum transmission electron microscopy (UHVTEM) has become increasingly popular for the direct observation of nanostructures having clean surfaces, since industrial requirements to make and research nano-scale materials have been rapidly growing for quantum or nanoscale electronic devices. Since we have first developed high resolution UHVTEM in 1986, the UHVTEMs have been evolved with steady advances such as UHV compatible goniometer, field emission gun or etc. Furthermore, the UHVTEM started to combine analytical capabilities such as energy dispersive X-ray spectrometer, in-column type energy filter and etc., and to combine STM (scanning tunneling microscope). The UHV technology is essential for the analysis, because the portion of contaminant in a nano-scale specimen increases as the size of the specimen goes down. This paper reports the results of gold nanostructures by recently the developed UHVTEM.Figure 1 shows recently developed UHVTEM with Schottky type field emission gun.


2011 ◽  
Vol 46 (2) ◽  
pp. 43-52 ◽  
Author(s):  
Arie Middelkoop ◽  
Atze Dijkstra ◽  
S. Doaitse Swierstra

2016 ◽  
Vol 51 (10) ◽  
pp. 781-799 ◽  
Author(s):  
Calvin Loncaric ◽  
Satish Chandra ◽  
Cole Schlesinger ◽  
Manu Sridharan

1993 ◽  
Vol 19 (1-2) ◽  
pp. 87-125
Author(s):  
Paola Giannini ◽  
Furio Honsell ◽  
Simona Ronchi Della Rocca

In this paper we investigate the type inference problem for a large class of type assignment systems for the λ-calculus. This is the problem of determining if a term has a type in a given system. We discuss, in particular, a collection of type assignment systems which correspond to the typed systems of Barendregt’s “cube”. Type dependencies being shown redundant, we focus on the strongest of all, Fω, the type assignment version of the system Fω of Girard. In order to manipulate uniformly type inferences we give a syntax directed presentation of Fω and introduce the notions of scheme and of principal type scheme. Making essential use of them, we succeed in reducing the type inference problem for Fω to a restriction of the higher order semi-unification problem and in showing that the conditional type inference problem for Fω is undecidable. Throughout the paper we call attention to open problems and formulate some conjectures.


Sign in / Sign up

Export Citation Format

Share Document