Results 61 to 70 of about 408,117 (264)
Research on selective trust-path search and aggregation in distributed environment
Current trust models based on reputation had some disadvantages in characterizing recommendation credibility and dealing with Trust-Path Search and aggregation.To solve these problems,an updating algorithm for recommendation credibility was proposed ...
Yan-lin QIN, Xiao-ping WU, Jian-xin GAO
doaj +2 more sources
The single factory production is shifting to multi-factory production which brings new challenges. Hybrid flow shop problem (HFSP) as a common problem in production-manufacturing has been studied extensively, however distributed hybrid flow shop problem (
Lei Wang, Dongdong Li
doaj +1 more source
Many patients with urothelial cancer do not benefit from treatment with pembrolizumab, while at risk of severe side effects. Changes in the levels of circulating tumor DNA early during treatment, measured by a simple and affordable assay that can be easily implemented in the clinic, can be used as a prognostic tool to identify these patients.
Youssra Salhi +14 more
wiley +1 more source
MITF maintains genome stability in nonmelanocyte lineages
MITF is essential for melanocyte survival and acts as an oncogene in 10%–20% of melanomas. We show that MITF depletion causes genome instability in nonmelanocytic cells, leading to LATS2‐mediated P53 activation, cell cycle arrest, and apoptosis. This study highlights the role of MITF as a genome maintenance factor beyond the melanocyte lineage. Created
Drifa H. Gudmundsdottir +13 more
wiley +1 more source
Drug resistance limits treatment success in a subset of lung cancers driven by ROS1 gene alterations. Using patient‐derived cells and computer simulations, we studied three key mutations and how they affect five targeted drugs. The mutations reduced drug effectiveness in different ways by altering protein structure and behavior.
Farhan Ul Haq +8 more
wiley +1 more source
Distributed Searching of Partial Grids
We consider the following distributed pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown $n$-node network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few agents as possible.
Dariusz Dereniowski, Dorota Urbanska
openaire +2 more sources
Circulating microRNAs as biomarkers of cachexia and sex‐specific cancer in senior dogs. In 25 client‐owned dogs, four circulating miRNAs (miR‐15a, miR‐15b, miR‐16, miR‐140) were downregulated in cachexia, with miR‐16 the strongest individual biomarker (AUC = 0.899).
Soon‐Seok Park +6 more
wiley +1 more source
To date, various methods have been proposed for calibrating polarimetric synthetic aperture radar (SAR) using distributed targets. Some studies have utilized the covariance matching estimation technique (Comet) for SAR data calibration.
Jingke Liu, Lin Liu, Xiaojie Zhou
doaj +1 more source
Promised and Distributed Quantum Search [PDF]
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in some subsets of S. In particular when k=2, we show a tight bound of the quantum query complexity for the Claw Finding problem, improving previous upper and lower bounds by ...
openaire +1 more source
Distributed indexing for semantic search [PDF]
In this paper we describe the process of building indices for semantic search using MapReduce. We compare the two most straightforward representations of RDF data, the horizontal index structure using parallel indices and the vertical index structure using fields. We measure the cost of building indices and also compare retrieval performance on keyword
openaire +1 more source

