Results 1 - 10
of
68,520
Table-Top AR environment , in Proc. of ISAR 2000, Oct. 2000, pp. 111-119. [10] P. Dourish, Where the action is: The foundations of Embodied Interaction , MIT Press, 2001. [11] M. Weiser, The computer for the twenty-first century , Scientific American, Vol. 265, No.3, pp. 94- 104, 1991. [12] L. Suchman, Plans and situated actions: The problem of human-machine communication , Cam- bridge University Press, Cambridge, 1987. [13] W. Du, H. Li, Vision based gesture recognition system with single camera , in IEEE Signal Process- ing Proceedings, Beijing, China, vol.2, 2000, pp. 1351 -1357. [14] L. Gupta, S. Ma, Gesture-based interaction and communication: automated classification of hand ges- ture contours . IEEE Transactions on Systems, Man, and Cybernetics, vol. 31, No. 1, pp. 114-120, 2001.
Table 3-1. Resource Name Variables Defined by the System
"... In PAGE 48: ... The resource type displayed with the name is link (LNK). Substitution Variables: The resource types that can be associated with each substitution variable shown in Table3 -1 on page 3-3 are defined as follows: 3-2 OS/400 Alerts Support V4R1 ... In PAGE 49: ...Table3... In PAGE 51: ... bulletmed Handle problems differently depending on the type of problem. Table3 -2 shows the relationship between the alert option (ALROPT) parameter in the message description and the alert status (ALRSTS) network attribute. In this figure, the messages defined as *DEFER have the log problem (LOGPRB) param- eter in the message description set to *YES; setting the LOGPRB parameter to *NO in a message causes all alerts for that message to be treated as *IMMED.... In PAGE 59: ... You can control the logging of alerts using the alert logging status (ALRLOGSTS) network attribute. Logging Alerts: Table3 -3 shows whether an alert is logged in the alert database, depending on: 1. The ALRLOGSTS network attribute (*ALL, *LOCAL, *RCV, or *NONE) 2.... In PAGE 60: ... the alert remains in the alert database. If the con- ditions shown in Table3 -3 indicate that the alert should not be logged, it is deleted from the alert database. If the conditions indicate that the alert should be logged, it remains in the alert database, but it is no longer displayed as a held alert.... In PAGE 71: ... Determining the Message ID: The message ID for a code point consists of the code point plus a 3-character prefix. Table3 -6 shows the message ID prefixes for the alert code points: For example, the message ID for failure cause X apos;1234 apos; is ALF1234. The code point for the detail qualifier data ID is only 2 hexadecimal digits.... In PAGE 72: ... For code point X apos;xxYx apos;, Y determines the number. Table3 -7 lists the number of qualifiers required by a code point with the given third digit. Substitution Text for Detailed Qualifiers: When you create a code point message that con- tains detailed qualifiers, you must specify where the qualifiers will be displayed.... In PAGE 72: ... To specify detailed qualifiers that appear on the same line as the code point text, you use substi- tution variables to define the placement of the qualifiers. Table3 -8 shows the substitution vari- able numbers that should be used for each qual- ifier. If the detailed qualifier placement is defined at the end of the code point text, you can omit the sub- stitution variable at the end of the text, and the system displays the detailed qualifier on the line following the code point text.... ..."
Table 3-5: Classification of replication in database systems.
"... In PAGE 30: ... All system characteristics which are contained in the classification framework are explicitly chosen by the system or protocol designer. Table3 -1 classifies these protocols. A different classification for replica update protocols, which concentrates on relationships between the protocols, is presented in [CHKS94].... In PAGE 34: ...Chapter 3: State of the art Table3 -1: Classification of replication protocols. Replication transparency Transparent Non-trans- parent Not applicable 2PC, 3PC, QC, ROWA, MW, VP, AE, TSAE, LR, IUIA, DP, MC, TU, Re, QCP, PT, ES, BI, Esc, VC Consistency Strong 2PC, 3PC, QC, ROWA, MW, VP, Re, VC1 Weak AE, TSAE, LR, IUIA, DP, MC, TU, QCP, PT, ES, BI, Esc, VC2 Replica syn- chronization Synchronous 2PC, 3PC, QC, ROWA, MW, VP, MC3, Re5, VC1 As soon as possible AE, TSAE, LR, IUIA, MC4, BI, Esc Temporal event QCP10, PT, ES11, VC2 Non-tempo- ral event DP7, TU8, Re6, QCP10, ES11 Update rights Master-slave TU, QCP, VC8 Peer-to-peer 2PC, 3PC, QC, ROWA, MW, VP, AE, TSAE, LR, IUIA, DP, MC, TU, Re, PT, ES, BI, Esc Conflicts Conflicts can occur AE, TSAE9, LR9, IUIA, DP, MC, TU, PT, ES11, BI12 No conflicts occur 2PC, 3PC, QC, ROWA, MW, VP, TSAE9, LR9, Re, QCP, Esc, VC, ES11, BI12 Implicit replica- tion of refer- enced objects Yes No Not applicable 2PC, 3PC, QC, ROWA, MW, VP, AE, TSAE, LR, IUIA, DP, MC, TU, Re, QCP, PT, ES, BI, Esc, VC Implicit schema replication Yes Partial No Not applicable 2PC, 3PC, QC, ROWA, MW, VP, AE, TSAE, LR, IUIA, DP, MC, TU, Re, QCP, PT, ES, BI, Esc, VC Dynamic allo- cation of repli- cas Yes No Not applicable 2PC, 3PC, QC, ROWA, MW, VP, AE, TSAE, LR, IUIA, DP, MC, TU, Re, QCP, PT, ES, BI, Esc, VC Data model Object- oriented Rela- tional Files Other data model Not applicable or open 2PC, 3PC, QC, ROWA, MW, VP, AE, TSAE, LR, IUIA, DP, MC, TU, Re, QCP, PT, ES, BI, Esc, VC 3.... In PAGE 34: ... Replication transparency Transparent Non-trans- parent Not applicable 2PC, 3PC, QC, ROWA, MW, VP, AE, TSAE, LR, IUIA, DP, MC, TU, Re, QCP, PT, ES, BI, Esc, VC Consistency Strong 2PC, 3PC, QC, ROWA, MW, VP, Re, VC1 Weak AE, TSAE, LR, IUIA, DP, MC, TU, QCP, PT, ES, BI, Esc, VC2 Replica syn- chronization Synchronous 2PC, 3PC, QC, ROWA, MW, VP, MC3, Re5, VC1 As soon as possible AE, TSAE, LR, IUIA, MC4, BI, Esc Temporal event QCP10, PT, ES11, VC2 Non-tempo- ral event DP7, TU8, Re6, QCP10, ES11 Update rights Master-slave TU, QCP, VC8 Peer-to-peer 2PC, 3PC, QC, ROWA, MW, VP, AE, TSAE, LR, IUIA, DP, MC, TU, Re, PT, ES, BI, Esc Conflicts Conflicts can occur AE, TSAE9, LR9, IUIA, DP, MC, TU, PT, ES11, BI12 No conflicts occur 2PC, 3PC, QC, ROWA, MW, VP, TSAE9, LR9, Re, QCP, Esc, VC, ES11, BI12 Implicit replica- tion of refer- enced objects Yes No Not applicable 2PC, 3PC, QC, ROWA, MW, VP, AE, TSAE, LR, IUIA, DP, MC, TU, Re, QCP, PT, ES, BI, Esc, VC Implicit schema replication Yes Partial No Not applicable 2PC, 3PC, QC, ROWA, MW, VP, AE, TSAE, LR, IUIA, DP, MC, TU, Re, QCP, PT, ES, BI, Esc, VC Dynamic allo- cation of repli- cas Yes No Not applicable 2PC, 3PC, QC, ROWA, MW, VP, AE, TSAE, LR, IUIA, DP, MC, TU, Re, QCP, PT, ES, BI, Esc, VC Data model Object- oriented Rela- tional Files Other data model Not applicable or open 2PC, 3PC, QC, ROWA, MW, VP, AE, TSAE, LR, IUIA, DP, MC, TU, Re, QCP, PT, ES, BI, Esc, VC 3.1 Replication protocols 41 Table3 -2: Legend to table 3-1. 2PC Two-phase commit MW Missing writes 3PC Three-phase commit PT Polytransaction AE Anti-entropy QC Quorum consensus BI Bounded ignorance QCP Quasi-copy DP Data-patch Re Referee ES Epsilon-serializability ROW A Read-One-Write-All Esc Escrow TSAE Timestamped anti-entropy IUIA Independent updates and in- cremental agreement TU Tentative update LR Lazy Replication VC Virtual primary copy MC mc-compatibility VP Virtual partition 1 Within virtual primary copy 7 Initiated by database adminis- trator 2 Outside virtual primary copy 8 Update requests of weak repli- cas are redirected to the virtual primary copy 3 For commutative transactions 9 Depending on update ordering 4 For non-commutative transac- tions 10 Depending on coherency conditions 5 Within CSCR 11 Depending on replica control protocol 6 Outside CSCR 12 Depending on the global and local consistency constraints 3.... In PAGE 40: ...Chapter 3: State of the art Table3 -3: Classification of replication in distributed systems. Replication transparency Transparent Is, FW, RG, OT, IB, AFS, Co10, Fi, Fr, Hu, Ru, MI, Ar, El, Ro, Go, Ha, SOM, ARO, DV, GI, RMS Non-trans- parent Ca, Ba, Co11 Not ap- plicable Consistency Strong Is1,2, Fr3,4, Hu, Ar, El1,2, Ro9, Go, Ha, SOM, ARO12, DV19, RMS Weak Is1,2, FW, RG, OT, IB, AFS, Co, Fi, Fr4, Ru, MI, Ca, El1,2, Ro9, ARO12, DV19, GI, Ba Replica syn- chronization Synchronous Is1,2, Fr3,4, Hu, Ar, El1,2, Ro9, Go, Ha, SOM, ARO12, DV19, RMS As soon as pos- sible Is1,2, FW, RG, AFS, Co10, Fi, Fr4, El1,2, Ro9, ARO12, DV19, GI22 Temporal event Fr4, Ca, ARO12 Non-temporal event OT14, IB14, Co11, Fr4, Ru8, MI7, ARO12, GI23, Ba Update rights Master- slave Ca, SOM13 Peer-to-peer Is, FW, RG, OT, IB, AFS, Co, Fi, Fr, Hu, Ru, MI, Ar, El, Ro, Go, Ha, SOM13, ARO, DV, GI, RMS, Ba Conflicts Conflicts can occur Is1,2, FW1, RG1, OT16, IB18, AFS, Co, Fi, Fr4, Ru, El1,2, Ro9, GI, Ba No conflicts occur Is1,2, FW1, RG1, OT20, IB15, Fr3, Hu, MI, Ca, Ar, El1,2, Ro9, Go, Ha, SOM, ARO5, DV17, RMS Implicit replica- tion of refer- enced objects Yes DV21 No OT, IB, Ar, El, Ro, Go, Ha, SOM, ARO, GI, RMS Not applicable Is, Fw, RG, AFS, Co, Fi, Fr, Hu, Ru, MI, Ca, Ba Implicit schema replication Yes Partial OT6, IB6 No Ar, El, Ro, Go, Ha, SOM, ARO, DV, GI, RMS Not applicable Is, FW, RG, AFS, Co, Fi, Fr, Hu, Ru, MI, Ca, Ba Dynamic allo- cation of repli- cas Yes RMS No Is, FW, RG, OT, IB, AFS, Co, Fi, Fr, Hu, Ru, MI, Ca, Ar, El, Ro, Go, Ha, SOM, ARO, DV, GI, Ba Not appli- cable Data model Object-ori- ented OT, IB, Ar, El, Ro, Go, Ha, SOM, ARO, DV, GI, RMS Rela- tional Files AFS, Co, Fi, Fr, Hu, Ru, MI, Ca Other data model Not applicable or open Is, FW, RG, Ba 3.... In PAGE 40: ... Replication transparency Transparent Is, FW, RG, OT, IB, AFS, Co10, Fi, Fr, Hu, Ru, MI, Ar, El, Ro, Go, Ha, SOM, ARO, DV, GI, RMS Non-trans- parent Ca, Ba, Co11 Not ap- plicable Consistency Strong Is1,2, Fr3,4, Hu, Ar, El1,2, Ro9, Go, Ha, SOM, ARO12, DV19, RMS Weak Is1,2, FW, RG, OT, IB, AFS, Co, Fi, Fr4, Ru, MI, Ca, El1,2, Ro9, ARO12, DV19, GI, Ba Replica syn- chronization Synchronous Is1,2, Fr3,4, Hu, Ar, El1,2, Ro9, Go, Ha, SOM, ARO12, DV19, RMS As soon as pos- sible Is1,2, FW, RG, AFS, Co10, Fi, Fr4, El1,2, Ro9, ARO12, DV19, GI22 Temporal event Fr4, Ca, ARO12 Non-temporal event OT14, IB14, Co11, Fr4, Ru8, MI7, ARO12, GI23, Ba Update rights Master- slave Ca, SOM13 Peer-to-peer Is, FW, RG, OT, IB, AFS, Co, Fi, Fr, Hu, Ru, MI, Ar, El, Ro, Go, Ha, SOM13, ARO, DV, GI, RMS, Ba Conflicts Conflicts can occur Is1,2, FW1, RG1, OT16, IB18, AFS, Co, Fi, Fr4, Ru, El1,2, Ro9, GI, Ba No conflicts occur Is1,2, FW1, RG1, OT20, IB15, Fr3, Hu, MI, Ca, Ar, El1,2, Ro9, Go, Ha, SOM, ARO5, DV17, RMS Implicit replica- tion of refer- enced objects Yes DV21 No OT, IB, Ar, El, Ro, Go, Ha, SOM, ARO, GI, RMS Not applicable Is, Fw, RG, AFS, Co, Fi, Fr, Hu, Ru, MI, Ca, Ba Implicit schema replication Yes Partial OT6, IB6 No Ar, El, Ro, Go, Ha, SOM, ARO, DV, GI, RMS Not applicable Is, FW, RG, AFS, Co, Fi, Fr, Hu, Ru, MI, Ca, Ba Dynamic allo- cation of repli- cas Yes RMS No Is, FW, RG, OT, IB, AFS, Co, Fi, Fr, Hu, Ru, MI, Ca, Ar, El, Ro, Go, Ha, SOM, ARO, DV, GI, Ba Not appli- cable Data model Object-ori- ented OT, IB, Ar, El, Ro, Go, Ha, SOM, ARO, DV, GI, RMS Rela- tional Files AFS, Co, Fi, Fr, Hu, Ru, MI, Ca Other data model Not applicable or open Is, FW, RG, Ba 3.2 Replication in distributed systems 53 Table3 -4: Legend to table 3-3. AFS Andrew File System Go GOOFY Ar Arjuna Ha Hawk ARO Adaptable replicated objects Hu Huygens Ba Bayou IB Information Bus Ca Castanet Is Isis Co Coda MI MIo-NFS DV DistView OT OrbixTalk El ELECTRA RG Replication group Fi Ficus RMS Replica Management System Fr Frolic Ro ROMANCE FW Framework for group com- munication systems Ru Rumor GI GINA SOM SOM Replication Framework 1 Depending on update ordering 13 Depending on the number of writable replicas 2 Depending on reply collection 14 Pull- and push-actions are explicitly initiated 3 Between clusters 15 With guaranteed message de- livery 4 Within cluster: Depending on replica control strategy 16 Without persistent event chan- nels 5 If consistency manager disal- lows asynchronous peer-to- peer replication for conflicting updates 17 If lock object disallows asyn- chronous peer-to-peer replica- tion for conflicting updates 6 Implicit by self-describing format 18 Without guaranteed message delivery 7 On token passing 19 Depending on replica control strategy of the lock object 8 Reconciliation is explicitly initiated 20 With persistent event channels 9 Depending on replica control strategy 21 Only at replication setup time 10 In connected mode 22 With tight or loose coupling 11 In disconnected mode 23 In decoupled mode 12 Depends on consistency man-... In PAGE 44: ...3.3 Replication in database systems 61 Table3 -6: Legend to table 3-5. CA CA-OpenIngres/Replicator OR OmniReplicator ER Informix Enterprise Replica- tion Ora Oracle replication facility DRO Objectivity/DB Data Replica- tion Option OSAR ObjectStore Asynchronous Replication Gem GemEnterprise OSC OSCAR IBM IBM DataPropagator SQLS Microsoft SQL Server repli- cation facility IP InfoPump SR SQL Remote Jet Microsoft Jet Database Engine Sy Sybase Replication Server LN Lotus Notes replication facil- ity VR Versant Replication 1 With peer-to-peer replication 3 Schema 2 With master-slave replication 4 Data 3.... ..."
Table 3-5 Primary Files
in Degree Conferred:.............................. METHODS FOR THE DESIGN OF MEDICAL DATA BASE SYSTEMS
"... In PAGE 55: ... and the functions of the required support system have been documented in detail t31; This study was done using many of the principles developed in [I] and [2]; The proposed automated medical record system has been called quot;The Family Systemtt. and it is this application which will be analyzed; Since the proposed system is moderately large, much use is made of tables during the exposition of the design process; FILES FOR THE FAMILY SYSTEN The Family System is envisaged to have 29 data files and several auxiliary index files [3]; The data files are summarized in Table3 -1: The summary provides An estimate of the size of the file: n; The number and total length of all fixed fields: af , Rf; The number and both average and maximum total length of ... In PAGE 57: ...fields; and the size: n(min, avg, max), an, Rn; The nests themselves are denoted using a hierarchical number in^ scheme: entity relation file. level I nest file, second and lowest level nest file: p, p;q, p;q;r The third file (Patient) has multiple record subtypes, containing optional and transient data; These files are denoted 3a and 3b; The length for various element types defined for the Family System is estimated as shown in Table3 -2; Groups of elements are taken in terms of multiple integer bytes; The table does not include any structural non-essential data elements; The estimates are based on data provided for the Family System [3], from the AANRS Study [2], and from statistics presented in [I]; The expected size of the files was verified by Dr; John Dervin of the Family Practice Center; and is shown in Table 3-3; Table 3-2 Lensth of Data Element Types Data-type V(min).,V(avg) ~(max) Reference Name Address Telephone Telephone Note Date Time Sex Flags Response Diglts (individual) 22 (business) 18 2 chars bits bit bits bytes bytes bgtes bytes bytes bytes [ : pit30 and ?:p;ll281 Hislll [2:p;99 and 2:vo1;2 CDB p;21] [3:p;81 I ~3:p;ai I ... In PAGE 57: ...fields; and the size: n(min, avg, max), an, Rn; The nests themselves are denoted using a hierarchical number in^ scheme: entity relation file. level I nest file, second and lowest level nest file: p, p;q, p;q;r The third file (Patient) has multiple record subtypes, containing optional and transient data; These files are denoted 3a and 3b; The length for various element types defined for the Family System is estimated as shown in Table 3-2; Groups of elements are taken in terms of multiple integer bytes; The table does not include any structural non-essential data elements; The estimates are based on data provided for the Family System [3], from the AANRS Study [2], and from statistics presented in [I]; The expected size of the files was verified by Dr; John Dervin of the Family Practice Center; and is shown in Table3 -3; Table 3-2 Lensth of Data Element Types Data-type V(min).,V(avg) ~(max) Reference Name Address Telephone Telephone Note Date Time Sex Flags Response Diglts (individual) 22 (business) 18 2 chars bits bit bits bytes bytes bgtes bytes bytes bytes [ : pit30 and ?:p;ll281 Hislll [2:p;99 and 2:vo1;2 CDB p;21] [3:p;81 I ~3:p;ai I ... In PAGE 59: ...The files presented by the Family System are organized to satisfy the perceived functional needs of the medical record applications; This means that all data attributes are assigned to specific files using conventional progra~ning design procedures; The files, however, exhibit semantic relationships among each other through the use of shared attribute domains; The files themselves are furthermore complex in the sense that they are not in first-normal-form; In order to present the data base model in a form which provides guidance to the design process, the files for the Family System will be normalized; In order tc derive the interrile rs~laLi.onships, the principal attributes of all files are listed alphabetically in Table3 -4; With each attribute the domain, the data type, and the file usage is indicated; Attributes which have a matching domain, but are named differently; are cornputstionally comparable, but ... In PAGE 63: ...A first-order normalization of the 32 Family System Files described in Table3 -1 extracts the nested structures and places them into distinct files; There are 25 nests and two auxiliary files so that the Family System in first-normal form comprises 57 files; In practice some of these nest files can be avoided by designating a fixed number of fields for the nest in the parent entity file as shown in Figure 2-2; The degree to which nests can be omitted depends on the efficiency of the file compression support; Prime candidates for denesting are the following files: 1;l Guarantors - small and low n(max) of repeating entries 4;1 Pap Smears - 11 11 11 II II II 11 4;2 Crug Allergies - quot; 11 11 II 11 11 II 10 ;0 Flowsheet - small flag and few entries 13;1 Day Sheet Patients - few records and high density 20;l Family member - small size of repeating field A sample calculation of the denesting tradeoff for the first of these files (1;1 ... In PAGE 68: ...The remaining files can now be reviewed for structural inter-relationships and redundancies; Linkage keys which have been identified in the 34 primary files are given as the ruling part for these files in Table3 -5; This table also indicates which of these files have a NULL dependent part (1;1, 5, 8, 9, lo), these files were apparently defined in [31 for their utility in providing a linkage, and are hence not an essential part of the data base model; There remain a number of files with identical ruling parts; These files represent different functional needs and were hence defined distinctly; In the model of the data base, however, these files are best combined; The original files are then represented ... In PAGE 69: ... medication code, date non.drugtEerapy, date floV sheet-type : gt; NUL date- date date date, problem-number date, problem-number, 3 code patient-number, aate; problem-number , test code patient-numbeF, date, problem-number , problem-note-number date, office date, office; patient-number - off ice office; patient-number * These files will be eliminated if denesting is carried out as lndlcated earller; In file 2; 1 (Family ember) the catenation of apos;family-number apos; and apos;family-member-number apos; forms the apos;~atient-number apos;, so that this file can also be represented as a segment dependent on the ruling part of apos;patient-number apos;; The new relations created in this manner are listed in Table3... In PAGE 74: ...role; Important linkage domains found in Table3 -4 are Patient name Patient number Provider name Office Family number Problem number Service code Therapy code Dollars Medication code Some redundancy is evident; In order to simplify updating, it may be desirable to define certain attributes as primary, and to update the redundant copies of these attributes asynchronously; Candidate attributes for such a division are the objective medical data as obtained during a patient visit; The primary relation for such data would be the Patient Visit file; The Problem List File; Flow-Sheets; Preventive Care records, etc; could be updated overnight; Redundancy for protection of data is maintained through the service files as the Transaction Log; Associations: An important primitive function for a data base is the ability to associate data from file with data from another file; Associations may be created dynamically through use of the Join operation, or may be bound permanently; A permanent association can contain unlimited dependent-part information; dynamic association only carries information derived from the joining ... In PAGE 78: ...transformed into a manipulatable model; This model was then inspected for function, redundancy; semantic relationships, and consistency; A number of transformations were performed to clarify and simplify the data base model; This model is now suitable for a performance-oriented design effort; Table 3-8 summarizes the transformations performed; The design of the Family System; as developed from an analysis of the service requirements, described 58 distinct files; The data base model now consists of 20 primary entity files (2 of these can be denested) 7 referenced entity files 4 lexicons 9 service files Rzlationships among the entity files are documented in Table3... In PAGE 80: ...hich is to support the Fa.m.i.1t.y System, several design techniques can be employed; These can be categorized as follows: File Organization Choices: pile, sequential, indexed-sequential, indexed, direct or ring; File Partitioning Choices: One record per tuple, or one record per segment; Use 01 apos; auxiliary access files; In practice all three choices will be employed; In order to establish a baseline; the nerf apos;ormance of a pile of unpartitioned records without auxiliary access files will be presented initially; Table 4-1 summarizes the basic relations and their parameters, as derived from the data presented in Table3 -1; Since all files are evaluated independently, the size of the ruling part has been added to the recordsize; The primary files summarized in Table 4-1 do not include the lexicons and referenced entity files; The space required for these is presented in Table 4-3 using the assumptions that they ... In PAGE 84: ...n aspect of information services to the Family System and as indicated in [ 1 :Ch;5; 1 I, the usage of the Family System for information purposes will depend on the quality of services to clinic, research and educational management; The load due to this latter type of usage can be expected to be considerably less and not coincide with times of high clinic activity; This aspect will hence not now be evaluated; The services that a.re to be provided are selected from [2:SeC;4C], and usage qualities are provided by [3:Ch;2] and Table3... In PAGE 104: ...T r log (n R/U) 1 (s+r+B/t) + 1/2 0/5 ~/t apos; F 2 Indexed-Sequential: An indexed-sequential file organization provides faster access through a tree search of key values [I:Ch;3;2;31; Its efficiency depends on a small number of updates per file; Some additional space, SI; is required; This space is a function of the fanout ratio, y, [I:Ch;3;3;1], blocking; and number of records; n, for a two-level (x=2) index; File 12;l only requires one level; The values for Rr depend on the size of the ruling part and are given in Table3 -7; T =s + (2 + Pov (1+1/2~ov)(r+B/t) ; Pov = o/(n+o) F T = ( R/B + 2 Pov (1-R/B) )(r+B/t) (two buffers are available) ... ..."
Table 1: Load Balancing Statistics [18] Shasha D. and Goodman N. Concurrent Search Tree Algorithms, ACM Transactions on Database Systems, 13(1), 1988, pp. 53-90. [19] Weihl E. W. and Wang P. Multi-version Memory: Software cache Management for Concurrent B- Trees, Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, 1990, pp. 650-655. [20] Yen I. and Bastani F. Hash Table in Massively Parallel Systems, Proceedings of the 1992 Interna- tional Conferences on Computer Languages, April 20-23, 1992, pp. 660-664.
1992
"... In PAGE 16: ... With hot spots the variation is much greater, indicating the nice e ect load balancing has for smoothing the variation and reducing the gradient. Finally Table1 shows the calculated average number of moves made by a node in the entire system, with and without hot spots and with and without load balancing, and the normalized variation of the capacity at each processor from the mean. The table shows that the load balancing reduces the coe cient of variation at the cost of a very small increase in the average moves in the system, indicating that load balancing is e ective with low overhead.... ..."
Cited by 4
Table 3-5. Representative Aircraft Fleet Data
"... In PAGE 10: ...able 2-3. Passenger-Cargo IOC Components .......................................................................... 2-3 Table3 -1.... In PAGE 10: ...able 3-1. A Representative Traffic Series Worksheet.............................................................. 3-2 Table3 -2.... In PAGE 10: ...able 3-2. A Representative Financial Series Worksheet.......................................................... 3-3 Table3 -3.... In PAGE 10: ...able 3-3. A Representative Detailed Cost Series Worksheet................................................... 3-4 Table3 -4.... In PAGE 10: ...able 3-4. A Representative Employment Series Worksheet .................................................... 3-5 Table3 -5.... In PAGE 10: ...able 3-5. Representative Aircraft Fleet Data............................................................................ 3-6 Table3... In PAGE 22: ... Traffic series include statistics that measure cargo volumes, aircraft activity, fuel consumption, and system capacity. Table3 -1 is an example of a traf- fic worksheet. With the exception of cargo ATMs and cargo RTMs, the line item titles and corresponding account numbers are taken directly from the Form 41 re- porting schedules.... In PAGE 23: ... Table3 -1. A Representative Traffic Series Worksheet Total: all-cargo airlines Elements 1994 1995 K110.... In PAGE 23: ...nalysis of non-U.S. air carriers should be treated with an additional degree of un- certainty. Table3... In PAGE 24: ...3-3 Table3 -2. A Representative Financial Series Worksheet Total: all-cargo airlines Elements 1994 1995 3905.... In PAGE 25: ... Table3 -3. A Representative Detailed Cost Series Worksheet Total: all-cargo airlines Elements 1994 1995 5123.... In PAGE 26: ...3-5 Table3 -3. A Representative Detailed Cost Series Worksheet (Continued) Total: all-cargo airlines Elements 1994 1995 7075.... In PAGE 26: ...9 Total aircraft operating expenses 3,973,313,720 4,850,481,317 The employment series reports the year-end weighted average number of full-time employees in each category. Table3 -4 is a representative employment series worksheet. Table 3-4.... In PAGE 26: ... Table 3-4 is a representative employment series worksheet. Table3 -4. A Representative Employment Series Worksheet Total: all-cargo airlines Elements 1994 1995 0021.... In PAGE 26: ... For each aircraft, the database contains observations regarding the operator, airframe age, and current engines. Table3 -5 is a sample of... In PAGE 28: ...he carrier-level analysis for the U.S. passenger-cargo (PC) industry. Both the or- ganization of the worksheet and the types of statistics computed are nearly identi- cal to those of the all-cargo industry. Table3 -6 presents a representative portion of the F41 AC Analysis worksheet. Table 3-6.... In PAGE 28: ... Table 3-6 presents a representative portion of the F41 AC Analysis worksheet. Table3 -6. A Representative Analysis Worksheet Total: all-cargo airlines Category 1994 1995 Network statistics Average stage length 669.... ..."
Table 3-5. Representative Aircraft Fleet Data
1998
"... In PAGE 10: ...able 2-3. Passenger-Cargo IOC Components .......................................................................... 2-3 Table3 -1.... In PAGE 10: ...able 3-1. A Representative Traffic Series Worksheet.............................................................. 3-2 Table3 -2.... In PAGE 10: ...able 3-2. A Representative Financial Series Worksheet.......................................................... 3-3 Table3 -3.... In PAGE 10: ...able 3-3. A Representative Detailed Cost Series Worksheet................................................... 3-4 Table3 -4.... In PAGE 10: ...able 3-4. A Representative Employment Series Worksheet .................................................... 3-5 Table3 -5.... In PAGE 10: ...able 3-5. Representative Aircraft Fleet Data............................................................................ 3-6 Table3... In PAGE 22: ... Traffic series include statistics that measure cargo volumes, aircraft activity, fuel consumption, and system capacity. Table3 -1 is an example of a traf- fic worksheet. With the exception of cargo ATMs and cargo RTMs, the line item titles and corresponding account numbers are taken directly from the Form 41 re- porting schedules.... In PAGE 23: ... Table3 -1. A Representative Traffic Series Worksheet Total: all-cargo airlines Elements 1994 1995 K110.... In PAGE 23: ...nalysis of non-U.S. air carriers should be treated with an additional degree of un- certainty. Table3... In PAGE 24: ...3-3 Table3 -2. A Representative Financial Series Worksheet Total: all-cargo airlines Elements 1994 1995 3905.... In PAGE 25: ... Table3 -3. A Representative Detailed Cost Series Worksheet Total: all-cargo airlines Elements 1994 1995 5123.... In PAGE 26: ...3-5 Table3 -3. A Representative Detailed Cost Series Worksheet (Continued) Total: all-cargo airlines Elements 1994 1995 7075.... In PAGE 26: ...9 Total aircraft operating expenses 3,973,313,720 4,850,481,317 The employment series reports the year-end weighted average number of full-time employees in each category. Table3 -4 is a representative employment series worksheet. Table 3-4.... In PAGE 26: ... Table 3-4 is a representative employment series worksheet. Table3 -4. A Representative Employment Series Worksheet Total: all-cargo airlines Elements 1994 1995 0021.... In PAGE 26: ... For each aircraft, the database contains observations regarding the operator, airframe age, and current engines. Table3 -5 is a sample of... In PAGE 28: ...he carrier-level analysis for the U.S. passenger-cargo (PC) industry. Both the or- ganization of the worksheet and the types of statistics computed are nearly identi- cal to those of the all-cargo industry. Table3 -6 presents a representative portion of the F41 AC Analysis worksheet. Table 3-6.... In PAGE 28: ... Table 3-6 presents a representative portion of the F41 AC Analysis worksheet. Table3 -6. A Representative Analysis Worksheet Total: all-cargo airlines Category 1994 1995 Network statistics Average stage length 669.... ..."
Table 12: Data for ATUM Traces on 32K Caches [3] J. H. Chang, H. Chao, and K. So, \Cache Design of A Sub-Micron CMOS System/370, quot; in Proceedings of the 14th Annual International Symposium on Computer Architecture, Pittsburgh, Pennsylvania, pp. 208{213, IEEE Computer Society and ACM SIGARCH, June 2{5, 1987. Computer Architecture News, 15(2), June 1987. [4] John L. Hennessy and David A. Patterson, Computer Architecture: A Quantitative Ap- proach. Morgan Kaufmann Publishers, Inc., 1990. [5] Mark D. Hill, \A Case for Direct-Mapped Caches, quot; Computer, 21(12):25{40, December 1988.
1993
Cited by 1
Table 13: Data for ATUM Traces on 128K Caches [6] Norman P. Jouppi, \Improving Direct-Mapped Cache Performance by the Addition of a Small Fully-Associative Cache and Prefetch Bu ers, quot; in Proceedings of the 17th Annual International Symposium on Computer Architecture, Seattle, Washington, pp. 364{373, IEEE Computer Society and ACM SIGARCH, May 28{31, 1990. Computer Architecture News, 18(2), June 1990. [7] S. Przybylski, M. Horowitz, and J. Hennessy, \Performance Tradeo s in Cache Design, quot; in Proceedings of the 15th Annual International Symposium on Computer Architecture, Honolulu, Hawaii, pp. 290{298, IEEE Computer Society and ACM SIGARCH, May 30{ June 2, 1988. Computer Architecture News, 16(2), May 1988. 36
1993
Cited by 1
Table 3-5 Software
in Contents
1995
"... In PAGE 8: ...able 2-3 Hazard Causes and Controls - Examples .........................................................16 Table3 -1 NASA Software Lifecycle - Reviews and Documents.... In PAGE 8: ...able 3-1 NASA Software Lifecycle - Reviews and Documents......................................20 Table3 -2 MIL-STD-882C Software Hazard Criticality Matrix.... In PAGE 8: ...able 3-2 MIL-STD-882C Software Hazard Criticality Matrix.......................................28 Table3 -3 Software Sub-system categories.... In PAGE 8: ...able 3-3 Software Sub-system categories........................................................................29 Table3 -4 Required Software Safety Effort .... In PAGE 8: ...able 3-4 Required Software Safety Effort .......................................................................30 Table3 -5 Software Requirements Phase.... In PAGE 8: ...able 3-5 Software Requirements Phase...........................................................................33 Table3 -6 Software Architectural Design Phase.... In PAGE 8: ...able 3-6 Software Architectural Design Phase................................................................34 Table3 -7 Software Detailed Design Phase .... In PAGE 8: ...able 3-7 Software Detailed Design Phase .......................................................................34 Table3 -8 Software Implementation Phase.... In PAGE 8: ...able 3-8 Software Implementation Phase........................................................................35 Table3 -9 Software Testing Phase .... In PAGE 8: ...able 3-9 Software Testing Phase .....................................................................................35 Table3 -10 Dynamic Testing .... In PAGE 8: ...able 3-10 Dynamic Testing .............................................................................................36 Table3 -11 Software Module Testing .... In PAGE 27: ...19 3.1 Software Development Lifecycle Approach Table3 -1 NASA Software Lifecycle - Reviews and Documents (page 20)shows the typical NASA software waterfall design lifecycle phases and lists the reviews and deliverable project documents required at each lifecycle phase. Each of these reviews and project documents should contain appropriate references and reports on software safety.... In PAGE 28: ...20 Table3 -1 NASA Software Lifecycle - Reviews and Documents LIFECYCLE PHASES MILESTONE REVIEWS SOFTWARE SAFETY TASKS DOCUMENTS Software Concept and Initiation (Project System and Subsystem Requirements and Design Development) SCR - Software Concept Review Software Management Plan Review Phase-0 Safety Review Scoping Safety Effort 2.1.... In PAGE 31: ... The system development phases are separated by system design reviews. Each system design review is conducted approximately in parallel with a corresponding system safety review as shown in Table3 -1 NASA Software Lifecycle - Reviews and Documents on page 20. The software development effort may or may not be synchronized with the system development effort.... In PAGE 35: ... 3.3 Scoping of Software Subsystem Safety Effort The level of required software safety effort for a system (shown in Table3 -3) is determined by its System Category, derived from Table 2-2 Hazard Prioritization - System Risk Index (Page 8), and the hazard severity level from Section 2.... In PAGE 36: ...28 Table3 -2 MIL-STD-882C Software Hazard Criticality Matrix HAZARD CATEGORY CONTROL CATEGORY CATASTRO- PHIC CRITICAL MODERATE NEGLIGIBLE / MARGINAL I1135 II 1 2 4 5 III 2 3 5 5 III 3 4 5 5 Software Hazard Risk Index Suggested Criteria 1 High Risk - significant analysis and testing resources 2 Medium risk - requirements and design analysis and in-depth testing required 3-4 Moderate risk - high level analysis and testing acceptable with management approval 5 Low Risk - Acceptable 3.3.... In PAGE 37: ...29 Table3 -3 Software Sub-system categories System Category Descriptions I Partial or total autonomous control of safety critical functions by software. (System Risk Index 2) Complex system with multiple subsystems, interacting parallel processors, or multiple interfaces.... In PAGE 38: ...30 Table3 -4 Required Software Safety Effort SYSTEM CATEGORY HAZARD SEVERITY LEVEL from Section 2.... In PAGE 39: ... Ultimately, the range of selected techniques must be negotiated and approved by project management, software development, software quality assurance, and software systems safety. Table3 -5 Software Requirements Phase through Table 3-11 Software Module Testing are modifications of tables that appear from an early International Electrotechnical Committee (IEC) draft standard IEC 1508, quot;Software For Computers In The Application Of Industrial Safety-Related Systems quot; [5]. This document is currently under review by national and international representatives on the IEC to determine its acceptability as an international standard on software safety for products which contain Programmable Electronic Systems (PESs).... In PAGE 39: ... These tables provide guidance on the types of assurance activities which may be performed during the lifecycle phases of safety-critical software development. For this guidebook, the Required Software Safety Efforts values displayed in Table3 -4 Required Software Safety Effort (page 30), will determine which development activities are required for each level of effort. Each of the following tables lists techniques and recommendations for use based on safety effort level for a specific software development phase or phases.... In PAGE 40: ... The final list of techniques to be used on any project should be developed jointly by negotiations between project management and safety assurance. All the following tables, Table3 -5 Software Requirements Phase through Table 3-11 Software Module Testing , list software development, safety and assurance activities which should be implemented in the stated phases of development. Life Cycle Phase Tasks and Priorities How To: Development Tasks How To: Analysis Tasks Concept Initiation Table 3-5 Software Requirements Phase Section 4.... In PAGE 40: ... All the following tables, Table 3-5 Software Requirements Phase through Table 3-11 Software Module Testing , list software development, safety and assurance activities which should be implemented in the stated phases of development. Life Cycle Phase Tasks and Priorities How To: Development Tasks How To: Analysis Tasks Concept Initiation Table3 -5 Software Requirements Phase Section 4.1 Section 5.... In PAGE 40: ... Table3 -5 Software Requirements Phase Section 4.3 Section 5.... In PAGE 40: ...3 Section 5.1 Software Detailed Design Table3 -7 Software Detailed Design Phase Section 4.4 Section 5.... In PAGE 40: ...4 Section 5.3 Software Implementation Table3 -8 Software Implementation Phase Section 4.5 Section 5.... In PAGE 40: ...5 Section 5.1 Software Test Table3 -9 Software Testing Phase Table 3-10 Dynamic Testing Table 3-11 Software Module Testing Section 4.6... In PAGE 40: ...5 Section 5.1 Software Test Table 3-9 Software Testing Phase Table3 -10 Dynamic Testing Table 3-11 Software Module Testing Section 4.6... In PAGE 40: ...5 Section 5.1 Software Test Table 3-9 Software Testing Phase Table 3-10 Dynamic Testing Table3 -11 Software Module Testing Section 4.6... In PAGE 41: ...33 Table3 -5 Software Requirements Phase TECHNIQUE SAFETY EFFORT LEVEL MIN MOD FULL 2.1 Preliminary Hazard Analysis (PHA) MMM 5.... In PAGE 42: ...34 Table3 -6 Software Architectural Design Phase TECHNIQUE SAFETY EFFORT LEVEL MIN MOD FULL 5.2.... In PAGE 42: ....2.4.2 Independence Analysis HR M M Table3 -7 Software Detailed Design Phase TECHNIQUE SAFETY EFFORT LEVEL MIN MOD FULL 5.3.... In PAGE 43: ...35 Table3 -8 Software Implementation Phase TECHNIQUE SAFETY EFFORT LEVEL MIN MOD FULL 5.4.... In PAGE 43: ...4.9 Formal Methods NR HR HR Table3 -9 Software Testing Phase TECHNIQUE SAFETY EFFORT LEVEL MIN MOD FULL Testing Defensive Programming NR HR M Boundary Value Tests R HR M Error Guessing NR NR R Test Coverage Analysis R HR M Functional Testing M M M Fagan Formal Inspections (Test Plans) HR HR M Reliability Modeling NR HR HR Checklists of Tests R HR... In PAGE 44: ...36 Table3 -10 Dynamic Testing TECHNIQUE SAFETY EFFORT LEVEL MIN MOD FULL Typical sets of sensor inputs HR M M Test specific functions HR M M Volumetric and statistical tests R HR HR Test extreme values of inputs R M M Test all modes of each sensor R M M Path testing R M M Every statement executed once HR M M Every branch tested at least once HR M M Every predicate term tested R HR M Every loop executed 0, 1, many times R M M Every path executed R HR M Every assignment to memory tested NR HR HR Every reference to memory tested NR HR HR All mappings from inputs checked NR HR HR All timing constraints verified R M M Test worst case interrupt sequences R R... In PAGE 45: ...37 Test significant chains of interrupts R R NR Test Positioning of data in I/O space HR M M Check accuracy of arithmetic NR HR M All modules executed at least once M M M All invocations of modules tested HR M M Table3 -11 Software Module Testing TECHNIQUE SAFETY EFFORT LEVEL MIN MOD FULL Simulation (Test Environment) R HR M Load Testing (Stress Testing) HR M M Boundary Value Tests R HR M Test Coverage Analysis R HR M Functional Testing M M M Performance Monitoring R HR M Formal Progress Reviews R M M Reliability Modeling NR HR HR Checklists of Tests R HR... ..."
Results 1 - 10
of
68,520