By Topic

2008 International Symposium on Electronic Commerce and Security

3-5 Aug. 2008

Filter Results

Displaying Results 1 - 25 of 231
  • [Front cover]

    Publication Year: 2008, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (670 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2008, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (11 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2008, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2008, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2008, Page(s):v - xix
    Request permission for commercial reuse | PDF file iconPDF (148 KB)
    Freely Available from IEEE
  • Message from the Symposium Chairs

    Publication Year: 2008, Page(s): xx
    Request permission for commercial reuse | PDF file iconPDF (24 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2008, Page(s): xxi
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • Committee Members

    Publication Year: 2008, Page(s):xxii - xxiii
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • The Application of Genetic Algorithm in Vehicle Routing Problem

    Publication Year: 2008, Page(s):3 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB) | HTML iconHTML

    Genetic Algorithms are excellent approaches to solving complex problem in optimization with difficult constraints. The vehicle routing problem (VRP) has been shown as an NP-complete problem. On the foundation of stressing the limitations of the network in VRP this paper introduces a finite automaton (FA) to produce individual population and implement a new evolution way using genetic algorithm. Be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Algorithm of Obtaining Best Rules Based on Rough Set

    Publication Year: 2008, Page(s):7 - 10
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (106 KB) | HTML iconHTML

    With the fast development of the technology in Database and Internet, excessive information has become a problem that decision makers engage in electronic commerce have to affront. This paper firstly establishes the decision table for excessive data, then reduces knowledge of the decision table, and obtains the best rules. This can reduce the redundancy of the data, and improve the efficiency of k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm of Topic Distillation Based on Anchor Text

    Publication Year: 2008, Page(s):11 - 15
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (201 KB) | HTML iconHTML

    For topic distillation and topic exploration, a rich resource is the information from hyper linked Web pages. The anchor text, an objective summary of Web pages, is of strong topic and semantic indication. As to the triangular relationship of the hub Web page, anchor text, and authoritative Web page, a good hub Web page is the one that is directed to a good authoritative Web page through the autho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A High Payload Steganographic Scheme Based on (7, 4) Hamming Code for Digital Images

    Publication Year: 2008, Page(s):16 - 21
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (498 KB) | HTML iconHTML

    High payload information hiding schemes with the good visual quality of stego images are suitable for steganographic applications such as online content distribution systems. This paper proposes a novel steganographic scheme based on the (7, 4) Hamming code for digital images.The proposed scheme embeds a segment of seven secret bits into a group of seven cover pixels at a time. The experimental re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Verifiable (t, n) Multiple Secret Sharing Scheme and Its Analyses

    Publication Year: 2008, Page(s):22 - 26
    Cited by:  Papers (4)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB) | HTML iconHTML

    In 2000, a new type of multi-secret sharing scheme, called the multiple secret sharing scheme, is proposed by Chien et al., in which more than one secret instead of only one secret can be shared in the same sharing session. In 2004, Yang et al. proposed another implementation of the above scheme based on Shamir's secret sharing to reduce the complexity of computation. In 2005, Pang et al. also pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Web Text Clustering Algorithm Based on DFSSM

    Publication Year: 2008, Page(s):27 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (335 KB) | HTML iconHTML

    A new algorithm of Web text clustering mining is presented, which is based on the Discovery Feature Sub-space Model (DFSSM). This algorithm includes the training stage of SOM and the clustering stage, which characterizes self-stability and powerful antinoise ability. It can distinguishes the most meaningful features from the Concept Space without the evaluation function. we have applied the algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cloud Model-based Data Attributes Reduction for Clustering

    Publication Year: 2008, Page(s):33 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    Data reduction, which can simplify large scale data and not lose useful information, is an important topic of knowledge discovery, data clustering and classification. Aiming to solve the current problem that continuous attribute in algorithm of clustering or classification has to be discrete, a new algorithm of data reduction based on cloud model is put forward. By use of cloud model, this algorit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of Learning Algorithm based on SGA Bayesian Network

    Publication Year: 2008, Page(s):37 - 40
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (242 KB) | HTML iconHTML

    A typical characteristic of Bayesian network topology is dependences of each variable within the network, which makes it impossible to optimize variables. This problem is solved by the developed approach to Bayesian network construction based on self-organizing genetic algorithm (SGA) from knowledge base. The genetic algorithm (GA) is improved by self-organizing organism and an effective operator ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Algorithm for Tate Pairing Computation

    Publication Year: 2008, Page(s):41 - 45
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (255 KB) | HTML iconHTML

    In this paper, an efficient algorithm for the computation of Tate pairing on general curves is presented. Our approach is to change the binary representation of the involved integer to its non-adjacent form at first, and then pre-organize this form to make further improvement on its efficiency. We also show this algorithm has better performance than BMX and LHC algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Deadline and Cost Constrained Optimization Algorithm for Scheduling Applications in Grids Based on Proportional Share Systems

    Publication Year: 2008, Page(s):46 - 50
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (254 KB) | HTML iconHTML

    Since computation of grids enable the sharing, selection, query and aggregation of geographically distributed resources for solving large-scale problems, developing mechanisms for grid resource scheduling is a complex undertaking problem. We had investigated several famous schedule methods proposed by Nimrod-G, a famous computational economy framework for regulating the supply and demand for resou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Scheme of Workflow Management System Based on Web Services

    Publication Year: 2008, Page(s):53 - 56
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (235 KB) | HTML iconHTML

    Traditional workflow management systems (WfMS) is hard to meet the requirements of the dynamic, flexible modern business process. In recent years, Web services technology has been developing. It not only makes the activity in workflow by Web services form, but also workflow itself is invoked by Web services, especially semantic Web services technology is developing, which makes it possible to comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High Efficiency Association Rules Mining Algorithm for Bank Cost Analysis

    Publication Year: 2008, Page(s):57 - 60
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    This paper introduces improving rate and proposes the incremental mining algorithm for optimizing association rules based on CBA mining algorithm. Comparing with the traditional algorithm, the improved algorithm is fast, efficient in incremental data mining and can find trends in association rules. The decision making reliability is enhanced by the association rules obtained from the improved algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Reconfiguration Method for Web Service Based on Policy

    Publication Year: 2008, Page(s):61 - 65
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB) | HTML iconHTML

    A more challenging problem for Web Service reconfiguration is to reconfigure services dynamically on demand. This paper proposes the dynamic reconfiguration method for Web Service. A policy based framework supports three levels reconfiguration strategies that separate reconfiguration from application. This framework includes three conceptual layers: change instruction, reconfiguration management, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on Customers Demand Forecasting for E-business Web Site Based on LS-SVM

    Publication Year: 2008, Page(s):66 - 70
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    This paper introduces a novel customers' demand forecasting model based on least squares support vector machines (LS-SVM) for e-business enterprises. Firstly, the paper presents actual state of e-business, and discusses some factors that block e-business advance in China. Then, some common techniques used for forecasting are briefly reviewed together with their shortcomings respectively. To solve ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An XML based Flexible Security E-Commerce Mode

    Publication Year: 2008, Page(s):71 - 73
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (209 KB) | HTML iconHTML

    This paper proposes a XML security E-commerce mode, which deals with the security problems of data transmission in E-commerce. Comparing with the traditional methods, the new mode can operate any parts of the data documents according to userspsila desires, and to encrypt and authenticate in arbitrary sequences. For its high flexibility, the new mode is able to satisfy the complex requirements of d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Design and Implementation of the Distribution Resource Planning Management System Based on WEB

    Publication Year: 2008, Page(s):74 - 77
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (613 KB) | HTML iconHTML

    The existing SCM software products in China are not relatively perfect in aspects: real-time visibility, flexibility, response ability, and development speed. This paper studies distribution resource planning system from management idea, application model and technical tool aspects, integrating latest SCM ideas and information technologies. The innovative SCM software system developed includes sup... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on High-accuracy Position Prediction Algorithm in Online Game

    Publication Year: 2008, Page(s):78 - 81
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (225 KB) | HTML iconHTML

    Aiming at the problem of the low accuracy predicted by the linear prediction technique of traditional Dead Reckoning in present online game, a new high-accuracy position prediction algorithm based on Dead Reckoning is proposed. The new proposed prediction algorithm uses high-order derivative polynomials to improve the prediction accuracy. The experimental results show that the algorithm is of bett... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.