Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

Data Mining - Concepts and Techniques.

Data Mining Practical Machine Learning Tools and Techniques

How to Do Things With Words

We consider the design and enactment of multi-agent protocols that describe collaboration using "normative" or "social" abstractions, specifically, commitments. A (multiagent) protocol defines the relevant social states and how they progress; each participant maintains a local projection of these states and acts accordingly. Protocols expose two important challenges: (1) how to compose them in a way that respects commitments and (2) how to verify the compliance of the parties with the social states. Individually, these challenges are inadequately studied and together not at all.

We motivate the notion of a social context to capture how a protocol may be enacted. A protocol can be verifiably enacted when its participants can determine each other's compliance. We first show the negative result that even when protocols can be verifiably enacted in respective social contexts, their composition cannot be verifiably enacted in the composition of those social contexts. We next show how to expand such a protocol so that it can be verifiably enacted. Our approach involves design rules to specify composite protocols so they would be verifiably enactable. Our approach demonstrates a use of dialectical commitments, which have previously been overlooked in the protocols literature.

/pdf/composing-and-verifying-commitment-based-multiagent-4emi1fstay.pdf

Composing and verifying commitment-based multiagent protocols

Know-how is an important concept in Artificial Intelligence. It has been argued previously that it cannot be successfully reduced to the knowledge of facts. In this paper, I present sound and complete axiomatizations for two non-reductive and intuitively natural formal definitions of the knowhow of an agent situated in a complex environment. I also present some theorems giving useful properties of know-how, and discuss and resolve an interesting paradox (which is described within). This is done using a new operator in the spirit of Dynamic Logic that is introduced herein and whose semantics and proof-theory are given.

A logic of situated know-how

A (business) protocol describes, in high-level terms, a pattern of communication between two or more participants, specifically via the creation and manipulation of the commitments between them. In this manner, a protocol offers both flexibility and rigor: a participant may communicate in any way it chooses as long as it discharges all of its activated commitments. Protocols thus promise benefits in engineering cross-organizational business processes. However, software engineering using protocols presupposes a formalization of protocols and a notion of the refinement of one protocol by another. Refinement for protocols is both intuitively obvious (e.g., PayViaCheck is clearly a kind of Pay) and technically nontrivial (e.g., compared to Pay, PayViaCheck involves different participants exchanging different messages). This article formalizes protocols and their refinement. It develops Proton, an analysis tool for protocol specifications that overlays a model checker to compute whether one protocol refines another with respect to a stated mapping. Proton and its underlying theory are evaluated by formalizing several protocols from the literature and verifying all and only the expected refinements.

/pdf/formalizing-and-verifying-protocol-refinements-440gi27mau.pdf

Formalizing and verifying protocol refinements

Social circles can be valuable in online applications, but existing approaches don't readily support such grouping: they either require a user to manually tag connections or offer no more than broad-brush acquaintanceship between connections. Platys Social is a novel approach that learns users' social circles and prioritizes their connections by bringing together contextual information and user interactions. Platys Social runs incrementally, can execute on a resource-limited mobile device, and can potentially avoid storing users' private information on a remote site.

/pdf/platys-social-relating-shared-places-and-private-social-i1ne162ijn.pdf

Platys Social: Relating Shared Places and Private Social Circles

The interoperability of interacting components means that their expectations of each other remain in agreement. A commitment captures what one agent (its creditor) may expect from another agent (its debtor). Chopra and Singh (CS however, such states may never obtain in enactments of real systems.Our approach retains and enhances CS (2) prove that it coincides with alignment; and (3) provide the computations by which a system of agents provably progresses toward alignment assuming eventual delivery of messages.

/pdf/generalized-commitment-alignment-27dqpw328g.pdf

Munindar P. Singh

Papers

Composing and verifying commitment-based multiagent protocols

A logic of situated know-how

Formalizing and verifying protocol refinements

Platys Social: Relating Shared Places and Private Social Circles

Generalized Commitment Alignment