Search results for "Computation"
showing 10 items of 7362 documents
Swarming Models for Facilitating Collaborative Decisions
2010
The paper highlights the computational power of swarming models (i.e., stigmergic mechanisms) to build collaborative support systems for complex cognitive tasks such as facilitation of group decision processes (GDP) in e-meetings. Unlike traditional approaches that minimize the cognitive complexity by incorporating the facilitation knowledge into the system, stigmergic coordination mechanisms minimize the complexity by providing the system with emergent functionalities that are shaped by the environment itself through the possibility to structure it in terms of high-level cognitive artefacts. This is illustrated by conducting a socio-simulation experiment for an envisioned collaborative sof…
Blow-up collocation solutions of nonlinear homogeneous Volterra integral equations
2011
In this paper, collocation methods are used for detecting blow-up solutions of nonlinear homogeneous Volterra-Hammerstein integral equations. To do this, we introduce the concept of "blow-up collocation solution" and analyze numerically some blow-up time estimates using collocation methods in particular examples where previous results about existence and uniqueness can be applied. Finally, we discuss the relationships between necessary conditions for blow-up of collocation solutions and exact solutions.
Collocation Method for Linear BVPs via B-spline Based Fuzzy Transform
2018
The paper is devoted to an application of a modified F-transform technique based on B-splines in solving linear boundary value problems via the collocation method. An approximate solution is sought as a composite F-transform of a discrete function (which allows the solution to be compactly stored as the values of this discrete function). We demonstrate the effectiveness of the described technique with numerical examples, compare it with other methods and propose theoretical results on the order of approximation when the fuzzy partition is based on cubic B-splines.
A comparison analysis between unsymmetric and symmetric radial basis function collocation methods for the numerical solution of partial differential …
2002
Abstract In this article, we present a thorough numerical comparison between unsymmetric and symmetric radial basis function collocation methods for the numerical solution of boundary value problems for partial differential equations. A series of test examples was solved with these two schemes, different problems with different type of governing equations, and boundary conditions. Particular emphasis was paid to the ability of these schemes to solve the steady-state convection-diffusion equation at high values of the Peclet number. From the examples tested in this work, it was observed that the system of algebraic equations obtained with the symmetric method was in general simpler to solve …
Toward an Understanding of Molecular Mechanism of Domino Cycloadditions. Density Functional Theory Study of the Reaction between Hexafluorobut-2-yne …
1998
Color and Flow Based Superpixels for 3D Geometry Respecting Meshing
2014
We present an adaptive weight based superpixel segmentation method for the goal of creating mesh representation that respects the 3D scene structure. We propose a new fusion framework which employs both dense optical flow and color images to compute the probability of boundaries. The main contribution of this work is that we introduce a new color and optical flow pixel-wise weighting model that takes into account the non-linear error distribution of the depth estimation from optical flow. Experiments show that our method is better than the other state-of-art methods in terms of smaller error in the final produced mesh.
On the uniform sampling of CIELAB color space and the number of discernible colors
2013
This paper presents a useful algorithmic strategy to sample uniformly the CIELAB color space based on close packed hexagonal grid. This sampling scheme has been used successfully in different research works from computational color science to color image processing. The main objective of this paper is to demonstrate the relevance and the accuracy of the hexagonal grid sampling method applied to the CIELAB color space. The second objective of this paper is to show that the number of color samples computed depends on the application and on the color gamut boundary considered. As demonstration, we use this sampling to support a discussion on the number of discernible colors related to a JND.
Tabu search for min-max edge crossing in graphs
2020
Abstract Graph drawing is a key issue in the field of data analysis, given the ever-growing amount of information available today that require the use of automatic tools to represent it. Graph Drawing Problems (GDP) are hard combinatorial problems whose applications have been widely relevant in fields such as social network analysis and project management. While classically in GDPs the main aesthetic concern is related to the minimization of the total sum of crossing in the graph (min-sum), in this paper we focus on a particular variant of the problem, the Min-Max GDP, consisting in the minimization of the maximum crossing among all egdes. Recently proposed in scientific literature, the Min…
Languages with mismatches
2007
AbstractIn this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S an…
The Bohr Radius of a Banach Space
2009
Following the scalar-valued case considered by Djakow and Ramanujan (A remark on Bohr’s theorem and its generalizations 14:175–178, 2000) we introduce, for each complex Banach space X and each \(1\le p0\). We study the p-Bohr radius of the Lebesgue spaces \(L^q(\mu )\) for different values of p and q. In particular we show that \(r_p(L^q(\mu ))=0\) whenever \(p<2\) and \(dim(L^q(\mu ))\ge 2\) and \(r_p(L^q(\mu ))=1\) whenever \(p\ge 2\) and \(p'\le q\le p\). We also provide some lower estimates for \(r_2(L^q(\mu ))\) for the values \(1\le q<2\).