Cloud Services Brokerage for Mobile Ubiquitous Computing

Recently, companies are adopting Mobile Cloud Computing (MCC) to efficiently deliver enterprise services to users (or consumers) on their personalized devices. MCC is the facilitation of mobile devices (e.g., smartphones, tablets, notebooks, and smart watches) to access virtualized services such as software applications, servers, storage, and network services over the Internet. With the advancement and diversity of the mobile landscape, there has been a growing trend in consumer attitude where a single user owns multiple mobile devices. This paradigm of supporting a single user or consumer to access multiple services from n-devices is referred to as the Ubiquitous Cloud Computing (UCC) or the Personal Cloud Computing. In the UCC era, consumers expect to have application and data consistency across their multiple devices and in real time. However, this expectation can be hindered by the intermittent loss of connectivity in wireless networks, user mobility, and peak load demands. Hence, this dissertation presents an architectural framework called, Cloud Services Brokerage for Mobile Ubiquitous Cloud Computing (CSB-UCC), which ensures soft real-time and reliable services consumption on multiple devices of users. The CSB-UCC acts as an application middleware broker that connects the n-devices of users to the multi-cloud services. The designed system determines the multi-cloud services based on the user's subscriptions and the n-devices are determined through device registration on the broker. The preliminary evaluations of the designed system shows that the following are achieved: 1) high scalability through the adoption of a distributed architecture of the brokerage service, 2) providing soft real-time application synchronization for consistent user experience through an enhanced mobile-to-cloud proximity-based access technique, 3) reliable error recovery from system failure through transactional services re-assignment to active nodes, and 4) transparent audit trail through access-level and context-centric provenance

A Knowledge Base with Dependencies

人工智能以知识为基础,然而知识往往是可错的.当知识被发现是错误时,就要撤销该错误知识及依赖于该错误知识的知识.基于对fOrgET机制、TMS和ATMS的改进,提出一种新的知识表示方法,即带有依赖关系的知识库.基于命题逻辑程序,给出带有依赖关系的知识库的示例,同时还给出1个规则加入算法和2个规则撤销算法.第2个规则撤销算法可以处理循环依赖关系.带有依赖关系的知识库,是一种全新结构的知识库,在知识表示、信念修正和辩论推理中具有应用的前景.Knowledge plays an important role in artificial intelligence,but there is the possibility that knowledge turns out to be erroneous.When a proposition turns out to be erroneous,this erroneous proposition and the other propositions,which depend on the erroneous proposition,will be retracted from the knowledge base.Based on TMS and ATMS,this paper presents a novel representation of knowledge,i.e.knowledge base with dependencies.This paper applies this idea to propositional logic program.Given a logic program,consequences together with their dependencies are recorded in the consequence set.Based on the consequences set with the dependencies,this paper proposes the algorithm of rule addition and two algorithms of rule deletion.The second algorithm of rule deletion can handle the problem of circular dependency.As a conclusion,this paper argues that justifications of knowledge should be stored in knowledge bases and different kinds of knowledge have different kinds of justifications.In this paper,this idea is applied to propositional logic program.In the future,we will extend this method to predicate logic and inductive logic.Based on knowledge base with dependencies,the retractions of knowledge become more efficiency.Therefore,this method provides a new foundation for belief revision and argument

A knowledge base with dependencies

Conference Name:2014 11th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2014. Conference Address: Xiamen, China. Time:August 19, 2014 - August 21, 2014.Traditionally, knowledge is defined as justified true belief (JTB). However, Gettier Problem showed that JTB is not sufficient for knowledge. This paper argues that validity of knowledge has to depend on justifications of knowledge. Therefore, justifications of knowledge have to be stored in knowledge base also. Based on Truth Maintenance Systems, this paper presents a novel knowledge representation system, i.e. knowledge bases with dependencies. This paper applies this idea to propositional logic program. Given a logic program, consequences together with their dependencies are computed and recorded. For updating consequences set with dependencies, this paper proposes an algorithm of rule addition and two algorithms of rule deletion. The second algorithm of rule deletion can handle the problem of circular dependency. Knowledge bases with dependencies can provide a new foundation for belief revision and argument. ? 2014 IEEE