Mechanical Fault Diagnosis of High-Voltage Circuit Breakers Based on Multi-Sensor Gramian Angular Field and Deep Residual Network. [PDF]
Sensors (Basel)Li X +6 more
europepmc +1 more source
Distributed Antenna Array and RIS-Assisted Planning Framework for Intelligent Coverage Optimization in B5G/6G Cell-Free Massive MIMO. [PDF]
Sensors (Basel)Farre V +5 more
europepmc +1 more source
Imaging-Based Spatial Transcriptomics: Data Interpretation Methods and Biomedical Applications. [PDF]
Biology (Basel)Li W, Zhou Y.
europepmc +1 more source
Protocol for imaging and analyzing the synaptic coverage of astrocytes with super-resolution STED microscopy in mouse brain slices. [PDF]
STAR ProtocWaldron L +3 more
europepmc +1 more source
Halo: a pretrained model for whole-cell segmentation from nuclei images in spatial transcriptomics. [PDF]
Brief BioinformZhang X, Zhuang H, Ji Z.
europepmc +1 more source
On the 2-Dimensional Channel Assignment Problem
IEEE Transactions on Computers, 1984 We consider the 2-dimensional channel assignment problem: given a set S of iso-oriented rectangles (whose sides are parallel to the coordinate axes), find a minimum number of planes (channels) to which only nonoverlapping rectangles are assigned. This problem is equivalent to the coloring problem of the rectangle intersection graph G = (V, E), in which
Der-Tsai Lee, Joseph Y-T Leung
exaly +4 more sources
Related searches:
A Theorem About the Channel Assignment Problem
SIAM Journal on Discrete Mathematics, 2003Summary: A list channel assignment problem is a triple \((G,L,w)\), where \(G\) is a graph, \(L\) is a function which assigns to each vertex of \(G\) a list of integers (colors), and \(w\) is a function which assigns to each edge of \(G\) a positive integer (its weight).
Riste Škrekovski, Daniel Kráľ
exaly +2 more sources
The Channel Assignment Problem
1983 IEEE Symposium on Security and Privacy, 1983An optimization problem exists in the context of local area network security. The network provides a number of physical or logical "channels", each carrying a set of levels or compartments of information. A channel is accessible to users cleared for all the levels it carries.
Bahaa W. Fam, Jonathan K. Millen
openaire +2 more sources
An Optimal Solution for the Channel-Assignment Problem
IEEE Transactions on Computers, 1979Given a set of intervals (pairs of real numbers), we look at the problem of finding a minimal partition of this set such that no element of the partition contains two overlapping intervals. We exhibit a Θ(N log N) algorithm which is optimal. The problem has applications in LSI layout design and job scheduling.
Udaiprakash I. Gupta +2 more
exaly +4 more sources
A new lower bound for the channel assignment problem
IEEE Transactions on Vehicular Technology, 2000The strength of lower bounds for the span in channel assignment problems is discussed with reference to standard benchmark problems. It is shown that in some circumstances current bounds are capable of very significant improvement. The use of methods from mathematical programming is outlined and a new lower bound applicable to cellular problems is ...
Derek H. Smith +2 more
openaire +2 more sources