Results 61 to 70 of about 3,877,335 (299)

A parallel algorithm for constructing binary decision diagrams [PDF]

Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2002
A parallel algorithm for constructing binary decision diagrams is described. The algorithms treats binary decision graphs as minimal finite automata. The automation for a Boolean function with AND as its main operation (OR operation) is obtained by forming the intersection (union) of the regular sets associated with its operands.
Shinji Kimura, Edmund M. Clarke
openaire   +2 more sources

The impact of leukocyte‐associated RNA retention on platelet RNA‐based cancer detection

Molecular Oncology, EarlyView.
Platelets carry RNA signals that may help detect cancer, but platelet samples can also retain RNA from white blood cells. We found that this retained white blood cell signal did not significantly affect machine learning cancer classification, suggesting that the cancer‐related RNA signal in platelets is largely independent of leukocyte‐associated RNA ...
Michał Sieczczyński, Krzysztof Pastuszak, Anna Samelak‐Czajka, Zuzanna Cemka, Paulina Jackowiak, Tomasz Stefaniak, Sylwia Łapińska‐Szumczyk, Jacek Jassem, Anna J. Żaczek, Matthew T. Rondina, Myron G. Best, Sjors G. J. G. In 't Veld, Anna Supernat   +12 more
wiley   +1 more source

Interactively Converting Ladder Diagrams into Grafcet Diagrams on a Robotic Neutralization System Case Study

Journal on Interactive Systems
Background: Programmable Logic Controllers (PLCs) are widely used to implement automation systems based on sequential control. For such systems, Ladder and Grafcet diagrams are standardized, respectively used as programming and specification formalisms.
Paulo André Sperandio Giacomin
doaj   +1 more source

Automated FRAP microscopy for high‐throughput analysis of protein dynamics in chromatin organization and transcription

FEBS Open Bio, EarlyView.
RoboMic is an automated confocal microscopy pipeline for high‐throughput functional imaging in living cells. Demonstrated with fluorescence recovery after photobleaching (FRAP), it integrates AI‐driven nuclear segmentation, ROI selection, bleaching, and analysis.
Selçuk Yavuz, Bart Geverts, Johan A. Slotman, Andrea Sacchetti, Stefan Prekovic, Martin E. van Royen, Adriaan B. Houtsmuller   +6 more
wiley   +1 more source

Efficient Enumeration of d-Minimal Paths Under Capacity Constraints: A Zero-Suppressed Decision Diagram Approach

IEEE Access
We study the enumeration of all d-minimal paths in a multistate two-terminal network, where each arc has a specific capacity limit. Classical approaches based on generating functions or incremental enumeration tend to suffer from severe combinatorial ...
Yasser Lamalem, Soufiane Hamida, Khalid Housni   +2 more
doaj   +1 more source

Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults

, 2014
This paper discusses the error resilience of Zero-Suppressed Binary Decision Diagrams (ZDDs), which are a particular family of Ordered Binary Decision Diagrams used for representing and manipulating combination sets.
V. Ciriani, Ciriani, Valentina, A. Bernasconi, Anna Bernasconi, Valentina Ciriani, BERNASCONI, ANNA, Ciriani V.   +6 more
core   +1 more source

MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis

FEBS Open Bio, EarlyView.
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss, Ao Li, Eduardo H. Gilglioni, Mayank Bansal, Sumeet Pal Singh, Latifa Bakiri, Alessandra K. Cardozo, Esteban N. Gurzov   +7 more
wiley   +1 more source

Symbolic vs. Bounded Synthesis for Petri Games [PDF]

Electronic Proceedings in Theoretical Computer Science, 2017
Petri games are a multiplayer game model for the automatic synthesis of distributed systems. We compare two fundamentally different approaches for solving Petri games. The symbolic approach decides the existence of a winning strategy via a reduction to a
Bernd Finkbeiner, Manuel Gieseking, Jesko Hecking-Harbusch, Ernst-Rüdiger Olderog   +3 more
doaj   +1 more source

Storing Set Families More Compactly with Top ZDDs

Algorithms, 2021
Zero-suppressed Binary Decision Diagrams (ZDDs) are data structures for representing set families in a compressed form. With ZDDs, many valuable operations on set families can be done in time polynomial in ZDD size.
Kotaro Matsuda, Shuhei Denzumi, Kunihiko Sadakane   +2 more
doaj   +1 more source

Query Learning Algorithm for Ordered Multi-Terminal Binary Decision Diagrams

, 2023
We propose a query learning algorithm for ordered multi-terminal binary decision diagrams (OMTBDDs) using at most n equivalence and 2n(l\lcei\log_2 m\rceil+ 3n) membership queries by extending the algorithm for ordered binary decision diagrams (OBDDs ...
Nakamura, Atsuyoshi
core