Search results for "Rete"

Glosa do uchwały Sądu Najwyższego - Izba Pracy, Ubezpieczeń Społecznych i Spraw Publicznych z dnia 4 sierpnia 2016 r., III UZP 11/16

2017

MIGRATION OF THE HIGHLY EDUCATED: EVIDENCE FROM RESIDENCE SPELLS OF UNIVERSITY GRADUATES*

2011

We examine the inter-regional migration of university graduates from 1991 to 2003 in Finland. The results show that time matters: two-years before and during the graduation year the hazard rates of migration increase, and then decrease thereafter. Although university graduates are particularly mobile, we find that most of them do not move from their region of studies within 10 years after graduation. The out-migration, i.e., brain drain, is much higher among graduates in the more peripheral universities than in the growth centers (Helsinki in particular). Migration is also substantially more likely for those studying away from the home region than for those studying at home. peerReviewed

Le responsabilità degli intermediari della rete telematica. I modelli statunitense ed europeo a raffronto.

2019

Il volume affronta il tema della responsabilità civile degli intermediari della rete telematica per il fatto illecito altrui mettendo a raffronto le soluzioni sperimentate nel diritto statunitense con quelle elaborate nel diritto europeo. In particolare, dall’analisi del dato normativo vigente nelle singole esperienze considerate e delle relative applicazioni giurisprudenziali si prendono in esame i doveri dei prestatori dei servizi elettronici e gli interventi che essi sono chiamati ad effettuare - sotto la scure della sanzione - sulle loro rispettive reti o piattaforme nel sovraintendere al flusso di contenuti diffusi dagli internauti. La trattazione si sofferma sull’estrema fragilità dei…

Extremal Irregular Digraphs

2018

A digraph is called irregular if its distinct vertices have distinct degree pairs. An irregular digraph is called minimal (maximal) if the removal of any arc (addition of any new arc) results in a non-irregular digraph. It is easily seen that the minimum sizes among irregular n-vertex whether digraphs or oriented graphs are the same and are asymptotic to (√2/3) n3/2; maximum sizes, however, are asymptotic to n2 and n2/2, respectively. Let s stand for the sum of initial positive integers, s = 1, 3, 6, . . . . An oriented graph Hs and a digraph Fs, both large (in terms of the size), minimal irregular, and on any such s vertices, s ≥ 21, are constructed in [Large minimal irregular digraphs, Op…

Orientācija uz nākotni un pretenziju līmenis kā studentu akadēmiskos sasniegumus prognozējoši faktori

2018

Šī bakalaura darba mērķis bija noskaidrot, vai studentu orientācija uz nākotni un pretenziju līmenis ir saistīti ar akadēmiskajiem sasniegumiem (un līdz ar to var kalpot par sasniegumus prognozējošiem faktoriem), un vai tie ir saistīti savā starpā. Pētījumā piedalījās 65 Latvijas Jūras Akadēmijas studenti vecumā no 18 līdz 28 gadiem (M=20,4 gadi, SD=1,7 gadi). Izpētei tika izmantotas Zimbardo laika perspektīvas aptaujas (Zimbardo Time Perspective Inventory (ZTPI), Zimbardo & Boyd, 1999) adaptācija latviešu valodā (Koļesovs, 2002), aptauja “Orientācija uz nākotni” (Koļesovs & Sadauska, 2016, Koļesovs, 2017), kā arī Švarclandera motorā prove (Borozdina, 1985) studentu pretenziju līmeņa noteik…

Refined instability estimates for some inverse problems

2022

Many inverse problems are known to be ill-posed. The ill-posedness can be manifested by an instability estimate of exponential type, first derived by Mandache [29]. In this work, based on Mandache's idea, we refine the instability estimates for two inverse problems, including the inverse inclusion problem and the inverse scattering problem. Our aim is to derive explicitly the dependence of the instability estimates on key parameters. The first result of this work is to show how the instability depends on the depth of the hidden inclusion and the conductivity of the background medium. This work can be regarded as a counterpart of the depth-dependent and conductivity-dependent stability estim…

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…

On a numerical solution of the Maxwell equations by discrete exterior calculus

2014

The average number of Sylow subgroups of a finite group

2013

We prove that if the average Sylow number (ignoring the Sylow numbers that are one) of a finite group G is ⩽7, then G is solvable.

Characterization of strong chain geometries by their automorphism group

1992

A wide class of chain geometries is characterized by their automorphism group using properties of a distinguished involution.