H2 Spring E. Governance, in principle, applies to the entire life cycle of an IT system

Similar documents
Evolving a New Feature for a Working Program

Computability Crib Sheet

Econ 325: Introduction to Empirical Economics

Geodatabase Best Practices. Dave Crawford Erik Hoel

Search and Lookahead. Bernhard Nebel, Julien Hué, and Stefan Wölfl. June 4/6, 2012

Alpha-Beta Pruning: Algorithm and Analysis

Induction on Failing Derivations

Solving Equations by Adding and Subtracting

Alpha-Beta Pruning: Algorithm and Analysis

Suppose h maps number and variables to ɛ, and opening parenthesis to 0 and closing parenthesis

Proving Programs Correct

Hypothesis testing I. - In particular, we are talking about statistical hypotheses. [get everyone s finger length!] n =

Advanced Analysis of Algorithms - Midterm (Solutions)

Alpha-Beta Pruning: Algorithm and Analysis

Administrative notes. Computational Thinking ct.cs.ubc.ca

Lecture Notes on Inductive Definitions

Proof Techniques (Review of Math 271)

5 ProbabilisticAnalysisandRandomized Algorithms

Proving Completeness for Nested Sequent Calculi 1

Tree Signatures and Unordered XML Pattern Matching

Event Operators: Formalization, Algorithms, and Implementation Using Interval- Based Semantics

Final. Introduction to Artificial Intelligence. CS 188 Spring You have approximately 2 hours and 50 minutes.

c 2011 Nisha Somnath

A Guide to Proof-Writing

MOD Ontology. Ian Bailey, Model Futures Michael Warner, MOD ICAD

Theory of Computation

CS6840: Advanced Complexity Theory Mar 29, Lecturer: Jayalal Sarma M.N. Scribe: Dinesh K.

CSE 355 Test 2, Fall 2016

EXPECTATIONS OF TURKISH ENVIRONMENTAL SECTOR FROM INSPIRE

Nearest Neighbor Search with Keywords

State GIS Officer/GIS Data

Propositional Logic. Fall () Propositional Logic Fall / 30

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.

Water Resources Systems Prof. P. P. Mujumdar Department of Civil Engineering Indian Institute of Science, Bangalore

An Algorithms-based Intro to Machine Learning

Suggested solutions to the 6 th seminar, ECON4260

Pattern Popularity in 132-Avoiding Permutations

AVL Trees. Manolis Koubarakis. Data Structures and Programming Techniques

Title: Logical Agents AIMA: Chapter 7 (Sections 7.4 and 7.5)

CSE 331 Winter 2018 Reasoning About Code I

Tutorial on Mathematical Induction

6 Evolution of Networks

1 Basic Definitions. 2 Proof By Contradiction. 3 Exchange Argument

Name: UW CSE 473 Final Exam, Fall 2014

CS 453 Operating Systems. Lecture 7 : Deadlock

DEMBSKI S SPECIFIED COMPLEXITY: A SIMPLE ERROR IN ARITHMETIC

The Weakest Failure Detector to Solve Mutual Exclusion

Syntactic Analysis. Top-Down Parsing

Brief Introduction to Prolog

Fundamental Algorithms

Fundamental Algorithms

Dictionary: an abstract data type

Q520: Answers to the Homework on Hopfield Networks. 1. For each of the following, answer true or false with an explanation:

NSL Verification and Attacks Agents Playing Both Roles

Diversified Top k Graph Pattern Matching

The Gauss-Jordan Elimination Algorithm

Math Models of OR: Branch-and-Bound

Policy Management for Virtual Communities of Agents

CHAPTER 22 GEOGRAPHIC INFORMATION SYSTEMS

Exam 3, Math Fall 2016 October 19, 2016

Lecture 3 : Predicates and Sets DRAFT

SDS developer guide. Develop distributed and parallel applications in Java. Nathanaël Cottin. version

Administering your Enterprise Geodatabase using Python. Jill Penney

Dictionary: an abstract data type

On the Computational Hardness of Graph Coloring

The null-pointers in a binary search tree are replaced by pointers to special null-vertices, that do not carry any object-data

Lecture 11: Proofs, Games, and Alternation

Extracted from a working draft of Goldreich s FOUNDATIONS OF CRYPTOGRAPHY. See copyright notice.

Lecture 2: Proof of Switching Lemma

Technical Specifications. Form of the standard

CS 395T Computational Learning Theory. Scribe: Mike Halcrow. x 4. x 2. x 6

CS20a: Turing Machines (Oct 29, 2002)

Decision trees. Special Course in Computer and Information Science II. Adam Gyenge Helsinki University of Technology

Private and Verifiable Interdomain Routing Decisions. Proofs of Correctness

Guest Speaker. CS 416 Artificial Intelligence. First-order logic. Diagnostic Rules. Causal Rules. Causal Rules. Page 1

Propositional Resolution

UNIT-VI PUSHDOWN AUTOMATA

Introduction to Languages and Computation

Boolean circuits. Lecture Definitions

Elementary Linear Algebra, Second Edition, by Spence, Insel, and Friedberg. ISBN Pearson Education, Inc., Upper Saddle River, NJ.

To every formula scheme there corresponds a property of R. This relationship helps one to understand the logic being studied.

Professor Christoph B. Graber, PhD Spring Semester Master s Module Exam Legal Sociology , Uhr

A Decidable Logic for Complex Contracts

2.6 Complexity Theory for Map-Reduce. Star Joins 2.6. COMPLEXITY THEORY FOR MAP-REDUCE 51

Skylines. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland

Common Sense Reasoning About Complex Actions

How to Recognise Different Tree Patterns from quite a Long Way Away

CSE 241 Class 1. Jeremy Buhler. August 24,

Price of Stability in Survivable Network Design

Central Algorithmic Techniques. Iterative Algorithms

On the Complexity of Mapping Pipelined Filtering Services on Heterogeneous Platforms

CS 125 Section #12 (More) Probability and Randomized Algorithms 11/24/14. For random numbers X which only take on nonnegative integer values, E(X) =

COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning

ESBN. Working Group on INSPIRE

CS505: Distributed Systems

Principles Underlying Evaluation Estimators

On the weakest failure detector ever

CS 6112 (Fall 2011) Foundations of Concurrency

arxiv: v1 [cs.ds] 3 Feb 2018

Principles of Intelligent Systems: Situation Calculus

Transcription:

1. (14 points) Of the following statements, identify all that hold about governance. A. Governance refers to the administration of a system according to the requirements imposed by a governing body Solution: A is false: governance is a general notion and applies in settings where they may be no governing body that imposes requirements; in the targeted settings, the requirements arise from the stakeholders B. Even changing the URL through which students register for courses at our university is an example of what could be a governance decision Solution: B is true: C. In abstract terms, a policy of a participant in a system reflects the autonomy of the participant Solution: C is true: a participant s policy describes its autonomous decision making even if it is to support others D. Effective governance presumes an ability to conduct voting to elect the stakeholders who would take system-wide decisions on behalf of everyone else Solution: D is false: governance does not impose a requirement to have a particular organization or to go through elections E. Governance, in principle, applies to the entire life cycle of an IT system Solution: E is true: F. Governance does not entail that all decisions are made through negotiation at run time; several important decisions could be configured ahead of time so little or no negotiation is needed at run time Solution: F is true: governance does not entail that everything be handled through run time negotiation G. The so-called SOA governance is an element of IT governance Solution: G is true: 2. (36 points) Problems on architecture, governance, norms, and contracts. A. Policies make the most sense in settings where we have to make sure that whatever the system manager wants is carried out and users are prevented from acting against the manager s wishes Solution: A is false: policies make sense where we want flexibility in decision making; policies make sense for decision making by any stakeholder B. To implement an organizational policy we must employ a policy engine Solution: B is false: an organizational policy may well be implemented in a hard-coded programmatic fashion or through human intervention; a policy engine would be a desirable way to implement such a policy but is by no means the only way to do so Page 1 of 8

C. Norms as we treat them in this course capture business relationships between autonomous parties as a way to specify their interactions in a meaningful manner Solution: C is true: D. A physical capability to perform some action is the most basic kind of norm Solution: D is false: E. An authorization is violated only if in its terminal state, its antecedent is true and its consequent is false Solution: E is false: no, if its antecedent is false and its consequent is true F. A well-designed Org would not specify a commitment for a role that an agent playing that role is not planning to satisfy Solution: F is false: the Org does not specify the autonomous agent s policies G. A well-designed Org would not specify that a role be both committed to doing something and prohibited from doing it Solution: G is true: H. We use prohibitions to specify restrictions on a party s behavior that cannot be enforced through the computational system alone and require some external process, potentially leading to sanctions Solution: H is true: I. Prohibitions as we treat them relate to an optimistic strategy for enforcing norms in that we assume each party will respect its prohibitions, so we give each party freedom to proceed though we may subsequently detect violations and penalize violators Solution: I is true: J. Often, a liability in one role s façade is a privilege in another role s façade Solution: J is true: K. A contract must include the specification of a resolution clause Solution: K is false: L. A contract can include the specification of a resolution clause Solution: L is true: M. A penalty clause in a contract is a kind of a sanction clause Page 2 of 8

Solution: M is true: N. Once a contract clause is violated, the contract may either terminate in failure if it cannot be resolved or continue in its execution phase if it can be resolved Solution: N is true: as shown in the contract life cycle O. The main advantage of using an architectural framework such as DoDAF is that it helps produce unique architectures for IT systems of nontrivial complexity Solution: O is false: no architecture or methodology would yield a unique result for systems of nontrivial complexity P. In DoDAF terms, our normative specifications would fall into the category of specifications called the Operational Views Solution: P is true: Q. A policy expresses how a participant in a contract chooses its interactions with others, including whether it decides to break the terms of the given contract Solution: Q is true: a participant s policies reflect its autonomous local decision making; interconnections reflect dependence between them R. A compensation clause in a contract describes how potential problems in carrying out the contract may be resolved Solution: R is true: a compensation clause is a kind of resolution clause 3. (10 points) Problems on metadata and XML. A. Metadata is the general category of data about data, and includes markup as an important subclass Solution: A is true: B. Metadata can be potentially valuable trying to correctly interpret documents that are not exchanged across enterprises but are merely stored and retrieved Solution: B is true: C. If someone changes the namespace to which a URI refers, that change could potentially invalidate an XML document that references that namespace Solution: C is false: a URI is just an identifier and a namespace is whatever it happens to identify D. Once a URI for a namespace becomes established, its meaning is irrelevant except that it is a well-known identifier Page 3 of 8

Solution: D is true: E. Using XML for representing all documents has the benefit that one enterprise can understand the documents produced by another enterprise Solution: E is false: XML supports parsing but not understanding 4. (16 points) [Worth 4 points each.] Of the following statements, identify all that hold about XQuery. A. The following XQuery function computes all the leaves of a subtree rooted at its argument, $anode d e c l a r e f u n c t i o n l o c a l : l e a f ($ anode ) { $anode / / [ c o u n t ( ) = 0 ] Solution: A is false: just the leaf elements B. When invoked with $root as the document root, local:ancestor computes the ancestor-or-self axis for $anode d e c l a r e f u n c t i o n l o c a l : a n c e s t o r ($ r o o t, $anode ) { l o c a l : a n c ($ r o o t, $anode, ( ) ) d e c l a r e f u n c t i o n l o c a l : a n c ($ r o o t, $ t h i s, $ ancs ) { i f ($ t h i s = $ r o o t ) t h e n ($ t h i s, $ a ncs ) e l s e l o c a l : a n c ($ r o o t, $ t h i s / p a r e n t : : e l e m e n t ( ), ($ t h i s, $ ancs ) ) Solution: B is true: it computes ancestor or self C. When invoked with $root as the document root, local:ancestorish, which invokes local:anc as declared in Part B, computes the ancestor-or-self axis for its argument, $anode d e c l a r e f u n c t i o n l o c a l : a n c e s t o r i s h ($ r o o t, $anode ) { l o c a l : a n c ($ r o o t, $anode, ($ anode ) ) Solution: C is false: it inserts a spurious copy of $anode D. When invoked with $root set to the document root, local:ancestorr computes the ancestor axis for $anode d e c l a r e f u n c t i o n l o c a l : a n c e ($ r o o t, $ t h i s, $ ancs ) { i f ($ t h i s = $ r o o t ) t h e n $ a ncs e l s e l o c a l : a n c e ($ r o o t, Page 4 of 8

$ t h i s / p a r e n t : : e l e m e n t ( ), ($ t h i s / p a r e n t : : e l e m e n t ( ), $ ancs ) ) d e c l a r e f u n c t i o n l o c a l : a n c e s t o r r ($ r o o t, $anode ) { l o c a l : a n c e ($ r o o t, $anode, ( ) ) Solution: D is true: Page 5 of 8

Listing 1: Singers nested within songs grouped by genre <Songs> <rock> <Song l g ="en">h o t e l C a l i f o r n i a<sgr name="eagles" /> </ Song> </ rock> <f o l k> <Song l g ="cpe">day O<S g r name="harry Belafonte" /> </ Song> <Song l g ="pa">mera D i l Darda<S g r name="jagdish Prasad" /> </ Song> </ f o l k> <c a l y p s o> <Song l g ="en">jamaica F a r e w e l l<sgr name="harry Belafonte" /> </ Song> </ c a l y p s o> </ Songs> 5. (20 points) Problems on XPath (refer to Listing 1 as needed). A. At the document root of Listing 1, evaluating the XPath expression Songs/rock/Song[@lg= en ] finds the Song nodes for Hotel California and Jamaica Farewell Solution: A is false: just Hotel California B. At the document root of Listing 1, evaluating the XPath expression Songs/rock/Song[@lg= cpe ]/text()[1] finds the text node containing Day O Solution: B is false: there is no rock song with @lg= cpe C. At the document root of Listing 1, evaluating the XPath expression Songs/rock/Song[@lg or text()] finds a Song node that has an attribute lg or encloses some text Solution: C is true: D. The XPath expression //text()/text() finds the longest words within a text node; when evaluated at the document root of Listing 1, its outputs would include California, Day, and so on Solution: D is false: E. At the text node containing Mera Dil Darda in Listing 1, evaluating the XPath expression./sgr finds the Sgr node for Jagdish Prasad Solution: E is false: The Sgr node is not a child of the text node F. Evaluating the XPath expression Songs//Song[@lg= cpe ]/descendant::node() at the document root of Listing 1, finds an empty node sequence Solution: F is false: Page 6 of 8

G. At the rock node in Listing 1, the expression following::element()[1] finds the folk node Solution: G is true: H. At the calypso node in Listing 1, the expression preceding-sibling::text()[3] finds a text node containing whitespace Solution: H is true: I. At the Songs node in Listing 1, the expression //Song/*[3.9] yields no result Solution: I is true: only integer filters from 1 to last() can produce a result J. At the Songs node in Listing 1, the expression //Song/*[1.9] yields the folk node and nothing else Solution: J is false: only integer filters from 1 to last() can produce a result 6. (8 points) Problems on XQuery. A. Evaluating the following XQuery query on Listing 1 identifies both the rock and calypso genres f o r $ song i n doc ($ i n p u t ) / / Song where e v e r y $ songg i n $ song /.. / Song s a t i s f i e s ($ songg / @lg= en ) r e t u r n <engenre gname= {name($song/..)} /> Solution: A is true: B. Evaluating the following XQuery query on Listing 1 identifies only the rock genre f o r $ g e n r e i n doc ($ i n p u t ) / Songs / where some $ song i n $ g e n r e / Song s a t i s f i e s ( f n : c o n t a i n s ($ song / Sgr / @name, "s" ) ) r e t u r n $ g e n r e Solution: B is false: C. Any XQuery query that includes nested FLWOR expressions must have exactly one return for each such nested FLWOR expression Solution: C is true: D. The following XQuery function yields the same result as computing self::node() on $anode d e c l a r e f u n c t i o n l o c a l : s e l f l i k e ($ anode ) { $anode Solution: D is true: 7. (10 points) Problems on XPath. Page 7 of 8

A. At any context node, evaluating parent::node()/child::node() produces the same result as evaluating child::node()/parent::node() Solution: A is false: B. At any context node that is an element, evaluating parent::element()/child::element() produces no larger a node sequence than evaluating child::element()/parent::element() Solution: B is false: parent-child no smaller a node sequence than child-parent C. At any context node that is a comment, evaluating parent::node()/child::node() always produces a strictly larger set of nodes than evaluating child::node()/parent::node() Solution: C is true: parent::node()/child::node() produces a sequence that includes at least the comment node itself, whereas child::node()/parent::node() always produces an empty sequence D. For any context node, self::element() equals itself Solution: D is false: only for a context node that is an element E. An XPath query such as parent::node()/child::node() may never terminate, depending on the particular XML document and context node at which it is evaluated Solution: E is false: Page 8 of 8