By Topic

Information Engineering and Electronic Commerce, 2009. IEEC '09. International Symposium on

Date 16-17 May 2009

Filter Results

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

    Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (1123 KB)  
    Freely Available from IEEE
  • [Title page i]

    Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (14 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (80 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (109 KB)  
    Freely Available from IEEE
  • Table of contents

    Page(s): v - xv
    Save to Project icon | Request Permissions | PDF file iconPDF (114 KB)  
    Freely Available from IEEE
  • Message from the Symposium Chairs

    Page(s): xvi
    Save to Project icon | Request Permissions | PDF file iconPDF (63 KB)  
    Freely Available from IEEE
  • Organizing Committee

    Page(s): xvii
    Save to Project icon | Request Permissions | PDF file iconPDF (62 KB)  
    Freely Available from IEEE
  • list-reviewer

    Page(s): xviii
    Save to Project icon | Request Permissions | PDF file iconPDF (64 KB)  
    Freely Available from IEEE
  • Notice of Retraction
    Semi-fragile Image Watermarking Algorithm Based on Double-Step

    Page(s): 3 - 10
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (542 KB) |  | HTML iconHTML  

    Notice of Retraction

    After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.

    We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

    The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

    In order to improve the invisibility and the robustness of semi-fragile watermarking, the paper first brings up the idea which embedding watermark based on the attackspsila characteristic, brings forward the region segmentation operator and the double-step embedding method. The paper puts forward the characteristic and its representation in DWT transform domain based on visual features model, and brings forward the quantized central limit theorem which applies to adjusting the coefficients in general transform domain. These all make semi-fragile water marking embedded through dynamic quantization and achieve the greatest robustness. It gives wavelet transform domain coefficient redressal operator and the best restore probability of the pixel value adjustment in experiments when the images were under attack. It leads up to a better invisibility of carrier image, a better robustness to the image processing, such as JPEG compression, noise adding, filtering, and the larger amount of embedded information. Whatpsilas more, it can ascertain the position of vicious attack exactly. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on Multi-dimensional Cellular Automation Pseudorandom Generator of LFSR Architecture

    Page(s): 11 - 15
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (240 KB) |  | HTML iconHTML  

    Cellular automata (CA) or linear feedback shift register (LFSR) architecture is widely used in pseudorandom generator of applied cryptography. The paper proposes a multi-dimensional and multi-rank pseudorandom generator combined the CA algorithm and LFSR architecture. In order to test the feasibility of the design, we research on feasibility and efficient of the algorithm by using three bit tests such as mono bit test, poker test and run test according to FIPS 140-1 standard. The final result can pass three FIPS 140-1 standard pseudorandom stream bit tests and provide better pseudorandom key stream. The results illustrate the algorithm is feasible and efficient. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Adaptive Supply Chain Model in B2C Electronic Commerce

    Page(s): 16 - 20
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (212 KB) |  | HTML iconHTML  

    To supply chain network design problems considering electronic commerce (e-commerce) of scale and further demand fluctuations, a reliability evaluation method is proposed to evaluate the performance of plants under demand fluctuations. In addition, an efficient mathematical model is proposed to adaptively determine the optimal adjustment decisions regarding production reallocation among plants under different fluctuating demands to decrease cost and improve efficiency in e-commerce. Detailed numerical results and comparisons with the existed scheme prove the validity of the proposed model. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on the Returns Policy Model of a Dual-Channel Supply Chain in E-commerce

    Page(s): 21 - 25
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (249 KB) |  | HTML iconHTML  

    This paper quantitatively analyzes the use of the e-marketplace for selling the returned products after rework in a dual-channel supply chain. In our dual-channel model, we derive the optimal order quantities and optimal retail prices for all the parties in the supply chain and we also propose the optimal buyback price established by the manufacturer. Through comparative analysis of the single-channel and the dual-channel model, we further find that the returns policy with e-marketplace is better than the traditional returns policy. In e-commerce, due to the existence of B2B e-marketplace, the returned products can be sold with a higher price which is higher than the salvage price. Both the manufacturer and the retailer can benefit from the dual-channel supply chain. Finally, we show that the retailerpsilas expected profit is an increasing function of the buyback price and the manufacturerpsilas expected profit is a decreasing function of the buyback price. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative Black Hole Attack Prevention for Mobile Ad Hoc Networks

    Page(s): 26 - 30
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (287 KB) |  | HTML iconHTML  

    The black hole attack is one of the security attacks that occur in mobile ad hoc networks (MANETs). In this article, the routing security issues and the problem of coordinated attack by multiple black holes acting in group in MANET are addressed in detail. Two authentication mechanisms, based on the hash function, the message authentication code (MAC) and the pseudo random function (PRF), are proposed to provide fast message verification and group identification, identify multiple black holes cooperating with each other and to discover the safe routing avoiding cooperative black hole attack. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conflict Analysis between Tacit Knowledge Sharing and Its Exclusivity Based on Meta-game Theory

    Page(s): 31 - 35
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (194 KB) |  | HTML iconHTML  

    Tacit knowledge sharing discussed in this study is important in the area of business due to its sharing to impel the organizationspsila competitive advantage. In this study, the conflict between tacit knowledge sharing and its exclusivity is described by conflict analysis based on game theory. Analysis shows that the conflict can be categorized as a non-absolute opposability conflict. Furthermore, to settle down the conflict situation, participation of third party which treated as the complement is assumed, and the relationship between the role of third party and equilibriums of conflict analysis is analyzed. Based on this analysis, it is thought that if an impartial coordinator entitled with some rights is introduced, the model might get an equilibrium solution and thus tacit knowledge sharing could be realized. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research of an Improved BP Decoding Algorithm

    Page(s): 36 - 39
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (265 KB) |  | HTML iconHTML  

    That the computation load is big is a shortcoming of traditional BP decoding algorithm. According to this shortcoming we give an improved BP decoding algorithm. The decoding algorithm in the iterative decoding process, only need to update the possibility of a wrong bit of information without having to update the information whose reliability is very high, raises the decoding efficiency and reduces decoding time delay. The simulation result shows: the calculation load of improved BP decoding algorithms descends distinctively with the increasing iteration numbers; Along with the times increasing of LDPC code iterations upper limit, coding performance can be obviously improved. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quorum-Based Optimistic Concurrency Control in Replicated DHTs

    Page(s): 40 - 45
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (347 KB) |  | HTML iconHTML  

    Distributed hash tables (DHTs) provide a scalable solution for data sharing in P2P systems. To achieve fault tolerance and ensure high data availability, DHTs typically rely on data replication. However, nodes churn, lacking of global view and existence of malicious nodes in P2P environment bring new challenges to the concurrency control for replicated data. Agreement-based algorithms require all-to-all communication among nodes, which does not scale well in P2P environment. Pessimistic approaches perform poorly when clients are malicious. Regards to replicated DHTs, an efficient quorum-based optimistic concurrency control algorithm is proposed.Hybrid failure model is used to reduce the fault-tolerant cost. The responsibilities of data storage and concurrency control are separated to enable data reliability and data availability to be adjusted independently. Simulation shows the proposed algorithm can obviously improve system scalability and reduce the fault-tolerant cost. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Empirical Assessment and Application of SERVQUAL in Mainland Chinese Express Industry

    Page(s): 46 - 50
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (229 KB) |  | HTML iconHTML  

    In the present study, the exploratory and confirmatory factor analyses were conducted to assess the SERVQUAL instrument dimensionality, reliability and validity, and apply the SERVQUAL instrument into Chinese Express Industry. We found that the adapted SERVQUAL instrument is also a valid and valuable tool to measure service quality. ldquoSecurityrdquo is an important additional dimension of service quality in Chinapsilas express industry. The dimensions of ldquoreliabilityrdquo and ldquoresponsivenessrdquo may need revision for the special nature of express industry. ldquoTimelinessrdquo may be the best interpretation of these two dimensions. And the study provides some useful insights and guidance for managers to measure and improve service quality. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weighted k-Means Algorithm Based Text Clustering

    Page(s): 51 - 55
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (230 KB) |  | HTML iconHTML  

    This paper proposes a weighted k-means clustering algorithm based on k-means (MacQueen, 1967; Anderberg, 1973) algorithm, and it can be used to cluster texts. Firstly, the weighted k-means algorithm changes the descriptive approach of text objects, and converts the categorical attributes to numeric ones to measure the dissimilarity of text objects by Euclidean distance; then, the weighted k-means algorithm uses weight vector to decrease the affects of irrelevant attributes and reflect the semantic information of text objects. Through an experiment, the weighted k-means algorithm is demonstrated to be more effective than k-means algorithm when used to cluster texts. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Empirical Research on Consumer Trust in E-commerce

    Page(s): 56 - 61
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (255 KB) |  | HTML iconHTML  

    According to the fact that consumer trust is widely perceived as an essential factor to the success of electronic commerce, we develop a model of consumer trust in e-commerce and use empirical research method to test it. After deep analyzing, we find that perceived size, propensity to trust, perceived privacy information protection, and perceived legal environment security are insignificantly related with the level of consumer trust. The possible explanations are given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Effect of Industry Competition on Credit Trade

    Page(s): 62 - 65
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (183 KB) |  | HTML iconHTML  

    In this paper, we analysis from the supply of trade credit and present a study on the use of an important non-formal financial channel - trade credits - for firms based on Chinese companies from 2000 to 2006. In particular, we compare the use of trade credit between competition industries and non-competition industries firms. To test the difference in the use of trade credit between competition industries and non-competition industries firms, we use the information in the firmspsila financial statements, we found that, compared to non-competition industries, firms in competition industries tend to use more trade credit. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Dynamic Trust Model Based on Entity Credibility in Heterogeneous Wireless Network

    Page(s): 66 - 70
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (344 KB) |  | HTML iconHTML  

    The characteristics of uncertainty and variability in heterogeneous wireless network bring some new security challenges. This paper proposes a dynamic trust model based on entity credibility (DTMBC) to evaluate the trustworthiness of the network. The evaluation incorporates direct trust, recommended trust, credibility of the candidate network, credibility of the evaluating entity and time stamp. Direct and recommended trusts reflect how well the candidate network has fulfilled the service agreement in the past. By introducing credibility of the candidate network and credibility of the evaluating entity, malicious behaviors of the dishonest entities are restrained effectively. Time stamp makes the evaluation pay much attention to the most recent performance records. Based on the interval threshold, FIFO strategy is introduced to discard the outdated trust records. The simulation results show the DTMBC model can accurately evaluate the trustworthiness of the network and effectively restrain the acts of slander and co-fraud. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Notice of Retraction
    Effects of Customer Participation on Customer Perceived Value and Customer Satisfaction in B2B Business Model

    Page(s): 71 - 78
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (348 KB) |  | HTML iconHTML  

    Notice of Retraction

    After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.

    We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

    The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

    This paper considers the roles of service customerspsila participates in the service production and delivery process. It also explores the effects of customer participation on customer perceived value, customer satisfaction in the service encounter. Furthermore, choosing architectural material industry, it implements empirical study on the relationship between the participation of the downriver enterprises in upriver enterprisespsila operations and customer perceived value, customer satisfaction in B2B business model. The empirical study indicates that higher ldquoperceived effortsrdquo, ldquotask definitionrdquo factors of customer participation lead to a higher level of customer perceived value and a higher level of customer satisfaction, but there is no notable relationship between ldquoinformation-seekingrdquo, ldquopersonal interactionrdquo factors of customer participation and customer perceived value, customer satisfaction. Finally, the management implications, main research conclusions and future research directions about customer participation are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Secure Routing and Aggregation Protocol with Low Energy Cost for Sensor Networks

    Page(s): 79 - 84
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (301 KB) |  | HTML iconHTML  

    Wireless sensor networks are increasingly deployed in security-critical areas, such as battle field. However, general sensor nodes are manufactured with inexpensive components, and they are short of security enhancement. Therefore, an adversary could capture and compromise sensor nodes easily, then launch some malicious attacks (including tampering or discarding useful data collected from source nodes). In this paper, we propose a secure routing and aggregation protocol with low energy cost for sensor networks (named STAPLE), which utilizes one-way hash chain and multi-path mechanism to achieve security of wireless sensor networks, and develop a network expanding model to control communication cost incurred by multi-path routing. We perform the simulation of STAPLE in comparison with INSENS, the results demonstrate that STAPLE achieves a higher level security and it is efficient in large scale sensor networks with considerably low communication overhead. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Color Image Cryptography Using Multiple One-Dimensional Chaotic Maps and OCML

    Page(s): 85 - 89
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (388 KB) |  | HTML iconHTML  

    In this paper, a stream color image cryptography has been proposed based on spatiotemporal chaos system. One-way coupled map lattices (OCML) are used to generate pseudorandom sequences and then encrypt image pixels one by one. By iterating randomly chosen chaotic maps from a set of chaotic maps for certain times, the generated pseudorandom sequences obtain high initial-value sensitivity and good randomness. The initial conditions of chaotic maps and parameters of the algorithm are generated by a 128-bit external key. Simulation results show that the proposed scheme is efficient and useful for the security of communication system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two Scalable Approaches to Analyzing Network Security Using Compact Attack Graphs

    Page(s): 90 - 94
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (218 KB) |  | HTML iconHTML  

    The compact attack graphs can implicitly reveal the potential threat of sophisticated multi-step attacks by enumerating possible sequences of exploits leading to the compromising given critical resources in enterprise networks with thousands of hosts. For security analysts, the challenge is how to analyze the complex attack graphs with possible ten thousands of nodes for defending the security of network. In the paper, we will essentially discuss two issues about it. The first is to compute non-loop attack paths with the distance less than the given number that the real attacker may take in realistic attack scenarios. The second is how to measure security risk. Two scalable approaches are proposed to solve the above two issues respectively. These approaches are proved to have a polynomial time complexity and can scale to the attack graphs with ten thousands of nodes corresponding to large enterprise networks. View full abstract»

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