Results 41 to 50 of about 157,946 (258)

CSRQ: Communication-Efficient Secure Range Queries in Two-Tiered Sensor Networks

open access: yesSensors, 2016
In recent years, we have seen many applications of secure query in two-tiered wireless sensor networks. Storage nodes are responsible for storing data from nearby sensor nodes and answering queries from Sink.
Hua Dai   +4 more
doaj   +1 more source

Organoids in pediatric cancer research

open access: yesFEBS Letters, EarlyView.
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley   +1 more source

Encodings for Range Majority Queries [PDF]

open access: yes, 2014
We face the problem of designing a data structure that can report the majority within any range of an array A[1,n], without storing A. We show that Ω(n) bits are necessary for such a data structure, and design a structure using O(nlog* n) bits that answers majority queries in O(logn) time. We extend our results to τ-majorities.
Gonzalo Navarro 0001   +1 more
openaire   +1 more source

Quadrant-Based Minimum Bounding Rectangle-Tree Indexing Method for Similarity Queries over Big Spatial Data in HBase

open access: yesSensors, 2018
With the rapid development of mobile devices and sensors, effective searching methods for big spatial data have recently received a significant amount of attention.
Bumjoon Jo, Sungwon Jung
doaj   +1 more source

Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation

open access: yesFEBS Letters, EarlyView.
Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe   +3 more
wiley   +1 more source

Distributed Efficient Similarity Search Mechanism in Wireless Sensor Networks

open access: yesSensors, 2015
The Wireless Sensor Network similarity search problem has received considerable research attention due to sensor hardware imprecision and environmental parameter variations. Most of the state-of-the-art distributed data centric storage (DCS) schemes lack
Khandakar Ahmed, Mark A. Gregory
doaj   +1 more source

The planar cell polarity protein Vangl2 interacts with the PDZ‐domains of Scribble but not with a unique PDZ‐like domain in Inturned

open access: yesFEBS Letters, EarlyView.
Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes   +4 more
wiley   +1 more source

Diversity and complexity in neural organoids

open access: yesFEBS Letters, EarlyView.
Neural organoid research aims to expand genetic diversity on one side and increase tissue complexity on the other. Chimeroids integrate multiple donor genomes within single organoids. Self‐organising multi‐identity organoids, exogenous cell seeding, or enforced assembly of region‐specific organoids contribute to tissue complexity.
Ilaria Chiaradia, Madeline A. Lancaster
wiley   +1 more source

Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation

open access: yesFEBS Letters, EarlyView.
Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz   +11 more
wiley   +1 more source

Range minimum queries in minimal space [PDF]

open access: yesTheoretical Computer Science, 2022
We consider the problem of computing a sequence of range minimum queries. We assume a sequence of commands that contains values and queries. Our goal is to quickly determine the minimum value that exists between the current position and a previous position $i$.
openaire   +3 more sources

Home - About - Disclaimer - Privacy