Search results for "rete"

showing 10 items of 3470 documents

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…

apprentissage implicite- apprentissage moteur- régularités- tâches continues- tâches discrètes- tâche de poursuite de cible- tâche de TRS[OTHER] domain_otherimplicit learning- motor learning- regularities- continuous tasks- discrete tasks- tracking task- SRT task[ OTHER ] domain_otherapprentissage implicite- apprentissage moteur- régularités- tâches continues- tâches discrètes- tâche de poursuite de cible- tâche de TRS.[OTHER]domain_other
researchProduct

STRUCTURE, ENVELOPE AND TECHNOLOGICAL INNOVATION The reinforced concrete in the construction of very tall buildings

2014

Until the second half of the nineteenth century, ie until the Industrial Revolution, the building structures played static function and also protective function. In the course of time separating the combination goes. The introduction of iron leads to a progressive "innovation" of building structures. The first application of iron in construction dates back to the mid-nineteenth century. They were first made with cast-iron columns and beams in iron and later with particular types of steel. The architecture of the iron is a true regeneration of the way of building, the cities are filled with sophisticated solid structures and slim at the same time, it enhances the transparency of glass, it in…

architecture technology building structures reinforced concrete tall buildingsSettore ICAR/12 - Tecnologia Dell'Architettura
researchProduct

A preterm child grows : focus on speech and language during the first two years

2000

assessment of preterm infantspeech and language developmentkielellinen kehityskeskosetage correctionkehitysecological assessmentpuhelapsetpreterm infant
researchProduct

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.

attenuated Radon transformMultispectralRAYUniqueness theorem01 natural sciencesinversio-ongelmat44A10 (Primary) 65R32 44A60 46N40 65Z05 (Secondary)030218 nuclear medicine & medical imaging0302 clinical medicine111 MathematicsDiscrete Mathematics and CombinatoricstietokonetomografiaPharmacology (medical)INVERSIONnuclear medicineBeam hardeningPhysicsLaplace transformDetectorNumerical Analysis (math.NA)Inverse problemuniqueness theoremFunctional Analysis (math.FA)Mathematics - Functional AnalysisMultiplicative system theoremkuvantaminensovellettu matematiikkaModeling and SimulationSPECTLine (geometry)numeerinen analyysipositroniemissiotomografiaemission computed tomographyAttenuated Radon transformEmission computed tomographyControl and OptimizationLaplace transformmultispectralOpen setCollimated light03 medical and health sciencesnuclear medicine.multiplicative system theoremFOS: Mathematicsinverse source problemMathematics - Numerical Analysis0101 mathematicsAttenuation010102 general mathematicsInverse source problemRangingComputational physicsTENSOR TOMOGRAPHYPETbeam hardeningNuclear MedicineAnalysis
researchProduct

PE teachers' job satisfaction, turnover, and intention to stay or leave the profession

2014

attritionopetustilatarea transferretentionarvostussukupuolierotturnoverjärjestyshäiriötmotiivittyöyhteisöturakehitystyötyytyväisyysopetusryhmätintention to leavetyöolottyön kuormittavuusammattitaitoPE teachersliikunnanopettajatjob satisfactionammatinvaihto
researchProduct

Le reti tra avvocati per la partecipazione alle procedure pubbliche di affidamento di servizi legali

2019

L'articolo analizza le principali questioni giuridiche connesse alla possibilità - oggi offerta dall'art. 12 della l. n. 81/2017 - di stipulare contratti di rete tra liberi professionisti, ed in particolare tra avvocati, allo scopo di partecipare alle gare pubbliche di affidamento di servizi legali. L'A. si propone altresì l'obiettivo di valutare se ed in che misura il contratto di rete possa offrire vantaggi competitivi, in termini di partecipazione alle procedure con la pubblica amministrazione, rispetto alle differenti modalita` organizzative attualmente a disposizione degli avvocati (es. società, associazioni, associazioni temporanee, consorzi stabili professionali).

avvocatiservizi legaligare pubblichecontratto di reteSettore IUS/04 - Diritto Commercialeprofessionisti
researchProduct

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.

b-chromatic numberGeneral Computer Science[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]power graphTheoretical Computer ScienceCombinatoricsComputer Science::Discrete MathematicsDiscrete Mathematics and CombinatoricsChromatic scaleGraph coloringcoloringMathematicscycle and complete binary treeMathematics::CombinatoricsBinary treelcsh:Mathematicscycle and complete binary tree.path[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Complete coloringlcsh:QA1-939Vertex (geometry)Brooks' theorem[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Edge coloringFractional coloringDiscrete Mathematics & Theoretical Computer Science
researchProduct

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.

best proximity point fixed point simulation functions variational inequality problemsNumerical AnalysisControl and OptimizationAlgebra and Number Theory010102 general mathematicsMathematical analysisFunction (mathematics)01 natural sciences010101 applied mathematicsSettore MAT/05 - Analisi MatematicaVariational inequalityProximity problemsDiscrete Mathematics and CombinatoricsApplied mathematicsPoint (geometry)0101 mathematicsAnalysisMathematicsMiskolc Mathematical Notes
researchProduct

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.

binary relationUnificationgraph theoryApplied Mathematics020207 software engineering0102 computer and information sciences02 engineering and technologyMizar system68v2001 natural sciencesAlgebraComputational Mathematics010201 computation theory & mathematicsQA1-9390202 electrical engineering electronic engineering information engineering05c62MathematicsMathematicsofComputing_DISCRETEMATHEMATICSMathematicsFormalized Mathematics
researchProduct

Assessing the influence of different biochar fractions on soil structure and soil water retention: laboratory investigation on a Sicilian soil

2012

biochar soil water retention NMR relaxometrySettore AGR/13 - Chimica AgrariaSettore AGR/08 - Idraulica Agraria E Sistemazioni Idraulico-Forestali
researchProduct