检索结果-内蒙古大学图书馆

Non-intrusive load monitoring based on time-enhanced multidimensional feature visualization

SCIENTIFIC REPORTS 2025年第1期15卷 1-18页

作者： Chen, Tie Yuan, Yimin Gao, Jiaqi Guo, Shinan Yang, Pingping China Three Gorges Univ Hubei Prov Key Lab Operat & Control Cascaded Hydro Yichang 443002 Peoples R China China Three Gorges Univ Coll Elect & New Energy Yichang 443002 Peoples R China

In the research of non-intrusive load monitoring (NILM), the temporal characteristics of V-I trajectories are often overlooked, and using a single feature for identification may lead to insignificant differences between similar loads. Based on this, this paper proposes a non-intrusive load monitoring method based on time-enhanced multidimensional feature visualization. By adding a time axis to the V-I trajectory, it integrates the rate of change in voltage and current, power factor, and third harmonic to form a three-dimensional spatiotemporal color V-I trajectory, addressing the gap in dynamic characteristics. The ECA-ResNet34 network model is used for load identification, avoiding the problems of network degradation and training difficulties caused by the excessive depth of traditional convolutional neural networks (CNN), and achieving efficient monitoring of household loads. The method was validated on the PLAID dataset, achieving an average F1 score of 97.3%. Furthermore, utilizing transfer learning, the model trained and tested on the PLAID dataset was further tested on the WHITED dataset to increase the model's universality and generalization ability, showing significant effects in identifying loads with similar V-I trajectories and multiple states.

关键词： Non-intrusive load monitoring V-I trajectory Time-enhanced Multidimensional color coding

来源：评论

学校读者我要写书评

暂无评论

Quantum visual multi-tone secret sharing scheme based on color encoding

引用

SIGNAL IMAGE AND VIDEO PROCESSING 2025年第7期19卷 1-13页

作者： Liu, Meng-Yao Zhao, Pei-Jun Yan, Bin Pan, Jeng-Shyang Yang, Hong-Mei Shandong Univ Sci & Technol Coll Elect & Informat Engn Qingdao 266590 Shandong Peoples R China Shandong Univ Sci & Technol Coll Comp Sci & Engn Qingdao 266590 Shandong Peoples R China

Current quantum visual secret sharing (QVSS) schemes are mainly limited to encrypting black-and-white binary images, which is one of their major key problems. To solve this problem, we propose a new quantum visual multi-tone secret sharing (QVMTSS) scheme. In the sharing phase, we first encrypt the whole quantum image using a novel enhanced quantum representation (NEQR). This avoids individual pixel processing while achieving the encryption of the four-tone image. Subsequently, we encode the binary color values to drastically reduce qubit usage during the sharing phase and achieve the encryption of a 2t\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2<^>t$$\end{document}-tone image. In the recovery phase, the secret image is recovered by performing quantum XOR operations based on position. Theoretical analysis and experimental findings confirm the scheme's security and feasibility.

关键词： Quantum visual secret sharing Multi-tone color coding Quantum XOR operation

来源：评论

学校读者我要写书评

暂无评论

cXR plus Voxel-Based Semantic Compression for Networked Immersion

引用

IEEE ACCESS 2023年 11卷 52763-52777页

作者： Rezwan, Sifat Wu, Huanzhuo Cabrera, Juan A. Nguyen, Giang T. Reisslein, Martin Fitzek, Frank H. P. Tech Univ Dresden TU Dresden Deutsch Telekom Chair Commun Networks D-01062 Dresden Germany Nokia D-81541 Munich Germany Tech Univ Dresden TU Dresden Hapt Commun Syst D-01062 Dresden Germany Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ 85287 USA Tech Univ Dresden Ctr Tactile Internet Human Loop CeTI D-01062 Dresden Germany

Extended Reality (XR) applications, which may encompass Augmented Reality (AR) and Virtual Reality (VR), commonly involve immersive virtual environments that are based on real physical environments. Transmitting the extensive color and depth image data for representing a physical environment over a communication network to create a corresponding immersive environment at a remote location is very challenging due to the enormous data volumes and the time constraints of real-time immersion. We explore semantic compression, which conveys the semantic meaning of the data through color-codes (CCs) to reduce the transmitted data volume. The creation of an immersive environment conventionally involves five steps (with corresponding output): calibration (single-frame point cloud), registration (registered point cloud), volume reconstruction (voxel frame), marching cubes (meshes), and rendering (3D environment). We develop the novel cXR+ semantic compression that splits the volume reconstruction into a client-side virtual network function (VNF) that represents the registered point cloud as CCs for network transmission to a server-side VNF that decodes the CCs to obtain the voxel frames so as to complete the volume reconstruction. We consider an analogous splitting of the calibration into two VNFs with Graph coloring (GC) compression of the color and depth image data as a comparison benchmark. Additionally, we consider the transmission of the raw and JPG compressed point cloud data as well as the volume reconstruction at the client-side and subsequent transmission of the voxel frames as benchmarks. We conduct measurements of the compression (computing) time, transmission time, compression ratio, and reconstruction accuracy for real-world data sets so as to elucidate the trade-offs in employing voxel-based semantic compression for transmitting immersive environments over communication networks.

关键词： Semantics Point cloud compression Three-dimensional displays Image color analysis Image coding Image reconstruction Servers Extended reality color coding communication network functional compression semantic compression virtual reality volumetric semantic compression voxel

来源：评论

学校读者我要写书评

暂无评论

Faster algorithms for k-subset sum and variations

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年第1期45卷 1-21页

作者： Antonopoulos, Antonis Pagourtzis, Aris Petsalakis, Stavros Vasilakis, Manolis Natl Tech Univ Athens Sch Elect & Comp Engn Athens 15780 Greece

We present new, faster pseudopolynomial time algorithms for the k-SUBSET SUM problem, defined as follows: given a set Z of n positive integers and k targets t(1), ... , t(k), determine whether there exist k disjoint subsets Z(1), ... , Z(k) subset of Z, such that E(Z(i)) = t(i), for i = 1, ... , k. Assuming t = max{t(1), ... , t(k)} is the maximum among the given targets, a standard dynamic programming approach based on Bellman's algorithm can solve the problem in O(nt(k)) time. We build upon recent advances on SUBSET SUM due to Koiliaris and Xu, as well as Bringmann, in order to provide faster algorithms for k-SUBSET SUM. We devise two algorithms: a deterministic one of time complexity (SIC)(n(k/(k+1))t(k)) and a randomised one of (SIC)(n + t(k)) complexity. Additionally, we show how these algorithms can be modified in order to incorporate cardinality constraints enforced on the solution subsets. We further demonstrate how these algorithms can be used in order to cope with variations of k-SUBSET SUM, namely SUBSET SUM RATIO, k-SUBSET SUM RATIO and MULTIPLE SUBSET SUM.

关键词： color coding FFT k-Subset Sum Multiple Knapsack Multiple Subset Sum Pseudopolynomial algorithms Subset Sum

来源：评论

学校读者我要写书评

暂无评论

Navigating through the noise: The effect of color-coded performance feedback on decision-making

引用

CONTEMPORARY ACCOUNTING RESEARCH 2024年第2期41卷 1031-1057页

作者： Cardinaels, Eddy Kramer, Stephan Maas, Victor S. Tilburg Univ Tilburg Sch Econ & Management Tilburg Netherlands Erasmus Univ Rotterdam Sch Management Rotterdam Netherlands Univ Amsterdam Amsterdam Business Sch Plantage Muidergracht 12 NL-1018 TV Amsterdam Netherlands

Many companies use color codes in their internal performance reports to highlight how current performance compares to performance in a previous period. We examine whether the use of color coding affects managers' decision-making in a resource allocation task. We argue that managers' decision accuracy will be lower if they receive noisier feedback, but that this detrimental effect of noise can be mitigated through color coding. Using two experiments, we find evidence consistent with our theory. Managers who receive reports in which performance increases are color-coded green and performance decreases are color-coded red are less affected by noise than managers who receive feedback reports without color coding. Supplemental analyses suggest that color coding induces managers to process feedback in a more holistic manner, which reduces the adverse effect of noise on managers' learning processes. Our findings have several important implications for research and practice. Remedier au manque de precision : la retroaction sur la performance par codes de couleur et son effet sur la prise de decisionDe nombreuses entreprises utilisent des codes de couleur dans leurs rapports de performance internes pour comparer la performance actuelle et la performance d'une periode anterieure. Les auteurs examinent si l'utilisation de codes de couleur influence la prise de decision chez les gestionnaires lors d'une tache liee a l'allocation de ressources. Ils soutiennent que la justesse des decisions des gestionnaires est moins grande si le niveau de precision de la retroaction est plus faible, mais que cet effet defavorable peut etre attenue par l'utilisation de codes de couleur. A l'aide de deux experiences, les auteurs trouvent des donnees qui concordent avec leur theorie. Les gestionnaires qui recoivent des rapports dans lesquels les ameliorations de performance sont codees en vert et les baisses de performance en rouge sont moins influences par le manque de precision que les gestionna

关键词： color coding feedback learning noise performance measurement apprentissage code de couleur manque de precision mesure de performance retroaction

来源：评论

学校读者我要写书评

暂无评论

To Increase Data Capacity of QR Code Using Multiplexing with color coding: An example of Embedding Speech Signal in QR Code 11

To Increase Data Capacity of QR Code Using Multiplexing with...

引用

11th Annual IEEE India Conference (INDICON)

作者： Galiyawala, Hiren J. Pandya, Kinjal H. CGPIT Dept E&C Bardoli Gujarat India

ISBN: (纸本)9781479953646

QR codes have become widely popular along with the increased usage and popularity of smart phones. In many areas, QR codes have overtaken the place of linear barcodes because of the obvious advantage of large data capacity and ease of data retrieval. QR code specifications offers many more advantages like reduced space, durability against soil and damage, high data capacity, supported languages are more than other barcodes, supports 360 degree reading, etc over linear barcodes which makes QR codes worth opting. The structural flexibility of QR code architecture opens many more possibilities to stretch the limits of data capacity further away which includes data hiding techniques, multiplexing techniques, use of color QR codes, use of data compression techniques, etc. Proposed technique attempts to increase data capacity by multiplexing several QR codes and generating a color QR code. Experimental results show that this technique offers increase of the data capacity upto 24 times as compared to a standard QR code of same size. To get quicker results while demultiplexing, multiplexing of 12 or less QR codes is advisable with proposed technique. Due to such large capacity offered by proposed technique, embedding of speech signal into a QR code has made possible.

关键词： QR code image multiplexing color coding data capacity enhancement embedding speech in QR code

来源：评论

学校读者我要写书评

暂无评论

Teaching Series and Parallel Connections

引用

IEEE TRANSACTIONS ON EDUCATION 2022年第3期65卷 461-470页

作者： Skromme, B. J. Wong, M. L. Redshaw, C. J. O'Donnell, M. A. Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ 85287 USA Arizona State Univ Coll Res & Evaluat Serv Team Tempe AZ 85287 USA

Contribution: A new operational definition of series connections is given based on elements belonging to the same two meshes, which is properly dual to the usual definition of parallel elements being connected to the same two nodes. Furthermore, computer-based exercises have been developed and tested to teach students about such connections in gateway linear circuits courses, using color coding of nodes and meshes as a pedagogical device. Background: Series and parallel connections are a crucial but difficult concept. Existing textbooks give them limited attention, resulting in later difficulties learning circuit analysis. Research Questions: RQ1: Can an improved definition of series elements aid student understanding and student satisfaction? RQ2: Can a computer-based ``game'' lead to effective mastery and student satisfaction at a wide range of institutions, including minority-serving ones? Methodology: Standard and new definitions were elaborated in a multiple-choice tutorial. A game was developed focusing on identifying series and parallel connections, with color coding of both nodes and meshes. Student learning was assessed over eight years using pretest and posttest in 14 varied institutions. Student opinions were assessed using several types of surveys. Findings: Strong learning gains were observed every semester from built-in pretest and posttest, with average scores of 28% and 87%, respectively. Large improvements were observed at every institution including five minority-serving ones. The posttest score is increased by a statistically significant amount after introducing the new definition of series elements. Students preferred the new definition of series and recommended its use, and very strongly endorsed color coding.

关键词： Resistors Voltage Image color analysis Encoding Software color Circuit analysis Circuit topology color coding computer-aided instruction conceptual learning linear circuit analysis parallel connections series connections

来源：评论

学校读者我要写书评

暂无评论

Binary annular phase mask for extended depth of field imaging system

Binary annular phase mask for extended depth of field imagin...

引用

2024 Frontiers in Optics, FiO 2024

作者： Reyes-Alfaro, J. Manuel Toxqui-Quitl, Carina Padilla-Vivanco, Alfonso González-Amador, Enrique Computer Vision Laboratory Universidad Politécnica de Tulancingo Ingenierías 100 Hidalgo43629 Mexico

A digital-optical imaging that uses a binary annular phase mask at the exit pupil to extend the depth of field is presented. The binary phase mask deliberately left the three different phase shifts, one for each wavelength of red, green and blue light, so all color channels are in focus for different axial lengths in obejct space. The optical imaging system with an extended depth of field provides a high-resolution composited image due to merging in-focus red, green and blue images. © Optica Publishing Group 2024, © 2024 The Author(s)

关键词： color coding phase mask pupil engineering

来源：评论

学校读者我要写书评

暂无评论

Randomized and Optimal Algorithms for k-Lifetime Dominating Set in Wireless Sensor Networks

引用

IEEE ACCESS 2022年 10卷 23774-23784页

作者： Luo, Weizhong Liang, Junbin Wang, Tianshu Huizhou Univ Sch Comp Sci & Engn Huizhou 516007 Guangdong Peoples R China Guangxi Univ Sch Comp & Elect Informat Guangxi Key Lab Multimedia Commun & Network Techn Nanning 530004 Peoples R China Neusoft Grp Co Ltd Nanning 530004 Peoples R China

In wireless sensor networks, rotating dominating set is an efficient method for balancing the energy consumption of nodes, and thereby extending the network operational time. This method can be abstracted as k-Lifetime Dominating Set in bipartite graph, that partitions the set of graph vertices representing sensors into k disjoint dominating sets. However, the considered problem has been proven to be NP-hard, and there is no hope of solving it in polynomial time unless P = NP. Existing studies mainly focus on developing approximation or heuristic algorithms, which usually cannot guarantee a solution for a given problem yes instance. In this study, we first propose a randomized algorithm that can generate a solution with guaranteed probability 1-epsilon (0 < epsilon < 1). Using the color coding method, we show that the randomized algorithm can be improved to guarantee the generation of a solution for a given problem yes instance in exponential time. Based on the idea of randomized partition, we further present a more practical centralized greedy algorithm, and then a distributed implementation. Simulation results indicate that the centralized algorithm can efficiently generate optimal solutions for almost all the given problem instances if the partition redundancy is above a certain limit. Compared with existing algorithm, the centralized algorithm increases the number of dominating sets by factors between 0% and 21%.

关键词： Dominating set NP-hard color coding random partition optimal algorithms

来源：评论

学校读者我要写书评

暂无评论

The Contribution of Adaptive Optics to Our Understanding of the Mechanisms of color Vision in Humans

引用

Neuroscience and Behavioral Physiology 2023年第6期53卷 1025-1035页

作者： Maximova, E.M. Kharkevich Institute of Information Transmission Problems Russian Academy of Sciences Moscow Russian Federation

We provide here a brief outline of data on color vision in animals and humans, along with the history and methods used in studying it. Results from basic research in this area obtained using adaptive optics and scanning laser ophthalmoscopy (AOSLO) in combination with densitometry, phase-sensitive optical coherence tomography (AO-PSOCT), and calcium imaging (Ca²⁺ imaging) are described. These methods provided the first in vivo evidence for the mosaic of cones in the human retina, allowing maps of the locations of cones of three different types (L, M, S) to be built and human color perception in response to stimulation of single cones to be investigated. © 2023, Springer Nature Switzerland AG.

关键词： adaptive optics color coding color vision dichromacy L cones M cones S cones

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：