Axiomatizations of the conjunctive permission value for games with permission structures

Game Theory;econometrics

Obligation, Permission, and Bayesian Orgulity

This essay has two aims. The first is to correct an increasingly popular way of misunderstanding Belot's Orgulity Argument. The Orgulity Argument charges Bayesianism with defect as a normative epistemology. For concreteness, our argument focuses on Cisewski et al.'s recent rejoinder to Belot. The conditions that underwrite their version of the argument are too strong and Belot does not endorse them on our reading. A more compelling version of the Orgulity Argument than Cisewski et al. present is available, however---a point that we make by drawing an analogy with de Finetti's argument against mandating countable additivity. Having presented the best version of the Orgulity Argument, our second aim is to develop a reply to it. We extend Elga's idea of appealing to finitely additive probability to show that the challenge posed by the Orgulity Argument can be met

Compline Book for the use of the Laity frequenting Dominican Churches

Compline, the last service of the day, while a simple part of the official daily prayer of the Church, has a special place in the hearts of Dominicans especially due to the procession afterwards during which the brothers and sisters sing the Salve Regina , a medieval antiphon to the Blessed Virgin Mary, and then the antiphon to Saint Dominic O lumen ecclesiae . As time went by with fewer friars in each community, the Compline became one of the few parts of the daily official prayer (Divine Office) which remained completely sung because of its relatively simple and repetitive nature.https://digitalcommons.providence.edu/catholic_documents/1006/thumbnail.jp

Authorization algorithms for permission-role assignments

Permission-role assignments (PRA) is one important process in Role-based access control (RBAC) which has been proven to be a flexible and useful access model for information sharing in distributed collaborative environments. However, problems may arise during the procedures of PRA. Conflicting permissions may assign to one role, and as a result, the role with the permissions can derive unexpected access capabilities. This paper aims to analyze the problems during the procedures of permission-role assignments in distributed collaborative environments and to develop authorization allocation algorithms to address the problems within permission-role assignments. The algorithms are extended to the case of PRA with the mobility of permission-role relationship. Finally, comparisons with other related work are discussed to demonstrate the effective work of the paper

Boston University Permission Ensemble, March 26, 2010

This is the concert program of the Boston University Permission Ensemble performance on Friday, March 26, 2010 at 7:30 p.m., at the Boston University Concert Hall, 855 Commonwealth Avenue, Boston, Massachusetts. Works performed were Quartet for Percussion by Gitta Steiner, But what about the noise of crumpling paper... by John Cage, Pendulum Music by Steve Reich, December 1952 by Earle Brown, Maknongan by Giacinto Scelsi, Radio Music by John Cage, and Les Moutons des Panurge by Frederick Rzewski. Digitization for Boston University Concert Programs was supported by the Boston University Center for the Humanities Library Endowed Fund

Boston University Permission Ensemble, November 20, 1994

This is the concert program of the Boston University Permission Ensemble performance on Sunday, November 20, 1994 at 8:00 p.m., at the Boston University Concert Hall, 855 Commonwealth Avenue, Boston, Massachusetts. Works performed were Fanfare for Tambourines by John Alfieri, Ceremonial by Paul Creston, Toccata for Percussion by Carlos Chavez, African Welcome Piece by Michael Udow, Divertimento for Brass and Percussion by Eugene Glickman, and Blue Song Plastic Dance by Jeffrey Fischer. Digitization for Boston University Concert Programs was supported by the Boston University Humanities Library Endowed Fund

Permission-Based Separation Logic for Multithreaded Java Programs

This paper motivates and presents a program logic for reasoning about multithreaded Java-like programs with concurrency primitives such as dynamic thread creation, thread joining and reentrant object monitors. The logic is based on concurrent separation logic. It is the first detailed adaptation of concurrent separation logic to a multithreaded Java-like language. The program logic associates a unique static access permission with each heap location, ensuring exclusive write accesses and ruling out data races. Concurrent reads are supported through fractional permissions. Permissions can be transferred between threads upon thread starting, thread joining, initial monitor entrancies and final monitor exits.\ud This paper presents the basic principles to reason about thread creation and thread joining. It finishes with an outlook how this logic will evolve into a full-fledged verification technique for Java (and possibly other multithreaded languages)