6,162 research outputs found
Concentration inequalities for mean field particle models
This article is concerned with the fluctuations and the concentration
properties of a general class of discrete generation and mean field particle
interpretations of nonlinear measure valued processes. We combine an original
stochastic perturbation analysis with a concentration analysis for triangular
arrays of conditionally independent random sequences, which may be of
independent interest. Under some additional stability properties of the
limiting measure valued processes, uniform concentration properties, with
respect to the time parameter, are also derived. The concentration inequalities
presented here generalize the classical Hoeffding, Bernstein and Bennett
inequalities for independent random sequences to interacting particle systems,
yielding very new results for this class of models. We illustrate these results
in the context of McKean-Vlasov-type diffusion models, McKean collision-type
models of gases and of a class of Feynman-Kac distribution flows arising in
stochastic engineering sciences and in molecular chemistry.Comment: Published in at http://dx.doi.org/10.1214/10-AAP716 the Annals of
Applied Probability (http://www.imstat.org/aap/) by the Institute of
Mathematical Statistics (http://www.imstat.org
On Kahan's Rules for Determining Branch Cuts
In computer algebra there are different ways of approaching the mathematical
concept of functions, one of which is by defining them as solutions of
differential equations. We compare different such approaches and discuss the
occurring problems. The main focus is on the question of determining possible
branch cuts. We explore the extent to which the treatment of branch cuts can be
rendered (more) algorithmic, by adapting Kahan's rules to the differential
equation setting.Comment: SYNASC 2011. 13th International Symposium on Symbolic and Numeric
Algorithms for Scientific Computing. (2011
LAPORAN INDIVIDU PRAKTIK PENGALAMAN LAPANGAN PERIODE 15 JULI â 15 SEPTEMBER 2016 SMA NEGERI 3 KLATEN
Pelaksanaan Praktik Pengalaman Lapangan (PPL) merupakan salah satu
mata kuliah yang wajib ditempuh oleh mahasiswa sebagai salah satu syarat
dalam menyelesaikan gelar sebagai sarjana pendidikan selain tugas akhir
skripsi di Universitas Negeri Yogyakarta. Visi dari Praktik Pengalaman
Lapangan adalah wadah pembentukan calon guru atau tenaga kependidikan yang
profesional.
Praktik Pengalaman Lapangan (PPL) dilaksanakan di SMA Negeri 3
Klaten, tepatnya di Jalan Mayor Sunaryo 42, Jonggrangan, Klaten Utara, Klaten.
Kegiatan ini dimulai secara efektif pada tanggal 18 Juli dan diakhiri pada tanggal
14 September 2016. Praktik Pengalaman Lapangan merupakan kegiatan
pembelajaran di sekolah. Dalam kegiatan pembelajaran perlu melakukan
persiapan, diantaranya pembuatan RPP, administrasi pendidik, serta media
pembelajaran yang diperlukan. Selama kegiatan PPL mahasiswa diberi
kepercayaan untuk mengampu kelas X MIPA 3, 4, 5 dan 6 dibawah bimbingan
Bapak Drs. Mulyadi. Evaluasi terhadap peserta didik dilakukan melalui Ulangan
Pendalaman Materi atau Ulangan Harian, kuis dan penugasan.
Secara kesuluruhan PPL berjalan dengan baik dan lancar. Keberhasilan
pelaksanaan PPL ini hendaknya disikapi oleh pihak Universitas Negeri
Yogyakarta dengan mempertahankan dan meningkatkan jalinan komunikasi dan
kerjasama dengan SMA Negeri 3 Klaten
Spectral Bandits for Smooth Graph Functions
International audienceSmooth functions on graphs have wide applications in manifold and semi-supervised learning. In this paper, we study a bandit problem where the payoffs of arms are smooth on a graph. This framework is suitable for solving online learning problems that involve graphs, such as content-based recommendation. In this problem, each item we can recommend is a node and its expected rating is similar to its neighbors. The goal is to recommend items that have high expected ratings. We aim for the algorithms where the cumulative regret with respect to the optimal policy would not scale poorly with the number of nodes. In particular, we introduce the notion of an effective dimension, which is small in real-world graphs, and propose two algorithms for solving our problem that scale linearly and sublinearly in this dimension. Our experiments on real-world content recommendation problem show that a good estimator of user preferences for thousands of items can be learned from just tens of nodes evaluations
Extending the Calculus of Constructions with Tarski's fix-point theorem
We propose to use Tarski's least fixpoint theorem as a basis to define
recursive functions in the calculus of inductive constructions. This widens the
class of functions that can be modeled in type-theory based theorem proving
tool to potentially non-terminating functions. This is only possible if we
extend the logical framework by adding the axioms that correspond to classical
logic. We claim that the extended framework makes it possible to reason about
terminating and non-terminating computations and we show that common facilities
of the calculus of inductive construction, like program extraction can be
extended to also handle the new functions
On the dimension of spline spaces on planar T-meshes
We analyze the space of bivariate functions that are piecewise polynomial of
bi-degree \textless{}= (m, m') and of smoothness r along the interior edges of
a planar T-mesh. We give new combinatorial lower and upper bounds for the
dimension of this space by exploiting homological techniques. We relate this
dimension to the weight of the maximal interior segments of the T-mesh, defined
for an ordering of these maximal interior segments. We show that the lower and
upper bounds coincide, for high enough degrees or for hierarchical T-meshes
which are enough regular. We give a rule of subdivision to construct
hierarchical T-meshes for which these lower and upper bounds coincide. Finally,
we illustrate these results by analyzing spline spaces of small degrees and
smoothness
Ouverture des donnĂ©es de recherche - Guide dâanalyse du cadre juridique en France
Ce document a Ă©tĂ© conçu en appui aux politiques dâouverture des donnĂ©es de la recherche ; il aborde les questions techniques, documentaires, Ă©conomiques et juridiques liĂ©es Ă ces problĂ©matiques
PERLINDUNGAN HUKUM TERHADAP PELAKSANAAN JAMINAN KESEHATAN BAGI PEKERJA SETELAH PERALIHAN STATUS KELEMBAGAAN JAMSOSTEK MENJADI BADAN PENYELENGGARA JAMINAN SOSIAL (BPJS)
Tujuan dilakukannya penelitian ini adalah untuk mengetahui bagaimana alasan transfomasi pembentukan Jamsostek menjadi BPJS (Badan Penyelenggara Jaminan Sosial dan bagaimana pelaksanaan perlindungan hukum jaminan kesehatan bagi pekerja setelah transformasi JAMSOSTEK menjadi BPJS (Badan Penyelenggara Jaminan Sosial. Dengan menggunakan metode penelitian yuridis normatif, disimpulkan: 1. Alasan transfomasi Jamsostek menjadi BPJS (Badan Penyelenggara jaminan Sosial) hendaknya masyarakat merasakan bahwa badan penyelenggara bermanfaat bagi peningkatan efisiensi dan efektifitas penyelenggaraan jaminan kesehatan kerja dalam menjangkau segenap lapisan masyarakat. Adapun alasanĂÂ penyelenggaraan jaminan sosial secara nasional adalah bahwa jaminan sosial sebagai instrumenĂÂ negara yang dirancang untuk redistribusi risiko secara nasional sesuai asas dan prinsip-prinsipĂÂ UUĂÂ SJSN. 2. Perlindungan hukum merupakan hak manusia sebagai subjek hukum, baik ketika ia berada dalam posisinya sebagai orang perseorangan/pribadi, maupun ketika ia berada dalam suatu komunitas, kelompok atau keadaan lain. Pemerintah melalui berbagai Undang-undang dan peraturan pelaksanaannya, di samping memberikan penegasan terhadap wujud hak-hak yang dimiliki oleh pekerja, juga menyertakan jaminan-jaminan perlindungan terhadap hak-hak pekerja tersebut. Secara umum bentuk perlindungan yang terkait dengan hal tersebut di atas adalah, terbitnya berbagai peraturan yang mengatur tentang upah, jam kerja, cuti/libur, kesehatan dan keselamatan kerja, organisasi pekerja/buruh dan lainlain. Di samping itu diselenggarakan pula dalam bentuk program-program jaminan sosial bidang ketenagakerjaan, yang meliputi jaminan sosial dan kesehatan (BPJS).Kata kunci: Pelaksanaan jaminan kesehatan, pekerja, transformasi kelembagaan jemasostek, badan penyelenggara jaminan sosial (BPJS)
Véhicules autonomes et connectés: Les défis actuels et les voies de recherche
International audienceLes livres blancs d'Inria examinent les grands dĂ©fis actuels posĂ©s par le numĂ©rique et prĂ©sentent les actions menĂ©es par nos Ă©quipes-projets pour les rĂ©soudre. Ils ont pour objectif de faire le point sur une problĂ©matique en prĂ©cisant ses complexitĂ©s, en dĂ©taillant les voies de recherches existantes ou en Ă©mergence et en dĂ©crivant les impacts sociĂ©taux attendus et Ă prĂ©voir.Le monde de la mobilitĂ© est en profonde mutation. Le dĂ©ploiement du vĂ©hicule autonome va non seulement transformer nos modes de transports, mais surtout avoir un impact sur l'Ă©volution de la sociĂ©tĂ© - en termes de sĂ©curitĂ©, d'environnement, d'urbanisme... â et sur l'industrie automobile elle-mĂȘme, avec de nouveaux vĂ©hicules dans lesquels lâintelligence artificielle jouera un rĂŽle dĂ©terminant. Pour mieux apprĂ©hender ce bouleversement, il est nĂ©cessaire de comprendre ce qui fait la spĂ©cificitĂ© du vĂ©hicule autonome et connectĂ©, les prouesses technologiques que les acteurs du secteur doivent rĂ©aliser ainsi que le dĂ©veloppement de collaborations entre recherches publique et privĂ©e
Coherence in monoidal track categories
We introduce homotopical methods based on rewriting on higher-dimensional
categories to prove coherence results in categories with an algebraic
structure. We express the coherence problem for (symmetric) monoidal categories
as an asphericity problem for a track category and we use rewriting methods on
polygraphs to solve it. The setting is extended to more general coherence
problems, seen as 3-dimensional word problems in a track category, including
the case of braided monoidal categories.Comment: 32 page
- âŠ