this paper presents an overview of the initiative based on non-commercial software, which is being carried out in the University of La Rioja, to develop an e-Science and e-Learning Web-Site withthe aim to encourage o...
详细信息
this paper presents an overview of the initiative based on non-commercial software, which is being carried out in the University of La Rioja, to develop an e-Science and e-Learning Web-Site withthe aim to encourage open science and e-Collaboration. this infrastructure is focused on supplying free access to a variety of symbolic and numeric applications related to Dynamics Systems, in general, and Astrodynamics, in particular, as well as their theoretical backgrounds.
N-dimensional discrete objects can be interpreted as cubical complexes which are suitable for the study of their homology groups in order to understand the original discrete object. the classic approach consists in co...
详细信息
N-dimensional discrete objects can be interpreted as cubical complexes which are suitable for the study of their homology groups in order to understand the original discrete object. the classic approach consists in computingthe Normal Smith Form of some matrices associated to the cubical complex. Further approaches deal mainly with a pre-processing of the matrices in order to reduce their size. In this paper we propose a new approach, initially based on Discrete Morse theory, which computes some homological information (Betti numbers and representative cycles) without calculating the Normal Smith Form. It works on any dimension, and it can also be applied to any kind of regular cell complex.
Our proposal aims an automatic method used for obtaining the ultrasound image of a region of interest based on the optical flow computation. Combined with a kernel correlation filter tracking algorithm and a Xception ...
详细信息
Our proposal aims an automatic method used for obtaining the ultrasound image of a region of interest based on the optical flow computation. Combined with a kernel correlation filter tracking algorithm and a Xception deep convolutional neural network architecture, our solution provides state-of-the-art results (over 90% accuracy) in the automatic diagnosis of liver lesion using contrast enhanced ultrasound.
We report on successfully porting and making available online Tarski, a system for computing with Tarski formulas (Boolean combinations of polynomial sign conditions over the real numbers). Tarski provides operations ...
详细信息
We report on successfully porting and making available online Tarski, a system for computing with Tarski formulas (Boolean combinations of polynomial sign conditions over the real numbers). Tarski provides operations like formula simplification and quantifier elimination, and is able to read and write SMT-LIB syntax. the web version of Tarski was created by using the Emscripten C++ to JavaScript/WebAssembly compiler. A terminal-based interpreter is provided via ***. Tarski is also available as a JavaScript library. We report on an experimental use in the dynamic geometry software GeoGebra.
Evolutionary algorithms for multimodal optimization are usually radius dependent in subpopulation formation and dynamics. the appropriate setting of a value to cover such a fluctuant threshold (as a result of variousl...
详细信息
Evolutionary algorithms for multimodal optimization are usually radius dependent in subpopulation formation and dynamics. the appropriate setting of a value to cover such a fluctuant threshold (as a result of variously shaped attraction basins) strongly relies upon the knowledge on the problem at hand or the extensive skill in manual parameter tuning. If several thresholds model the disposal of species withthe many attraction basins, radii setting significantly increases in complexity. Genetic chromodynamics is one such recent, competent technique, whose performance is practically affected by the existence of such key parameters. It is hence the purpose of present paper to present an enhanced alternative to radii maintenance within this method, by embedding a mechanism to examine the fitness landscape and detect the attractors, around which these species revolve.
this paper proposes two nature-inspired algorithms to solve the triangle-densest-k-subgraph problem, and compares and contrasts their results. this is one of the less studied problems in computational graph theory tha...
详细信息
ISBN:
(数字)9798331532833
ISBN:
(纸本)9798331532840
this paper proposes two nature-inspired algorithms to solve the triangle-densest-k-subgraph problem, and compares and contrasts their results. this is one of the less studied problems in computational graph theory that can be reasonably solved with at least one of the proposed algorithms even without specific improvements made to them.
We investigate the distribution of cells by dimension in cylindrical algebraic decompositions (CADs). We find that they follow a standard distribution which seems largely independent of the underlying problem or CAD a...
详细信息
We investigate the distribution of cells by dimension in cylindrical algebraic decompositions (CADs). We find that they follow a standard distribution which seems largely independent of the underlying problem or CAD algorithm used. Rather, the distribution is inherent to the cylindrical structure and determined mostly by the number of variables. this insight is then combined with an algorithm that produces only full-dimensional cells to give an accurate method of predicting the number of cells in a complete CAD. Since constructing only full-dimensional cells is relatively inexpensive (involving no costly algebraic number calculations) this leads to heuristics for helping with various questions of problem formulation for CAD, such as choosing an optimal variable ordering. Our experiments demonstrate that this approach can be highly effective.
the goal of this paper is to develop a fault tolerant Grid Intrusion Detection System. the architecture is based on a network of high level detection systems which receive intrusion information form local detectors. T...
详细信息
the goal of this paper is to develop a fault tolerant Grid Intrusion Detection System. the architecture is based on a network of high level detection systems which receive intrusion information form local detectors. these high level detectors constantly exchange information using gossip algorithms and correlate the data received received from the local level to detect complex attacks targeted at different parts of a Grid or at certain running applications. the detection system includes new and innovative methods to link intrusion information as well as coordination between different detection systems. the design of the system is also focused on reliability so in case any component crashes, the remaining ones will automatically cover the exposed resources and the system will survive without any loss of efficiency.
Various methodologies to model and analyze timed and hybrid systems using SAL are reported. We assume that the system is specified as a network of timed/hybrid automata with synchronized transitions and urgency. We sh...
详细信息
Various methodologies to model and analyze timed and hybrid systems using SAL are reported. We assume that the system is specified as a network of timed/hybrid automata with synchronized transitions and urgency. We show how to translate the system into a SAL model withthe time domain being either discrete or dense, and the clocks being either saturated or unsaturated. Depending on these choices, various tools provided by SAL to model check reachability properties over the system are used to establish safety properties of timed systems. We profile the performance of these tools with a comparative study.
Many applications have modules which could benefit greatly from the massive parallel numericcomputing power provided by GPUs. Renderers, signal processing or simulators are only a few such applications. Due to the we...
详细信息
Many applications have modules which could benefit greatly from the massive parallel numericcomputing power provided by GPUs. Renderers, signal processing or simulators are only a few such applications. Due to the weaknesses of the GPUs such as stackless execution model or poor capabilities for pointer exchange withthe host, sometimes is not feasible to convert an entire algorithm for GPU, even if it is highly parallel and some of its parts can be greatly accelerated on GPU. In such situations a programmer should have a framework which allows him to split the code flow of a thread in parts and each of these parts will run on the most suitable computing resource, CPU or GPU. For GPU execution, multiple data from host threads will be collected, run on GPU and the results returned to the original threads so they will be able to resume execution on host. In this paper we propose such an algorithm, analyze it and evaluate its practical results.
暂无评论