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

The Carnot Project at MCC is addressing the problem of logically unifying physically-distributed, enterprise-wide, heterogeneous information. Carnot will provide a user with the means to navigate information efficiently and transparently, to update that information consistently, and to write applications easily for large, heterogeneous, distributed information systems. A prototype has been implemented which provides services for (a) enterprise modeling and model integration to create an enterprise-wide view, (b) semantic expansion of queries on the view to queries on individual resources, and (c) inter-resource consistency management. This paper describes the Carnot approach to transaction processing in environments where heterogeneous, distributed, and autonomous systems are required to coordinate the update of the local information under their control. In this approach, subtransactions are represented as a set of tasks and a set of intertask dependencies that capture the semantics of a particular relaxed transaction model. A scheduler has been implemented which schedules the execution of these tasks in the Carnot environment so that all intertask dependencies are satisfied.

Task scheduling using intertask dependencies in Carnot

As the technology advances, we can expect the development of specialized agents to be used as standardized building blocks for information systems. Two trends lend credence to such a prediction. First, software systems in general are being constructed with larger components, such as ActiveX and JavaBeans, which are becoming closer to being agents themselves. They have more functionality than simple objects, respond to events autonomously, and, most importantly, respond to system builders at development time, as well as to events at runtime. Moreover, there is a move toward more cooperative information systems, in which the architecture itself plays an important role in the effectiveness of the system, as opposed to traditional software systems where effectiveness depends on the quality of the individual components. These architectures are generating a set of standardized agents. Architectures based on standardized agent types should be easier to develop, understand, and use. Perhaps most important of all, these architectures will make it easier for separately developed information systems to interoperate.

https://scholarcommons.sc.edu/cgi/viewcontent.cgi?article=1063&context=csce_facpub

All agents are not created equal

A method for maintaining data objects in memory introduces metrics for freshness and interestingness of the data object. A freshness estimate is defined as the length of time that the data contained within the data object is expected to remain correct from the date that the object was last known to be valid. The interestingness estimate is defined as the length of time that the data object is expected to retain its usefulness to the user from the time that the data object was last used. The freshness estimate and interestingness estimate are stored in the data object along with a reference date. The freshness estimate, interestingness estimate, and reference date are updated or confirmed each time the data object is accessed. A maintenance program is periodically invoked to determine whether the data objects are outdated by comparing the time estimates associated with each data object to that object's reference date. Objects found to be outdated are candidates for removal from the system.

Stored data object management and archive control

More than a dozen leading experts give their opinions on where the Internet is headed and where it will be in the next decade in terms of technology, policy, and applications. They cover topics ranging from the Internet of Things to climate change to the digital storage of the future.

Internet predictions [Guest editor's introduction]

Belief-Desire-Intention.- The Belief-Desire-Intention Model of Agency.- BDI Models and Systems: Reducing the Gap.- Information-Passing and Belief Revisionin Multi-agent Systems.- On the Relationship between BDI Logics and Standard Logics of Concurrency.- Intention Reconsideration Reconsidered.- Making SharedPlans More Concise and Easier to Reason About.- Theories.- Autonomous Norm Acceptance.- Moral Sentiments in Multi-agent Systems.- Social Structure in Artificial Agent Societies: Implications for Autonomous Problem-Solving Agents.- The Bases of Effective Coordination in Decentralized Multi-agent Systems.- A Model Checking Algorithm for Multi-agent Systems.- Compositional Verification of Multi-agent Systems in Temporal Multi-epistemic Logic.- Emergent Mental Attitudes in Layered Agents.- Architectures.- The Right Agent (Architecture) to Do the Right Thing.- Representing Abstract Agent Architectures.- HEIR - A Non-hierarchical Hybrid Architecture for Intelligent Robots.- A-Teams: An Agent Architecture for Optimization and Decision-Support.- Goal-Satisfaction in Large-Scale Agent Systems: A Transportation Example.- Task Decomposition and Dynamic Role Assignment for Real - Time Strategic Teamwork.- Languages.- Agent Languages and Their Relationship to Other Programming Paradigms.- A Survey of Agent-Oriented Methodologies.- The Agentis Agent InteractionModel.- Content-Based Routing as the Basis for Intra-Agent Communication.- Agent Communication Language: Towards a Semantics based on Success, Satisfaction, and Recursion.- Control Structures of Rule-Based Agent Languages.- A Reactive Approach for Solving Constraint Satisfaction Problems.- Increasing Resource Utilization and Task Performance by Agent Cloning.- An Index to Volumes 1-5 of the Intelligent Agents Series.- An Index to Volumes 1-5 of the Intelligent Agents Series.

Intelligent agents V : agent theories, architectures, and languages : 5th International Workshop, ATAL'98 : Paris, France, July 4-7, 1998 : proceedings

Munindar P. Singh

Papers

Task scheduling using intertask dependencies in Carnot

All agents are not created equal

Stored data object management and archive control

Internet predictions [Guest editor's introduction]

Intelligent agents V : agent theories, architectures, and languages : 5th International Workshop, ATAL'98 : Paris, France, July 4-7, 1998 : proceedings