Systems analysis and synthesis: bridging computer science and information technology
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam [und 11 weitere]
Elsevier Morgan Kaufmann
[2016]
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XXIX, 481 Seiten Diagramme |
| ISBN: | 9780128053041 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV043505097 | ||
| 003 | DE-604 | ||
| 005 | 20160506 | ||
| 007 | t | ||
| 008 | 160411s2016 |||| |||| 00||| eng d | ||
| 020 | |a 9780128053041 |9 978-0-12-805304-1 | ||
| 035 | |a (OCoLC)969824654 | ||
| 035 | |a (DE-599)BVBBV043505097 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-473 | ||
| 084 | |a ST 237 |0 (DE-625)143623: |2 rvk | ||
| 100 | 1 | |a Dwyer, Barry |e Verfasser |0 (DE-588)1099323878 |4 aut | |
| 245 | 1 | 0 | |a Systems analysis and synthesis |b bridging computer science and information technology |c Barry Dwyer |
| 264 | 1 | |a Amsterdam [und 11 weitere] |b Elsevier Morgan Kaufmann |c [2016] | |
| 264 | 4 | |c © 2016 | |
| 300 | |a XXIX, 481 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a System analysis | |
| 650 | 0 | 7 | |a Systemanalyse |0 (DE-588)4116673-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Software Engineering |0 (DE-588)4116521-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Software Engineering |0 (DE-588)4116521-4 |D s |
| 689 | 0 | 1 | |a Systemanalyse |0 (DE-588)4116673-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung UB Bamberg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028921421&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028921421 | ||
Datensatz im Suchindex
| _version_ | 1804176143055585280 |
|---|---|
| adam_text | Contents
Foreword..............................................................v
Preface..............................................................xv
Acknowledgments.....................................................xxi
CHAPTER 1 Systems, Analysis, and Synthesis 1
1.1 Systems.................................................1
1.2 Aim of the Book.........................................3
1.2.1 Kernel, Interface, and Environment..............4
1.2.2 System Development Models.......................5
1.2.3 Classical Life-cycle Models.....................6
1.2.4 Evolutionary Models.............................7
1.2.5 Transformational Models.........................7
1.3 Analysis................................................8
1.4 Synthesis...............................................9
1.4.1 Composition and Decomposition..................12
1.5 Tractability...........................................13
1.6 Mental Blocks..........................................19
1.7 Summary................................................21
1.8 Further Reading........................................22
1.9 Exercises..............................................22
CHAPTER 2 Mathematical Background 23
Introduction...........................................24
2.1 Propositional Calculus.................................25
2.1.1 Logical Operators..............................25
2.1.2 Properties of Logical Operators................27
2.1.3 Conjunctive Normal Form........................27
2.1.4 Logical Inference..............................29
2.2 First-order Predicate Calculus.........................29
2.2.1 Quantifiers....................................30
2.3 Sets...................................................31
2.3.1 Set Notation...................................31
2.3.2 Set Operators..................................32
2.3.3 Properties of Set Operators....................33
2.3.4 Euler Diagrams.................................34
2.4 Relations and Functions................................35
2.4.1 Cartesian Products.............................35
2.4.2 Binary Relations...............................35
2.4.3 Special Relations..............................38
2.4.4 Operations on Relations........................40
2.5 Graphs and Schemas.....................................44
2.5.1 Graphs.........................................44
2.5.2 Connected Components...........................48
vii
viii
Contents
2.6
2.7
2.8
2.9
2.10
2.5.3 Rooted Trees.........................
2.5.4 Labelled Graphs......................
2.5.5 Matrix Representation of Graphs......
2.5.5 Schemas..............................
Representing Sets...........................
2.5.1 Arrays...............................
2.6.2 Linked Lists.........................
2.6.3 Search Trees.........................
2.6.4 B-Trees..............................
2.6.5 Hash Tables..........................
2.6.6 Bit Maps.............................
2.6.7 Decision Trees and Decision Diagrams.
2.6.8 Other Structures.....................
Representing Functions, Relations, and Graphs
2.7.1 Functions............................
2.7.2 Correspondences......................
2.7.3 Sequences............................
2.7.4 Relations and Graphs.................
2.7.5 Files................................
Summary.....................................
Further Reading.............................
Exercises........................
. 50 . 51 . 52 . 57 . 61 .61 . 62 . 63 . 65 . 66 . 66 . 67 . 67 . 68 . 68 . 68 . 69 . 70 . 72 . 74 . 77 . 78
CHAPTER 3
3.1
3.2
3.3
3.4
3.5
3.6
3.7
3.8
3.9
3.10
3.11
3.12
3.13
CHAPTER 4 4.1
Atoms
Introduction .................................
Finite-State Automata.........................
Deterministic and Non-deterministic Automata
Regular Expressions...........................
Finite Means Finite...........................
Analysing States..............................
Counting......................................
Continuous Systems............................
Products of FSAs..............................
Shared Events.................................
Modelling Atoms...............................
3.10.1 Identifiers...........................
3.10.2 Representing States...................
Summary.......................................
Further Reading...............................
Exercises.............
79
. 79 .81 .83 .87 .89 .90 .94 .96 .99 100 105 105
107
108 108 108
Data-structure Analysis
Introduction..........
Conceptual Schemas..
Ill
111
113
ix
114
116
117
121
121
122
122
123
124
125
127
128
130
132
135
137
138
139
140
141
143
143
145
145
146
147
147
149
150
154
158
165
166
166
169
169
170
174
175
177
178
179
Contents
4.1.1 Constraints............................
4.1.2 Tables, Atoms, and States..............
Deriving Functional Dependencies...............
4.2.1 Many-to-one Relations..................
4.2.2 One-to-many Relations..................
4.2.3 One-to-one Relations...................
4.2.4 Many-to-many Relations.................
4.2.5 Expressing FDs in the Relational Model ..
Entity-relationship Analysis...................
4.3.1 Relationships as Entities..............
Synthesising a Database Schema by Composition
4.4.1 Functional Dependency Graphs...........
4.4.2 Closure of an FD Graph.................
4.4.3 Minimal FD Graphs......................
4.4.4 The Canonical FD Graph.................
4.4.5 Cycles.................................
4.4.6 Algebraic Compositional Methods........
4.4.7 Summary of Compositional Methods.......
Designing a Database Schema by Decomposition.
Summary........................................
Further Reading................................
Exercises......................................
Kernel Specifications
Introduction...................................
The Kernel.....................................
Serialisability................................
Infrastructure.................................
An Academic Records System.....................
A Specification Language.......................
Specifying Atoms...............................
Specifying Events..............................
Summary........................................
Further Reading................................
Exercises......................................
Database Technology
Introduction...................................
The SQL Data Definition Language...........
From Schema to SQL.............................
SQL Queries....................................
6.3.1 Sub-Queries............................
6.3.2 Views..................................
6.3.3 Embedded SQL...........................
X
Contents
6.4
6.5
6.6
6.7
6.8
6.9
Query Optimisation.........................
6.4.1 The Memory Hierarchy................
6.4.2 Join Algorithms.....................
6.4.3 Join Trees...........................
Transactions................................
6.5.1 The Need for Locking................
6.5.2 The Two-phase Protocol..............
6.5.3 Deadlock.............................
6.5.4 Correctness of the Two-phase Protocol
Back-up and Recovery.......................
Summary.....................................
Further Reading............................
Exercises..................................
181
184
185 189 193
193
194
195
198
199
200 200 200
CHAPTER 7 Processes ¿UJ
Introduction............................................203
7.1 Use-definition Analysis.................................204
7.1.1 The Determines Relation..........................204
7.1.2 The Determines Graph.............................205
7.1.3 The State Dependency Graph.......................207
7.2 Preventing Deadlock.....................................210
7.2.1 Resource Priorities..............................211
7.2.2 Real-time Systems................................214
7.3 Process Graphs..........................................216
7.3.1 Degrees of Coupling between Processes..........218
7.3.2 The Canonical Process Graph......................219
7.3.3 Process Optimisation.............................220
7.4 Object-oriented Systems.................................222
7.4.1 Synthesis of an Object-oriented System.........222
7.4.2 Event Segmentation...............................224
7.5 Batch Processing........................................229
7.5.1 Update Algorithms................................234
7.5.2 Validity of Batch Processing.....................235
7.5.3 Event Segmentation in a Batch Processing System.....................................................238
7.5.4 Synthesising a Batch Processing System...........239
7.6 Modes...................................................243
7.7 Fragility...............................................246
7.7.1 Defences against Fragility.......................246
7.8 User Dialogue...........................................248
7.9 Summary.................................................249
7.10 Further Reading.........................................250
7.11 Exercises...............................................250
Contents xi
CHAPTER 8 Interfaces 253
Introduction...........................................253
8.1 Reports...............................................254
8.2 Forms.................................................257
8.3 Human Factors.........................................260
8.3.1 Physiological Factors..........................261
8.3.2 Cognitive Factors..............................267
8.3.3 Behavioural Factors............................273
8.4 Psychology Experiments................................281
8.4.1 The Binomial Distribution......................282
8.4.2 Unbiased Estimates.............................284
8.4.3 Individual Differences.........................286
8.5 Forms Design..........................................289
8.6 Summary...............................................291
8.7 Further Reading.......................................291
8.8 Exercises.............................................292
CHAPTER 9 Rules 295
Introduction...........................................295
9.1 Business Rules........................................296
9.2 Rule-based Systems....................................297
9.2.1 Decision Tables................................298
9.2.2 Checking Study Programmes......................301
9.3 Expert Systems........................................303
9.3.1 Forward and Backward Chaining..................305
9.3.2 Logic Trees....................................306
9.3.3 A Practical Inference Engine...................309
9.3.4 Branch and Bound Search........................314
9.3.5 Search and Planning............................319
9.3.6 Fuzzy Logic....................................322
9.4 Summary...............................................328
9.5 Further Reading.......................................329
9.6 Exercises.............................................330
CHAPTER 10 System Dynamics 333
Introduction...........................................333
10.1 Queueing Models.......................................334
10.1.1 Basic Queueing Theory..........................336
10.1.2 Probability Distributions......................338
10.1.3 A Simple Queueing Model........................338
10.2 Control Systems.......................................344
10.2.1 The First Simulation...........................344
10.2.2 The Simplified Simulation......................349
10.2.3 The Second Simulation..........................351
xii
Contents
10.2.4 Linear Sampled-data Systems
10.3 Summary............................
10.4 Further Reading....................
10.5 Exercises..........................
352
355
356
357
CHAPTER 11
11.1
11.2
11.3
Project Management
Introduction..............
Discounted Cash Flow......
Critical Path Analysis....
Project Control...........
11.3.1 Acceptance Testing
11.4 Personnel Management.........
11.5 Standards and Documentation
11.5.1 Literate Programming.
11.6 Feasibility Studies..........
11.6.1 Financial Feasibility...
11.6.2 Technical Feasibility..
11.7 Methodology..................
11.8 Summary......................
11.9 Further Reading..............
11.10 Exercises....................
359
359
360 363 368 370
373
374
375 377
377
378
379 382
382
383
APPENDIX A Regular Expressions and FSAs 385
Introduction........................................... 385
A.l From Regular Expressions to State-transition Diagrams.. 385
A.2 From Finite-state Automata to Regular Expressions.......390
A.3 Summary................................................392
A.4 Further Reading........................................ 393
A. 5 Exercises..............................................393
APPENDIX B Normalisation 395
Introduction............................................395
B. l Joins and Views..........................................396
B.2 The Database Key........................................ 396
B.3 The Universal Relation...................................397
B.4 Objectives of Good Database Design.......................400
B.4.1 Transitive Dependencies...........................401
B.4.2 Partial Dependencies..............................402
B.4.3 1st, 2nd, and 3rd Normal Forms....................404
B.4.4 Normalisation................................... ’ 405
B.4.5 Boyce-Codd Dependencies ..........................408
B.4.6 Multi-valued Dependencies.........................412
B.4.7 Decomposition Algorithms........................ 415
B.5 Difficulties with Normalisation...... aiq
Contents xiii
B.6 Summary.............................................420
B.7 Further Reading.....................................420
B. 8 Exercise............................................421
APPENDIX C Answers to the Exercises 423
C. l Chapter 1 ..........................................423
C.2 Chapter 2...........................................426
C.3 Chapter 3...........................................429
C.4 Chapter 4...........................................430
C.5 Chapter 5...........................................432
C.6 Chapter 6...........................................434
C.7 Chapter 7...........................................437
C.8 Chapter 8...........................................441
C.9 Chapter 9...........................................444
C.10 Chapter 10..........................................448
C.ll Chapter 11..........................................450
C.12 Appendix A..........................................454
C.13 Appendix B..........................................455
Index............................................................459
|
| any_adam_object | 1 |
| author | Dwyer, Barry |
| author_GND | (DE-588)1099323878 |
| author_facet | Dwyer, Barry |
| author_role | aut |
| author_sort | Dwyer, Barry |
| author_variant | b d bd |
| building | Verbundindex |
| bvnumber | BV043505097 |
| classification_rvk | ST 237 |
| ctrlnum | (OCoLC)969824654 (DE-599)BVBBV043505097 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01458nam a2200361 c 4500</leader><controlfield tag="001">BV043505097</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160506 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">160411s2016 |||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780128053041</subfield><subfield code="9">978-0-12-805304-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)969824654</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043505097</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 237</subfield><subfield code="0">(DE-625)143623:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dwyer, Barry</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1099323878</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Systems analysis and synthesis</subfield><subfield code="b">bridging computer science and information technology</subfield><subfield code="c">Barry Dwyer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam [und 11 weitere]</subfield><subfield code="b">Elsevier Morgan Kaufmann</subfield><subfield code="c">[2016]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXIX, 481 Seiten</subfield><subfield code="b">Diagramme</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="650" ind1=" " ind2="4"><subfield code="a">System analysis</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Systemanalyse</subfield><subfield code="0">(DE-588)4116673-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Software Engineering</subfield><subfield code="0">(DE-588)4116521-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Software Engineering</subfield><subfield code="0">(DE-588)4116521-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Systemanalyse</subfield><subfield code="0">(DE-588)4116673-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Bamberg - ADAM Catalogue Enrichment</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=028921421&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-028921421</subfield></datafield></record></collection> |
| id | DE-604.BV043505097 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:27:29Z |
| institution | BVB |
| isbn | 9780128053041 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028921421 |
| oclc_num | 969824654 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG |
| owner_facet | DE-473 DE-BY-UBG |
| physical | XXIX, 481 Seiten Diagramme |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | Elsevier Morgan Kaufmann |
| record_format | marc |
| spelling | Dwyer, Barry Verfasser (DE-588)1099323878 aut Systems analysis and synthesis bridging computer science and information technology Barry Dwyer Amsterdam [und 11 weitere] Elsevier Morgan Kaufmann [2016] © 2016 XXIX, 481 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier System analysis Systemanalyse (DE-588)4116673-5 gnd rswk-swf Software Engineering (DE-588)4116521-4 gnd rswk-swf Software Engineering (DE-588)4116521-4 s Systemanalyse (DE-588)4116673-5 s DE-604 Digitalisierung UB Bamberg - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028921421&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Dwyer, Barry Systems analysis and synthesis bridging computer science and information technology System analysis Systemanalyse (DE-588)4116673-5 gnd Software Engineering (DE-588)4116521-4 gnd |
| subject_GND | (DE-588)4116673-5 (DE-588)4116521-4 |
| title | Systems analysis and synthesis bridging computer science and information technology |
| title_auth | Systems analysis and synthesis bridging computer science and information technology |
| title_exact_search | Systems analysis and synthesis bridging computer science and information technology |
| title_full | Systems analysis and synthesis bridging computer science and information technology Barry Dwyer |
| title_fullStr | Systems analysis and synthesis bridging computer science and information technology Barry Dwyer |
| title_full_unstemmed | Systems analysis and synthesis bridging computer science and information technology Barry Dwyer |
| title_short | Systems analysis and synthesis |
| title_sort | systems analysis and synthesis bridging computer science and information technology |
| title_sub | bridging computer science and information technology |
| topic | System analysis Systemanalyse (DE-588)4116673-5 gnd Software Engineering (DE-588)4116521-4 gnd |
| topic_facet | System analysis Systemanalyse Software Engineering |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028921421&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT dwyerbarry systemsanalysisandsynthesisbridgingcomputerscienceandinformationtechnology |