This would allow teams to have an objective currency for trust transactions. These systems would allow another surface for autonomous Ali, A.S., Rana, O., and Walker, D.W. (2004): "WS-QoC: agents to integrate the social fabric with information Measuring Quality of Service Compliance," International gathered in virtual environments. Further, the system would Conference on Service Oriented Computing (ICSOC04), New increase illumination of dark networks engaged in illicit York, NY. covert activity. Participants would be assigned a score Allbeck, J., and Badler, N. (2002): "Toward Representing Agent similar to FICO scores; when an individual score falls Behaviors Modified by Personality and Emotion," Autonomous noticeably or falls below a threshold, further observation Agents and Multiagent Systems, Bologna, Italy.

Nexus Network Learner is an intelligent agent based simulation used to study Irregular Warfare (IW) in several major studies at the Department of Defense (DoD). Heterogeneous autonomous agents, each with their own separated inductive learning mechanism, have initial attributes and behaviors in proportion to demographic groups in the simulated population, and learn new behaviors as they serve culturally based goals. Nexus agents create a dynamic role-based network, and learn how to choose partners as well as what behaviors they should have with their network partners. As Nexus agents coevolve, nexus models the emergence of social institutions from individual behaviors, the fundamental social aggregation challenge. Nexus models the formation of learned vicious and virtuous cycles of behavior, some of which have higher average utility for the agents than others, and can be used to test the effects of interventions on the natural motivation-based system. An experiment is presented that uses Nexus to model the vicious cycle of corruption in an African country, from the first Irregular Warfare Analytical baseline at the Office of the Secretary of Defense (Messer 2009).

When market works and when it fails has been an issue long pursued by economists. While to an extreme extent the view, as characterized by the “invisible hand” or “market mechanism”, has been so dominant in economics education and public policy debates, it is generally acceptable that markets are not out there and have to designed properly so as to work (McMillan, 2004). The significance of designs has been further illustrated by experimental economics. As opposed to designs, what, however, has been drawn less attention is the role of traders, their characteristics and behavior. To one extreme, one may consider that a good design is so dominant that there leaves little room for individual traders to play a role. The literature inspired by the zero-intelligence agent (Gode and Sunder, 1993) provides a good background of this issue, and many later studies do cast doubt on the sufficiency of this minimal intelligence and propose different versions of additional intelligence.  

Forecasting the behavior of systems with multiple responses has been a challenging problem in the context of many applications such as collaborative filtering, financial markets, or bioinformatics, where responses may be, respectively, movie ratings, stock prices, or activity of genes within a cell. Statistical modeling techniques have been widely applied for learning multivariate time series either in the multiple linear regression setting [3] or with autoregressive models [19]. More recently, kernel-based regularized methods have been developed for multitask learning [7, 2]. These approaches share in common the use of the correlation structure between input variables to enhance prediction of every single output. Frequently, the correlation structure is assumed to be given or is estimated separately.

In many instances, information on engineering systems can be obtained through measurements, monitoring or direct observations of system performances and can be used to update the system reliability estimate. In structural reliability analysis, such information is expressed either by inequalities (e.g. for the observation that no defect is present) or by equalities (e.g. for quantitative measurements of system characteristics). When information Z is of the equality type, the a-priori probability of Z is zero and most structural reliability methods (SRM) are not directly applicable to the computation of the updated reliability. Hitherto, the computation of the reliability of engineering systems conditional on equality information was performed through first- and second order approximations. In this paper, it is shown how equality information can be transformed into inequality information, which enables reliability updating by solving a standard structural system reliability problem. This approach enables the use of any SRM, including those based on simulation, for reliability updating with equality information. It is demonstrated on three numerical examples, including an application to fatigue reliability.

Individuals and groups, within organisations, cooperate by producing, manipulating and organizing knowledge, and by building and refining new collective knowledge. Organisations increasingly see their intellectual capital as strategic resources that must be managed effectively to achieve competitive advantage. This capital consists of the knowledge held in the minds of its members, embodied in its procedures and decision making processes, and stored in its repositories. Subsequently, it should be useful for KM systems and Collaboration systems to integrate both kinds of capabilities into a single collaborative-and-knowledge based system to support joint efforts towards a goal [1]. Decision making is one of the critical processes where we need both knowledge management (that focuses on creation, storage, sharing and use of knowledge) and collaboration (that focuses on cooperation, communication, coordination and coproduction) to make that more effective and efficient. This paper aims to explicit step-by-step the multimodal decision making (MDM) process at three levels (individual, collective and hybrid) and is organized as follows; we start with a brief overview of the literature on collaborative knowledge management. In section three, we propose formal description of MDM process. Finally, section four presents our model of MDM process basing on the proposed formal description and UML-G profile.

This work is about diagrammatic languages, how they can be represented, and what they in turn can be used to represent. More specifically, it focuses on representations and applications of string diagrams. String diagrams are used to represent a collection of processes, depicted as "boxes" with multiple (typed) inputs and outputs, depicted as "wires". If we allow plugging input and output wires together, we can intuitively represent complex compositions of processes, formalised as morphisms in a monoidal category. [...] The first major contribution of this dissertation is the introduction of a discretised version of a string diagram called a string graph. String graphs form a partial adhesive category, so they can be manipulated using double-pushout graph rewriting. Furthermore, we show how string graphs modulo a rewrite system can be used to construct free symmetric traced and compact closed categories on a monoidal signature. The second contribution is in the application of graphical languages to quantum information theory. We use a mixture of diagrammatic and algebraic techniques to prove a new classification result for strongly complementary observables. [...] We also introduce a graphical language for multipartite entanglement and illustrate a simple graphical axiom that distinguishes the two maximally-entangled tripartite qubit states: GHZ and W. [...] The third contribution is a description of two software tools developed in part by the author to implement much of the theoretical content described here. The first tool is Quantomatic, a desktop application for building string graphs and graphical theories, as well as performing automated graph rewriting visually. The second is QuantoCoSy, which performs fully automated, model-driven theory creation using a procedure called conjecture synthesis.

We propose a tree regularization framework, which enables many tree models to perform feature selection efficiently. The key idea of the regularization framework is to penalize selecting a new feature for splitting when its gain (e.g. information gain) is similar to the features used in previous splits. The regularization framework is applied on random forest and boosted trees here, and can be easily applied to other tree models. Experimental studies show that the regularized trees can select high-quality feature subsets with regard to both strong and weak classifiers. Because tree models can naturally deal with categorical and numerical variables, missing values, different scales between variables, interactions and nonlinearities etc., the tree regularization framework provides an effective and efficient feature selection solution for many practical problems.

We propose a solution to the image deconvolution problem where the convolution kernel or point spread function (PSF) is assumed to be only partially known. Small perturbations generated from the model are exploited to produce a few principal components explaining the PSF uncertainty in a high dimensional space. Unlike recent developments on blind deconvolution of natural images, we assume the image is sparse in the pixel basis, a natural sparsity arising in magnetic resonance force microscopy (MRFM). Our approach adopts a Bayesian Metropolis-within-Gibbs sampling framework. The performance of our Bayesian semi-blind algorithm for sparse images is superior to previously proposed semi-blind algorithms such as the alternating minimization (AM) algorithm and blind algorithms developed for natural images. We illustrate our myopic algorithm on real MRFM tobacco virus data.

We propose a dynamic logic of lying, wherein a 'lie that phi' (where phi is a formula in the logic) is an action in the sense of dynamic modal logic, that is interpreted as a state transformer relative to the formula phi. The states that are being transformed are pointed Kripke models encoding the uncertainty of agents about their beliefs. Lies can be about factual propositions but also about modal formulas, such as the beliefs of other agents or the belief consequences of the lies of other agents. We distinguish (i) an outside observer who is lying to an agent that is modelled in the system, from (ii) one agent who is lying to another agent, and where both are modelled in the system. For either case, we further distinguish (iii) the agent who believes everything that it is told (even at the price of inconsistency), from (iv) the agent who only believes what it is told if that is consistent with its current beliefs, and from (v) the agent who believes everything that it is told by consistently revising its current beliefs. The logics have complete axiomatizations, which can most elegantly be shown by way of their embedding in what is known as action model logic or the extension of that logic to belief revision.