17411195
Offer Group Generation and Delayed Processing in Multi-Issue Negotiation
In this paper we describe a mechanism for automated negotiation in which artificial agents can deal with a multi-issue negotiation in a one-to-many way based on some strategies. The negotiation process are governed dynamically by some strategies that emphasize on the diverse processing methods under the considering of different commodity attributes, including dynamic delayed evaluation and response to the received offers, generation of offer group with the same utility. Our analysis shows that the mechanism ensures that bargaining agents could reach a better agreement automatically. We also implement a prototype system to verify the advantages of our mechanism.
5086368
Marker-controlled perception-based mesh segmentation
This paper introduces an interactive marker-controlled mesh segmentation algorithm. In many applications, we need to partition a given mesh according to human perception or particular requirements. The algorithm presented in this paper is based on fast marching watersheds. We refer to the experience of image segmentation area and introduce interactive marker selection. Thus we obviously overcome the difficulty in intuitional segmentation control, and improve the quality of segmentation. The output results show the effectiveness and practicability of the algorithm.
23948133
Building Domain Ontology Based on Web Data and Generic Ontology
The automatic or semi-automatic construction of ontology has become a research topic of interest in recent years. This paper describes a mechanism for constructing domain specific ontologies automatically based on web data and generic ontology. Firstly, we employ the hierarchical agglomerative clustering(HAC) algorithm, clustering web pages hierarchically and resulting in a binary tree. Then an algorithm is proposed, which selectd from the binary tree the significative nodes as topics implying concepts of domain interests. Lastly, the Chinese generic ontology, HowNet, is introduced to evolve the topics (together with their hierarchical structures) into domain ontology. We experiment our method in the field of computer hardware based on web pages collected from Chinese BtoC web sites. An in-depth discussion on the experiment results is also given.
36918365
C3: A New Learning Scheme to Improve Classification of Rare Category Emails
This paper proposes C3, a new learning scheme to improve classification performance of rare category emails in the early stage of incremental learning. C3 consists of three components: the chief-learner, the co-learners and the combiner. The chief-learner is an ordinary learning model with an incremental learning capability. The chief-learner performs well on categories trained with sufficient samples but badly on rare categories trained with insufficient samples. The co-learners that are focused on the rare categories are used to compensate for the weakness of the chief-learner in classifying new samples of the rare categories. The combiner combines the outputs of both the chief-learner and the co-learner to make a finial classification. The chief-learner is updated incrementally with all the new samples overtime and the co-learners are updated with new samples from rare categories only. After the chief-learner has gained sufficient knowledge about the rare categories, the co-learners become unnecessary and are removed. The experiments on customer emails from an e-commerce company have shown that the C3 model outperformed the Naive Bayes model on classifying the emails of rare categories in the early stage of incremental learning.
5773205
Auction-Based Pricing Model for Web Service Providers
Applying auctions to Web services selection and invocation calls for examination due to the unique features of Web services, such as interoperable machine-to machine interactions and re-enterable bargaining services. In this paper, we propose a formal model for Web services-based auctions. Examining a one sided sealed auction type, we prove mathematically that service requestorsâ€™ risk preferences could lead to different pricing strategies for service providers towards higher profit. We argue that Service Level Agreement (SLA) documents can be used to analyze service requestorsâ€™ preferences. On top of WS Agreement, we propose a basic service requestor risk preference elicitation algorithm, as well as a historical data-based service requestor risk preference prediction model. Guidelines are provided to iteratively approach the learning rate of the proposed risk preference prediction model. The methods and techniques presented in this paper can be reused to investigate and examine more facades of services-oriented auctions towards establishing a new research realm on comprehensive services-oriented auctions.
20371919
An Insight Into User Privacy and Accountable Anonymity for Mobile E-Commerce Transactions
Abstract: In this paper the need to develop an accountable anonymity scheme specifically for mobile e-commerce is established. The requirements of such a scheme are identified and shortfalls in existing anonymity services are identified. A novel approach based on the concept of unlinking processes to prevent any meaningful collation of information on a particular on-line identity being performed is discussed. We then propose (in outline) an anonymity scheme based on this concept that will then be extended to provide accountability through on-line revocation.
1064501
Trade-off scheme for fault tolerant connected dominating sets on size and diameter
Connected Dominating Set (CDS) has been a well known approach for constructing a virtual backbone to alleviate the broadcasting storm in wireless networks. Current research has focused on minimizing the size and diameter or improving the fault tolerance of CDS. However, to our best knowledge, no existing research has considered these three important factors together in a single model. In this paper, we introduce the fault tolerant model studying a joint optimization problem in which the objective is to minimize the CDS size as well as the network latency. This model also addresses the tradeoffs between the objective functions. We next propose one approximation algorithm and two distributed algorithms with constant ratios for the model. Simulation results show that our algorithms can gain good tradeoffs between the three factors, which coincide with theoretical analysis. Moreover, our algorithms could obtain a better performance than previous work.
34672242
An effective model for composition of secure systems
Abstract In this paper we present a composable security property based on the principle of an existing one that was developed for the non-interference requirement and used to deal with composition of components linked as a chain. This new property is more general in the sense that it can handle composition of components connected as a tree, and allow each component and their system to meet different security requirements. The applicability of the new property is then assessed based on a case study of security analysis of a file system. Useful observations derived from this case study are finally discussed which can help to develop cost-effective approaches to design and evaluation of secure systems.
39485215
Security issues in an EDI environment
EDI (Electronic Data Interchange) means electronic transmission, processing, and storage of commercial, business, or trade related documents. The paper surveys the security threats posed to an EDI system, and outlines the techniques and services used to counter these threats. Most importantly, the paper has gone into great depth to address an EDI specific security requirement-non repudiation of receipt. The current related work done to support this service is first discussed, and then a new and simple, but effective protocol to achieve non repudiation of receipt on a distributed and heterogeneous system platform is proposed.