Titlebook: Computational Science and Its Applications - ICCSA 2003; International Confer Vipin Kumar,Marina L. Gavrilova,Pierre L’Ecuyer Conference pr

滑動

Type-1-Diabetes

Improvements to the Helpful-Set Algorithm and a New Evaluation Scheme for Graph-Partitionersgorithm and a local refinement heuristic has proven to be a powerful method, and several libraries exist providing such an implementation. Due to the large involvement of heuristics, the evaluation of these libraries is usually based on experiments. In this paper we show that single experiments are

Catheter

Mesh Partitioners for Computational Grids: A Comparisonbuted, mesh-based applications may require a mesh partitioner that considers both processor and network heterogeneity. We have developed a heterogeneous mesh partitioner, called PaGrid. PaGrid uses a multilevel graph partitioning approach, augmented by execution time load balancing in the final unco

Gourmet

CONFIIT: A Middleware for Peer to Peer Computing peer-to-peer environment designed to compute FIIT problems. This Java written middleware aims at setting a logical ring organization for network’s resources, such as PCs, workstations or parallel architectures. It also offers a low-cost communication solution to share, and compute, the different ta

Initiative

Axon895

Venules

A Modular Architecture for Distributed IDS in MANETnvironment. The main feature of our proposition relies on the use, on each node of the MANET, of a local IDS (LIDS) cooperating with other LIDSes through the use of mobile agents. The modular design is needed as a response to the extensibility requirements related to the complex contexts of MANET. T

otic-capsule

Characterization of the Security Implications of Alternative E-procurement Topologiestions. In order to establish these alternative topologies we consider how the two main participants (buyer and supplier) could access to the e-procurement solution (i.e. through the Internet or through a Virtual Private Network — VPN-). From the point of view of the buyer, we consider two main possi

卡死偷電

跑過

On the Number of Equivalence Classes in Certain Stream Ciphersrepresentation. The aim is to get some knowledge about the different nonlinear filter equivalence classes, where these filters are partitioned according to cyclic shift and conjugacy. This equivalence also indicates an identical linear complexity for all sequences in the same equivalence class. The