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

$k$k-TEVS: A $ k$k-Times E-Voting Scheme on Blockchain With Supervision

IEEE Transactions on Dependable and Secure Computing 2024年第3期22卷 2326-2337页

作者： Yang Liu Debiao He Min Luo Lianhai Wang Cong Peng School of Cyber Science and Engineering Wuhan University Wuhan China Institute of Information Technology Shenzhen Institute of Information Technology Shenzhen China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shanghai Technology Innovation Centre of Distributed Privacy-Preserving Artificial Intelligence Matrix Elements Technologies Shanghai China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

The e-vote is regarded as a way to express the opinion that the voters ask for. Actually, the e-vote could be applied wildly like questionnaire, survey and feedback. Moreover, the coexistences of efficiency and security as well as transparency and privacy could be considered as building blocks in the e-vote system. The blockchain could provide a public access board to reduce the storage costs for the field consisted of the vote group manager (GM) with its vote assistants (VA). Particularly the $k$ -times anonymous authentication ( $k$ -TAA) could also be a practical approach to preserve voters’ privacy and reduce the computation costs during the vote process. However, the e-vote scheme with pure $k$ -TAA strategy could damage either the supervision of voting or the efficiency and consistency of authentication process. What’s more, the impacts of dishonest voters couldn’t be stopped until the vote end. To tackle these problems, we apply the accumulator technology to add or revoke the voters at any time and extend the framework of $k$ -TAA with the update process for the e-vote on blockchain for supervision ( $ k$ -TEVS). In our scheme, the voter updates his membership witness and proves the fact that he is still a valid member with respective VA under the latest accumulator value. What’s more, this witness update operation is not contained in the authentication process, which means that the authentication process is still constant and efficient. Moreover, our add or delete update process with signature of knowledge needs only one pairing operation. For the security, we prove that the relaxed anonymity still holds in the $ k$ -TEVS framework. Finally, We implement $ k$ -TEVS scheme, the Emura’s work [1] and the Huang’s work [2] for comparison. Then we make time cost and communication cost experiments, which present the feasibility and practicality of this scheme.

关键词： Blockchains Authentication Costs Protocols Security Privacy Surveys Electronic voting computer science information security

来源：评论

学校读者我要写书评

暂无评论

GALA3D: Towards Text-to-3D Complex Scene Generation via Layout-guided Generative Gaussian Splatting

arXiv

引用

arXiv 2024年

作者： Zhou, Xiaoyu Ran, Xingjian Xiong, Yajiao He, Jinlin Lin, Zhiwei Wang, Yongtao Sun, Deqing Yang, Ming-Hsuan Wangxuan Institute of Computer Technology Peking University China National Key Laboratory for Multimedia Information Processing Google DeepMind United Kingdom University of California Merced United States

We present GALA3D, generative 3D GAussians with LAyout-guided control, for effective compositional text-to-3D generation. We first utilize large language models (LLMs) to generate the initial layout and introduce a layout-guided 3D Gaussian representation for 3D content generation with adaptive geometric constraints. We then propose an instance-scene compositional optimization mechanism with conditioned diffusion to collaboratively generate realistic 3D scenes with consistent geometry, texture, scale, and accurate interactions among multiple objects while simultaneously adjusting the coarse layout priors extracted from the LLMs to align with the generated scene. Experiments show that GALA3D is a user-friendly, end-to-end framework for state-of-the-art scene-level 3D content generation and controllable editing while ensuring the high fidelity of object-level entities within the scene. The source codes and models will be available at ***. Copyright © 2024, The Authors. All rights reserved.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

An Optimal Power System Multi-objective Environmental-Economic Planning Based on Moth-Flame Optimization 1

引用

18th International Conference on Intelligent information Hiding and Multimedia Signal processing, IIH-MSP 2022

作者： Chu, Shu-Chuan Nguyen, Trong-The Nguyen, Vinh-Tiep Nguyen, Trinh-Dong Dao, Thi-Kien College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China University of Information Technology Ho Chi Minh City700000 Viet Nam Vietnam National University Ho Chi Minh City700000 Viet Nam Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China

ISBN: (数字)9789819901050

ISBN: (纸本)9789819901043

A power system’s optimization under economic planning concerns scheduling sectors as a challenging reality task with its characteristics with non-convex, high-dimensional, nonlinear problems. This study introduces an optimal power system environmental and economic scheduling based on a multi-moth-flame optimizer (MMFO). A multi-objective programming mathematical model uses the Pareto optimal frontier to obtain the Pareto non-inferiority optimal solution, generate the optimal configuration scheme, and search for the optimal global solution in the feasible region. Calculation results of a power system with IEEE test case of 15 and 40 generator sets demonstrate the high convergence and strong adaptability of the algorithm suggested in addressing the environmental-economic dispatch of the power system. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

In-sensor Computing ANN Capacitive Sensors

arXiv

引用

arXiv 2024年

作者： Zhao, Guihua Peng, Yating Zhu, Jiaxin Tang, Xin Yu, Zhiyi School of Microelectronics Science and Technology Sun Yat-sen University Zhuhai519082 China Guangdong Provincial Key Laboratory of Optoelectronic Information Processing Chips and Systems Sun Yat-Sen University Guangdong China

This letter proposes an in-sensor computing multiply-and-accumulate (MAC) circuit based on capacitance. The MAC circuits can constitute an artificial neural network (ANN) layer and be operated as ANN classifiers and autoencoders. The proposed circuit is a promising scheme for capacitive ANN image sensors, showing competitively high efficiency and lower power. Copyright © 2024, The Authors. All rights reserved.

关键词： Capacitive sensors

来源：评论

学校读者我要写书评

暂无评论

Heuristic attribute reduction based on neighborhood knowledge granularity 3

Heuristic attribute reduction based on neighborhood knowledg...

引用

2021 3rd International Conference on Artificial Intelligence and computer Science, AICS 2021

作者： Yang, Wen Wang, Lei Liu, Chao Zhong, Qiangqiang School of Information Engineering Nanchang Institute of Technology Nanchang330099 China Jiangxi Provincial Key Laboratory of Water Information Cooperative Sensing and Intelligent Processing Nanchang Institute of Technology Nanchang330099 China

The classical attribute reduction algorithm is not suitable for the neighborhood decision information system of numerical attribute. Since any feature subset in real feature space can be approximated by neighborhood information particles, the concept of knowledge granularity is extended to neighborhood rough set from the perspective of the granularity computation. In this paper, knowledge granularity, attribute importance and heuristic algorithm based on the granularity of knowledge in neighborhood rough set are studied from the point of view of neighborhood relation matrix. The feasibility of heuristic algorithm is analyzed on UCI data sets. Experiments achieve better classification accuracy and lower attribute reduction results than the existing algorithms. © Journal of Physics: Conference Series 2021.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Incremental attribute reduction based on knowledge granularity under incomplete data 3

Incremental attribute reduction based on knowledge granulari...

引用

2021 3rd International Conference on Artificial Intelligence and computer Science, AICS 2021

作者： Zhong, Qiangqiang Wang, Lei Yang, Wen Liu, Chao School of Information Engineering Nanchang Institute of Technology Nanchang330000 China Jiangxi Provincial Key Laboratory of Water Information Cooperative Sensing and Intelligent Processing Nanchang Institute of Technology Nanchang330000 China

Traditional attribute reductions can’t be directly applied to miss attribute values and dynamic changes data. Therefore, how to dynamically update attribute reductions efficiently when incomplete data changes dynamically is great research value. For the change of the object, using matrix’s simple and clear characteristics, the paper focus on the incremental attribute reduction algorithm in matrix form of knowledge granularity. Firstly, the knowledge granularity is obtained by matrix which uses to measure the uncertainty of the system, then calculating the attribute importance, and using the attribute importance to devise a static algorithm, and then analyzing incremental matrix form when the object increases. The comparative experiments show that the incremental algorithm can effectively and efficiently update the result of attribute reduction as the object changes. © Journal of Physics: Conference Series 2021.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Cone-Beam Computed Tomography Limited-Angle Image Reconstruction Using Planning CT-Guided Deep Diffusion Model

引用

IEEE Transactions on Instrumentation and Measurement 2025年 74卷

作者： Wu, Zhan Yang, Yang Hu, Dianlin Lyu, Tianling Li, Yinsheng Tang, Hao Shu, Huazhong Xi, Yan Zhang, Yi Chen, Yang Southeast University Laboratory of Image Science and Technology Nanjing210096 China Southeast University Ministry of Education Key Laboratory of Computer Network and Information Integration Nanjing210096 China Zhejiang University of Technology Academy for Advanced Interdisciplinary Science and Technology Hangzhou China Chinese Academy of Sciences Key Laboratory of Biomedical Imaging Science and System China Capital Medical University Beijing Jishuitan Hospital China First-Imaging Tech Shanghai China Sichuan University School of Cyber Science and Engineering Chengdu China Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Ministry of Education Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing Laboratory of Image Science and Technology the School of Computer Science and Engineering Nanjing210096 China

For existing image-guided radiation therapy systems (IGRT), the limited angular range of the cone-beam computed tomography (CBCT) scanning improves the compactness of the system and compatibility between CBCT and linear accelerator configurations. However, the limited-angle CBCT reconstruction under incomplete projection data causes severe artifacts in the reconstructed images, further having a negative impact on the registration accuracy in IGRT. In this paper, we propose a planning CT-guided deep diffusion model, termed LARGE-DiffNet, to improve imaging quality and registration accuracy for limited-angle CBCT image reconstruction. In stark contrast to existing approaches leveraging hand-crafted regularization, such as local smoothness and/or sparsity of the image, LARGE-DiffNet learns the distribution-level prior knowledge to describe the features of ideal CBCT images via a planning CT-guided diffusion model. The proposed LARGE-DiffNet is evaluated on the clinical CBCT dataset, and extensive experimental results demonstrate that the proposed method outperforms the state-of-the-art methods. The proposed LARGE-DiffNet technique has great potential in IGRT. © 1963-2012 IEEE.

关键词： Image reconstruction Computed tomography Planning Radiation therapy Diffusion models Biomedical imaging Image restoration Training Reconstruction algorithms Image quality

来源：评论

学校读者我要写书评

暂无评论

Forget less,count better:a domain-incremental self-distillation learning benchmark for lifelong crowd counting

引用

Frontiers of information technology & Electronic Engineering 2023年第2期24卷 187-202页

作者： Jiaqi GAO Jingqi LI Hongming SHAN Yanyun QU James ZWANG Fei-Yue WANG Junping ZHANG Shanghai Key Laboratory of Intelligent Information Processing School of Computer ScienceFudan UniversityShanghai 200433China Institute of Science and Technology for Brain-inspired Intelligence Fudan UniversityShanghai 200433China Shanghai Center for Brain Science and Brain-inspired Technology Shanghai 201210China School of Information Science and Technology Xiamen UniversityXiamen 361005China College of Information Sciences and Technology the Pennsylvania State UniversityUniversity ParkPA 16802USA State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China

Crowd counting has important applications in public safety and pandemic control.A robust and practical crowd counting system has to be capable of continuously learning with the newly incoming domain data in real-world scenarios instead of fitting one domain ***-the-shelf methods have some drawbacks when handling multiple domains:(1)the models will achieve limited performance(even drop dramatically)among old domains after training images from new domains due to the discrepancies in intrinsic data distributions from various domains,which is called catastrophic forgetting;(2)the well-trained model in a specific domain achieves imperfect performance among other unseen domains because of domain shift;(3)it leads to linearly increasing storage overhead,either mixing all the data for training or simply training dozens of separate models for different domains when new ones are *** overcome these issues,we investigate a new crowd counting task in incremental domain training setting called lifelong crowd *** goal is to alleviate catastrophic forgetting and improve the generalization ability using a single model updated by the incremental ***,we propose a self-distillation learning framework as a benchmark(forget less,count better,or FLCB)for lifelong crowd counting,which helps the model leverage previous meaningful knowledge in a sustainable manner for better crowd counting to mitigate the forgetting when new data arrive.A new quantitative metric,normalized Backward Transfer(nBwT),is developed to evaluate the forgetting degree of the model in the lifelong learning *** experimental results demonstrate the superiority of our proposed benchmark in achieving a low catastrophic forgetting degree and strong generalization ability.

关键词： Crowd counting Knowledge distillation Lifelong learning

来源：评论

学校读者我要写书评

暂无评论

Deep Representation Learning for Electron Ionization Mass Spectra Retrieval

Deep Representation Learning for Electron Ionization Mass Sp...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Shibo Liu Xuan Zhang Anlei Jiao Shiwei Sun Longyang Dian Xuefeng Cui School of Computer Science and Technology Shandong University Qingdao China Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China State Key Laboratory of Microbial Technology Shandong University Qingdao China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The task of retrieving and analyzing mass spectra is indispensable for the identification of compounds in mass spectrometry (MS). This methodology is of critical importance as it enables researchers to correlate observed spectra with established databases, thereby precisely determining the chemical composition of samples. The primary challenges to its efficacy lie in optimizing the balance between retrieval accuracy and processing speed. Empirical studies have demonstrated that by converting mass spectra into embeddings via deep learning, it is possible to achieve both high accuracy and speed in retrieval. Nevertheless, there are complex challenges associated with employing deep learning for spectral embedding, particularly within the domain of electron ionization mass spectrometry (EI-MS). In this paper, we introduce a novel representation learning technique termed EI-MS2VEC for EI-MS retrieval. Our spectrum retrieval methodology surpasses current state-of-the-art techniques such as FastEI. For the in-silico library, we attain hit rate@1 and hit rate@10 of 43.6% and 84.5%, respectively, compared to FastEI’s 36.7% and 80.4%. Moreover, our retrieval approach operates with an order of magnitude greater speed than FastEI. The source code is available on Github (https://***/xfcui/EI-MS2VEC).

关键词： Representation learning Deep learning Accuracy Databases Source coding Ionization Predictive models Mass spectroscopy Electrons Software development management

来源：评论

学校读者我要写书评

暂无评论

Shapley Value-based Contrastive Alignment for Multimodal information Extraction

arXiv

引用

arXiv 2024年

作者： Luo, Wen Tianshu, Shen Xia, Yu Li, Sujian State Key Laboratory of Multimedia Information Processing School of Computer Science Peking University Beijing China Wangxuan Institute of Computer Technology Peking University Beijing China School of Computer Science Peking University Beijing China

The rise of social media and the exponential growth of multimodal communication necessitates advanced techniques for Multimodal information Extraction (MIE). However, existing methodologies primarily rely on direct Image-Text interactions, a paradigm that often faces significant challenges due to semantic and modality gaps between images and text. In this paper, we introduce a new paradigm of Image-Context-Text interaction, where large multimodal models (LMMs) are utilized to generate descriptive textual context to bridge these gaps. In line with this paradigm, we propose a novel Shapley Value-based Contrastive Alignment (Shap-CA) method, which aligns both context-text and context-image pairs. Shap-CA initially applies the Shapley value concept from cooperative game theory to assess the individual contribution of each element in the set of contexts, texts and images towards total semantic and modality overlaps. Following this quantitative evaluation, a contrastive learning strategy is employed to enhance the interactive contribution within context-text/image pairs, while minimizing the influence across these pairs. Furthermore, we design an adaptive fusion module for selective cross-modal fusion. Extensive experiments across four MIE datasets demonstrate that our method significantly outperforms existing state-of-the-art methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：