The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.

2005

Filter Results

Displaying Results 1 - 25 of 165
  • International program committee

    Publication Year: 2005, Page(s):iv - v
    Request permission for commercial reuse | PDF file iconPDF (539 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conference chairs

    Publication Year: 2005, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (431 KB)
    Freely Available from IEEE
  • Message from the general chair

    Publication Year: 2005, Page(s):i - I
    Request permission for commercial reuse | PDF file iconPDF (527 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message from the program chair

    Publication Year: 2005, Page(s): ii
    Request permission for commercial reuse | PDF file iconPDF (457 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • External reviewers

    Publication Year: 2005, Page(s):vi - vii
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2005, Page(s):viii - xv
    Request permission for commercial reuse | PDF file iconPDF (209 KB)
    Freely Available from IEEE
  • Workshops table of contents

    Publication Year: 2005, Page(s):xvi - xvii
    Request permission for commercial reuse | PDF file iconPDF (99 KB)
    Freely Available from IEEE
  • The microprocessor of the year 2014: do Pentium 4, Pentium M, and Power 5 provide any hints?

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (59 KB) | HTML iconHTML

    Summary form only given. Moore's law continues to thrive, - one billion transistors on each silicon die with a 10 GHz clock is close at hand. But Pentium 4 follow-ons, we are told, have been canceled. Another important chip manufacturer has canceled its top of the line processor. On the other hand, Intel has made some provocative statements with Pentium M. IBM has done likewise with Power 5. Can w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic resource scheduling scheme for CDMA2000 systems

    Publication Year: 2005
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (321 KB) | HTML iconHTML

    Summary form only given. CDMA2000 1xEV-DV has been proposed as one of the global standards of 3G networks, which adopts TDM/CDM and adaptive modulation and coding (AMC) techniques to enhance the data rate up to 3.1 Mbps. Even though the current CDMA 2000 1xEV-DV standard specifies all combinations of the system parameters such as encoder packet size, modulation scheme, the number of time slots per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum lifetime broadcasting in wireless networks

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB) | HTML iconHTML

    Summary form only given. We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree that maximizes the critical energy of the network following the broadcast is developed. Additionally, we propose two new greedy heuristics to construct minimum energy broadcast trees. We show how our... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multivariate statistical analysis for network attacks detection

    Publication Year: 2005
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    Summary form only given. Detection and self-protection against viruses, worms, and network attacks is urgently needed to protect network systems and their applications from catastrophic failures. Once a network component is infected by viruses, worms, or became a target of network attacks, its operational state shifts from normal to abnormal state. Online monitoring mechanism can collect important... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistent graph layout for weighted graphs

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    Summary form only given. In this paper, we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the graph. We introduce tree algorithms and show that they can be successful in solving the problem up to a certain precision. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding maximum-cost minimum spanning trees

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB) | HTML iconHTML

    Summary form only given. Consider the scenario in which a start-up communication company charges its network users by the cost of the minimum spanning tree (MST) they use in their protocols. Wanting to increase their profits, they aim at maximizing the cost of the MST of their network. We consider two different cases. In the first case, the company has a set of links with fixed cost vector W and w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determining all pairs edge connectivity of a 4-regular graph in O(|V|)

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (198 KB) | HTML iconHTML

    Summary form only given. The edge connectivity of a graph G = (V, E) is defined as the function, /spl lambda/: V /spl times/ V /spl rarr/ N, that associates to any pair of vertices (u, v) the maximum number of edge-disjoint paths connecting the two vertices, /spl lambda/(u, v). In this paper, we present a method for determining the function /spl lambda/(u,v) for all vertex pairs in a 4-regular gra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast, effective vertex cover kernelization: a tale of two algorithms

    Publication Year: 2005
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (235 KB) | HTML iconHTML

    Summary form only given. Two kernelization methods for the vertex cover problem are investigated. The first, LP-kernelization has been in prior use and is known to produce predictable results. The second, crown reduction, is newer and faster but generates more variable results. Previously-unknown connections between these powerful methods are established. It is also shown that the problem of findi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RNG-based searching and broadcasting algorithms over Internet graphs and peer-to-peer computing systems

    Publication Year: 2005
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    Summary form only given. In a broadcasting problem, a message is sent from a source to all the other nodes in the network. Blind flooding is a classical mechanism for broadcasting, where each node retransmits received message to all its neighbors. We propose a new broadcasting and searching scheme over the Internet based on generalized relative neighborhood graphs (RNG). Messages are forwarded onl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An all-to-all broadcasting algorithm for faulty hypercubes

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (218 KB) | HTML iconHTML

    Summary form only given. In this paper, for all-to-all broadcasting on an n-dimensional hypercube, the validity of applying a one-to-all broadcasting algorithm at most as many times as the number of nodes in the divided sub-cube is studied. With n + 12 steps, Raghavendra and Sridhar presented a one-to-all broadcasting algorithm on an n-dimensional hypercube with n - 1 faulty nodes. On the other ha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Autonomous resource management and control algorithms for distributed wireless sensor networks

    Publication Year: 2005
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (281 KB) | HTML iconHTML

    Summary form only given. We discuss a novel framework for integrated sensing and resource management in a distributed intelligent sensor network with sensor nodes whose useful active lifetime is significantly shorter than the required lifetime of the sensor system. Past sensor network research has focused on security and communication; but largely ignored the overall dynamic resource management is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification of radiological exams and organs by belief theory

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (210 KB) | HTML iconHTML

    Summary form only given. The emergence of new medical image detectors such as multi-array scanners and the large diffusion of PET-scans has conditioned the modern medical practise. Indeed, the exams are more volumetric and more precise. We develop new medical software that allows us to classify exams. Coupled with a region of interest localization, it improves significantly the diagnosis time. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient partition of state space for parallel reachability analysis

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (141 KB) | HTML iconHTML

    Summary form only given. As the model-checking (which is based on reachability analysis) becomes increasingly used in the industry, there is a big need for efficient new methods to deal with the large real-size designs. This paper presents a novel method for improving the performance of reachability analysis using parallelization techniques. We propose a new method for partitioning the large state... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Acyclic circuit partitioning for path delay fault emulation

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (169 KB) | HTML iconHTML

    Summary form only given. Acyclic partitioning of VLSI circuits is studied under area/delay, 1-0 size and communication constraints. In this paper, we define the path-delay-fault emulation problem which adds a new constraint, viz. path count constraint, to partitioning problem. We present two algorithms to solve the problem. The first algorithm decomposes a circuit into entirely-fanout-free cones (... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On sparse matrix-vector product optimization

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (182 KB) | HTML iconHTML

    Summary form only given. Sparse matrices are matrices having a large number of zero elements. When such matrices are used, both computing time and memory space may be dramatically reduced by taking into account their sparsity. It is well known that the sparse matrix-vector product (SMVP) where the matrix is sparse and the vector is dense is an important kernel in many scientific applications e.g. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reusability metrics for software components

    Publication Year: 2005
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (209 KB) | HTML iconHTML

    Summary form only given. Assessing the reusability, adaptability, compose-ability and flexibility of software components is more and more of a necessity due to the growing popularity of component based software development (CBSD). Even if there are some metrics defined for the reusability of object-oriented software (OOS), they cannot be used for CBSD because these metrics require analysis of sour... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for selecting materialized views in a data warehouse

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (322 KB) | HTML iconHTML

    Summary form only given. A data warehouse stores materialized views of data from one or more sources, for the purpose of efficiently implementing decision-support or OLAP queries. One of the most important decisions in designing a DW is the selection of materialized views to be maintained at the warehouse. The goal is to select an appropriate set of views so that the sum cost of processing set of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic construction of multidimensional schema from OLAP requirements

    Publication Year: 2005
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB) | HTML iconHTML

    Summary form only given. The manual design of data warehouse and data mart schemes can be a tedious, error-prone, and time-consuming task. In addition, it is a highly complex engineering task that calls for methodological support. This paper lays the grounds for an automatic generation approach of multidimensional schemes. It first defines a tabular format for OLAP requirements. Secondly, it prese... View full abstract»

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