1

Zdenek ZdrahalKnowledge Media institute

The Open University26 October 2012

From Bletchley to CORENew Challenges in Open Access

2

Open Access Resources

OA inferred knowledge

Green OA papers

OA research

data

Services

Gold OA

3

A few examples of new tasks

4

Melvin Webber Herbert Simon Alan Turing

Dilemmas in a GeneralTheory of Planning

Rittel & Webber(1973)

… wicked and tame problems

The Structure of Ill Structured Problems

H.Simon(1973)

… well and ill structured problems,

GPS

On Computable Numbers …

A.Turing(1935)

… algorithmsTuring machine

5

On Computable Numbers …

A.Turing(1935)

… algorithmsTuring machine

Herbert Simon Alan Turing

The Structure of Ill Structured Problems

H.Simon(1973)

… well and ill structured problems,

GPS

Melvin Webber

Dilemmas in a GeneralTheory of Planning

Rittel & Webber(1973)

… wicked and tame problems

6

On Computable Numbers …

A.Turing(1935)

… algorithmsTuring machine

Dilemmas in a GeneralTheory of Planning

Rittel & Webber(1973)

… wicked and tame problems

Alan TuringMelvin Webber Herbert Simon

The Structure of Ill Structured Problems

H.Simon(1973)

… well and ill structured problems,

GPS

7

Dilemmas in a GeneralTheory of Planning

Rittel & Webber(1973)

… wicked and tame problems

The Structure of Ill Structured Problems

H.Simon(1973)

… well and ill structured problems,

GPS

Herbert SimonMelvin Webber Alan Turing

On Computable Numbers …

A.Turing(1935)

… algorithmsTuring machine

8

Melvin Webber Alan TuringHerbert Simon

Dilemmas in a GeneralTheory of Planning

Rittel & Webber(1973)

… wicked and tame problems

The Structure of Ill Structured Problems

H.Simon(1973)

… well and ill structured problems,

GPS

On Computable Numbers …

A.Turing(1935)

… algorithmsTuring machine

9

Dilemmas in a General

Theory of PlanningRittel & Webber

(1973)

… wicked and tame problems

The Structure of Ill Structured Problems

H.Simon(1973)

… well and ill structured problems,

GPS

On Computable Numbers …

A.Turing(1935)

… algorithmsTuring machine

?

Citations

10

UNESCO Conferences

http://unescore-clic.org/

for

11

12

13

Conclusions 1

Reasoning

Assumptions

Paper

14

Conclusions 1

Assumptions 2Assumptions 1

Reasoning 1 Reasoning 2

Paper 1 Paper 2

15

Conclusions 1 1

Assumptions 1

Reasoning 1 Reasoning 2

Paper 1 Paper 2

Conclusions 21

16

Brief Genesis of CORE

• Bletchley Park Text

• Eurogene

• The CORE Family- CORE- ServiceCORE- DiggiCORE

17

Enigma A.Turing Colossus Bombe Hut 6

Story 1 Story 3 Story 4 Story 5Story 2

objectobjectobject people place

Bletchley Park Text (2003)

18

• Measuring mutual information between two concepts.

BTM-Works → Giant-Bombe I = 8.589 [bit]Giant-Bombe → Hut-6 I = 3.065 [bit]Hut-6 - Newmanry I = 0.895 [bit]Newmanry - Colossus -MK-II I = 5.419 [bit]

What does it mean?

BTM Works

GiantBombe

Hut 6 NewmanryColossus MK-2

Sequencing concepts and resources

19

http://www.bletchleypark.org.uk/text/

… available since 2005

20

Eurogene (2005)

• Sharing OA educational resources in human genetics• Multilingual (10 languages), automatically annotated

by domain specific ontology (… controlled vocabulary)• Machine translation of text• Academic levels• Multimedia• Learning packages• Available online since 2008 http://eurogene.open.ac.uk

21

22

• Basic CORE infrastructure developed, harvested 60 repositories, full text similarity

• ServiceCORE … 271 OAR (all 142 UK) harvested, metadata + full text, semantic similarity, deduplication, mobile apps, 9M metadata, 500k full text, API, 100M LOD triples, SPARQL, plugin, repository analytics|

• DiggiCORE … networks: citations of papers, citations of authors, semantic similarity of papers … infrastructure

The CORE Family

23

CORE visits (October 2012)

More than 6000 visits per day

… but this is just the start!

24

OAR ChallengesStandard• Aggregation of OA resources• Integration textual resources with

OA research data• Provide intelligent search for papers and research• Support OA repositories

Advanced• Provide computer access to OA resources across repositories• Enable mining and sharing of inferential knowledge from OA

resources across repositories• Support the development of new services that use the existing and

inferential knowledge

25

OAR ChallengesNovel case studies• Develop selected services based on

citations networks, subject classification, author/co-author/citation networks.

• Develop novel methods for measuring impact of publications and authors

• Develop methods for measuring cross-fertilization between different domains based on the above.

• Develop methods for evaluating trends in scientific disciplines.

26

Thank you!

27

back to Melvin Webber

28

29

back to Herbert Simon

30

A. TURING

"On Computable Numbers, with an Application to the Entscheidungs Problem." This is a bizarre paper. It begins by defining a computing device absolutely unlike anything I have seen, then proceeds to show—I haven't quite followed the needlessly complicated formalism—that there are numbers that it can't compute. As I see it, there are two alternatives that apply to any machine that will ever be built: Either these numbers are too big to be represented in the machine, in which case the conclusion is obvious, or they are not; in that case, a machine that can't compute them is simply broken!Any tabulating machine worth its rent can compute all the values in the range it represents, and any number computable by a function—that is, by applying the four operations a number of times—can be computed by any modern tabulating machine since these machines—unlike the one proposed here with its bizarre mechanism——have the four operations hardwired. It seems that the "improvement" proposed by Turing is not an improvement over current technology at all, and I strongly suspect the machine is too simple to be of any use.If the article is accepted, Turing should remember that the language of this journal is English and change the title accordingly.

back to Alan Turing