Complexity of increasing the secure connectivity in wireless ad hoc networks

We consider the problem of maximizing the secure connectivity in wireless ad hoc networks, and analyze complexity of the post-deployment key establishment process constrained by physical layer properties such as connectivity, energy consumption and interference. Two approaches, based on graph augmentation problems with nonlinear edge costs, are formulated. The first one is based on establishing a secret key using only the links that are already secured by shared keys. This problem is in NP-hard and does not accept polynomial time approximation scheme PTAS since minimum cutsets to be augmented do not admit constant costs. The second one extends the first problem by increasing the power level between a pair of nodes that has a secret key to enable them physically connect. This problem can be formulated as the optimal key establishment problem with interference constraints with bi-objectives: (i) maximizing the concurrent key establishment flow, (ii) minimizing the cost. We prove that both problems are NP-hard and MAX-SNP with a reduction to MAX3SAT problem

Ditransitive verbs and the ditransitive construction: a diachronic perspective

This paper argues for the adoption of a construction-based perspective to the investigation of diachronic shifts in valency, which is a hitherto largely neglected topic in the framework of valency grammar. On the basis of a comparison of the set of verbs attested in the double object argument structure pattern in a corpus of 18th-century British English with the construction's present-day semantic range, I will distinguish between three kinds of valency shifts. It will be shown that the semantic ranges of schematic argument structure constructions are subject to diachronic change, and that the shifts in valency observed in individual verbs are often part of more general changes at the level of the associated argument structure constructions. The latter part of the paper explores frequency shifts in valency and constructional semantics

Jesu Meine Freude: A cultural reception analysis of Romans 8

Romans 8:1-11 ; Contains German text and trans of motet, Jesus Meine Freude by J S Bach. Cultural reception of the Gospel, edt by T Hegedus

Take-ings

The word property had many meanings in 1789, as it does today, and a critical aspect of the ongoing debate about the meaning of the Fifth Amendment\u27s Takings Clause has centered on how the word should be read in the context of the Clause. Property has been read by Professor Thomas Merrill to refer to ownership interests, by Richard Epstein in terms of a broad Blackstonian conception of the individual control of the possession, use, and disposition of resources, by Benjamin Barros as reflective of constructions through individual expectations and state law, and by the author as physical control of material possessions As a textual matter, however, the Takings Clause is not simply concerned with governmental actions that affect property. The Clause provides that private property [shall not] be taken for public use without just compensation. It is thus concerned with property taken for public use and the word taken is the key, at least for a textualist, to understanding both which types of governmental actions fall within the ambit of the Clause and what types of property the Clause protects. The centrality of the concept of takings to the Clause\u27s meaning is reflected by the name by which the Clause is known. It is the Takings Clause, not the Property Clause. Although it has, ironically, not figured prominently in takings scholarship, the word taken is of fundamental importance to the Clause\u27s meaning. In this essay, the author explores the importance from a textualist perspective and argues that a textualist will reject the doctrine of regulatory takings

Learning salience amoung [sic] features through contingency in the CEL framework

Determining which features in an environment are salient given a task, salience assignment, is a central problem in Machine Learning. A related phenomenon, contingency (the conditions under which relative salience among environmental features is acquired), is central to learning and memory in animal psychology. This paper presents an analysis of a set of empirical data on contingency and an algorithm for the salience assignment problem. The algorithm presented is implemented in a working computer program which interacts with a simulated environment to produce contingent associative learning corresponding to relevant behavioral data. The model also makes specific empirical predictions that can be experimentally tested

Verifying the Interplay of Authorization Policies and Workflow in Service-Oriented Architectures (Full version)

A widespread design approach in distributed applications based on the service-oriented paradigm, such as web-services, consists of clearly separating the enforcement of authorization policies and the workflow of the applications, so that the interplay between the policy level and the workflow level is abstracted away. While such an approach is attractive because it is quite simple and permits one to reason about crucial properties of the policies under consideration, it does not provide the right level of abstraction to specify and reason about the way the workflow may interfere with the policies, and vice versa. For example, the creation of a certificate as a side effect of a workflow operation may enable a policy rule to fire and grant access to a certain resource; without executing the operation, the policy rule should remain inactive. Similarly, policy queries may be used as guards for workflow transitions. In this paper, we present a two-level formal verification framework to overcome these problems and formally reason about the interplay of authorization policies and workflow in service-oriented architectures. This allows us to define and investigate some verification problems for SO applications and give sufficient conditions for their decidability.Comment: 16 pages, 4 figures, full version of paper at Symposium on Secure Computing (SecureCom09

A Hybrid Analysis for Security Protocols with State

Cryptographic protocols rely on message-passing to coordinate activity among principals. Each principal maintains local state in individual local sessions only as needed to complete that session. However, in some protocols a principal also uses state to coordinate its different local sessions. Sometimes the non-local, mutable state is used as a means, for example with smart cards or Trusted Platform Modules. Sometimes it is the purpose of running the protocol, for example in commercial transactions. Many richly developed tools and techniques, based on well-understood foundations, are available for design and analysis of pure message-passing protocols. But the presence of cross-session state poses difficulties for these techniques. In this paper we provide a framework for modeling stateful protocols. We define a hybrid analysis method. It leverages theorem-proving---in this instance, the PVS prover---for reasoning about computations over state. It combines that with an "enrich-by-need" approach---embodied by CPSA---that focuses on the message-passing part. As a case study we give a full analysis of the Envelope Protocol, due to Mark Ryan