Policy-based Awareness Management (PAM): Case study of a wireless communication system at a hospital

The present paper evaluates the use of software agents to identify relevance of information, called awareness. This evaluation is based on existing policies and scenarios in the context of wireless communication of a hospital in Norway. The study is to address the lack of literature for experimental studies on a method to employ software agents for awareness identification. Research in computer supported cooperative work indicates the significant contributions of software agents to assist individuals. There are bodies of work that show awareness provides the means for software agents in which effective cooperation can take place. In addition, the role of the methods to identify awareness is emphasized in the literature of both computer supported cooperative work and software agents. This paper explains a step-wise process, called Policy-based Awareness Management, which allows agents to use policies as a source to identify awareness and thus change their behaviors accordingly. The contribution of this method is based on the concepts proposed by the logic of general awareness. The present study applies Directory Enabled Networks-next generation as the policy structure for the method. The paper evaluates the process via its application to identify the relevance of information in wireless communication scenarios in a hospital. The present study conducts observations, interviews and discussions on the wireless communication system of the hospital to identify the different scenarios happening in the system. The paper presents a set of simulations on these scenarios and concludes that the method is effective and cost-efficient.     

Reliable representations for association rules

Association rule mining has contributed to many advances in the area of knowledge discovery. However, the quality of the discovered association rules is a big concern and has drawn more and more attention recently. One problem with the quality of the discovered association rules is the huge size of the extracted rule set. Often for a dataset, a huge number of rules can be extracted, but many of them can be redundant to other rules and thus useless in practice. Mining non-redundant rules is a promising approach to solve this problem. In this paper, we first propose a definition for redundancy, then propose a concise representation, called a Reliable basis, for representing non-redundant association rules. The Reliable basis contains a set of non-redundant rules which are derived using frequent closed itemsets and their generators instead of using frequent itemsets that are usually used by traditional association rule mining approaches. An important contribution of this paper is that we propose to use the certainty factor as the criterion to measure the strength of the discovered association rules. Using this criterion, we can ensure the elimination of as many redundant rules as possible without reducing the inference capacity of the remaining extracted non-redundant rules. We prove that the redundancy elimination, based on the proposed Reliable basis, does not reduce the strength of belief in the extracted rules. We also prove that all association rules, their supports and confidences, can be retrieved from the Reliable basis without accessing the dataset. Therefore the Reliable basis is a lossless representation of association rules. Experimental results show that the proposed Reliable basis can significantly reduce the number of extracted rules. We also conduct experiments on the application of association rules to the area of product recommendation. The experimental results show that the non-redundant association rules extracted using the proposed method retain the same inference capacity as the entire rule set. This result indicates that using non-redundant rules only is sufficient to solve real problems needless using the entire rule set.     

Automatic selection of arterial input function on dynamic contrast-enhanced MR images

Dynamic susceptibility contrast-magnetic resonance imaging (DSC-MRI) data analysis requires the knowledge of the arterial input function (AIF) to quantify the cerebral blood flow (CBF), volume (CBV) and the mean transit time (MTT). AIF can be obtained either manually or using automatic algorithms. We present a method to derive the AIF on the middle cerebral artery (MCA). The algorithm draws a region of interest (ROI) where the MCA is located. Then, it uses a recursive cluster analysis on the ROI to select the arterial voxels. The algorithm had been compared on simulated data to literature state of art automatic algorithms and on clinical data to the manual procedure. On in silico data, our method allows to reconstruct the true AIF and it is less affected by partial volume effect bias than the other methods. In clinical data, automatic AIF provides CBF and MTT maps with a greater contrast level compared to manual AIF ones. Therefore, AIF obtained with the proposed method improves the estimate reliability and provides a quantitatively reliable physiological picture.     

一个新的基于Merkle树的移动代理路由解决方案

移动代理是一种软件程序,被认为在未来的电子商务中将起到很重要的作用。但安全问题一直是移动代理得到实际应用的一个很大障碍。对已有的移动代理路由协议进行了分析讨论,在此基础上,利用一种特殊单向函数,结合Merkle树结构,构造了一个新的基于Merkle树的移动代理路由解决方案。该方案不仅具有更好的使用安全性和便利性,而且具有更低的计算复杂度。     

Designing Agent-Based Electronic Employment Markets

Two modes of matching people with jobs prevail at present: 1) hierarchical planning and 2) distributed markets. Each has strengths and limitations, but few systems have been designed to take advantage of strengths corresponding to both. With evolving information technology, however, the job-matching process could be accomplished far more equitably and efficiently using web-based markets within the firm, and intelligent agents offer excellent potential to help both potential employees and employers find one another in a distributed, electronic marketplace. But realizing this potential goes well beyond simply changing the rules of internal job matching or making agent technology available to job searchers. Rather, the corresponding markets and technologies must be designed, together, to mutually accomplish the desired results (e.g., efficient and effective matching) and conform to necessary properties (e.g., market clearing). Through the research described in this paper, we draw from Game Theory results to assess the feasibility of using two-sided matching algorithms to address this market-design problem. We also draw from current agent research to address the information technology dimension of the problem by implementing a proof-of-concept multi-agent system to enact, automate and support the corresponding market solution. This paper integrates the key economic and technological elements required to design robust electronic employment markets. And the corresponding research provides new knowledge and insight into co-development of the requisite economic markets and agent technologies.     

Building Agile Systems with Mobile Code

Mobile code has been championed as a solution to a plethora of software problems. This paper describes investigative work undertaken in order to evaluate the mobile code abstractions of Mobile Agents and Mobile Objects, and to understand the implications of using these abstractions to build distributed systems.We describe two systems built to support the Sales Order Process of a distributed manufacturing enterprise, using IBM's Aglets Software Development Kit. The Sales Order Process model and the requirements for agility used as the basis for these implementations are derived from data collected in an industrial case study.Both systems are evaluated using the Goal/Question/Metric methodology. Two new metrics for Semantic Alignment and Change Capability are presented and used to evaluate each system with respect to the degree of system agility supported. The systems are evaluated through a set of scenarios generated during the case study in an attempt to see if they support system integration and agility in the manufacturing domain. Further we examine the implications of using a mobile code abstraction when compared with the abstraction offered by traditional distribution technology.The work described provides evidence that both Mobile Agent and Mobile Object systems have inherent properties that can be used to build agile distributed systems. Further, Mobile Agents with their additional autonomy provide marginally greater support.     

Decision-Centric Information Monitoring

We are interested in information management for decision support applications, especially those that monitor distributed, heterogeneous databases to assess time-critical decisions. Users of such applications can easily be overwhelmed with data that may change rapidly, may conflict, and may be redundant. Developers are faced with a dilemma: either filter out most information and risk excluding critical items, or gather possibly irrelevant or redundant information, and overwhelm the decision maker. This paper describes a solution to this dilemma called decision-centric information monitoring (DCIM). First, we observe that decision support systems should monitor only information that can potentially change some decision. We present an architecture for DCIM that meets the requirements implied by this observation. We describe techniques for identifying the highest value information to monitor and techniques for monitoring that information despite autonomy, distribution, and heterogeneity of data sources. Finally, we present lessons learned from building LOOKOUT, which is to our knowledge the first implementation of a top-to-bottom system performing decision-centric information monitoring.     

A hierarchical, agent-based service oriented architecture for smart environments

Service Oriented Architectures, which allow for the integration of different subsystems and of applications running on different devices and platforms, may be very suitable to solve the problem of service personalization in large smart environments like cities, where the number of potential users and potentially available services is rapidly growing. Taking this into account, we have designed an agent-based service oriented architecture for smart spaces. Two of the greatest challenges in the design of such a solution are providing effective device, service and context federation and composition mechanisms and handling user mobility. For the first challenge, we have designed a hierarchical architecture and developed a set of inheritance, aggregation and access mechanisms for devices, services and context. To handle user mobility, we have followed three different strategies, using stationary, mobile or nomadic agents. In this paper, we describe the main aspects of our architecture and perform an experimental evaluation to determine the advantages and drawbacks of the different strategies.