Search results for "methodologie"
showing 10 items of 2141 documents
Systematic implementation of higher order Whitney forms in methods based on discrete exterior calculus
2022
AbstractWe present a systematic way to implement higher order Whitney forms in numerical methods based on discrete exterior calculus. Given a simplicial mesh, we first refine the mesh into smaller simplices which can be used to define higher order Whitney forms. Cochains on this refined mesh can then be interpolated using higher order Whitney forms. Hence, when the refined mesh is used with methods based on discrete exterior calculus, the solution can be expressed as a higher order Whitney form. We present algorithms for the three required steps: refining the mesh, solving the coefficients of the interpolant, and evaluating the interpolant at a given point. With our algorithms, the order of…
Algebraic singularities have maximal reductive automorphism groups
1989
LetX = On/ibe an analytic singularity where ṫ is an ideal of theC-algebraOnof germs of analytic functions on (Cn, 0). Letdenote the maximal ideal ofXandA= AutXits group of automorphisms. An abstract subgroupequipped with the structure of an algebraic group is calledalgebraic subgroupofAif the natural representations ofGon all “higher cotangent spaces”are rational. Letπbe the representation ofAon the first cotangent spaceandA1=π(A).
HDR-ARtiSt: a FPGA-based Smart Camera for High Dynamic Range color video from multiple exposures
2014
International audience; A camera is able to capture only a part of a high dynamic range scene information. The same scene can be fully perceived by the human visual system. This is true especially for real scenes where the difference in light intensity between the dark areas and bright areas is high. The imaging technique which can overcome this problem is called HDR (High Dynamic Range). It produces images from a set of multiple LDR images (Low Dynamic Range), captured with different exposure times. This technique appears as one of the most appropriate and a cheap solution to enhance the dynamic range of captured environments. We developed an FPGA-based smart camera that produces a HDR liv…
UNE APPROCHE PARALLELE D'EVALUATION DES PARAMETRES DE TEXTURE POUR L'ANALYSE D'IMAGES DE GRANDE TAILLE
2011
International audience; The main objective of this paper is to develop a new image processing technique that could better be adapted to the processing of large and complex images, especially SAR images, in relation to the former methods of our works. We propose here a new approach of textural parameters evaluation which is about (Ng+1)n-1 times faster than the co-occurrence matrix approach considered as classical, where n is the order of the textural parameter and Ng being the maximum grey level in the image. This approach is based on a new modeling of textural parameters of a generic order n>1 equivalent to the classical formulation, but which is no longer based on frequency matrix (co-occ…
Implementation of participatory sensing approach in mobile vehicle based sensor networks
2013
In this paper author describes his research with the goal to develop and experimentally verify specific data recording and processing methodologies based on participatory sensing approach implementation in mobile vehicle based sensor networks. To reach this goal, author performed study of literature, testing of hypothesis using general purpose computer devices, adaptation of smartphones for participatory sensing, development of special purpose embedded devices, practical experiments with selected technical equipment and software as well as gathering of experimental results and following statistical analysis. The result of this research are several data acquisition and processing methodologi…
Image classification based on 2D feature motifs
2013
The classification of raw data often involves the problem of selecting the appropriate set of features to represent the input data. In general, various features can be extracted from the input dataset, but only some of them are actually relevant for the classification process. Since relevant features are often unknown in real-world problems, many candidate features are usually introduced. This degrades both the speed and the predictive accuracy of the classifier due to the presence of redundancy in the candidate feature set. In this paper, we study the capability of a special class of motifs previously introduced in the literature, i.e. 2D irredundant motifs, when they are exploited as feat…
Permutations of zero-sumsets in a finite vector space
2020
Abstract In this paper, we consider a finite-dimensional vector space 𝒫 {{\mathcal{P}}} over the Galois field GF ( p ) {\operatorname{GF}(p)} , with p being an odd prime, and the family ℬ k x {{\mathcal{B}}_{k}^{x}} of all k-sets of elements of 𝒫 {\mathcal{P}} summing up to a given element x. The main result of the paper is the characterization, for x = 0 {x=0} , of the permutations of 𝒫 {\mathcal{P}} inducing permutations of ℬ k 0 {{\mathcal{B}}_{k}^{0}} as the invertible linear mappings of the vector space 𝒫 {\mathcal{P}} if p does not divide k, and as the invertible affinities of the affine space 𝒫 {\mathcal{P}} if p divides k. The same question is answered also in the case where …
Improvement of partition coefficients determination of aroma compounds in food matrices by the phase ratio variation method
2011
The Phase Ratio Variation (PRV) method is a very valuable method commonly used for liquid/vapor partition coefficients data acquisition of aroma compounds. Nevertheless, some limits are linked to this method, especially for volatile compounds. A careful examination of the PRV equation leads us to propose the following expression: 1/Cvap-real =(nliq/n0) x 1/Cvap-ideal = (nliq/n0) x (1/KC0 + (1/Co) b), We performed an examination for two cases of K values (K1=0.001 and K2=0.05), putting forward that a carefully choice of b range values is crucial for reliability of the regression calculation 1/A versus b.
Computing Subdivision Surface Intersection
2003
Computer surface intersections is fundamental problem in geometric modeling. Any Boolean operation can be seen as an intersection calculation followed by a selection of parts necessary for building the surface of the resulting object. This paper deals with the computing of intersection curveson subdivision surfaces (surfaces generated by the Loop scheme). We present three variants of our algorithm. The first variant calculates this intersection after classification of the object faces into intersecting and non-intersecting pairs of faces. the second variant is based on 1-neighborhood of the intersecting faces. The third variant uses the concept of bipartite graph.
Orientare dal liceo all’università: il progetto di ricerca-formazione «FOrP»
2019
In questo contributo, dopo avere chiarito la finalità dell’orientamento presentata nelle Linee guida nazionali per l’orientamento permanente(MIUR, 2014) e descritto brevemente alcune metodologie educative utilizzate in Italia negli ultimi venti anni per aiutare gli studenti a costruire il loro progetto di vita professionale, si presenta nelle linee generali il progetto di ricerca-formazione «FOrP» (Formazione, Orientamento, Progettualità), volto a colmare, mediante laboratori-ponte di carattere disciplinare scuola-università, il gap tra le competenze disciplinari acquisite dagli alunni alla fine del percorso degli studi liceali e quelle richieste all’inizio degli studi universitari, nonché …