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

arXiv 2024年

作者： Wang, Shengbin Li, Guihui Chen, Zhaoyun Wang, Peng Dou, Menghan Zheng, Haiyong Wang, Zhimin Gu, Yongjian Wu, Yu-Chun Guo, Guo-Ping Origin Quantum Computing Company Limited Anhui Hefei230026 China CAS Key Laboratory of Quantum Information University of Science and Technology of China Anhui Hefei230026 China Intelligent Information Sensing and Processing Lab College of Electronic Engineering Ocean University of China Shandong Qingdao266000 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Anhui Hefei230088 China College of Physics and Optoelectronic Engineering Ocean University of China Shandong Qingdao266100 China

Solving combinatorial optimization problems using variational quantum algorithms (VQAs) represents one of the most promising applications in the NISQ era. However, the limited trainability of VQAs could hinder their scalability to large problem sizes. In this paper, we improve the trainability of variational quantum eigensolver (VQE) by utilizing convex interpolation to solve portfolio optimization. The idea is inspired by the observation that the Dicke state possesses an inherent clustering property. Consequently, the energy of a state with a larger Hamming distance from the ground state intuitively results in a greater energy gap away from the ground state energy in the overall distribution trend. Based on convex interpolation, the location of the ground state can be evaluated by learning the property of a small subset of basis states in the Hilbert space. This enlightens naturally the proposals of the strategies of close-to-solution initialization, regular cost function landscape, and recursive ansatz equilibrium partition. The successfully implementation of a 40-qubit experiment using only 10 superconducting qubits demonstrates the effectiveness of our proposals. Furthermore, the quantum inspiration has also spurred the development of a prototype greedy algorithm. Extensive numerical simulations indicate that the hybridization of VQE and greedy algorithms achieves a mutual complementarity, combining the advantages of both global and local optimization methods. Our proposals can be extended to improve the trainability for solving other large-scale combinatorial optimization problems that are widely used in real applications, paving the way to unleash quantum advantages of NISQ computers in the near future. Copyright © 2024, The Authors. All rights reserved.

关键词： Ground state

来源：评论

学校读者我要写书评

暂无评论

Attribute-Based Encryption With Payable Outsourced Decryption Using Blockchain and Responsive Zero Knowledge Proof

arXiv

引用

arXiv 2024年

作者： Cai, Dongliang Chen, Borui Zhang, Liang Li, Kexin Kan, Haibin Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China Shanghai Engineering Research Center of Blockchain Shanghai200433 China Department of Industrial Engineering and Decision Analytics Hong Kong University of Science and Technology Hong Kong Yiwu Research Institute of Fudan University Yiwu322000 China

Attribute-Based Encryption (ABE) is a promising solution for access control in cloud services. However, the heavy decryption overhead hinders its widespread adoption. A general approach to address this issue is to outsource decryption to decryption cloud service(DCS). Existing schemes have utilized various methods to enable users to verify outsourced results;however, they lack an effective mechanism to achieve exemptibility which enables the honest DCS to escape from wrong claims. And it is impractical to assume that the DCS will provide free services. In this paper, we propose a blockchain-based payable outsourced decryption ABE scheme that achieves both verifiability and exemptibility without adding redundant information to ABE ciphertext. We use zero-knowledge proof to verify outsourced results on blockchain and introduce an optional single-round challenge game under optimistic assumption to address the high cost of proof generation. Moreover, our system achieves fairness and decentralized outsourcing to protect the interests of all parties. Finally, we implement and evaluate our scheme on Ethereum to demonstrate its feasibility and efficiency, the gas usage in attribute numbers from 5 to 60 is 11× to 140× in the happy case and 4× to 55× in the challenge case lower than the scheme of Ge et al. (TDSC'23). Copyright © 2024, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Collaborative Scheduling of computing Tasks for Edge computing

Collaborative Scheduling of Computing Tasks for Edge Computi...

引用

2021 China Automation Congress, CAC 2021

作者： Liu, Yue Xiong, Gang Zhu, Fenghua Chen, Shichao Zhang, Liguo Liu, Xudong School of Artificial Intelligence and Automation Beijing University of Technology The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Beijing Engineering Research Center of Intelligent Systems and Technology Institute of Automation The Cloud Computing Center Chinese Academy of Sciences Beijing China The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Qingdao Academy of Intelligent Industries Chinese Academy of Sciences Beijing China Faculty of Information and Technology Beijing University of Technology Beijing China

ISBN: (纸本)9781665426473

In the face of the rapid development of the IoT, the traditional cloud computing, while providing services for mobile intelligent devices, also brings problems such as network bandwidth occupation and communication delay. Edge computing can solve these problems to some extent. But too many offloaded tasks may result in an edge server becoming overloaded and execution delay of tasks increasing, the computing resources of idle edge devices are also not fully utilized. In order to make full use of the computing resources of idle edge devices in the local network and reduce the execution delay for computing tasks, this paper takes the average delay time for all end devices as the optimization objective and proposes an end-edge cooperative scheduling (EECS) model to schedule tasks for edge computing. The scheduling algorithm used in EECS model is improved based on MCT algorithm. We use the EdgeCloudSim to verify the EECS model and scheduling algorithm. The simulation results show that the average completion time of computing tasks in EECS model, compared with only single edge server (SEE) task computing model, can be reduced by up to three times. In addition, the system load can be balanced to a certain extent in local network. © 2021 IEEE

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm

arXiv

引用

arXiv 2022年

作者： Bao, Shilong Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Alibaba Group China School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China Peng Cheng Laboratory China

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a diversity control regularization term to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML. © 2022, CC BY-NC-SA.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

ECA-RetinaNet: A Novel Self-Attention RetinaNet for Environmental Microorganism Image Object Detection

ECA-RetinaNet: A Novel Self-Attention RetinaNet for Environm...

引用

IEEE International Conference on Big Data

作者： Hechen Yang Jinzhu Yang Tao Jiang Xin Zhao Jinghua Zhang Peng Zhao Ao Chen Qianqing Nie Marcin Grzegorzek Chen Li Microscopic Image and Medical Image Analysis Group College of Medicine and Biological Information Engineering Northeastern University Shenyang China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Shenyang Liaoning China School of Intelligent Medicine Chengdu University of Traditional Chinese Medicine Chengdu China International Joint Institute of Robotics and Intelligent Systems Chengdu University of Information Technology Chengdu China Institute of Medical Informatics University of Luebeck Luebeck Germany

The detection of environmental microorganisms is always a difficult task, e specially when the multi-scale environment is complex. For tiny objects in microscopic images, current detection methods face the challenge of accurate identification and localization. In contrast, we propose a convolutional neural network (ECA-RetinaNet) for microscopic object detection of which underlying dataset is a high-quality EMDS-7 dataset. The accuracy of ECA-RetinaNet is high, with a high mean Average Precision (mAP) value of 81.42% in the Environmental Microorganisms (EMS) detection task. Its accuracy has been higher than that of the two-stage object detection network.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DEEPACC:Automate Chromosome Classification Based On Metaphase Images Using Deep Learning Framework Fused With Priori Knowledge

DEEPACC:Automate Chromosome Classification Based On Metaphas...

引用

IEEE International Symposium on Biomedical Imaging

作者： Li Xiao Chunlong Luo Ningbo HuaMei Hospital University of the Chinese Academy of Sciences (UCAS) Advanced Computer Research Center Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Science

Chromosome classification is an important but difficult and tedious task in karyotyping. Previous methods only classify manually segmented single chromosome, which is far from clinical practice. In this work, we propose a detection based method, DeepACC, to locate and fine classify chromosomes simultaneously based on the whole metaphase image. We firstly introduce the Additive Angular Margin Loss to enhance the discriminative power of the model. To alleviate batch effects, we transform decision boundary of each class case-by-case through a siamese network which make full use of priori knowledges that chromosomes usually appear in pairs. Furthermore, we take the clinically seven group criteria as a prior-knowledge and design an additional Group Inner-Adjacency Loss to further reduce inter-class similarities. A private metaphase image dataset from clinical laboratory are collected and labelled to evaluate the performance. Results show that the new design brings encouraging performance gains comparing to the state-of-the-art baseline models.

关键词： Deep learning Image segmentation Additives Biological system modeling Knowledge based systems Transforms Performance gain

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage Graph Computation Model with Communication Equilibrium 15th

A Two-Stage Graph Computation Model with Communication Equil...

引用

15th CCF Conference on Computer Supported Cooperative Work and Social computing, Chinese CSCW 2020

作者： Dong, Yanmei Chen, Rongwang Guo, Kun College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China College of Mathematics and Computer Science Wuyi University Wuyishan Fujian354300 China Digital Fujian Tourism Big Data Institute Wuyishan Fujian354300 China

ISBN: (纸本)9789811625398

Distributed graph computing aims at performing in-depth analysis on large networks in a parallel manner. Iterative communication computation is an important model to perform graph analysis. Moreover, high-efficiency iterative communication computation is necessary for assuring the quality of graph partitioning. Many strategies to improve graph computing are usually based on the hypothesis of single communication iteration which focuses on the optimization of load balance in a single graph partitioning and the improvement of parallel granularity or communication manners. However, a graph in the real-world usually requires complex communication iterations to achieve good analysis results, which often have the problems of data and communication tilting and low analysis efficiency. In this paper, we propose a two-stage graph computing model with communication equilibrium (TSMCE). The model employs a communication-equilibrated graph partitioning strategy (CEGP) for load balancing and a two-stage graph computing mode (TS) to reduce the crossing-partition communication. With the change of graph density, various factors such as load balancing, communication balancing, cross-partition transmission traffic, communication delay, and convergence speed can always maintain an efficient balance. The experiments conducted on the real-world datasets show that the communication-equilibrated graph partitioning strategy can divide a graph with high quality compared with Hash and Metis. Besides, the overall performance of our two-stage graph computing model with communication equilibrium is higher than that of the BSP model. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

TSW-FD: A novel temporal and spatial domain weight analysis of feature difference for micro-expression spotting

TSW-FD: A novel temporal and spatial domain weight analysis ...

引用

2020 International Symposium on Automation, information and computing, ISAIC 2020

作者： Zhang, Zhihao Mo, Fan Zhao, Ke Chen, Tong Fu, Xiaolan State Key Laboratory of Brain and Cognitive Science Institute of Psychology Chinese Academy of Sciences Beijing100101 China Department of Psychology University of Chinese Academy of Sciences Beijing100049 China Chongqing Key Laboratory of Non-linear Circuit and Intelligent Information Processing Southwest University Chongqing400715 China Chongqing Key Laboratory of Artificial Intelligence and Service Robot Control Technology Chongqing400715 China

The micro-expression spotting has recently attracted increasing attention from psychology and computer vision community, since embraced in the second facial Micro-Expression Grand Challenge (MEGC 2019). Different from the original feature difference (FD) analysis, in this paper, we proposed a novel temporal and spatial domain weight analysis of feature difference (TSW-FD) to achieve micro-expression spotting. The experimental results showed that TSW-FD improved 17.86% and 24.21% in F1-Score comparing to the FD in CASME Ⅱ and SMIC-E-HS. © 2021 institute of Physics Publishing. All rights reserved.

关键词： Finite difference method

来源：评论

学校读者我要写书评

暂无评论

Construction and Application of the SMART Model for Adaptive Industrial Data Collection Based on Knowledge Graphs

Construction and Application of the SMART Model for Adaptive...

引用

IEEE International Conference on Big Data

作者： Wendan Cheng Zhen Zhang Heng Qian Qiuyue Wang Guanqun Su Lingge Meng Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Shu Ju (Shandong) Intelligent Technology Co. Ltd. Jinan China Shandong Standard Institute of Emerging Technologies and Innovations Co. Ltd. Jinan China Shandong Qingniao IIoT Co. Ltd. Jinan China

ISBN: (数字)9798350362480

ISBN: (纸本)9798350362497

Industrial data collection is the foundation for implementing enterprise digitization, which is of great significance to the development of intelligent manufacturing. However, Industrial Data Collection Standards (IDCS) are primarily published in paper or PDF formats, which makes it challenging to associate and reuse knowledge. This brings difficulties to data collection and management of heterogeneous devices, thus affecting the adaptive collection of industrial data. For this reason, this paper introduces SMART into industrial data collection and proposes the construction and application of a knowledge graph-based SMART Model. First, ontology semantic reasoning and natural language processing techniques are utilized to develop an ontology model for industrial data collection and extract fine-grained IDCS knowledge. Then, the knowledge is integrated according to the standard primitive structure and conceptual reasoning rules by constructing a standard association model to form the Industrial Data Collection Standards Knowledge Graph (IDCS-KG). Finally, the SMART competence level is quantitatively assessed based on the completion degree of each operation within the SMART Model. An experimental case study demonstrates that the SMART Model can collect intelligent adaptive industrial data through the reasoning and analysis of equipment adaptation protocols and data quality management strategies.

关键词： Adaptation models Analytical models Protocols Knowledge graphs Data collection Ontologies Data models Cognition Natural language processing Standards

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Stereo Matching for Transparent Scene Depth Estimation

arXiv

引用

arXiv 2025年

作者： Liu, Zhidan Yao, Chengtang Zeng, Jiaxi Wu, Yuwei Jia, Yunde Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China

In this paper, we present a multi-label stereo matching method to simultaneously estimate the depth of the transparent objects and the occluded background in transparent scenes. Unlike previous methods that assume a unimodal distribution along the disparity dimension and formulate the matching as a single-label regression problem, we propose a multi-label regression formulation to estimate multiple depth values at the same pixel in transparent scenes. To resolve the multi-label regression problem, we introduce a pixel-wise multivariate Gaussian representation, where the mean vector encodes multiple depth values at the same pixel, and the covariance matrix determines whether a multi-label representation is necessary for a given pixel. The representation is iteratively predicted within a GRU framework. In each iteration, we first predict the update step for the mean parameters and then use both the update step and the updated mean parameters to estimate the covariance matrix. We also synthesize a dataset containing 10 scenes and 89 objects to validate the performance of transparent scene depth estimation. The experiments show that our method greatly improves the performance on transparent surfaces while preserving the background information for scene reconstruction. Code is available at https://***/BFZD233/TranScene. © 2025, CC BY.

关键词： Multiple linear regression

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：