Search results for "Data type"
showing 10 items of 1183 documents
Evaluation of the Measuring Active Drag system usability: An important step for its integration into training sessions
2010
This paper is the first stage of an iterative process aiming at the (re)design of a training device for swimming. The purpose of this study was to evaluate the usability of the Measuring Active Drag (MAD) system, a technical device for biomechanical evaluation and performance analysis. To do so, this study examines real activity of elite swimmers using this system. It was conducted within an activity-centred approach: the course-of-action technological research programme. Three international male swimmers volunteered to participate in the study. Two types of data were collected: (a) video recordings, and (b) verbalisations during post-protocol interviews. The data were processed in two step…
Publication Data Integration as a Tool for Excellence-Based Research Analysis at the University of Latvia
2017
The evaluation of research results can be carried out with different purposes aligned with strategic goals of an institution, for example, to decide upon distribution of research funding or to recruit or promote employees of an institution involved in research. Whereas quantitative measures such as number of scientific papers or number of scientific staff are commonly used for such evaluation, the strategy of the institution can be set to achieve ambitious scientific goals. Therefore, a question arises as to how more quality oriented aspects of the research outcomes should be measured. To supply an appropriate dataset for evaluation of both types of metrics, a suitable framework should be p…
Parallel fractional correlation: an optical implementation
2008
An optical setup to obtain all the fractional correlations of a one-dimensional input in a single display is implemented. The system works as a multichannel parallel correlator for a continuous set of fractional orders and presents a variable shift variance. Some experimental results together with computer simulations are performed to illustrate the performance of our proposal.
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…
Handling local concept drift with dynamic integration of classifiers : domain of antibiotic resistance in nosocomial infections
2006
In the real world concepts and data distributions are often not stable but change with time. This problem, known as concept drift, complicates the task of learning a model from data and requires special approaches, different from commonly used techniques, which treat arriving instances as equally important contributors to the target concept. Among the most popular and effective approaches to handle concept drift is ensemble learning, where a set of models built over different time periods is maintained and the best model is selected or the predictions of models are combined. In this paper we consider the use of an ensemble integration technique that helps to better handle concept drift at t…
Speeding up of microstructure reconstruction: I. Application to labyrinth patterns
2011
Recently, entropic descriptors based the Monte Carlo hybrid reconstruction of the microstructure of a binary/greyscale pattern has been proposed (Piasecki 2011 Proc. R. Soc. A 467 806). We try to speed up this method applied in this instance to the reconstruction of a binary labyrinth target. Instead of a random configuration, we propose to start with a suitable synthetic pattern created by cellular automaton. The occurrence of the characteristic attributes of the target is the key factor for reducing the computational cost that can be measured by the total number of MC steps required. For the same set of basic parameters, we investigated the following simulation scenarios: the biased/rando…
Extracting modular-based backbones in weighted networks
2021
Abstract Networks are an adequate representation for modeling and analyzing a great variety of complex systems. However, understanding networks with millions of nodes and billions of connections can be pretty challenging due to memory and time constraints. Therefore, selecting the relevant nodes and edges of these large-scale networks while preserving their core information is a major issue. In most cases, the so-called backbone extraction methods are based either on coarse-graining or filtering approaches. Coarse-graining techniques reduce the network size by gathering similar nodes into super-nodes, while filter-based methods eliminate nodes or edges according to a statistical property.In…
Separation properties of continuous maps in codimension 1 and geometrical applications
1992
Abstract Nuno Ballesteros, J.J. and M.C. Romero Fuster, Separation properties of continuous maps in codimension 1 and geometrical applications, Topology and its Applications 46 (1992) 107-111. We show that the image of a proper closed continuous map, f , from an n -manifold X to an ( n + 1)-manifold Y , such that H 1 (Y; Z 2 ) =0 , separates Y into at least two connected components provided the self-intersections set of f is not dense in any connected component of Y . We also obtain some geometrical applications.
Numerical decomposition of geometric constraints
2005
Geometric constraint solving is a key issue in CAD/CAM. Since Owen's seminal paper, solvers typically use graph based decomposition methods. However, these methods become difficult to implement in 3D and are misled by geometric theorems. We extend the Numerical Probabilistic Method (NPM), well known in rigidity theory, to more general kinds of constraints and show that NPM can also decompose a system into rigid subsystems. Classical NPM studies the structure of the Jacobian at a random (or generic) configuration. The variant we are proposing does not consider a random configuration, but a configuration similar to the unknown one. Similar means the configuration fulfills the same set of inci…
Memetic Algorithms in Continuous Optimization
2012
Intuitively, a set is considered to be discrete if it is composed of isolated elements, whereas it is considered to be continuous if it is composed of infinite and contiguous elements and does not contain “holes”.