scispace - formally typeset
Search or ask a question
Institution

Romanian Academy

ArchiveBucharest, Romania
About: Romanian Academy is a archive organization based out in Bucharest, Romania. It is known for research contribution in the topics: Population & Nonlinear system. The organization has 3662 authors who have published 10491 publications receiving 146447 citations. The organization is also known as: Academia Română & Societatea Literară Română.


Papers
More filters
Proceedings ArticleDOI
17 Dec 2018
TL;DR: This work presents an end-to-end model that makes it possible to learn all parameters of the graph matching process, including the unary and pairwise node neighborhoods, represented as deep feature extraction hierarchies.
Abstract: The problem of graph matching under node and pairwise constraints is fundamental in areas as diverse as combinatorial optimization, machine learning or computer vision, where representing both the relations between nodes and their neighborhood structure is essential. We present an end-to-end model that makes it possible to learn all parameters of the graph matching process, including the unary and pairwise node neighborhoods, represented as deep feature extraction hierarchies. The challenge is in the formulation of the different matrix computation layers of the model in a way that enables the consistent, efficient propagation of gradients in the complete pipeline from the loss function, through the combinatorial optimization layer solving the matching problem, and the feature extraction hierarchy. Our computer vision experiments and ablation studies on challenging datasets like PASCAL VOC keypoints, Sintel and CUB show that matching models refined end-to-end are superior to counterparts based on feature hierarchies trained for other problems.

205 citations

Journal ArticleDOI
TL;DR: The main result of as discussed by the authors is that Eisenbud and Frenkel proved the following theorem: when X is a smooth variety defined over an algebraically closed field k of characteristic zero, the space of arcs X ∞ of X is the projective limit X∞ = proj limm Xm.
Abstract: Let X be a variety defined over an algebraically closed field k of characteristic zero The mth jet scheme Xm of X is a scheme whose closed points over x ∈ X are morphisms OX,x −→ k[t]/(tm+1) When X is a smooth variety, this is an affine bundle over X, of dimension (m + 1) dim X The space of arcs X∞ of X is the projective limit X∞ = proj limm Xm Our main result is a proof of the following theorem, which was conjectured by Eisenbud and Frenkel:

203 citations

Journal ArticleDOI
TL;DR: It is proposed that the secretion defects seen in GS2 and FHL3 have a common origin, and it is suggested that the rab27a/Munc13-4 complex is an essential regulator of secretory granule fusion with the plasma membrane in hematopoietic cells.
Abstract: Griscelli syndrome type 2 (GS2) is a genetic disorder in which patients exhibit life-threatening defects of cytotoxic T lymphocytes (CTLs) whose lytic granules fail to dock on the plasma membrane and therefore do not release their contents. The disease is caused by the absence of functional rab27a, but how rab27a controls secretion of lytic granule contents remains elusive. Mutations in Munc13-4 cause familial hemophagocytic lymphohistiocytosis subtype 3 (FHL3), a disease phenotypically related to GS2. We show that Munc13-4 is a direct partner of rab27a. The two proteins are highly expressed in CTLs and mast cells where they colocalize on secretory lysosomes. The region comprising the Munc13 homology domains is essential for the localization of Munc13-4 to secretory lysosomes. The GS2 mutant rab27aW73G strongly reduced binding to Munc13-4, whereas the FHL3 mutant Munc13-4Δ608-611 failed to bind rab27a. Overexpression of Munc13-4 enhanced degranulation of secretory lysosomes in mast cells, showing that it has a positive regulatory role in secretory lysosome fusion. We suggest that the secretion defects seen in GS2 and FHL3 have a common origin, and we propose that the rab27a/Munc13-4 complex is an essential regulator of secretory granule fusion with the plasma membrane in hematopoietic cells. Mutations in either of the two genes prevent formation of this complex and abolish secretion.

203 citations

Journal ArticleDOI
TL;DR: The method of fundamental solutions (MFS) is a relatively new method for the numerical solution of boundary value problems and initial/boundary value problems governed by certain partial differential equations as discussed by the authors.
Abstract: The method of fundamental solutions (MFS) is a relatively new method for the numerical solution of boundary value problems and initial/boundary value problems governed by certain partial differential equations. The ease with which it can be implemented and its effectiveness have made it a very popular tool for the solution of a large variety of problems arising in science and engineering. In recent years, it has been used extensively for a particular class of such problems, namely inverse problems. In this study, in view of the growing interest in this area, we review the applications of the MFS to inverse and related problems, over the last decade.

202 citations


Authors

Showing all 3740 results

NameH-indexPapersCitations
Cristina Popescu7428518434
Adrian Covic7357017379
Gheorghe Paun6539918513
Floriana Tuna6027111968
Arto Salomaa5637417706
Jan A. Bergstra5561613436
Alexandru T. Balaban5360514225
Cristian Sminchisescu5317312268
Maya Simionescu4719210608
Marius Andruh462398431
Werner Scheid465189186
Vicenţiu D. Rădulescu463607771
Cornelia Vasile442977108
Irinel Popescu444018448
Mihail Barboiu442395789
Network Information
Related Institutions (5)
Centre national de la recherche scientifique
382.4K papers, 13.6M citations

87% related

École Normale Supérieure
99.4K papers, 3M citations

86% related

University of Bordeaux
55.5K papers, 1.6M citations

86% related

Vienna University of Technology
49.3K papers, 1.3M citations

86% related

Royal Institute of Technology
68.4K papers, 1.9M citations

86% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202335
2022113
2021671
2020690
2019704
2018630