Results 91 to 100 of about 358,315 (287)
Searching for nodes in random graphs [PDF]
We consider the problem of searching for a node on a labelled random graph according to a greedy algorithm that selects a route to the desired node using metric information on the graph. Motivated by peer-to-peer networks two types of random graph are proposed with properties particularly amenable to this kind of algorithm.
openaire +3 more sources
Metformin mediates mitochondrial quality control in Leber's hereditary optic neuropathy (LHON) fibroblasts carrying mtDNA mutations. At therapeutic levels, metformin activates AMPK signaling to restore mitochondrial dynamics by promoting fusion and restraining fission, while preserving mitochondrial mass, enhancing autophagy/mitophagy and biogenesis ...
Chatnapa Panusatid +3 more
wiley +1 more source
Three-Way Decision-Driven Adaptive Graph Convolution for Deep Clustering
Graph clustering is an efficient method for deep clustering that utilizes graph convolution. Graph convolution effectively combines structure and content information, and lots of recent graph convolution-based methods have shown promising results in ...
Wei Liang +4 more
doaj +1 more source
Searching for partial Hadamard matrices [PDF]
Three algorithms looking for pretty large partial Hadamard ma- trices are described. Here “large” means that hopefully about a third of a Hadamard matrix (which is the best asymptotic result known so far, [8]) is achieved.
Armario Sampalo, José Andrés +6 more
core
Learning Graph Search Heuristics
Searching for a path between two nodes in a graph is one of the most well-studied and fundamental problems in computer science. In numerous domains such as robotics, AI, or biology, practitioners develop search heuristics to accelerate their pathfinding algorithms.
Pandy M. +6 more
openaire +3 more sources
We investigated the toxicity of 12 active compounds commonly found in herbal weight loss supplements (WLS) using human liver and colon cell models. Epigallocatechin‐3‐gallate was the only compound showing significant toxicity. Metabolic profiling revealed protein degradation, disrupted energy and lipid metabolism suggesting that the inclusion of EGCG ...
Emily C. Davies +3 more
wiley +1 more source
Entity and Relation Linking for Knowledge Graph Question Answering Using Gradual Searching
Knowledge graph question answering (KGQA) systems have an important role in retrieving data from a knowledge graph (KG). With the system, regular users can access data from a KG without the need to construct a formal SPARQL query.
Adila Alfa Krisnadhi +2 more
doaj +1 more source
A Domain-Independent Algorithm for Plan Adaptation
The paradigms of transformational planning, case-based planning, and plan debugging all involve a process known as plan adaptation - modifying or repairing an old plan so it solves a new problem.
Hanks, S., Weld, D. S.
core +3 more sources
Dagstuhl Reports : Volume 1, Issue 2, February 2011 [PDF]
Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs ...
Schloss Dagstuhl, Leibniz-Zentrum für Informatik
core
NF90–NF45 functions as a negative regulator of methyltransferase‐like 3/14 (METTL3/14)‐mediated N6‐methyladenosine (m6A) modification on primary microRNAs (pri‐miRNAs). NF90–NF45 binds to anti‐oncogenic pri‐miRNAs and inhibits their m6A modification, thereby suppressing the biogenesis of anti‐oncogenic miRNAs.
Takuma Higuchi +6 more
wiley +1 more source

