Public and situated displays: social and interactional aspects of shared display technologies
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Dordrecht
Kluwer Academic
2003
|
| Schriftenreihe: | The Kluwer international series oncomputer supported cooperative work
2 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XXXIV, 422 S. Ill. |
| ISBN: | 1402016778 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV017622777 | ||
| 003 | DE-604 | ||
| 005 | 20050923 | ||
| 007 | t | ||
| 008 | 031028s2003 ne a||| |||| 00||| eng d | ||
| 010 | |a 2003066348 | ||
| 020 | |a 1402016778 |9 1-4020-1677-8 | ||
| 035 | |a (OCoLC)53223733 | ||
| 035 | |a (DE-599)BVBBV017622777 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a ne |c NL | ||
| 049 | |a DE-91G |a DE-355 |a DE-706 | ||
| 050 | 0 | |a HF5843 | |
| 082 | 0 | |a 659.13/42 |2 22 | |
| 084 | |a ST 278 |0 (DE-625)143644: |2 rvk | ||
| 084 | |a DAT 612f |2 stub | ||
| 245 | 1 | 0 | |a Public and situated displays |b social and interactional aspects of shared display technologies |c edited by Kenton O'Hara ... |
| 264 | 1 | |a Dordrecht |b Kluwer Academic |c 2003 | |
| 300 | |a XXXIV, 422 S. |b Ill. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a The Kluwer international series oncomputer supported cooperative work |v 2 | |
| 650 | 4 | |a Gesellschaft | |
| 650 | 4 | |a Advertising, Outdoor |x Computer-aided design | |
| 650 | 4 | |a Advertising, Outdoor |x Social aspects | |
| 650 | 4 | |a Display boards |x Computer-aided design | |
| 650 | 4 | |a Signs and signboards |x Computer-aided design | |
| 650 | 4 | |a Visual communication |x Social aspects | |
| 650 | 0 | 7 | |a Computer Supported Cooperative Work |0 (DE-588)4288972-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Computer Supported Cooperative Work |0 (DE-588)4288972-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a O'Hara, Kenton |e Sonstige |4 oth | |
| 830 | 0 | |a The Kluwer international series oncomputer supported cooperative work |v 2 |w (DE-604)BV017898118 |9 2 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010601453&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-010601453 | ||
Datensatz im Suchindex
| _version_ | 1804130375945945088 |
|---|---|
| adam_text | Contents
List of Figures xv
List of Tables xix
1 Manufacturing Systems: Trends, Classification, and
Behavior Patterns 1
1.1 Distributed Flexible Manufacturing Systems 2
1.1.1 DFMS Properties 4
1.1.2 DFMS Behaviour 7
1.1.3 Organizational Paradigms 8
1.1.4 Example of the Implementation of a Holonic
Manufacturing System in Induction Motor Production . 10
1.1.5 A Layered Approach to DFMS Modeling 13
1.2 Manufacturing Control (MC) 14
1.2.1 Definition of Manufacturing Control 14
1.2.2 Manufacturing Control Functions 16
1.2.3 Classification of Production Scheduling 18
1.3 Scheduling and Resource Allocation 23
1.3.1 Definition 23
1.3.2 Mathematical Model for Job Shop Scheduling 24
1.4 On line Manufacturing Control 27
1.4.1 Computational Complexity of Scheduling and
Resource Allocation 28
1.5 Algorithmic Approach to Problem Solution 28
1.5.1 Greedy Heuristics 29
1.5.2 Local Search Heuristics 30
1.5.3 Off line and On line Algorithms 32
1.6 Conclusions 33
xi
xii Contents
2 On Line Load Balancing 35
2.1 Problem Definition 35
2.2 Known Results and Existing Approaches 36
2.2.1 The Greedy Approach 37
2.2.2 The Robin Hood Algorithm 39
2.2.3 Tasks with Known Duration: the Assignl Algorithm ... 41
2.3 A Metaheuristic Approach 43
2.4 Example 48
2.5 Experimental Results 53
2.5.1 A Multi objective Approach in the Case of Known
Task Departure Dates 57
2.6 Conclusions 62
3 Resource Levelling 65
3.1 Background and Problem Definition 65
3.2 Resource Levelling and the Minimization of the Peak and the
Makespan 68
3.3 The Greedy Approach 75
3.4 The Metaheuristic Approach 78
3.4.1 Conceptual Comparison with Known Local Search
Methods 79
3.4.2 How to Control the Effect of the Minimization of the
Makespan and the Frequency Based Memory 82
3.5 Experimental Results 84
3.5.1 Description of the Experiments 84
3.5.2 Analysis of the Results 85
3.5.3 Lower Bounds Comparison 87
3.5.4 Comparison with Known Algorithms 90
3.6 The Extension to the Case with Arbitrary Integer Duration... 93
3.7 Case Study 1 95
3.8 Case Study 2 100
3.9 Conclusions 103
4 Scheduling Jobs in Robotized Cells with Multiple Shared
Resources 105
4.1 Background and Problem Definition 105
4.2 Problem Definition 1°7
4.3 MV Completeness Result 1°9
4.4 The Proposed Heuristic 110
4.5 Computational Results 114
4.6 Conclusions 120
Contents xiii
5 Tool Management on Flexible Machines 121
5.1 Background 121
5.1.1 Definition of the Generic Instance 126
5.1.2 Assumptions 126
5.2 The Binary Clustering and the KTNS Approaches 127
5.3 The Proposed Algorithms 130
5.3.1 Algorithm 1 130
5.3.2 Algorithm 2 135
5.3.3 Algorithm 3 141
5.3.4 Algorithm 4 148
5.4 Computational Analysis 153
5.4.1 Comparison with Tang and Denardo 153
5.4.2 Comparison with Crama e.t al 155
5.4.3 Comparison Among the Proposed Algorithms 1(53
5.5 Conclusions 168
Appendix A 171
Appendix B 193
Glossary 199
References 201
Index 215
List of Figures
1.1 Example of a Virtual Enterprise. The Virtual Enterprise is
a temporary network of independent companies linked by
information technology to share skill, costs and access to one
another markets 2
1.2 The Extended Enterprise 3
1.3 The Supply Chain 4
1.4 Configuration of an autonomous distributed manufacturing
system 5
1.5 Production methods 11
1.6 Basic holons 12
1.7 A shop production floor 14
1.8 Conventional manufacturing control system 15
1.9 Holonic manufacturing control system 16
1.10 Configuration of a decentralized control system 17
1.11 Manufacturing control functions 17
1.12 Example of a flow shop with four machines and two jobs 19
1.13 An assembly line 20
1.14 Example of a schedule in a flow shop 20
1.15 Example of a job shop with four machines and three jobs 21
1.16 Example of a schedule in a job shop 21
1.17 Example of a fixed position shop 22
1.18 Example of precedence graph 26
1.19 Schedule of the precedence graph in Figure 1.18 on two resources 26
1.20 Greedy schedule for MTSP 30
1.21 Schedule for MTSP obtained by local search 31
1.22 On line schedule for MTSP 32
1.23 Off line schedule for MTSP 33
xv
xvi List of Figures
2.1 The trend of the objective function of the greedy algorithm
over time: the instance with 100 tasks and 5 machines 55
2.2 The trend of the objective function of the semi greedy algorithm 56
2.3 Schedule shape produced by the greedy algorithm on an
instance with 200 tasks and 10 machines 58
2.4 Schedule shape produced by the OBA RH revised algorithm
on an instance with 200 tasks and 10 machines 59
2.5 Schedule shape produced by the greedy algorithm on an
instance with 500 tasks and 10 machines 59
2.6 Schedule shape produced by the OBA RH revised algorithm
on an instance with 500 tasks and 10 machines 60
2.7 Load shape of machine 1 over time interval [t, t + 3] 60
2.8 Load shape of machine 2 over time interval [t, t + 3] 61
2.9 Load shape of machine 3 over time interval [t, t + 3] 61
2.10 Tuning of the multi objective parameters 62
3.1 The incompatibility graph 73
3.2 The resource requirement matrix 74
3.3 The trade off between the schedule length and the peak of
resource usage. The notation i^ in the schedules means that
task i requires q units of the associated resource type. By
default i = i l1 74
3.4 The trade off between the schedule length and the peak of
resource usage. The notation i^ in the schedules means that
task i requires q units of the associated resource type. By
default i = i^ 74
3.5 Schedule obtained by means of STRF 77
3.6 Schedule obtained by means of LTRF 77
3.7 Schedule obtained by means of ATR 78
3.8 The multi start greedy algorithm structure. Parameter count
is used to check if the local search in the hill climbing phase is
executed more than once 81
3.9 The experiments are averages of 10 instances. The x axis
reports the value a; + are the lowest values of the makespan
and * the highest ones 83
3.10 Up: the chart shows the sequence of dev obtained by the
algorithm in the scenario £?i and 5 = 8. In the x axis
are the number of progressive invocation of the algorithm
functions. Down: the chart shows the different dew makespan
combinations explored by the algorithm in 12,500 iterations
on the same scenario B with 5 = 8 88
3.11 Production layout for the three antenna types 96
List of Figures xvii
3.12 The antenna assembly process 98
3.13 The graph associated with the production process 100
3.14 The production line 101
4.1 Robots in a cell 106
4.2 An example of the LMU Problem 109
4.3 An optimal schedule with Y = 2z(B + 2) 110
4.4 An application of the LMU A algorithm 114
4.5 Trends of the makespan as the number n of jobs increases 115
4.6 Trends in the makespan as the number m of machines increases 116
4.7 Makespan values, for a given m, as n and pr increase 117
4.8 Makespan values, for a given n, as m and pr increase 118
5.1 An NC machine 122
5.2 Example of tools for NC machines 123
5.3 The compatibility graph 133
5.4 A matching in the compatibility graph 133
5.5 The new graph G 134
5.6 Iterated Step 4 and Step 5 134
5.7 Graph of the intersections among configurations 140
5.8 Graph of the intersections among configurations 144
5.9 Graph of the intersections among configurations 145
5.10 Graph of the intersections among configurations 146
5.11 Graph of the intersections among configurations 147
5.12 Graph of the intersections among configurations 148
5.13 Graph of the intersections among configurations 148
5.14 Step 4: graph of the intersections among configurations 149
5.15 Graph of the intersections among configurations 150
5.16 Graph H(V, E) 151
5.17 First iteration of Step 2 151
5.18 Second iteration of Step 2 152
5.19 Comparison with Tang and Denardo [164] 155
5.20 Comparison with average values 165
5.21 Average values for dense matrices 167
5.22 Average performance of the algorithms on instances 10/10/7.
15/20/12, 30/40/25. 40/60/30 168
5.23 Number of times each algorithm outperforms the others 169
List of Tables
1.1 Basic and characterizing properties of DFMS 5
1.2 Greedy Algorithm for MSTP 30
1.3 Local search algorithm for MTSP 31
2.1 Metaheuristic template 44
2.2 SA template; maxjit is a limit on number of iterations 44
2.3 TA template; max it is a limit on the number of iterations 45
2.4 OBA template; max it is a limit on the number of iterations. . . 46
2.5 OBA RH template; max it is a limit on the number of iterations 47
2.6 OBA RH revised template; maxJ,t is a limit on the number of
iterations 49
2.7 Comparison among different on line load balancing algorithms.
The number of machines is 5 53
2.8 Comparison among different on line load balancing algorithms.
The number of machines is 10 54
2.9 Comparison among different on line load balancing algorithms.
The number of machines is 15 54
2.10 Comparison among different on line load balancing algorithms.
The number of machines is 20 55
2.11 Comparison among different on line load balancing algorithms.
The average case with 5 machines 56
2.12 Comparison among different on line load balancing algorithms.
The average case with 10 machines 57
2.13 Comparison among different on line load balancing algorithms.
The average case with 15 machines 57
2.14 Comparison among different on line load balancing algorithms.
The average case with 20 machines 58
xix
xx List of Tables
2.15 Comparison among different on line load balancing algorithms
with a multi objective approach. The average case with 5
machines 63
2.16 Comparison among different on line load balancing algorithms
with a multi objective approach. The average case with 10
machines 63
2.17 Comparison among different on line load balancing algorithms
with a multi objective approach. The average case with 15
machines 64
2.18 Comparison among different on line load balancing algorithms
with a multi objective approach. The average case with 20
machines 64
3.1 Greedy algorithm (emphasis on makespan) 76
3.2 Greedy algorithm (emphasis on peak) 77
3.3 Total, maximum and average resource requests in the example
of the previous section 77
3.4 The local search algorithm 80
3.5 The 12 scenarios examined 86
3.6 Experimental results for 6 = 2 87
3.7 Experimental results for 5 = 4 89
3.8 Experimental results for 5 = 6 90
3.9 Experimental results for 6 = 8 91
3.10 Comparison of Mpeak with LBpeak 92
3.11 Comparison of Mpeak with LB peak 92
3.12 Comparison of Mts with Opt 93
3.13 Comparison between our algorithm and the algorithms in [138] . 93
3.14 Comparison between our algorithm and the algorithms in [138] . 94
3.15 Duration and resources associated with each task of the
antenna assembly process. Task duration are in hours 97
3.16 Precedence relations among tasks 99
3.17 Duration and resources associated with each task of the
antenna assembly process. Task duration are in hours 101
4.1 Scenario with pr = 0 H*
4.2 Scenario with pr = 0.1 H
4.3 Scenario with pr = 0.2 116
4.4 Scenario with pr = 0.3 H
4.5 Scenario with pr = 0.4 H
4.6 Reducing processing times of Make operations H9
4.7 Percentage reduction of CmaX 4.8 Reducing processing times of Load and Unload operations 119
List of Tables xxi
4.9 Percentage reduction of Cmax 119
5.1 A tool/job matrix 128
5.2 The score of each row 128
5.3 The matrix ordered with respect to the rows 129
5.4 The scores of each column 129
5.5 The matrix ordered with respect to the columns 129
5.6 The final matrix ordered 130
5.7 Tool/job matrix 132
5.8 Step 1: first iteration 137
5.9 Step 1: second iteration 138
5.10 Step 1: third iteration 138
5.11 Step 1: fourth iteration 139
5.12 Tool/job matrix after Step 2 139
5.13 Intersections among configurations 140
5.14 Intersections among configurations 143
5.15 Intersections among configurations 144
5.16 Intersections among configurations 145
5.17 Intersections among configurations 146
5.18 Intersections among configurations 147
5.19 Intersections among configurations 149
5.20 Complete table of removed edges according to the out degree
values 152
5.21 Matrix obtained in Step 5 153
5.22 Performance of the four algorithms proposed 154
5.23 min max intervals of each test instance 150
5.24 The different capacities used in the test instances 156
5.25 Average values of best(I) 157
5.26 Best results achieved by the four algorithms on the 160 test
instances 157
5.27 Best results achieved by the four algorithms on the 160 test
instances 158
5.28 Results of Algorithm 1 on the 160 test instances 159
5.29 Results of Algorithm 1 on the 160 test instances 159
5.30 Comparison between Algorithm 1 and the algorithms given in
[58] 160
5.31 Results of Algorithm 2 on the 160 test instances 160
5.32 Results of Algorithm 2 on the 160 test instances 161
5.33 Comparison between Algorithm 2 and the algorithms given in
[58] 161
5.34 Results of Algorithm 3 on the 160 test instances 162
5.35 Results of Algorithm 3 on the 160 test instances 162
xxii List of Tables
5.36 Comparison between Algorithm 3 and the algorithms given in
[58] 163
5.37 Results of Algorithm 4 on the 160 test instances 164
5.38 Results of Algorithm 4 on the 160 test instances 164
5.39 Comparison between Algorithm 4 and the algorithms given in
[58] 165
5.40 Comparison among the four algorithms proposed 166
5.41 Average values for dense matrices 166
5.42 Average performance of the algorithms on instances 10/10/7,
15/20/12, 30/40/25, 40/60/30 167
5.43 Number of times an algorithm outperforms the others 168
|
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV017622777 |
| callnumber-first | H - Social Science |
| callnumber-label | HF5843 |
| callnumber-raw | HF5843 |
| callnumber-search | HF5843 |
| callnumber-sort | HF 45843 |
| callnumber-subject | HF - Commerce |
| classification_rvk | ST 278 |
| classification_tum | DAT 612f |
| ctrlnum | (OCoLC)53223733 (DE-599)BVBBV017622777 |
| dewey-full | 659.13/42 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 659 - Advertising and public relations |
| dewey-raw | 659.13/42 |
| dewey-search | 659.13/42 |
| dewey-sort | 3659.13 242 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Informatik Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01911nam a2200469zcb4500</leader><controlfield tag="001">BV017622777</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20050923 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">031028s2003 ne a||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2003066348</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1402016778</subfield><subfield code="9">1-4020-1677-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)53223733</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017622777</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">ne</subfield><subfield code="c">NL</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">HF5843</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">659.13/42</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 278</subfield><subfield code="0">(DE-625)143644:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 612f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Public and situated displays</subfield><subfield code="b">social and interactional aspects of shared display technologies</subfield><subfield code="c">edited by Kenton O'Hara ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht</subfield><subfield code="b">Kluwer Academic</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXXIV, 422 S.</subfield><subfield code="b">Ill.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">The Kluwer international series oncomputer supported cooperative work</subfield><subfield code="v">2</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gesellschaft</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Advertising, Outdoor</subfield><subfield code="x">Computer-aided design</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Advertising, Outdoor</subfield><subfield code="x">Social aspects</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Display boards</subfield><subfield code="x">Computer-aided design</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Signs and signboards</subfield><subfield code="x">Computer-aided design</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Visual communication</subfield><subfield code="x">Social aspects</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Computer Supported Cooperative Work</subfield><subfield code="0">(DE-588)4288972-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Computer Supported Cooperative Work</subfield><subfield code="0">(DE-588)4288972-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">O'Hara, Kenton</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">The Kluwer international series oncomputer supported cooperative work</subfield><subfield code="v">2</subfield><subfield code="w">(DE-604)BV017898118</subfield><subfield code="9">2</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010601453&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010601453</subfield></datafield></record></collection> |
| id | DE-604.BV017622777 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T19:20:02Z |
| institution | BVB |
| isbn | 1402016778 |
| language | English |
| lccn | 2003066348 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010601453 |
| oclc_num | 53223733 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-355 DE-BY-UBR DE-706 |
| owner_facet | DE-91G DE-BY-TUM DE-355 DE-BY-UBR DE-706 |
| physical | XXXIV, 422 S. Ill. |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Kluwer Academic |
| record_format | marc |
| series | The Kluwer international series oncomputer supported cooperative work |
| series2 | The Kluwer international series oncomputer supported cooperative work |
| spelling | Public and situated displays social and interactional aspects of shared display technologies edited by Kenton O'Hara ... Dordrecht Kluwer Academic 2003 XXXIV, 422 S. Ill. txt rdacontent n rdamedia nc rdacarrier The Kluwer international series oncomputer supported cooperative work 2 Gesellschaft Advertising, Outdoor Computer-aided design Advertising, Outdoor Social aspects Display boards Computer-aided design Signs and signboards Computer-aided design Visual communication Social aspects Computer Supported Cooperative Work (DE-588)4288972-8 gnd rswk-swf Computer Supported Cooperative Work (DE-588)4288972-8 s DE-604 O'Hara, Kenton Sonstige oth The Kluwer international series oncomputer supported cooperative work 2 (DE-604)BV017898118 2 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010601453&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Public and situated displays social and interactional aspects of shared display technologies The Kluwer international series oncomputer supported cooperative work Gesellschaft Advertising, Outdoor Computer-aided design Advertising, Outdoor Social aspects Display boards Computer-aided design Signs and signboards Computer-aided design Visual communication Social aspects Computer Supported Cooperative Work (DE-588)4288972-8 gnd |
| subject_GND | (DE-588)4288972-8 |
| title | Public and situated displays social and interactional aspects of shared display technologies |
| title_auth | Public and situated displays social and interactional aspects of shared display technologies |
| title_exact_search | Public and situated displays social and interactional aspects of shared display technologies |
| title_full | Public and situated displays social and interactional aspects of shared display technologies edited by Kenton O'Hara ... |
| title_fullStr | Public and situated displays social and interactional aspects of shared display technologies edited by Kenton O'Hara ... |
| title_full_unstemmed | Public and situated displays social and interactional aspects of shared display technologies edited by Kenton O'Hara ... |
| title_short | Public and situated displays |
| title_sort | public and situated displays social and interactional aspects of shared display technologies |
| title_sub | social and interactional aspects of shared display technologies |
| topic | Gesellschaft Advertising, Outdoor Computer-aided design Advertising, Outdoor Social aspects Display boards Computer-aided design Signs and signboards Computer-aided design Visual communication Social aspects Computer Supported Cooperative Work (DE-588)4288972-8 gnd |
| topic_facet | Gesellschaft Advertising, Outdoor Computer-aided design Advertising, Outdoor Social aspects Display boards Computer-aided design Signs and signboards Computer-aided design Visual communication Social aspects Computer Supported Cooperative Work |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010601453&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV017898118 |
| work_keys_str_mv | AT oharakenton publicandsituateddisplayssocialandinteractionalaspectsofshareddisplaytechnologies |