2010 First ACIS International Symposium on Cryptography, and Network Security, Data Mining and Knowledge Discovery, E-Commerce and Its Applications, and Embedded Systems

23-24 Oct. 2010

Filter Results

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

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

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

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

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

    Publication Year: 2010, Page(s):v - xi
    Request permission for commercial reuse | PDF file iconPDF (156 KB)
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2010, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (57 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Symposium Chairs

    Publication Year: 2010, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (61 KB) | HTML iconHTML
    Freely Available from IEEE
  • Program Committee and Reviewers

    Publication Year: 2010, Page(s):xiv - xv
    Request permission for commercial reuse | PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • Keynotes

    Publication Year: 2010, Page(s):xvi - xvii
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (73 KB)

    Provides an abstract for each of the keynote presentations and a brief professional biography of each presenter. The complete presentations were not made available for publication as part of the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method for Nonlinear Equation's Simple Roots

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

    In this paper, we present the convergence behavior of a modified Newton's method based on Simpson integral rule. The convergence properties of this method for solving equations which have simple roots have been discussed and it has been shown that it converges cubically to simple roots. The values of the corresponding asymptotic error constants of convergence are determined. Theoretical results ha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Algorithm Based on Prefix Tree for Sequence Pattern Mining

    Publication Year: 2010, Page(s):6 - 11
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (342 KB) | HTML iconHTML

    Algorithm PTPSPM (a parallel algorithm based on prefix tree for sequence pattern mining) is proposed in order to deal with the speed limited and effectiveness problem of the sequence pattern mining in massive data. In this paper, a new prefix-tree structure and an improved prefix-span algorithm are introduced to mine the local sequence, the global sequence are obtained by merging all the local seq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for Parallel Machine Scheduling on Any Number of Machine

    Publication Year: 2010, Page(s):12 - 17
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (393 KB) | HTML iconHTML

    In this paper, we present algorithms for the problem of scheduling n independent jobs on m identical machines. As a generalization of the classical parallel machine scheduling problem each machine is available only at a machine dependent release time. For the problem of minimizing the make span, we develop a kind of linear time algorithm with a tight bound of 1+(m-1)/m. For the problem Pm|non-incr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optimization Model of Elevators Group Zoning Dispatching and Its Application

    Publication Year: 2010, Page(s):18 - 21
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    Considering the difficultly of passengers taking elevators in up-peak traffic mode, this paper studies and gives an optimal strategy of elevator group dynamic zoning dispatching. Firstly, this paper explains the basis and algorithm about this elevator group dynamic zoning dispatching model. Then it establishes one elevator service quality model and one elevator energy loss model separately. Based ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ARMA Model Parameter Optimized Estimate Method

    Publication Year: 2010, Page(s):22 - 26
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (301 KB) | HTML iconHTML

    The ARMA model is the most basic sequential method and the practical application of the most comprehensive time series model. It expands and develops in the linear regression model foundation. The ARMA model not only may promulgate dynamic data's structure and the rule, will forecast its future value, moreover may also from the various research system's related characteristic, the ARMA model's par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Atuomorphism Group of Simple Lie Algebra C_q[x^±1, y^±1, z^±1]/C

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

    In this paper, the automorphisms and anti-automorphisms of a class of simple associative algebra Cq:=Cq[x±1, y±1, z±1] are studied, then the automorphisms of a class of simple Lie algebra Cq/C are determined. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block Diagonalization and a Numerical Method of the Eigenproblem for an n×n Normal Matrix

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

    It is important that the eigenproblem of a matrix is solved in the matrix analysis and its engineering application. For a normal matrix with multiplex eigenvalues, a method of block diagonalization is given by using Householder transformation and finding eigenvectors of the tridiagonal Hermitian matrix. On the basis of this, a numerical method of finding its eigenvalues and eigenvectors is obtaine... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Completeness of Random Exponential Systems in the Weighted Banach Space

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

    In this paper, the authors investigate the completeness of random exponential systems {tkeλn(ω)t} in Cα, where Cα is the weighted Banach space of complex continuous functions of f on R with f(t)exp(-α(t)) vanishing at infinity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discussion of Complex integration on Complex Contours

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

    This paper elaborated on the complex integration on the complex contour, and gave the calculation formula of complex integrals according to different cases with different number of singular points, namely, one singular point, n singular points, infinite singular points (countable). Therefore, it is easy to analysis and understand the development and establishment of complex integration on complex ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • E-convex Bilevel Programming

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

    This paper presents E-convex linear programming problem from the theorems and expands the single E-convex programming into double. And also E-convex programming definition and some theorems are given, which enriched the field of bilevel linear programming. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extrapolation Methods to Compute the Hypersingular Integral on Interval

    Publication Year: 2010, Page(s):44 - 48
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB) | HTML iconHTML

    The composite trapezoidal rule for the computation of Hadamard finite-part integral on interval with the hyper singular kernel 1/(t-s)2 is discussed and the case of the mesh point coinciding with the singular point by generalized finite-part definition is considered. The asymptotic expansion is obtained and an extrapolation algorithm is presented to accelerate the convergence rate. Base... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy Set Model of Locality Problem in Ubiquitous Computing

    Publication Year: 2010, Page(s):49 - 52
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (306 KB) | HTML iconHTML

    In ubiquitous computing environment, user application requires close interaction with the network nodes in its proximity, the interactions are opportunistic and unpredictable with the user's movement. This paper names this phenomenon as a locality problem and provides a model of this problem based on fuzzy set theory. Fuzzy synthetic evaluation method is used to evaluate the local scene members. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Legendre Wavelets Method for Nonlinear Fractional Differences Equation

    Publication Year: 2010, Page(s):53 - 56
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (261 KB) | HTML iconHTML

    In this paper we consider a kind of polynomials-Legendre polynomials then we get Legendre wavelet. Legendre wavelet operational matrix of the fractional integration is derived and combined the property of operational matrix to solve nonlinear fractional differential equations, we give some example and the numerical example shows that the method is effective. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mathematical Method of a New Fast BEM for 2D Potential Problems

    Publication Year: 2010, Page(s):57 - 58
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (239 KB) | HTML iconHTML

    The boundary element method (BEM) has been successfully applied to 2D and 3D large scale potential problems and efficiently reduce the computing operations and memory requirements. In this paper, by using Laplace Transformation, a new kind of fast BEM for 2D potential problems is presented. Using this method, the logarithm operation can be converted to product operation, the calculation complexity... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Note on Two-f-Tolerance Competition Graphs

    Publication Year: 2010, Page(s):59 - 62
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (329 KB) | HTML iconHTML

    Let φ be a symmetric function defined from N×N into N, where N denotes the nonnegative integers. A graph G=(V,E) is a φ-tolerance competition graph if there is a digraph D=(V,A) such that each vertex vi∈V can be assigned a nonnegative integer ti such that, for i≠j, vivj∈E if and only if |O(vi)∩O... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ohba's Conjecture is True for Graphs K_6,3*t,2*(k-2t-4),1*(t+3)

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

    A graph G is called chromatic-choosable if ch(G)=χ(G). Ohba's conjecture states that every graph G with 2χ(G)+1 or fewer vertices is chromatic-choosable. In this paper we show that Ohba's conjecture is true for complete multipartite graphs K6,3*t,2*(k-2t-4),1*(t+3) and its all k-chromatic sub graphs for all integers t≥0 and k≥2t+4, that is, ch(K6,3*t,2*(... View full abstract»

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