Modal Tableaux for Verifying Security Protocols

To develop theories to specify and reason about various aspects of multi-agent systems, many researchers have proposed the use of modal logics such as belief logics, logics of knowledge, and logics of norms. As multi-agent systems operate in dynamic environments, there is also a need to model the evolution of multi-agent systems through time. In order to introduce a temporal dimension to a belief logic, we combine it with a linear-time temporal logic using a powerful technique called fibring for combining logics. We describe a labelled modal tableaux system for a fibred belief logic (FL) which can be used to automatically verify correctness of inter-agent stream authentication protocols. With the resulting fibred belief logic and its associated modal tableaux, one is able to build theories of trust for the description of, and reasoning about, multi-agent systems operating in dynamic environments

Modal tableaux for verifying stream authentication protocols

To develop theories to specify and reason about various aspects of multi-agent systems, many researchers have proposed the use of modal logics such as belief logics, logics of knowledge, and logics of norms. As multi-agent systems operate in dynamic environments, there is also a need to model the evolution of multi-agent systems through time. In order to introduce a temporal dimension to a belief logic, we combine it with a linear-time temporal logic using a powerful technique called fibring for combining logics. We describe a labelled modal tableaux system for the resulting fibred belief logic (FL) which can be used to automatically verify correctness of inter-agent stream authentication protocols. With the resulting fibred belief logic and its associated modal tableaux, one is able to build theories of trust for the description of, and reasoning about, multi-agent systems operating in dynamic environments

UniMOS: A Universal Framework For Multi-Organ Segmentation Over Label-Constrained Datasets

Machine learning models for medical images can help physicians diagnose and manage diseases. However, due to the fact that medical image annotation requires a great deal of manpower and expertise, as well as the fact that clinical departments perform image annotation based on task orientation, there is the problem of having fewer medical image annotation data with more unlabeled data and having many datasets that annotate only a single organ. In this paper, we present UniMOS, the first universal framework for achieving the utilization of fully and partially labeled images as well as unlabeled images. Specifically, we construct a Multi-Organ Segmentation (MOS) module over fully/partially labeled data as the basenet and designed a new target adaptive loss. Furthermore, we incorporate a semi-supervised training module that combines consistent regularization and pseudolabeling techniques on unlabeled data, which significantly improves the segmentation of unlabeled data. Experiments show that the framework exhibits excellent performance in several medical image segmentation tasks compared to other advanced methods, and also significantly improves data utilization and reduces annotation cost. Code and models are available at: https://github.com/lw8807001/UniMOS.Comment: Accepted by BIBM202

Fundamental Issues in Mobile Healthcare Information Systems

Fundamental Issues in Mobile Healthcare Information System

Finding the optimal social trust path for the selection of trustworthy service providers in complex social networks

Online Social networks have provided the infrastructure for a number of emerging applications in recent years, e.g., for the recommendation of service providers or the recommendation of files as services. In these applications, trust is one of the most important factors in decision making by a service consumer, requiring the evaluation of the trustworthiness of a service provider along the social trust paths from a service consumer to the service provider. However, there are usually many social trust paths between two participants who are unknown to one another. In addition, some social information, such as social relationships between participants and the recommendation roles of participants, has significant influence on trust evaluation but has been neglected in existing studies of online social networks. Furthermore, it is a challenging problem to search the optimal social trust path that can yield the most trustworthy evaluation result and satisfy a service consumer's trust evaluation criteria based on social information. In this paper, we first present a novel complex social network structure incorporating trust, social relationships and recommendation roles, and introduce a new concept, Quality of Trust (QoT), containing the above social information as attributes. We then model the optimal social trust path selection problem with multiple end-to-end QoT constraints as a Multiconstrained Optimal Path (MCOP) selection problem, which is shown to be NP-Complete. To deal with this challenging problem, we propose a novel Multiple Foreseen Path-Based Heuristic algorithm MFPB-HOSTP for the Optimal Social Trust Path selection, where multiple backward local social trust paths (BLPs) are identified and concatenated with one Forward Local Path (FLP), forming multiple foreseen paths. Our strategy could not only help avoid failed feasibility estimation in path selection in certain cases, but also increase the chances of delivering a near-optimal solution with high quality. The results of our experiments conducted on a real data set of online social networks illustrate that MFPB-HOSTP algorithm can efficiently identify the social trust paths with better quality than our previously proposed H-OSTP algorithm that outperforms prior algorithms for the MCOP selection problem.16 page(s

A heuristic algorithm for trust-oriented service provider selection in complex social networks

In a service-oriented online social network consisting of service providers and consumers, a service consumer can search trustworthy service providers via the social network. This requires the evaluation of the trustworthiness of a service provider along a certain social trust path from the service consumer to the service provider. However, there are usually many social trust paths between participants in social networks. Thus, a challenging problem is which social trust path is the optimal one that can yield the most trustworthy evaluation result In this paper, we first present a novel complex social network structure and a new concept, Quality of Trust (QoT). We then model the optimal social trust path selection with multiple end-to-end QoT constraints as a Multi-Constrained Optimal Path (MCOP) selection problem which is NP-Complete. For solving this challenging problem, we propose an efficient heuristic algorithm, H_OSTP. The results of our experiments conducted on a large real dataset of online social networks illustrate that our proposed algorithm significantly outperforms existing approaches.8 page(s

A critical analysis of mobility management related issues of wireless sensor networks in cyber physical systems

Mobility management has been a long-standing issue in mobile wireless sensor networks and especially in the context of cyber physical systems; its implications are immense. This paper presents a critical analysis of the current approaches to mobility management by evaluating them against a set of criteria which are essentially inherent characteristics of such systems on which these approaches are expected to provide acceptable performance. We summarize these characteristics by using a quadruple set of metrics. Additionally, using this set we classify the various approaches to mobility management that are discussed in this paper. Finally, the paper concludes by reviewing the main findings and providing suggestions that will be helpful to guide future research efforts in the area

Fast and simple high-capacity quantum cryptography with error detection

Quantum cryptography is commonly used to generate fresh secure keys with quantum signal transmission for instant use between two parties. However, research shows that the relatively low key generation rate hinders its practical use where a symmetric cryptography component consumes the shared key. That is, the security of the symmetric cryptography demands frequent rate of key updates, which leads to a higher consumption of the internal one-time-pad communication bandwidth, since it requires the length of the key to be as long as that of the secret. In order to alleviate these issues, we develop a matrix algorithm for fast and simple high-capacity quantum cryptography. Our scheme can achieve secure private communication with fresh keys generated from Fibonacci- and Lucas- valued orbital angular momentum (OAM) states for the seed to construct recursive Fibonacci and Lucas matrices. Moreover, the proposed matrix algorithm for quantum cryptography can ultimately be simplified to matrix multiplication, which is implemented and optimized in modern computers. Most importantly, considerably information capacity can be improved effectively and efficiently by the recursive property of Fibonacci and Lucas matrices, thereby avoiding the restriction of physical conditions, such as the communication bandwidth

Querying historical data over multiple time-lines

In a temporal database, time-varying relations may be defined over multiple time-lines with varying rates of sampling and/or progress, for instance, multiple time series. There is a need to represent such data in a temporal model and provide query languages. In this paper, we propose a clocked temporal relational algebra, called R, which supports temporal relations based on multiple time-lines. In the underlying model, temporal relations (historical data) are defined over clocks which are subsequences of an assumed global time-line. The algebra is uniform, it is a consistent extension of the relational algebra, and it includes a number of temporal operators to combine data based on different time-lines, as well as extensions of the operators of the relational algebra. The semantics of an operation of R depends on the clocks of the relations involved in the operation as well as the relations. We outline a formal interpretation of expressions of R, which also represent clocked relations, and sketch a naïve expression evaluation method.27 page(s

Intelligent agents and P2P Semantic Web

The semantic Web aims to address the limitations of the World Wide Web by providing content that can be interpreted by both humans and machines, thus enabling intelligent agents acting on behalf of humans and/or other agents to discover and reason with the available information in Berners-Lee, J. (2001). While there has been tremendous progress on the infrastructure development for the Semantic Web, it has been observed that comparable progress in the use of the agent technology is still lacking by Hendler, J. (2007). In the mean time, Peer-to-Peer (P2P) networks have been very successful by making available and redistributing huge amounts of data among millions of networked computers. This naturally leads to the concept of a distributed Semantic Web archive integrated with the existing Semantic Web that resides on a P2P network of user nodes (hence so-called P2P Semantic Web).1 page(s