Search results for "Discrete"

Apprentissage implicite de régularités : Mise en évidence d'une différence d'apprentissage entre tâches motrices continues et discrètes

2005

This research is concerned with the implicit learning of regularities in continuous motor tasks (e.g., tracking tasks) and discrete tasks (e.g., Serial Reaction Time tasks). First, a reanalysis of Wulf and collaborator's studies, dealing with implicit motor learning, made it possible to highlight methodological problems and potential biases that provide alternative explanations for the apparent implicit learning obtained in their continuous tracking experiments. Indeed, by respecting a more rigorous methodology, it appears that it is quite difficult to obtain such learning in a continuous task. This led us to try to understand why it was easier to draw benefit from a repetition in a discret…

Optimal recovery of a radiating source with multiple frequencies along one line

2020

We study an inverse problem where an unknown radiating source is observed with collimated detectors along a single line and the medium has a known attenuation. The research is motivated by applications in SPECT and beam hardening. If measurements are carried out with frequencies ranging in an open set, we show that the source density is uniquely determined by these measurements up to averaging over levelsets of the integrated attenuation. This leads to a generalized Laplace transform. We also discuss some numerical approaches and demonstrate the results with several examples.

The b-chromatic number of power graphs

2003

The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant x_i adjacent to a vertex of every color j, 1 ≤ j ≠ i ≤ k. In this paper, we discuss the b-chromatic number of some power graphs. We give the exact value of the b-chromatic number of power paths and power complete binary trees, and we bound the b-chromatic number of power cycles.

A simulation function approach for best proximity point and variational inequality problems

2017

We study sufficient conditions for existence of solutions to the global optimization problem min(x is an element of A) d(x, fx), where A, B are nonempty subsets of a metric space (X, d) and f : A -> B belongs to the class of proximal simulative contraction mappings. Our results unify, improve and generalize various comparable results in the existing literature on this topic. As an application of the obtained theorems, we give some solvability theorems of a variational inequality problem.

Unification of Graphs and Relations in Mizar

2020

Summary A (di)graph without parallel edges can simply be represented by a binary relation of the vertices and on the other hand, any binary relation can be expressed as such a graph. In this article, this correspondence is formalized in the Mizar system [2], based on the formalization of graphs in [6] and relations in [11], [12]. Notably, a new definition of createGraph will be given, taking only a non empty set V and a binary relation E ⊆ V × V to create a (di)graph without parallel edges, which will provide to be very useful in future articles.

Simulation of granular organic fertilizer application by centrifugal spreader

2021

There is no specialized equipment designed to spread granular cylindrical organic fertilizer in the soil. There are also no rational recommendations available on how to spread this type of fertilizer. Mineral fertilizer spreaders are most often used for spreading granulated organic fertilizer. However, these fertilizers are significantly different from mineral fertilizers. Due to these differences, organic granular fertilizers often are spread unevenly, and the fertilizer does not reach the required working width. Furthermore, the rate of spreading is not accurate, and the fertilizer is often crushed too much. The objective of this research is to develop a simulation model for granular orga…

Business-to-business service quality assessment in professional wine events: the case of Vinitaly

2014

Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.

1996

A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT’s in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from −1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT are discussed.

A Digital Watermarking Algorithm Based on Quantization of the DCT: Application on Medical Imaging

2013

International audience; The objective of this paper is to elaborate a new watermarking algorithm applied to the medical imaging. This algorithm must be invisible, robust and has a rate, relatively high, integrating data. The proposed method uses the standard JPEG compression for the integration of medical data. The insertion block is inserted just after the quantization phase. To control identification and eventually the correction (if possible) of the inserted data, we use a series of turbocodes to recover the inserted data, after application of several attacks. The simulation studies are applied on MRI medicals images.

A particle based simulation model for glacier dynamics

2013

This publication is contribution number 22 of the Nordic Centre of Excellence SVALI, “Stability and Variations of Arctic Land Ice”, funded by the Nordic Top-level Research Initiative (TRI). The work has been supported by the SVALI project through the University of Lapland, Arctic Centre, and through the University Centre in Svalbard. Funding was also provided by the Conoco-Phillips and Lunding High North Research Program (CRIOS: Calving Rates and Impact on Society). A particle-based computer simulation model was developed for investigating the dynamics of glaciers. In the model, large ice bodies are made of discrete elastic particles which are bound together by massless elastic beams. These…