Search results for "riso"
showing 10 items of 1451 documents
Comparaison internationale : à la recherche de jeunes diplômés de l'enseignement supérieur compétents en informatique
2003
By 1990, tow-thirds of all the jobs available for graduates with higher educational qualifications required advanced computer skills. However, only 30% of these graduates felt that they mastered these skills sufficiently well. Many of them have had to complete their initial vocational training by taking continuing training courses. In addition, mastering computer skills usually means earning higher wages. These results were based on a survey carried out on 35000 people who had graduated in disciplines of all kinds in eleven European countries and Japan.
Perron's method for the porous medium equation
2016
O. Perron introduced his celebrated method for the Dirichlet problem for harmonic functions in 1923. The method produces two solution candidates for given boundary values, an upper solution and a lower solution. A central issue is then to determine when the two solutions are actually the same function. The classical result in this direction is Wiener’s resolutivity theorem: the upper and lower solutions coincide for all continuous boundary values. We discuss the resolutivity theorem and the related notions for the porous medium equation ut −∆u = 0
Nonlinear diffusion in transparent media: the resolvent equation
2017
Abstract We consider the partial differential equation u - f = div ( u m ∇ u | ∇ u | ) u-f=\operatornamewithlimits{div}\biggl{(}u^{m}\frac{\nabla u}{|\nabla u|}% \biggr{)} with f nonnegative and bounded and m ∈ ℝ {m\in\mathbb{R}} . We prove existence and uniqueness of solutions for both the Dirichlet problem (with bounded and nonnegative boundary datum) and the homogeneous Neumann problem. Solutions, which a priori belong to a space of truncated bounded variation functions, are shown to have zero jump part with respect to the ℋ N - 1 {{\mathcal{H}}^{N-1}} -Hausdorff measure. Results and proofs extend to more general nonlinearities.
Symmetrization for singular semilinear elliptic equations
2012
In this paper, we prove some comparison results for the solution to a Dirichlet problem associated with a singular elliptic equation and we study how the summability of such a solution varies depending on the summability of the datum f. © 2012 Fondazione Annali di Matematica Pura ed Applicata and Springer-Verlag.
Mai più prigioni del silenzio. Il divieto di dialogare con gli altri detenuti vìola la dignità dei condannati all’ergastolo
2022
La Corte europea dei diritti dell'uomo ha riconosciuto una violazione degli artt. 3 e 13 Cedu, in riferimento al regime penitenziario di isolamento che ha inibito a un condannato all'ergastolo di parlare con altri detenuti durante un breve periodo di permanenza all'aperto. L'occasione offre spunti per brevi riferimenti storici alle cd. prigioni del silenzio; per un'analisi del ruolo interpretativo e obbligatorio delle sentenze europee; per l'individuazione dei limiti di invalicabile umanità della pena a vita. Dopo avere configurato il controllo giurisdizionale come scriminante, come causa di giustificazione, rispetto all'esercizio di poteri arbitrari, si richiama l'attenzione sul principio …
Diritto antitrust e libertà contrattuale: l’obbligo di contrarre e il problema dell’eterodeterminazione del prezzo
2008
Il diritto antitrust nasce negli Stati Uniti come declinazione dei principi di common law in materia di tutela della libertà contrattuale. La sua evoluzione lo distanzia però notevolmente da tale matrice, ma i problemi della definizione dei contenuti contrattuali emergono prepotentemente laddove, come in tema di trattamento del refusal to deal, ragionevolezza delle prestazioni e tutela della concorrenza si intrecciano strettamente. Si analizzano quindi le moderne metodologie proposte per la corretta determinazione del prezzo di accesso ad una risorsa essenziale.
Some integral type fixed point theorems in Non-Archimedean Menger PM-Spaces with common property (E.A) and application of functional equations in dyn…
2013
In this paper, we prove some integral type common fixed point theorems for weakly compatible mappings in Non-Archimedean Menger PM-spaces employing common property (E.A). Some examples are furnished which demonstrate the validity of our results. We extend our main result to four finite families of self-mappings employing the notion of pairwise commuting. Moreover, we give an application which supports the usability of our main theorem.
Regular Minimality and Thurstonian-type modeling
2009
Abstract A Thurstonian-type model for pairwise comparisons is any model in which the response (e.g., “they are the same” or “they are different”) to two stimuli being compared depends, deterministically or probabilistically, on the realizations of two randomly varying representations (perceptual images) of these stimuli. The two perceptual images in such a model may be stochastically interdependent but each has to be selectively dependent on its stimulus. It has been previously shown that all possible discrimination probability functions for same–different comparisons can be generated by Thurstonian-type models of the simplest variety, with independent percepts and deterministic decision ru…
When can association graphs admit a causal interpretation?
1994
We discuss essentially linear structures which are adequately represented by association graphs called covariance graphs and concentration graphs. These do not explicitly indicate a process by which data could be generated in a stepwise fashion. Therefore, on their own, they do not suggest a causal interpretation. By contrast, each directed acyclic graph describes such a process and may offer a causal interpretation whenever this process is in agreement with substantive knowledge about causation among the variables under study. We derive conditions and procedures to decide for any given covariance graph or concentration graph whether all their pairwise independencies can be implied by some …
Dichotomies properties on computational complexity of S-packing coloring problems
2015
This work establishes the complexity class of several instances of the S -packing coloring problem: for a graph G , a positive integer k and a nondecreasing list of integers S = ( s 1 , ? , s k ) , G is S -colorable if its vertices can be partitioned into sets S i , i = 1 , ? , k , where each S i is an s i -packing (a set of vertices at pairwise distance greater than s i ). In particular we prove a dichotomy between NP-complete problems and polynomial-time solvable problems for lists of at most four integers.