Showing papers in "Journal of Computational Science in 2011"

TL;DR: This work investigates whether measurements of collective mood states derived from large-scale Twitter feeds are correlated to the value of the Dow Jones Industrial Average (DJIA) over time and indicates that the accuracy of DJIA predictions can be significantly improved by the inclusion of specific public mood dimensions but not others.

TL;DR: The software designs realizing the major goal of the WaLBerla framework, a good balance between expandability and scalable, highly optimized, hardware-dependent, special purpose kernels, are described.

TL;DR: In this article, a complex automata model for in-stent restenosis, coupling bulk flow, drug diffusion, and smooth muscle cell models, all operating on different time scales, is presented.

TL;DR: The findings show that: (i) multidimensional hubs do exist and their characterization yields interesting insights and (ii) it is possible to detect the most influential dimensions that cause the different hub behaviors.

TL;DR: In this article, the iterative Jacobi and Gauss-Seidel smoothers are used to reduce the pressure on the memory bus for parallel execution of stochastic computations on cache-based multicore architectures.

TL;DR: This work presents an analytically exact spiral scheme for generating a highly uniform distribution of points on the unit sphere and aims to serve as an initial solution (with random perturbation) for the electrostatic repulsion scheme.

TL;DR: This work will present a simple deterministic scheme to generate nearly uniform point sets with antipodal symmetry, which is of special importance to many scientific and engineering applications.

TL;DR: A novel measure, viral conductance (VC), to assess the robustness of complex networks with respect to the spread of SIS epidemics, which incorporates the fraction of infected nodes at steady state for all possible effective infection strengths.

TL;DR: It is concluded that there are significant differences between the Healthy and Epileptic Signals in the designed method than the GFD through graphical and statistical tools.

TL;DR: The software design of MarDyn supports testing and comparing of various methods in all parts of the program, which is on the one hand a pure MPI parallelisation and on the other hand a hybrid approach using MPI in combination with a memory-coupled parallelisation.

TL;DR: A case study on the ongoing endeavor of improving and developing library software for the parallel computation of eigenvalues for dense symmetric matrices, driven by fields of application such as quantum chemistry is presented.

TL;DR: In this paper, the authors present a computationally efficient methodology for the optimization of climate model parameters applied to a (one-dimensional) representative of a class of marine ecosystem models, using a response correction technique to create a surrogate from a temporarily coarser discretized physics-based low-fidelity model.

TL;DR: This work combines the Lattice-Boltzmann method with fluid-structure interaction techniques in order to achieve real-time simulations targeting interactive virtual environments and demonstrates that recent multi-core CPUs outperform the Cell BE, while GPUs are significantly faster than conventional multi-threaded SSE code.

TL;DR: The results identify the threshold where positive influences on a population reduce the number of high-rate offenders in the community and further the knowledge about the social influences in a high-risk community and how these influences can effect decisions on offender management.

TL;DR: The highly scalable parallel tree code PEPC for rapid computation of long-range Coulomb forces is presented and more serious limitations of the original locally essential tree concept of Salmon and Warren, which ultimately lead to a failure in memory scaling, are identified and analyzed rigorously.

TL;DR: A critical investigation into computational models developed for studying the spread of communicable disease is presented and a spatially explicit micro-meso-macro model for the e-commerce sector is presented.

TL;DR: This research examines the effects of size of a hospital and the time that the social computing platform has been in existence on extensivity and intensivity.

TL;DR: The obtained results show that, macro–microcrack spacing is an important parameter if the microscopic cracks is relatively close to the macrocrack tip, and for an inclined microcrack configuration, the interaction becomes significant and cannot be neglected.

TL;DR: It is found that randomly generated test input is a viable approach to testing for code mistakes and that simple structural metrics have little predictive power in the type of testing required.

TL;DR: Global error control of the time-propagation for the Schrodinger equation with a time-dependent Hamiltonian with global error control.

TL;DR: PDEs are modeled by an electrical equivalent circuit generated from the equations arising from the finite element method (FEM), which allows the solution of PDEs to be obtained through circuit simulation.

TL;DR: The analysis of α reverse and RKD processes shows information diffusion irreversibility in small-world and scale-free but not in random networks, and shows that random networks are more stable toward attacks, resulting a complete information diffusion process over the entire network.

TL;DR: The Steinberg hypothesis allows the world view of specific people to be more accurately modelled; this will allow greater understanding of a person's discourse, either by someone else or automatically by a computer.

TL;DR: The core routines of the scattering suite “ADDA” are ported to the open computing language (OpenCL), a framework for programming parallel devices like PC graphics cards (graphics processing units, GPUs) or multi-core CPUs to allow calculating the scattering properties even of large cloud ice particles.

TL;DR: It is shown that distributed object allocation problem in DCE with an objective to allocate objects over different servers so that the number of inter-server communications can be minimized is similar to the graph bisection problem.

TL;DR: The results demonstrate a successful estimation of the inflow velocity by different optimization algorithms and a reduction of the time to evaluate the objective of the parameter estimation by a factor of roughly 27 using 40 processes.

TL;DR: A homophily probability evaluating the tendency of blogs to cite blogs from the same community is defined, and the notion of community distance is introduced to capture whether a blog cites (or is cited by) blogs distant or not from its community.

TL;DR: A benchmark from fluid dynamics is used to demonstrate that the performance of the suggested agglomeration scheme comes much closer to the desired behaviour of the ideal multigrid than that of alternatives described in the literature.

TL;DR: A model of spatial pattern formation of electoral preferences is presented, such that in nearby areas citizens tend to vote for the same candidate whereas in geographically distant areas the most voted candidate is that whose political position is distant to the latter.

TL;DR: The concept of terminal graph (t-graph for short), which improves on the concept of graph as a unifying principle for the representation and computational synthesis and inference of technological and biological networks, is introduced.