Towards an Informational Pragmatic Realism

I discuss the design of the method of entropic inference as a general framework for reasoning under conditions of uncertainty. The main contribution of this discussion is to emphasize the pragmatic elements in the derivation. More specifically: (1) Probability theory is designed as the uniquely natural tool for representing states of incomplete information. (2) An epistemic notion of information is defined in terms of its relation to the Bayesian beliefs of ideally rational agents. (3) The method of updating from a prior to a posterior probability distribution is designed through an eliminative induction process that singles out the logarithmic relative entropy as the unique tool for inference. The resulting framework includes as special cases both MaxEnt and Bayes’ rule. It therefore unifies entropic and Bayesian methods into a single general inference scheme. I find that similar pragmatic elements are an integral part of Putnam’s internal realism, of Floridi’s informational structural realism, and also of van Fraasen’s empiricist structuralism. I conclude with the conjecture that their valuable insights can be incorporated into a single coherent doctrine—an informational pragmatic realism.     

Parallelized egocentric fields for autonomous navigation

In this paper, we propose a general framework for local path-planning and steering that can be easily extended to perform high-level behaviors. Our framework is based on the concept of affordances: the possible ways an agent can interact with its environment. Each agent perceives the environment through a set of vector and scalar fields that are represented in the agent’s local space. This egocentric property allows us to efficiently compute a local space-time plan and has better parallel scalability than a global fields approach. We then use these perception fields to compute a fitness measure for every possible action, defined as an affordance field. The action that has the optimal value in the affordance field is the agent’s steering decision. We propose an extension to a linear space-time prediction model for dynamic collision avoidance and present our parallelization results on multicore systems. We analyze and evaluate our framework using a comprehensive suite of test cases provided in SteerBench and demonstrate autonomous virtual pedestrians that perform steering and path planning in unknown environments along with the emergence of high-level responses to never seen before situations.     

To var or not to var: how do C# developers use and misuse implicit and explicit typing?

When implicit typing with the “var” keyword was introduced into C#, it prompted contradictory opinions among developers. This paper starts by explaining the difference between implicit and explicit typing and then provides an overview of developers’ opinions and guidelines that are available online. This paper then reports on the results of a study that investigated how C# developers use and misuse implicit and explicit typing. This study involved analyzing the source code of 10 different open-source software projects including more than 16,500,000 lines of code and more than 930,000 variables. This study investigated to what extent developers use a form of typing that affects the readability of a variable’s type and the length of its declaration. It also investigated whether or not there is an adoption of a consistent set of guidelines in general and across each software project. A tool called “Code Analysis and Refactoring Engine for C#” (Care#) was developed and used to conduct the code analysis for this study.

     

一种无指导的隐式篇章关系推理方法研究

该文提出一种基于信息检索的无指导方法,用于推理隐式篇章片段之间的语义连接关系,如因果关系、转折关系等。该文基于Google搜索引擎,抽取在句子结构以及语义层面上均与原隐式片段相似的显式片段,通过分析和识别相关显式关系来间接推理隐式关系。主要包括以下三个模块 构建高质量查询关键词并抽取候选显式关系;结合三种隐式关系推理模型(相似度、置信度、关联度),综合考察查询关键词以及候选关系的质量;基于排序学习的方法,统计高质量候选关系中的类别分布以实现最终隐式关系的推理。该文采用Penn Discourse TreeBank 2.0篇章语料库,最终方法精确率达到54.3%,与有指导的方法相比,提高了约14.3%。     

A probabilistic inference model for recommender systems

Recommendation is an important application that is employed on the Web. In this paper, we propose a method for recommending items to a user by extending a probabilistic inference model in information retrieval. We regard the user’s preference as the query, an item as a document, and explicit and implicit factors as index terms. Additional information sources can be added to the probabilistic inference model, particularly belief networks. The proposed method also uses the belief network model to recommend items by combining expert information. Experimental results on real-world data sets show that the proposed method can improve recommendation effectiveness.     

Accurate Implicit–Explicit General Linear Methods with Inherent Runge–Kutta Stability

We investigate implicit–explicit (IMEX) general linear methods (GLMs) with inherent Runge–Kutta stability (IRKS) for differential systems with non-stiff and stiff processes. The construction of such formulas starts with implicit GLMs with IRKS which are A- and L-stable, and then we ‘remove’ implicitness in non-stiff terms by extrapolating unknown stage derivatives by stage derivatives which are already computed by the method. Then we search for IMEX schemes with large regions of absolute stability of the ‘explicit part’ of the method assuming that the ‘implicit part’ of the scheme is \(A(\alpha )\)-stable for some \(\alpha \in (0,\pi /2]\). Examples of highly stable IMEX GLMs are provided of order \(1\le p\le 4\). Numerical examples are also given which illustrate good performance of these schemes.     

Learning personal preferences on online newspaper articles from user behaviors

This paper discusses methods by which user preferences for WWW-based newspaper articles can be learned from user behaviors. Two modes of inference were compared in an experiment: one using explicit feedback and the other using implicit feedback. In the explicit feedback mode, the users score all articles according to their relevance. In the implicit feedback mode, the user reads articles by performing scrolling and enlarging operations, and the system infers from the operations how much the user was interested in each article. Our newspaper on the WWW, called ANATAGONOMY, has a learning engine and a scoring engine on the server. The system users read daily news articles by using a WWW browser in which there is an interaction agent that monitors the user behaviors. The learning engine on the server infers user preferences from the interaction agent, and the scoring engine scores new articles and creates personalized newspaper pages based on the extracted user profiles. In an experiment, the system was able to personalize the newspaper to some extent when using only implicit feedback when some parameters were properly set, but the personalization was not as precise as it was when explicit feedback was used. By mixing explicit feedback with implicit feedback, the system could personalize newspapers quickly and precisely without requiring too much effort on the part of the users. User preferences can also be used to construct information retrieval agents or even to create cyberspace communities of the users that have similar interests. We think that the proposed technique for learning user preferences greatly enhances the value of the WWW.     

W3-privacy: understanding what, when, and where inference channels in multi-camera surveillance video

Huge amounts of video are being recorded every day by surveillance systems. Since video is capable of recording and preserving an enormous amount of information which can be used in many applications, it is worth examining the degree of privacy loss that might occur due to public access to the recorded video. A fundamental requirement of privacy solutions is an understanding and analysis of the inference channels than can lead to a breach of privacy. Though inference channels and privacy risks are well studied in traditional data sharing applications (e.g., hospitals sharing patient records for data analysis), privacy assessments of video data have been limited to the direct identifiers such as people’s faces in the video. Other important inference channels such as location (Where), time (When), and activities (What) are generally overlooked. In this paper we propose a privacy loss model that highlights and incorporates identity leakage through multiple inference channels that exist in a video due to what, when, and where information. We model the identity leakage and the sensitive information separately and combine them to calculate the privacy loss. The proposed identity leakage model is able to consolidate the identity leakage through multiple events and multiple cameras. The experimental results are provided to demonstrate the proposed privacy analysis framework.     

Empirically building and evaluating a probabilistic model of user affect

We present a probabilistic model of user affect designed to allow an intelligent agent to recognise multiple user emotions during the interaction with an educational computer game. Our model is based on a probabilistic framework that deals with the high level of uncertainty involved in recognizing a variety of user emotions by combining in a Dynamic Bayesian Network information on both the causes and effects of emotional reactions. The part of the framework that reasons from causes to emotions (diagnostic model) implements a theoretical model of affect, the OCC model, which accounts for how emotions are caused by one’s appraisal of the current context in terms of one’s goals and preferences. The advantage of using the OCC model is that it provides an affective agent with explicit information not only on which emotions a user feels but also why, thus increasing the agent’s capability to effectively respond to the users’ emotions. The challenge is that building the model requires having mechanisms to assess user goals and how the environment fits them, a form of plan recognition. In this paper, we illustrate how we built the predictive part of the affective model by combining general theories with empirical studies to adapt the theories to our target application domain. We then present results on the model’s accuracy, showing that the model achieves good accuracy on several of the target emotions. We also discuss the model’s limitations, to open the ground for the next stage of the work, i.e., complementing the model with diagnostic information.

Cluster-group based trusted computing for mobile social networks using implicit social behavioral graph

Mobile Social Networks (MSNs) facilitate connections between mobile devices, and are capable of providing an effective mobile computing environment for users to access, share, and distribute information. However, MSNs are virtual social spaces, the available information may not be trustworthy to all. Therefore, trust inference plays a critical role for establishing social links between mobile users. In MSNs, users’ transactions will more and more be complemented with group contact. Hence, future usage patterns of mobile devices will involve more group contacts. In this paper, we describe the implicit social behavioral graph, i.e., ego-i graph which is formed by users’ contacts, and present an algorithm for initiating ego-i graph. We rate these relationships to form a dynamic contact rank, which enables users to evaluate the trust values between users within the context of MSNs. We, then, calculate group-based trust values according to the level of contacts, interaction evolution, and users’ attributes. Based on group-based trust, we obtain a cluster trust by the aggregation of inter group-based trust values. Due to the unique nature of MSNs, we discuss the propagation of cluster trust values for global MSNs. Finally, we evaluate the performance of our trust model through simulations, and the results demonstrate the effectiveness of group-based behavioural relationships in MSNs’ information sharing system.     

Law-abiding and integrity on the Internet: A case for agents

Software agents extend the current, information-based Internet to include autonomous mobile processing. In most countries such processes, i.e., software agents are, however, without an explicit legal status. Many of the legal implications of their actions (e.g., gathering information, negotiating terms, performing transactions) are not well understood. One important characteristic of mobile software agents is that they roam the Internet: they often run on agent platforms of others. There often is no pre-existing relation between the “owner” of a running agent’s process and the owner of the agent platform on which an agent process runs. When conflicts arise, the position of the agent platform administrator is not clear: is he or she allowed to slow down the process or possibly remove it from the system? Can the interests of the user of the agent be protected? This article explores legal and technical perspectives in protecting the integrity and availability of software agents and agent platforms.     

Epistemic logic and logical omniscience: A survey

This survey brings together a collection of epistemic logics and discusses their approaches in alleviating the logical omniscience problem. Of particular note is the logic of implicit and explicit belief. Explicit belief refers to information actively held by an agent, while implicit belief refers to the logical consequence of explicit belief. Ramifications of Levesque's logic include nonstandard epistemic logic and the logics of awareness and local reasoning. Models of nonstandard epistemic logic are defined with respect to nonstandard proportional logic to weaken its semantics. In the logic of awareness, an agent can only believe a concept that it is aware of. Closely related to awareness are S-1 and S-3 epistemic operators which can be used to model skeptical and credulous agents. The logic of local reasoning provides a semantics for representing the fact that agents can have different clusters of beliefs which may contradict each other. Other variations include epistemic structures which are generalizations of the logic of local reasoning and fusion epistemic models which provide an account that agents can combine information conjunctively or disjunctively. Another closely related approach is the logic of explicit propostions which captures the insight that agents can hold beliefs independently without putting them together. © 1997 John Wiley & Sons, Inc.     

Measuring incompatibility between Atanassov’s intuitionistic fuzzy sets

The aim of this paper is to establish an axiomatic definition of incompatibility measure in the framework of Atanassov’s intuitionistic fuzzy sets and use geometrical methods to build some families of such incompatibility measures. First, we construct several functions to measure incompatibility for an intuitionistic t-norm that can be represented by an adequate t-norm and t-conorm. Additionally, we establish some relations between some particular cases of these functions. Similarly, we then obtain incompatibility measures for a family of non-representable intuitionistic t-norms.     

Belief, information acquisition, and trust in multi-agent systems—A modal logic formulation

In this paper, we consider the influence of trust on the assimilation of acquired information into an agent's belief. By use of modal logic, we semantically and axiomatically characterize the relationship among belief, information acquisition and trust. The belief and information acquisition operators are respectively represented by KD45 and KD normal modalities, whereas trust is denoted by a modal operator with minimal semantics. One characteristic axiom of the basic system is if agent i believes that agent j has told him the truth of p and he trusts the judgement of j on p, then he will also believe p. In addition to the basic system, some variants and further axioms for trust and information acquisition are also presented to show the expressive richness of the logic. The applications of the logic to computer security and database reasoning are also suggested by its connection with some previous works.     

A hybrid online-product recommendation system: Combining implicit rating-based collaborative filtering and sequential pattern analysis

Many online shopping malls in which explicit rating information is not available still have difficulty in providing recommendation services using collaborative filtering (CF) techniques for their users. Applying temporal purchase patterns derived from sequential pattern analysis (SPA) for recommendation services also often makes users unhappy with the inaccurate and biased results obtained by not considering individual preferences. The objective of this research is twofold. One is to derive implicit ratings so that CF can be applied to online transaction data even when no explicit rating information is available, and the other is to integrate CF and SPA for improving recommendation quality. Based on the results of several experiments that we conducted to compare the performance between ours and others, we contend that implicit rating can successfully replace explicit rating in CF and that the hybrid approach of CF and SPA is better than the individual ones.     

Finite-sample investigation of likelihood and Bayes inference for the symmetric von Mises-Fisher distribution

We consider likelihood and Bayes analyses for the symmetric matrix von Mises-Fisher (matrix Fisher) distribution, which is a common model for three-dimensional orientations (represented by 3×3 orthogonal matrices with a positive determinant). One important characteristic of this model is a 3×3 rotation matrix representing the modal rotation, and an important challenge is to establish accurate confidence regions for it with an interpretable geometry for practical implementation. While we provide some extensions of one-sample likelihood theory (e.g., Euler angle parametrizations of modal rotation), our main contribution is the development of MCMC-based Bayes inference through non-informative priors. In one-sample problems, the Bayes methods allow the construction of inference regions with transparent geometry and accurate frequentist coverages in a way that standard likelihood inference cannot. Simulation is used to evaluate the performance of Bayes and likelihood inference regions. Furthermore, we illustrate how the Bayes framework extends inference from one-sample problems to more complicated one-way random effects models based on the symmetric matrix Fisher model in a computationally straightforward manner. The inference methods are then applied to a human kinematics example for illustration.     

Extracting relevance and affect information from physiological text annotation

We present physiological text annotation, which refers to the practice of associating physiological responses to text content in order to infer characteristics of the user information needs and affective responses. Text annotation is a laborious task, and implicit feedback has been studied as a way to collect annotations without requiring any explicit action from the user. Previous work has explored behavioral signals, such as clicks or dwell time to automatically infer annotations, and physiological signals have mostly been explored for image or video content. We report on two experiments in which physiological text annotation is studied first to (1) indicate perceived relevance and then to (2) indicate affective responses of the users. The first experiment tackles the user’s perception of relevance of an information item, which is fundamental towards revealing the user’s information needs. The second experiment is then aimed at revealing the user’s affective responses towards a -relevant- text document. Results show that physiological user signals are associated with relevance and affect. In particular, electrodermal activity was found to be different when users read relevant content than when they read irrelevant content and was found to be lower when reading texts with negative emotional content than when reading texts with neutral content. Together, the experiments show that physiological text annotation can provide valuable implicit inputs for personalized systems. We discuss how our findings help design personalized systems that can annotate digital content using human physiology without the need for any explicit user interaction.     

Communication between agents with heterogeneous perceptual capabilities

In real world applications robots and software agents often have to be equipped with higher level cognitive functions that enable them to reason, act and perceive in changing, incompletely known and unpredictable environments. One of the major tasks in such circumstances is to fuse information from various data sources. There are many levels of information fusion, ranging from the fusing of low level sensor signals to the fusing of high level, complex knowledge structures. In a dynamically changing environment even a single agent may have varying abilities to perceive its environment which are dependent on particular conditions. The situation becomes even more complex when different agents have different perceptual capabilities and need to communicate with each other.In this paper, we propose a framework that provides agents with the ability to fuse both low and high level approximate knowledge in the context of dynamically changing environments while taking account of heterogeneous and contextually limited perceptual capabilities.To model limitations on an agent’s perceptual capabilities we introduce the idea of partial tolerance spaces. We assume that each agent has one or more approximate databases where approximate relations are represented using lower and upper approximations on sets. Approximate relations are generalizations of rough sets.It is shown how sensory and other limitations can be taken into account when constructing and querying approximate databases for each respective agent. Complex relations inherit the approximativeness of primitive relations used in their definitions. Agents then query these databases and receive answers through the filters of their perceptual limitations as represented by (partial) tolerance spaces and approximate queries. The techniques used are all tractable.