منابع مشابه
Recovering metabolic pathways via optimization
A metabolic pathway is a coherent set of enzyme catalysed biochemical reactions by which a living organism transforms an initial (source) compound into a final (target) compound. Some of the different metabolic pathways adopted within organisms have been experimentally determined. In this paper, we show that a number of experimentally determined metabolic pathways can be recovered by a mathemat...
متن کاملRecovering Euclidean Distance Matrices via Landmark MDS
In network topology discovery, it is often necessary to collect measurements between network elements without injecting large amounts of traffic into the network. A possible solution to this problem is to actively query the network for some measurements and use these to infer the remaining ones. We frame this as a particular version of the Noisy Matrix Completion problem where the entries refle...
متن کاملRecovering Diffusivities and Binding Rates via Uncaging
and the end conditions bx(0, t) = bx(`, t) = cx(0, t) = cx(`, t) = 0. Our task is to recover p ≡ {Db, Dc, k−, r, u} from knowledge of b(xj , ·) and Kd = k−/k+. Let us explicitly track the dependence of of b upon p by writing b = b(x, t; p) and write the IBVP above as R([b, c], p) = 0. Now differentiating R([b(p), c(p)], p) = 0 wrt p reveals ∂[b,c]R∂p[b, c] + ∂pR = 0 or ∂p[b(p), c(p)] = −∂[b,c]R...
متن کاملRecovering Nonuniform Planted Partitions via Iterated Projection
In the planted partition problem, the n vertices of a random graph are partitioned into k “clusters,” and edges between vertices in the same cluster and different clusters are included with constant probability p and q, respectively (where 0 ≤ q < p ≤ 1). We give an efficient spectral algorithm that recovers the clusters with high probability, provided that the sizes of any two clusters are eit...
متن کاملRecovering Question Answering Errors via Query Revision
The existing factoid QA systems often lack a post-inspection component that can help models recover from their own mistakes. In this work, we propose to crosscheck the corresponding KB relations behind the predicted answers and identify potential inconsistencies. Instead of developing a new model that accepts evidences collected from these relations, we choose to plug them back to the original ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.05.346