Results 91 to 100 of about 4,253,766 (293)
Composition Algorithms for Conditional Distributions
This chapter is about two recently published algorithms that can be used to sample from conditional distributions. We show how the efficiency of the algorithms can be improved when a sample is required from many conditional distributions. Using real-data examples from educational measurement, we show how the algorithms can be used to sample from ...
Maarten Marsman +2 more
openaire +4 more sources
Distributed Graph Simulation: Impossibility and Possibility [PDF]
This paper studies fundamental problems for distributed graph simulation. Given a pattern query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is to compute the matches Q(G) of Q in G.
Wang, Xin +3 more
core
Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source
Dynamic Barrier Coverage in a Wireless Sensor Network for Smart Grids
The development of engineering technology such as inspection robots (IR) for transmission lines and wireless sensor networks (WSN) are widely used in the field of smart grid monitoring.
Fei Fan +5 more
doaj +1 more source
Descriptive Combinatorics and Distributed Algorithms
This is a draft of an article to appear in the October 2022 issue of the Notices of the AMS. In this survey article we explore a fascinating area called descriptive combinatorics and its recently discovered connections to distributed algorithms -- a fundamental part of computer science that is becoming increasingly important in the modern era of ...
openaire +2 more sources
Non Parametric Distributed Inference in Sensor Networks Using Box Particles Messages [PDF]
This paper deals with the problem of inference in distributed systems where the probability model is stored in a distributed fashion. Graphical models provide powerful tools for modeling this kind of problems.
Haj Chhadé, Hiba +15 more
core +1 more source
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
RoundMi: A quantitative method to analyze mitochondrial morphology in mitotic cells
RoundMi is a workflow for rapid analysis of mitochondrial morphology in mitotic cells. By combining adaptive preprocessing with automated segmentation and quantification, it enables accurate measurements from single focal plane images, reducing acquisition time and computational demands while remaining compatible with high‐throughput fixed and live ...
Elmira Parvindokht Bararpour +2 more
wiley +1 more source

