Scientific Software Development - Copyright 2001 Thomas Muhr Scientific Software Devel opment - Copyright 2001 T homas Muhr This set of 21 PowerPoint transparencies contains This set of 21 PowerPoint transparencies contains information about concepts and use of ATLAS.ti, information about concepts and use of ATLAS.ti, Please read copyright note on transparency no. 2. Please read copyright note on transparency no. 2. ATLAS ATLAS . . ti ti The Knowledge Workbench The Knowledge Workbench
Transcript
Sci
entif
ic S
oftw
are
Dev
elop
men
t - C
opyr
ight
200
1 T
hom
as M
uhr
Scientific Software Development - Copyright 2001 Thomas Muhr
This set of 21 PowerPoint transparencies contains information about This set of 21 PowerPoint transparencies contains information about concepts and use of ATLAS.ti, Please read copyright note on concepts and use of ATLAS.ti, Please read copyright note on transparency no. 2.transparency no. 2.
ATLASATLAS..titi The Knowledge WorkbenchThe Knowledge Workbench
Sci
entif
ic S
oftw
are
Dev
elop
men
t - C
opyr
ight
200
1 T
hom
as M
uhr
Scientific Software Development - Copyright 2001 Thomas Muhr
The PowerPoint transparencies included in this package may be The PowerPoint transparencies included in this package may be used to support your ATLAS.ti workshops, training sessions & used to support your ATLAS.ti workshops, training sessions & demonstrations.demonstrations.
You may alter the transparencies to fit your needs, but please do not You may alter the transparencies to fit your needs, but please do not remove original copyright notes. If you have any transparencies remove original copyright notes. If you have any transparencies either self made or created via modification of the existing sheets we either self made or created via modification of the existing sheets we will all be happy if you make these available for the public.will all be happy if you make these available for the public.
In no event may the transparencies included in this package be In no event may the transparencies included in this package be commercially exploited (e.g., sold) either altered or unaltered without commercially exploited (e.g., sold) either altered or unaltered without prior written permission by the author, Thomas Muhr, Berlin.prior written permission by the author, Thomas Muhr, Berlin.
The conversion of Hermeneutic Units into HTML code enables new ways of structured publishing. Research teams can quickly exchange ideas and complete projects world wide.
Hypertext - what codes cannot doHypertext - what codes cannot do
contradicts
Code ACode A
Code BCode B
Q1
Q2
While codes describe similarity of the coded segments, it is hard to represent relations (beside the equivalence relation) between individual segments.Only direct links (“hyper-links”) between segments enable the representation of such local knowledge.
If one would establish a link between the codes in the example to emulate a hyper link, we would have to assume that these codes do not refer to any other segments, but are used as labels for individual segments: a clear “misuse” of codes....ATLAS/ti supports named links between data segments.
The QueryToolThe QueryToolThe QueryTool retrieves data segments by their attached codes using Boolean, proximity and semantic operators. Queries are entered in RPN calculator style.
Boolean operators
Semantic operators
Proximity operators
ORXORANDNOT
SUBUP
SIB
WITHINENCLOSES
OVERLAPPED_BYOVERLAPSFOLLOWS
PRECEDESCOOCCUR
Term stack
Feedback pane
Results
Stack manipulationClear stackSwap the two topmost elementsPush - duplicate topmost elementRecalculate resultsUndo last operationRedo last undone operation
Boolean retrieval is purely set based. Elements are assumed to be independent. No property of a retrieved segment other than being coded with codes A,B,..X is taken into account.Overselectivity: AND (A1, A2, ..., An) fails even with n-1 matching terms.Underspecified: OR (A1, A2, ..., An) succeeds with everything from 1 to n matching terms. A segment coded with only one code is treated equal to one coded with all of them.
Retrieval Methods I - Boolean RetrievalRetrieval Methods I - Boolean Retrieval
A B
not (A or B)A or B
A and Bnot A and B
A xor B
A and not B
Q1
Q2
Q3
Q4
Q5
Document universe: Q1,...,Q5
Query examples:A -> {Q1, Q2, Q3}B -> {Q3, Q4}not A -> {Q4, Q5}A or B -> {Q1, Q2, Q3, Q4}A xor B -> {Q1, Q2, Q4}not (A or B) -> {Q5}A and not B -> {Q1, Q2}A and B -> {Q3}not A and B -> {Q4}
Proximity retrieval takes the spatial relations between the retrieved elements into account. A segment can overlap, follow, enclose or simply cooccur with another segment.The semantics were adapted from Allen’s time logic calculus.
Retrieval Methods II - Proximity RetrievalRetrieval Methods II - Proximity Retrieval
A
B
Q1
Q4
Q5
Q2
Q3
Primary document P1 In addition to the Boolean conditions described above, the following proximity relations hold:
B overlaps A -> {Q3, Q4}A overlapped by B -> {Q1, Q2}C overlaps B -> {Q5}A within C -> {Q2}A overlaps C -> {Q3}C follows A -> {Q5}B overlaps C -> {Q3, Q4}etc.
Note, that proximity operators are non-commutative:B op A is not the same asA op B Operand input order is significant!
Semantic, or thesaurus-based retrieval takes transitive relations between the terms (codes) into account. Its quality is dependent upon the quality of the semantic network used.
Retrieval Methods III - Semantic RetrievalRetrieval Methods III - Semantic Retrieval
Q1
Example queries using the semantic operator SUB on the terminology network below:sub (Positive Attitude) -> {Q1, Q2, Q3, Q4, Q5}sub (Negative Attitude} -> {Q6, Q7, Q8}sub (Attitude) -> {Q1,.., Q8}
While the extension of sub (Positive Attitude) and or (Love, Kindness) is identical for the example below {Q1,..,Q5}, the intension is different.The former query will - unaltered! - yield different results with another subterm of Pos. Attitude. The latter query will not ecognize this new fact and has to be reformulated.
QueryTool: Building QueriesQueryTool: Building QueriesBoolean, proximity and semantic operators are combined using the “click-language” par excellence: the Reverse Polish Notation (RPN) by Lukasiewicz1.RPN is a parenthesis-free postfix language: operands first, then the operators.The main ingredience of the RPN query processor is the Stack, a data structure, that is very similar to a pile of plates: It can only be accessed from the top: new plates are put on the pile, plates can only be removed from the top.
1Born 1878 in Lvov (now Ukraine), died 1956 in Dublin, Ireland. Polish Minister of Education in 1919 and professor at Warsaw University from 1920 to 1939)
Old HP 29C RPN calculator
Example: “All quotations coded with ‘Positive Attitude’ and any of its sub codes but not with ‘Kindness’”in formal infix notation: SUB Pos. Attitude AND NOT Kindness
Step: 1 2 3 4 5Enter: Pos. Att. SUB (1) Kindness NOT (1) AND (2)
Note, how every operator takes (“pops”) its appropriate number of arguments from the stack and “pushes” the resulting term back on the stack. Every entry, operand or operator generates a result. No “syntactic sugar” is needed as in “infix” notations (eg. parentheses).
The QueryTool: Super CodesThe QueryTool: Super CodesA well constructed, non-trivial query is often the result of a considerable amount of work and ways to make a query reusable are needed: Super Codes.Super Codes are also an important tool for theory construction as they capture hypotheses for repeated validation against the data.
Normal codes store direct quotation references, super codes store queries. Although the visible “clicking behavior” of a super code resembles that of normal codes, there is a considerable difference of “how” each generates its references:
Query X
Normal codes deliver their quotation references.The result changes only by explicitely assigning new or removing existing references.
Super codes recalculate the stored query “when-needed” and deliver the result. When any of the conditions of the query change, the super codes result list changes as well - without any changes to the latter.
Unlike other approaches that store the “extension” (the result set) of a query, super codes store the queries’ “intension”.
Super codes are “first class” objects and can be used in queries (and in other super codes).
Team Work - Merging Projects ITeam Work - Merging Projects IMerging projects is mandatory for the support of teams working on separate data and/or different code sets. A number of stock merge strategies permits efficient control over the resulting project. Strategies can be freely adapted to fit specific needs.
Merging Projects II - StrategiesMerging Projects II - StrategiesMerging proceeds as subsequent and repeated merging of partial projects into a target project.A merge strategy controls the method of how the different object types (e.g. primary docs, codes) from the source projects migrate into the target project.
Examples:A Different data sets, same codes
This strategy supports an economic handling of large primary data in a top-down approach.
B Same data, different codesBy applying this method, different aspects of a theory can be applied to the same data sets.
What’s newWhat’s new in ATLAS.ti 4.2 in ATLAS.ti 4.2
WYSIWYG - printouts of primary texts plus marginWYSIWYG - printouts of primary texts plus margin Media - fine-grained segmentation and coding of video and Media - fine-grained segmentation and coding of video and
audio filesaudio files (incl. MP3!) (incl. MP3!) Improved Margin AreaImproved Margin Area Networks - vector export to drawing software, WordNetworks - vector export to drawing software, Word®® etc. etc. Wordcruncher - count word occurrences and calculate Wordcruncher - count word occurrences and calculate
type/token ratio. type/token ratio. New reportsNew reports Primary Doc Path Mapping ToolPrimary Doc Path Mapping Tool XML XML - memo - memo and code and code import & exportimport & export
