The version presented here may differ from the published version or, version of record, if you wish to cite this item you are advised to consult the publisher's version. Please see the 'permanent WRaP URL' above for details on accessing the published version and note that access may require a subscription.
The design of solid-state lighting is vital, as numerous metrics are involved in their exact positioning, and as it is utilized in various processes, ranging from intelligent buildings to the internet of things (IoT). This work aims to determine the power and delay spread from the light source to the receiver plane. The positions of the light source and receiver were used for power estimation. We focus on analog orthogonal frequency-division multiplexing (OFDM) in visible light communication (VLC) and assess the area under the curve (AUC). The proposed system was designed using modulation techniques (i.e., quadrature amplitude modulation; QAM) for visible light communication (VLC) and pulse-width modulation (PWM) for dimming sources. For the positioning and spreading of brightness, the proof-of-concept was weighted equally over the entire area. Therefore, the receiver plane was analyzed, in order to measure the power of each light-emitting diode (LED) in a given area, using the delayed mean square error (MSE). A framework was applied for the placement of LEDs, using full-width at half-maximum (FWHM) parameters with varying distances. Then, the received power was confirmed. The results show that the AUC using DRMS values for LEDs significantly increased (by 30%) when the number of source LEDs was changed from four to three. These results confirm that our system, associated with the simple linear lateration estimator, can achieve better energy consumption.
The data generated from non-Euclidean domains and its graphical representation (with complex-relationship object interdependence) applications has observed an exponential growth. The sophistication of graph data has posed consequential obstacles to the existing machine learning algorithms. In this study, we have considered a revamped version of a semi-supervised learning algorithm for graph-structured data to address the issue of expanding deep learning approaches to represent the graph data. Additionally, the quantum information theory has been applied through Graph Neural Networks (GNNs) to generate Riemannian metrics in closed-form of several graph layers. In further, to pre-process the adjacency matrix of graphs, a new formulation is established to incorporate high order proximities. The proposed scheme has shown outstanding improvements to overcome the deficiencies in Graph Convolutional Network (GCN), particularly, the information loss and imprecise information representation with acceptable computational overhead. Moreover, the proposed Quantum Graph Convolutional Network (QGCN) has significantly strengthened the GCN on semi-supervised node classification tasks. In parallel, it expands the generalization process with a significant difference by making small random perturbations ÁG of the graph during the training process. The evaluation results are provided on three benchmark datasets, including Citeseer, Cora, and PubMed, that distinctly delineate the superiority of the proposed model in terms of computational accuracy against state-of-the-art GCN and three other methods based on the same algorithms in the existing literature.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.