Search results for "Scalability"
showing 10 items of 221 documents
SVG rendering for internet imaging
2006
The SVG (scalable vector graphics) standard allows representing complex graphical scenes by a collection of graphic vectorial-based primitives, offering several advantages with respect to classical raster images such as: scalability, resolution independence, etc. In this paper we present a full comparison between some advanced raster to SVG algorithms: SWaterG, SVGenie, SVGWave and some commercial tools. SWaterG works by a watershed decomposition coupled with some ad-hoc heuristics, SVGenie and SVGWave use a polygonalization based respectively on data dependent and wavelet triangulation. The results obtained by SWaterG, SVGenie and SVGWave are satisfactory both in terms of perceptual measur…
CoCoDat: a database system for organizing and selecting quantitative data on single neurons and neuronal microcircuitry.
2004
We present a novel database system for organizing and selecting quantitative experimental data on single neurons and neuronal microcircuitry that has proven useful for reference-keeping, experimental planning and computational modelling. Building on our previous experience with large neuroscientific databases, the system takes into account the diversity and method-dependence of single cell and microcircuitry data and provides tools for entering and retrieving published data without a priori interpretation or summarizing. Data representation is based on the framework suggested by biophysical theory and enables flexible combinations of data on membrane conductances, ionic and synaptic current…
Programmable linear quantum networks with a multimode fibre
2019
Reconfigurable quantum circuits are fundamental building blocks for the implementation of scalable quantum technologies. Their implementation has been pursued in linear optics through the engineering of sophisticated interferometers. While such optical networks have been successful in demonstrating the control of small-scale quantum circuits, scaling up to larger dimensions poses significant challenges. Here, we demonstrate a potentially scalable route towards reconfigurable optical networks based on the use of a multimode fibre and advanced wavefront-shaping techniques. We program networks involving spatial and polarisation modes of the fibre and experimentally validate the accuracy and ro…
A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows
2009
This paper presents an efficient and well-scalable metaheuristic for fleet size and mix vehicle routing with time windows. The suggested solution method combines the strengths of well-known threshold accepting and guided local search metaheuristics to guide a set of four local search heuristics. The computational tests were done using the benchmarks of [Liu, F.-H., & Shen, S.-Y. (1999). The fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research Society, 50(7), 721-732] and 600 new benchmark problems suggested in this paper. The results indicate that the suggested method is competitive and scales almost linearly up to instances with 1000 custome…
Numerical experiments with a parallel fast direct elliptic solver on Cray T3E
1997
A parallel fast direct O(N log N) solver is shortly described for linear systems with separable block tridiagonal matrices. A good parallel scalability of the proposed method is demonstrated on a Cray T3E parallel computer using MPI in communication. Also, the sequential performance is compared with the well-known BLKTRI-implementation of the generalized. cyclic reduction method using a single processor of Cray T3E.
Parallelization strategies for density matrix renormalization group algorithms on shared-memory systems
2003
Shared-memory parallelization (SMP) strategies for density matrix renormalization group (DMRG) algorithms enable the treatment of complex systems in solid state physics. We present two different approaches by which parallelization of the standard DMRG algorithm can be accomplished in an efficient way. The methods are illustrated with DMRG calculations of the two-dimensional Hubbard model and the one-dimensional Holstein-Hubbard model on contemporary SMP architectures. The parallelized code shows good scalability up to at least eight processors and allows us to solve problems which exceed the capability of sequential DMRG calculations.
A Support Vector Domain Description Approach to Supervised Classification of Remote Sensing Images
2007
This paper addresses the problem of supervised classification of remote sensing images in the presence of incomplete (nonexhaustive) training sets. The problem is analyzed according to two different perspectives: 1) description and recognition of a specific land-cover class by using single-class classifiers and 2) solution of multiclass problems with single-class classification techniques. In this framework, we analyze different one-class classifiers and introduce in the remote sensing community the support vector domain description method (SVDD). The SVDD is a kernel-based method that exhibits intrinsic regularization ability and robustness versus low numbers of high-dimensional samples. T…
A comparative study of partitioning methods for crowd simulations
2010
The simulation of large crowds of autonomous agents with realistic behavior is still a challenge for several computer research communities. In order to handle large crowds, some scalable architectures have been proposed. Nevertheless, the effective use of distributed systems requires the use of partitioning methods that can properly distribute the workload generated by agents among the existing distributed resources. In this paper, we analyze the use of irregular shape regions (convex hulls) for solving the partitioning problem. We have compared a partitioning method based on convex hulls with two techniques that use rectangular regions. The performance evaluation results show that the conv…
Cell-List based Molecular Dynamics on Many-Core Processors: A Case Study on Sunway TaihuLight Supercomputer
2020
Molecular dynamics (MD) simulations are playing an increasingly important role in several research areas. The most frequently used potentials in MD simulations are pair-wise potentials. Due to the memory wall, computing pair-wise potentials on many-core processors are usually memory bounded. In this paper, we take the SW26010 processor as an exemplary platform to explore the possibility to break the memory bottleneck by improving data reusage via cell-list-based methods. We use cell-lists instead of neighbor-lists in the potential computation, and apply a number of novel optimization methods. Theses methods include: an adaptive replica arrangement strategy, a parameter profile data structur…
Analyzing Large-Scale Crowd Simulations for Building Evacuation
2010
Animated virtual crowds have been used last years for analyzing human factors in scenarios where masses of people gather. A typical example is building evacuation in case of fire. Scalability still remains as an open issue for these multiagent systems applications. In this paper, we use a scalable architecture to simulate a large-scale version of a virtual crowd in a building evacuation. From the social point of view, the results provided by the large-scale version of the crowd add new and crucial information about the agents behavior, emphasizing the need for a small amount of trained leaders in order to save lives. From the system point of view, the results show that the trend of avatars …