Mining frequent subgraphs from a collection of input graphs is an important task for exploratory data analysis on graph data. However, if the input graphs contain sensitive information, releasing discovered frequent subgraphs may pose considerable threats to individual privacy. In this paper, we study the problem of frequent subgraph mining (FSM) under the rigorous differential privacy model. W...

لایه کَندگی کربن‌­چگالی‌­بالا یکی از گزینه‌­های امیدبخش در افروزش گرماهسته­‌ای هدف­‌های گداخت محصورشدگی لختی است. به منظور کاهش ناپایداری‌­های هیدرودینامیکی و هم‌­چنین حفظ سوخت پدیده پیش‌­گرمایش، طراحی دوتایی با بیرونی کربن­‌چگالی­‌بالا که اخیراً توسط محققین مورد توجه قرار گرفته است، استفاده شده این‌­رو این پژوهش، بهینه‌­سازی یک هدف کروی دلخواه تک پلی‌­استایرن را کد MULTI-IFE بررسی دادیم. هدف، تح...

∗Speaker. †We (S.D. and P.U.) thank the Galileo Galilei Institute for Theoretical Physics in Florence for the hospitality and the INFN for partial support during the completion of this work. P.U. is supported as Heisenberg Fellow of the Deutsche Forschungsgemeinschaft DFG. This work is supported in part by the European Community’s Marie-Curie Research Training Network HEPTOOLS under contract MR...

Im Rahmen der hochschulweiten Open-Access-Strategie für die Zweitveröffentlichung identifiziert durch die Universitätsbibliothek Ilmenau. " " Within the academic Open Access Strategy identified for deposition by Ilmenau University Library. " " Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG-geförderten) Allianz-bzw. Nationallizenz frei zugänglich. " " This publication i...

We demonstrate a midinfrared source tunable from 6.7 to 12.7 μm via difference frequency generation (DFG) in orientation-patterned GaAs, with 1.3 mW average output power. The input pulses are generated via Raman self-frequency shift of a femtosecond Tm-doped-fiber laser system in a fluoride fiber. We numerically model the DFG process and show good agreement between simulations and experiments. ...

Diese Arbeit wird von der Deutschen Forschungsgemeinschaft (DFG) geffrdert, Pro-jektnr. No 88/14-1.

This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities between hidden and observed variables, and factors modeling dynamical constraints on hidden variables. The DFG assigns a scalar energy to each configuration of hidden and observed variables. A gradient-based inference procedure finds...

In this paper, we address a shortest path problem where an autonomous vehicle moves on a polyhedral surface according to a distance function that depends on the direction of the movement (directional) and on the friction of the space (frictional). This shortest path problem generalizes a hierarchy of problems and finds geometric structure to solve several proximity problems. We perform the char...

Signal processing applications which are iterative in nature are best represented by data flow graphs (DFG). In these applications, the maximum sampling frequency is dependent on the topology of the DFG, the cyclic dependencies in particular. The determination of the iteration bound, which is the reciprocal of the maximum sampling frequency, is critical in the process of hardware implementation...