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

物件導向軟體之架構(Object-Oriented Software Construction)探討

An Introduction to MultiAgent Systems.

Home PURPOSE OF THE CENTER: To develop the center to address state-of-the-art research, create innovating educational programs, and support technology transfers using commercially viable results to assist the Army Research Laboratory to develop the next generation Future Combat System in the telecommunications sector that assures prevention of perceived threats, and Non Line of Sight/Beyond Line of Sight lethal support.

How to… home page

Inductive Logic Programming (ILP) is a new discipline which investigates the inductive construction of first-order clausal theories from examples and background knowledge. We survey the most important theories and methods of this new field. First, various problem specifications of ILP are formalized in semantic settings for ILP, yielding a “model-theory” for ILP. Second, a generic ILP algorithm is presented. Third, the inference rules and corresponding operators used in ILP are presented, resulting in a “proof-theory” for ILP. Fourth, since inductive inference does not produce statements which are assured to follow from what is given, inductive inferences require an alternative form of justification. This can take the form of either probabilistic support or logical constraints on the hypothesis language. Information compression techniques used within ILP are presented within a unifying Bayesian approach to confirmation and corroboration of hypotheses. Also, different ways to constrain the hypothesis language or specify the declarative bias are presented. Fifth, some advanced topics in ILP are addressed. These include aspects of computational learning theory as applied to ILP, and the issue of predicate invention. Finally, we survey some applications and implementations of ILP. ILP applications fall under two different categories: first, scientific discovery and knowledge acquisition, and second, programming assistants.

Inductive Logic Programming : Theory and Methods

Global choreographies define the rules that peers should respect in their interaction, with the aim of guaranteeing interoperability An abstract choreography can be seen as a protocol specification; it does not refer to specific peers and, especially in an open application domain, it might be necessary to retrieve a set of web services that fit in it A crucial issue, that is raising attention, is verifying whether the business process of some peers, in particular the parts that encode the communicative behavior, will produce interactions which are conformant to the agreed protocol (legality issue) Such issue is tackled by the so called conformance test, which is a means for certifying the capability of interacting of the involved parts: two peers that are proved conformant to a same protocol will actually interoperate by producing a legal conversation This work proposes an approach to the verification of a priori conformance of a business process to a protocol, which is based on the theory of formal languages and guarantees the interoperability of peers that are individually proved conformant

/pdf/verifying-the-conformance-of-web-services-to-global-41y3k5buip.pdf

Verifying the conformance of web services to global interaction protocols: a first step

Affective computing is receiving increasing attention in many sectors, ranging from advertisement to politics. This work, set in a Social Semantic Web framework, presents ArsEmotica, an application software for associating the predominant emotions to artistic resources of a social tagging platform. Our aim is to extract a rich emotional semantics (i.e. not limited to a positive or a negative reception) of tagged resources through an ontology driven approach. This is done by exploiting and combining available computational and sentiment lexicons with an ontology of emotional categories. The information sources we rely upon are the tags by which users annotated resources, that are available through the ArsMeteo platform, and the ontology OntoEmotion, that was enriched by means of our tool with over four hundred Italian emotional words referring to the about eighty-five emotional concepts of the ontology. Tags directly referring to ontological concepts are identified, while potentially affective tags, can be annotated by using the ontology thanks to the spontaneous intervention of the user, in a pure Web 2.0 approach. Finally, the tagged artworks are related with the emerging predominant emotions. Matteo Baldoni Dipartimento di Informatica, Universita degli Studi di Torino e-mail: baldoni@di.unito.it Cristina Baroglio Dipartimento di Informatica, Universita degli Studi di Torino e-mail: baroglio@di.unito.it Viviana Patti Dipartimento di Informatica, Universita degli Studi di Torino e-mail: patti@di.unito.it Paolo Rena Dipartimento di Informatica, Universita degli Studi di Torino e-mail: paolo.rena@gmail.com

/pdf/from-tags-to-emotions-ontology-driven-sentiment-analysis-in-1vnr4311wt.pdf

From tags to emotions: Ontology-driven sentiment analysis in the social semantic web

From Tags to Emotions: Ontology-driven Sentimental Analysis in the Social Semantic Web.

Commitments provide a flexible means for specifying the business relationships among autonomous and heterogeneous agents, and lead to a natural way of enacting such relationships However, current formalizations of commitments incorporate conditions expressed as propositions, but disregard (1) temporal regulations and (2) an agent's control over such regulations Thus, they cannot handle realistic application scenarios where time and control are often central because of domain conventions or other requirementsWe propose a new formalization of commitments that builds on an existing representation of events in which we can naturally express temporal regulations as well as what an agent can control, including indirectly as based on the commitments and capabilities of other agents Our formalization supports a notion of commitment safety A benefit of our consolidated approach is that by incorporating these considerations into commitments we enable agents to reason about and flexibly enact the regulationsThe main contributions of this paper include (1) a formal semantics of commitments that accommodates temporal regulations; (2) a formal semantics of the notions of innate and social control; and (3) a formalization of when a temporal commitment is safe for its debtor We evaluate our contributions using an extensive case study

/pdf/commitments-with-regulations-reasoning-about-safety-and-25lbx6u7fg.pdf

Commitments with regulations: reasoning about safety and control in REGULA

Ever since the seminal work of Searle, two components of interaction protocols have been identified: constitutive rules, defining the meaning of actions and regulative rules, defining the flow of execution, ie the behavior the agent should show The two parts together define the meaning of the interaction Commitment-based protocols, however, usually do not account for the latter and, when they do it, they do not adopt a decoupled representation of the two parts A clear distinction in the two representations would, however, bring many advantages, mainly residing in a greater openess of multi-agent systems, an easier re-use of protocols and of action definitions, and a finer specification of protocol properties In this work we introduce the notion of behavior-oriented commitment-based protocols, which account both for the constitutive and the regulative specifications and that explicitly foresee a representation of the latter based on constraints among commitments A language, named 2CL, for writing regulative specifications is also given

/pdf/behavior-oriented-commitment-based-protocols-4elj9ifl8y.pdf

Cristina Baroglio

Papers

Verifying the conformance of web services to global interaction protocols: a first step

From tags to emotions: Ontology-driven sentiment analysis in the social semantic web

From Tags to Emotions: Ontology-driven Sentimental Analysis in the Social Semantic Web.

Commitments with regulations: reasoning about safety and control in REGULA

Behavior-Oriented Commitment-based Protocols