Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies

27-29 Aug. 2003

Filter Results

Displaying Results 1 - 25 of 213
  • Fast parallel computation of multi-exponentiation for public key cryptosystems

    Publication Year: 2003, Page(s):955 - 958
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (351 KB) | HTML iconHTML

    Multiexponentiation may be performed faster than the traditional multiple square and multiply method by rearranging the exponentiation in an efficient sequence. For a suitable choice of such sequences, the resulting multiexponentiation reduces the expected number of nonsquaring multiplications at the cost of a rearrangement. Rearrangement effort depends entirely on the exponent and can be kept dow... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A kind of network security behavior model based on game theory

    Publication Year: 2003, Page(s):950 - 954
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (405 KB) | HTML iconHTML

    We study security interactive behavior between the hacker and the defender, under which an innovated new idea is emphasized. The process of attack and defend is supposed as the n different rational and noncooperative players under incomplete information, which is accord with n person incomplete information game. When the hackers attack the defender, they attempt to get their satisfied payoff, howe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal scheduling algorithm for fork-join task graphs

    Publication Year: 2003, Page(s):587 - 589
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (287 KB) | HTML iconHTML

    The task duplication based scheduling is a new approach to the scheduling problems. This is known as an NP-complete problem. Although some algorithms are able to find an optimal schedule under certain conditions, they ignored to economize processors and minimize the total completion time. We present a task duplication based balance scheduling (TDBS) algorithm which can schedule a class of fork-joi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Schnorr-Adleman lattice

    Publication Year: 2003, Page(s):946 - 949
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (293 KB) | HTML iconHTML

    Lattice theory has been found numerous applications in mathematics and computer science. The shortest vector problem (SVP) and the closest vector problem (CVP) are basic problems of lattice theory. It has been known that the CVP is NP-hard under Karp reduction. SVP is NP-hard under randomized reduction within any constant factor less than √2. The reduction from large integer factorization an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Job relocation: a method to enhance the performance of gang scheduling on clusters of PCs

    Publication Year: 2003, Page(s):582 - 586
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (435 KB) | HTML iconHTML

    Resource allocation and reallocation are very important issues affecting the performance of gang scheduling. Currently most gang scheduling systems adopt regular allocation policies. For many existing clusters of PCs, however, processors are interconnected via a fast Ethernet or a crossbar switch network and the location of processors is not a significant factor when communication costs are consid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast algorithm for nonlinearity of Boolean function

    Publication Year: 2003, Page(s):747 - 749
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (258 KB) | HTML iconHTML

    Nonlinearity is an important index for a Boolean function to be used in stream cipher systems. We design fast algorithm for nonlinearity of Boolean function. Boolean addition used in this new algorithm instead of integer matrix multiplication used in ordinary ones, by which both time and space are saved. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equipartitioning versus marginal analysis for parallel job scheduling

    Publication Year: 2003, Page(s):765 - 768
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (370 KB) | HTML iconHTML

    Given n malleable and nonpreemptable parallel jobs that arrive for execution at time 0, we examine and compare two job scheduling strategies that allocate m identical processors among the n competing jobs. In all cases, n≤m. The first strategy is based on the heuristic paradigm of equipartitioning, and the second is based on the notion of marginal analysis. Equipartitioning uses no a priori inf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using UML for modeling PDM system architectures

    Publication Year: 2003, Page(s):789 - 791
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (270 KB) | HTML iconHTML

    A kind of PDM architecture, which is modeled by UML, is introduced. The main methods of designing and realizing PDM system based on UML are described. Finally, an example is given in order to provide methodical guidelines and hints. It can also be used as a tutorial for UML and for object-oriented development in general. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Access key distribution scheme for level-based hierarchy

    Publication Year: 2003, Page(s):942 - 945
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (379 KB) | HTML iconHTML

    A new access key distribution scheme is proposed for applications where users are in a level-based hierarchy. Based on Chinese remainder theorem (CRT) and Rabin-based secure public key cryptosystem, the proposed scheme has the following characteristics: (1) each user can derive the secret key for user in a lower security level and the inversion is not allowed; (2) the key generation and derivation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Range sum query processing in parallel data warehouses

    Publication Year: 2003, Page(s):877 - 881
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (429 KB) | HTML iconHTML

    Online analytical processing (OLAP) is a critical component of data warehouse. Most of today's OLAP applications work on data warehouses with a centralized structure in which a single database contains huge amounts of data. A range query is a very popular and important operation on OLAP data cube in finding trends or relations between attributes. Methods of computing range query in a centralized d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A different approach for allocating tasks in a DCS using A

    Publication Year: 2003, Page(s):577 - 581
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (454 KB) | HTML iconHTML

    In a distributed computing systems (DCS) tasks may consist of multiple modules. Tasks submitted to a DCS, are usually partitioned into different modules and the modules may be allocated to different processing nodes so as to achieve minimum turn around time of the tasks utilizing the maximum resources of the existing system such as CPU speed, memory capacities etc. The problem lies on how to obtai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A quorum-based distributed algorithm for group mutual exclusion

    Publication Year: 2003, Page(s):742 - 746
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (381 KB) | HTML iconHTML

    The group mutual exclusion problem is a variant of mutual exclusion problem in a sense that only the same group of processes can enter their critical section simultaneously. We propose a quorum-based distributed algorithm for the group mutual exclusion problem in asynchronous message passing distributed systems. The message complexity of our algorithm is O(/Q/) in the best case and O(n/Q/) in the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new TDOA location technique based on Taylor series expansion in cellular networks

    Publication Year: 2003, Page(s):378 - 381
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB) | HTML iconHTML

    Wireless applications based on subscriber location information have been receiving more attention these years, which makes radio location techniques one of the most popular research areas of cellular networks. Taylor series expansion (TSE) method has been widely used in solving nonlinear equations for its high accuracy and good robustness. Since the performance of TSE depends highly on the initial... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimizing the copy graph to improve scalability

    Publication Year: 2003, Page(s):923 - 926
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    Data is replicated at multiple network nodes for performance and availability. Primary lazy replica update protocols have become popular for their superior performance characteristics. A common problem with those lazy replication protocols is that the number of exchanged messages and the deadlock probability drastically increase when the number of sites increases. We propose a method to minimize t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A knowledge markup language and distributed theorem proving

    Publication Year: 2003, Page(s):127 - 131
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (450 KB) | HTML iconHTML

    We mainly focus on the following two issues: the knowledge and problems representation on the Web, and how a theorem-proving system can provide users on the Web with theorem-proving Web services. As to the first issue, we propose MSKML (many-sorted knowledge markup language) as the language for knowledge and problems representation on the Web; as to the second, the theorem-proving server provides ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method of IP traceback for DOS

    Publication Year: 2003, Page(s):762 - 764
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (311 KB) | HTML iconHTML

    We describe a technique for tracing anonymous packet flooding attacks in the Internet back toward their source. In our approach, forwarding nodes (such as routers) log information with probabilistic about traversing packets on the Internet and then use the log data to trace each packet from its final destination back to its source, hop by hop. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sorting networks on a nanocomputing architecture

    Publication Year: 2003, Page(s):784 - 788
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (361 KB) | HTML iconHTML

    Sorting is fundamental in algorithm design. A new architecture, the cell matrix™, is illustrated on which Batcher's sorting networks are realized. The cell matrix™ fits nanocomputers quite well for its reconfigurable structure of homogeneous cells. We introduce the realization and analysis of O-E sorting networks and bitonic-sorting networks on the Cell Matrix™ to show how to pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on Shao's blind signature scheme

    Publication Year: 2003, Page(s):940 - 941
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (209 KB) | HTML iconHTML

    A general attack on Shao's blind signature scheme [Pecora L. M et al. (1990)] is presented. It is pointed out that, in Shao's scheme, the signer can trace the identity of the signature requester, which shows that the Shao's scheme is not really blind. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Web mining for electronic business application

    Publication Year: 2003, Page(s):872 - 876
    Cited by:  Papers (2)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB) | HTML iconHTML

    Electronic business is generating massive amount of data on customer purchases, browsing patterns, usage times and preferences at an increasing rate. Web mining techniques can be applied on all the data being collected for obtaining useful information. We attempt to present issues associated with Web mining for electronic business. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graph transformational approach to the multiprocessor scheduling of iterative computations

    Publication Year: 2003, Page(s):571 - 576
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (431 KB) | HTML iconHTML

    A modular strategy for scheduling iterative computations is proposed. An iterative computation is represented using a cyclic task-graph. The cyclic task-graph is transformed into an acyclic task-graph. This acyclic task-graph is subsequently scheduled using one of the many well-known and high-quality static scheduling strategies from the literature. Graph unfolding is not employed and the generate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The parallel algorithm of 2-D discrete wavelet transform

    Publication Year: 2003, Page(s):738 - 741
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (278 KB) | HTML iconHTML

    We discuss a new parallel algorithm of 2-D discrete wavelet transform (DWT) using MPI_Scatterv and MPI_Gatherv (MPI: Message Passing Interface). Here the 2-D sequential Daubechies discrete wavelet transform program is first decomposed into several 1-D transforms, and then the parallel conversion is made on them. This parallel program has already been successfully implemented on the dawni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A TOA reconstruction method based on ring of scatterers model

    Publication Year: 2003, Page(s):375 - 377
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (289 KB) | HTML iconHTML

    In nonline-of-sight propagation (NLOS) environment, the time of arrival (TOA) measurement is biased by a positive NLOS noise, causing mobile location errors. In order to mitigate the NLOS influence on the location accuracy, a new method is proposed. By discussing the probability density function of NLOS error based on ring of scatterers model, a TOA reconstruction method is introduced. By using th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The non-eye typhoon center locating with parallel computing

    Publication Year: 2003, Page(s):488 - 491
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    A new mathematical morphology-based algorithm is proposed to achieve automatic center location of noneye typhoon. The center of a noneye typhoon is near the geometric center of the cloud system and has higher temperature. For each infrared satellite cloud image, the locating procedures are as follows: a) noises filtering, b) main cloud systems segmenting, c) center locating and d) multispectral im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An agent-based approach for grid computing

    Publication Year: 2003, Page(s):608 - 611
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (409 KB) | HTML iconHTML

    We present an agent-based computational grid (ACG), which applies the concept of computational grid to agents. The ACG system is to implement a uniform higher-level management of the computing resources and services on the grid, and provide users with a consistent and transparent interface for accessing such services. All entities in the grid environment including computing resources and services ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized association rule base mining and its algorithm

    Publication Year: 2003, Page(s):919 - 922
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB) | HTML iconHTML

    Association rule mining is one of the most important research areas in data mining. Yet there exist two big problems in process of acquiring rule by traditional mining algorithms, i.e., the quantity and the quality of rule. Presently there are many methods focus on resolving these two problems. Although these methods can reduce the amount of rules derived to some extent, but the total number is to... View full abstract»

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