14117241
Denial of Service: Another Example
Although denial of service attack has been becoming a fast-growing concern in security research, previous work focused on a type of classical denial of service caused by resource exhaustion. In this paper, a different type of network denial of service attack is discussed. Since traditional models and countermeasures are not applicable, we discuss solutions that can defend this non-classical service denial attack.
206485325
Password memorability and security: empirical results
Users rarely choose passwords that are both hard to guess and easy to remember. To determine how to help users choose good passwords, the authors performed a controlled trial of the effects of giving users different kinds of advice. Some of their results challenge the established wisdom.
132181
A note on proactive password checking
Nowadays, proactive password checking algorithms are based on the philosophy of the dictionary attack, and they often fail to prevent some weak passwords with low entropy. In this paper, a new approach is proposed to deal with this new class of weak passwords by (roughly) measuring entropy. A simple example is given to exploit effective patterns to prevent low-entropy passwords as the first step of entropy-based proactive password checking.
5296157
A Novel Scalable Algorithm for Supervised Subspace Learning
Subspace learning approaches aim to discover important statistical distribution on lower dimensions for high dimensional data. Methods such as principal component analysis (PCA) do not make use of the class information, and linear discriminant analysis (LDA) could not be performed efficiently in a scalable way. In this paper, we propose a novel highly scalable supervised subspace learning algorithm called as supervised Kampong measure (SKM). It assigns data points as close as possible to their corresponding class mean, simultaneously assigns data points to be as far as possible from the other class means in the transformed lower dimensional subspace. Theoretical derivation shows that our algorithm is not limited by the number of classes or the singularity problem faced by LDA. Furthermore, our algorithm can be executed in an incremental manner in which learning is done in an online fashion as data streams are received. Experimental results on several datasets, including a very large text data set RCV1, show the outstanding performance of our proposed algorithm on classification problems as compared to PCA, LDA and a popular feature selection approach, information gain (IG).
17691685
WFMS-based Data Integration for e-Learning
As more and more organisations and institutions are moving towards the e-learning strategy, more and more disparate data are distributed by different e-learning systems. How to effectively use this vast amount of distributed data becomes a big challenge. This paper addresses this challenge and works out a new mechanism to implement data integration for e-learning. A workflow management system based (WFMS-based) data integration model is contributed to the e-learning
18875168
Towards Autonomous Service Level Agreement Negotiation for Adaptive Service Composition
This paper reports innovative research aiming at supporting autonomous establishment and maintenance of service level agreements in order to guarantee end-to-end quality of service requirements for service composition provision. In this research, a set of interrelated service level agreements is established and maintained for a service composition, through autonomous agent negotiation. To enable this, an innovative framework is proposed in which agents on behalf of the service requestor and the service providers can negotiate service level agreements in a coordinated way. This framework also enables adaptive service level agreement re-negotiation in the dynamic and ever-changing service environment
1812621
A Data Storage Mechanism for Peer-to-Peer Based Decentralised Workflow Systems
This paper proposes an innovative data storage mechanism for decentralised workflow systems. The research is based on a peer-to-peer workflow architecture in which various nodes communicate with each other directly to carry out workflow functions. In this approach, a process is partitioned into separate tasks, and then individual tasks are passed to appropriate nodes. To realise this approach, a data repository independent process notation is provided. Moreover, this paper also designs communication protocols to maintain data in a dynamic environment. The key distinction of this approach is to propose a “know what you should know” policy to reflect the nature of applications.
4928164
A service workflow management framework based on peer-to-peer and agent technologies
Service workflow management which consolidates multiple services to achieve business goals has become a critical issue in service-oriented computing. Due to the unique feature of service workflows such as full distribution and high dynamicity, the contemporary workflow technology has exhibited inefficiency, vulnerability, inflexibility and lack of adaptability. Based upon the authors' previous work on peer-to-peer based workflow management and seamless integration of agents and Web services, this paper innovatively presents SwinDeW-A which is a decentralised service workflow management framework based on peer-to-peer and agent technologies. Based on this framework, this paper also discusses how autonomous service level agreement negotiation, decentralised process enactment, and autonomous process adaptation can be achieved. The proposed approach takes advantages of the peer-to-peer computing technology and the agent technology to provide more efficient, reliable, flexible and adaptive service workflow management.