Institution
University of Trento
Education•Trento, Italy•
About: University of Trento is a education organization based out in Trento, Italy. It is known for research contribution in the topics: Population & Context (language use). The organization has 10527 authors who have published 30978 publications receiving 896614 citations. The organization is also known as: Universitá degli Studi di Trento & Universita degli Studi di Trento.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The current state of autonomic communications research is surveyed and significant emerging trends and techniques are identified.
Abstract: Autonomic communications seek to improve the ability of network and services to cope with unpredicted change, including changes in topology, load, task, the physical and logical characteristics of the networks that can be accessed, and so forth. Broad-ranging autonomic solutions require designers to account for a range of end-to-end issues affecting programming models, network and contextual modeling and reasoning, decentralised algorithms, trust acquisition and maintenance---issues whose solutions may draw on approaches and results from a surprisingly broad range of disciplines. We survey the current state of autonomic communications research and identify significant emerging trends and techniques.
690 citations
••
TL;DR: In vitro and in vivo human prostate cancer models are used to show that these tumors can develop resistance to the antiandrogen drug enzalutamide by a phenotypic shift from androgen receptor–dependent luminal epithelial cells to AR-independent basal-like cells.
Abstract: Some cancers evade targeted therapies through a mechanism known as lineage plasticity, whereby tumor cells acquire phenotypic characteristics of a cell lineage whose survival no longer depends on the drug target. We use in vitro and in vivo human prostate cancer models to show that these tumors can develop resistance to the antiandrogen drug enzalutamide by a phenotypic shift from androgen receptor (AR)–dependent luminal epithelial cells to AR-independent basal-like cells. This lineage plasticity is enabled by the loss of TP53 and RB1 function, is mediated by increased expression of the reprogramming transcription factor SOX2, and can be reversed by restoring TP53 and RB1 function or by inhibiting SOX2 expression. Thus, mutations in tumor suppressor genes can create a state of increased cellular plasticity that, when challenged with antiandrogen therapy, promotes resistance through lineage switching.
689 citations
••
TL;DR: Experiments carried out on two sets of multitemporal images acquired by the European Remote Sensing 2 satellite SAR sensor confirm the effectiveness of the proposed unsupervised approach, which results in change-detection accuracies very similar to those that can be achieved by a manual supervised thresholding.
Abstract: We present a novel automatic and unsupervised change-detection approach specifically oriented to the analysis of multitemporal single-channel single-polarization synthetic aperture radar (SAR) images. This approach is based on a closed-loop process made up of three main steps: (1) a novel preprocessing based on a controlled adaptive iterative filtering; (2) a comparison between multitemporal images carried out according to a standard log-ratio operator; and (3) a novel approach to the automatic analysis of the log-ratio image for generating the change-detection map. The first step aims at reducing the speckle noise in a controlled way in order to maximize the discrimination capability between changed and unchanged classes. In the second step, the two filtered multitemporal images are compared to generate a log-ratio image that contains explicit information on changed areas. The third step produces the change-detection map according to a thresholding procedure based on a reformulation of the Kittler-Illingworth (KI) threshold selection criterion. In particular, the modified KI criterion is derived under the generalized Gaussian assumption for modeling the distributions of changed and unchanged classes. This parametric model was chosen because it is capable of better fitting the conditional densities of classes in the log-ratio image. In order to control the filtering step and, accordingly, the effects of the filtering process on change-detection accuracy, we propose to identify automatically the optimal number of despeckling filter iterations [Step 1] by analyzing the behavior of the modified KI criterion. This results in a completely automatic and self-consistent change-detection approach that avoids the use of empirical methods for the selection of the best number of filtering iterations. Experiments carried out on two sets of multitemporal images (characterized by different levels of speckle noise) acquired by the European Remote Sensing 2 satellite SAR sensor confirm the effectiveness of the proposed unsupervised approach, which results in change-detection accuracies very similar to those that can be achieved by a manual supervised thresholding.
688 citations
••
TL;DR: In this article, a Monte-Carlo method is used to estimate the invariant probability law of a stochastic differential system by simulating a simple t,rajectory.
Abstract: Given the solution (Xt ) of a Stochastic Differential System, two situat,ions are considered: computat,ion of Ef(Xt ) by a Monte–Carlo method and, in the ergodic case, integration of a function f w.r.t. the invariant probability law of (Xt ) by simulating a simple t,rajectory. For each case it is proved the expansion of the global approximat,ion error—for a class of discret,isat,ion schemes and of funct,ions f—in powers of the discretisation step size, extending in the fist case a result of Gragg for deterministic O.D.E. Some nn~nerical examples are shown to illust,rate the applicat,ion of extrapolation methods, justified by the foregoing expansion, in order to improve the approximation accuracy
679 citations
••
TL;DR: The Distributional Memory approach is shown to be tenable despite the constraints imposed by its multi-purpose nature, and performs competitively against task-specific algorithms recently reported in the literature for the same tasks, and against several state-of-the-art methods.
Abstract: Research into corpus-based semantics has focused on the development of ad hoc models that treat single tasks, or sets of closely related tasks, as unrelated challenges to be tackled by extracting different kinds of distributional information from the corpus. As an alternative to this "one task, one model" approach, the Distributional Memory framework extracts distributional information once and for all from the corpus, in the form of a set of weighted word-link-word tuples arranged into a third-order tensor. Different matrices are then generated from the tensor, and their rows and columns constitute natural spaces to deal with different semantic problems. In this way, the same distributional information can be shared across tasks such as modeling word similarity judgments, discovering synonyms, concept categorization, predicting selectional preferences of verbs, solving analogy problems, classifying relations between word pairs, harvesting qualia structures with patterns or example pairs, predicting the typical properties of concepts, and classifying verbs into alternation classes. Extensive empirical testing in all these domains shows that a Distributional Memory implementation performs competitively against task-specific algorithms recently reported in the literature for the same tasks, and against our implementations of several state-of-the-art methods. The Distributional Memory approach is thus shown to be tenable despite the constraints imposed by its multi-purpose nature.
671 citations
Authors
Showing all 10758 results
Name | H-index | Papers | Citations |
---|---|---|---|
Yi Chen | 217 | 4342 | 293080 |
Jie Zhang | 178 | 4857 | 221720 |
Richard B. Lipton | 176 | 2110 | 140776 |
Jasvinder A. Singh | 176 | 2382 | 223370 |
J. N. Butler | 172 | 2525 | 175561 |
Andrea Bocci | 172 | 2402 | 176461 |
P. Chang | 170 | 2154 | 151783 |
Bradley Cox | 169 | 2150 | 156200 |
Marc Weber | 167 | 2716 | 153502 |
Guenakh Mitselmakher | 165 | 1951 | 164435 |
Brian L Winer | 162 | 1832 | 128850 |
J. S. Lange | 160 | 2083 | 145919 |
Ralph A. DeFronzo | 160 | 759 | 132993 |
Darien Wood | 160 | 2174 | 136596 |
Robert Stone | 160 | 1756 | 167901 |