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

7th International Conference on Artificial Intelligence and Security, ICAIS 2021

作者： Tang, Huanrong Jiang, Aoyun Ouyang, Jianquan Key Laboratory of Intelligent Computing Information Processing Ministry of Education School of Computer Science and School of Cyberspace Science Xiangtan University Xiangtan Hunan411100 China

ISBN: (纸本)9783030786144

At present, with the development of science and medical level, more and more diseases can be cured. However, the cost of treating some diseases is high, and for many families with limited financial resources, it is difficult to spend so much money on treatment in a short period of time. As a result, more and more people are launching fundraising projects through third-party platforms such as Water Drops and Easy Fundraising, using the money raised to treat diseases. However, these third-party platforms have many problems, such as easy to disclose the private information of people who seeking help, the fundraising process is complex and slow, the use of project funds is difficult to timely monitor, the release of false fundraising projects for fundraising fraud, and so on. For these reasons, fewer members of the public will believe the authenticity of fundraising projects, so that it is not easy to donate to fundraising projects, which also makes it difficult for people who really need to raise funds to treat diseases. In view of this situation, this paper puts forward a blockchain and smart contract-based fundraising system for critical diseases, which can solve the problems existing in third-party platforms, and can help helpers quickly raise funds to cure diseases, it also can avoid the abuse of fundraising funds, false fundraising and other acts. Not only improve the transparency of fundraising behavior, but also enhance the enthusiasm of public participation in donations. © 2021, Springer Nature Switzerland AG.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges

arXiv

引用

arXiv 2025年

作者： Zhou, Xiaotian Zehmakan, Ahad N. Zhang, Zhongzhi Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China Research Institute of Intelligent Complex Systems Fudan University Shanghai200433 China School of Computing Australian National University Canberra Australia

The Kirchhoff index, which is the sum of the resistance distance between every pair of nodes in a network, is a key metric for gauging network performance, where lower values signify enhanced performance. In this paper, we study the problem of minimizing the Kirchhoff index by adding edges. We first provide a greedy algorithm for solving this problem and give an analysis of its quality based on the bounds of the submodularity ratio and the curvature. Then, we introduce a gradient-based greedy algorithm as a new paradigm to solve this problem. To accelerate the computation cost, we leverage geometric properties, convex hull approximation, and approximation of the projected coordinate of each point. To further improve this algorithm, we use pre-pruning and fast update techniques, making it particularly suitable for large networks. Our proposed algorithms have nearly-linear time complexity. We provide extensive experiments on ten real networks to evaluate the quality of our algorithms. The results demonstrate that our proposed algorithms outperform the state-of-the-art methods in terms of efficiency and effectiveness. Moreover, our algorithms are scalable to large graphs with over 5 million nodes and 12 million edges. Copyright © 2025, The Authors. All rights reserved.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Sparse Andrew's Sine Norm Promoting Adaptive Algorithm under Non-Gaussian Noises 5

Sparse Andrew's Sine Norm Promoting Adaptive Algorithm under...

引用

5th IEEE International Conference on Electronic information and Communication Technology, ICEICT 2022

作者： Hadi, Abdul Huang, Xinqi Ali, Burhan Li, Yingsong College of Information and Communications Engineering Harbin Engineering University Harbin150001 China College of Intelligent System and Control Science Engineering Harbin Engineering University Harbin150001 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui Hefei China

ISBN: (数字)9781665472111

ISBN: (纸本)9781665472111

Two sparse adaptive filtering (AF) algorithms based on Andrew's sine estimator (ASE) are presented to achieve improved performance for identifying sparse systems, where the ASE is derived within the least-square framework. Furthermore, zero-attracting (ZA) scheme is used in ASE to construct ZA-ASE and its re-weighting form (RZA-ASE) to combat non-Gaussian noises and use the sparse characteristics of the system. Their performance is investigated via simulations and compared with the least-mean square (LMS) and the maximum correntropy criterion (MCC) algorithms to show their superior performance. © 2022 IEEE.

关键词： Adaptive filtering

来源：评论

学校读者我要写书评

暂无评论

SafeCFG: Redirecting Harmful Classifier-Free Guidance for Safe Generation

arXiv

引用

arXiv 2024年

作者： Pan, Jiadong Gao, Hongcheng Li, Liang Zha, Zheng-Jun Huang, Qingming Luo, Jiebo Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS China University of Chinese Academy of Sciences China University of Science and Technology of China China University of Rochester United States

Diffusion models (DMs) have demonstrated exceptional performance in text-to-image (T2I) tasks, leading to their widespread use. With the introduction of classifier-free guidance (CFG), the quality of images generated by DMs is improved. However, DMs can generate more harmful images by maliciously guiding the image generation process through CFG. Some safe guidance methods aim to mitigate the risk of generating harmful images but often reduce the quality of clean image generation. To address this issue, we introduce the Harmful Guidance Redirector (HGR), which redirects harmful CFG direction while preserving clean CFG direction during image generation, transforming CFG into SafeCFG and achieving high safety and quality generation. We train HGR to redirect multiple harmful CFG directions simultaneously, demonstrating its ability to eliminate various harmful elements while preserving high-quality generation. Additionally, we find that HGR can detect image harmfulness, allowing for unsupervised fine-tuning of safe diffusion models without pre-defined clean or harmful labels. Experimental results show that by incorporating HGR, images generated by diffusion models achieve both high quality and strong safety, and safe DMs trained through unsupervised methods according to the harmfulness detected by HGR also exhibit good safety performance. The codes will be publicly available. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Prediction of piRNA-mRNA interactions based on an interactive inference network

Prediction of piRNA-mRNA interactions based on an interactiv...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Liu, Yajun Li, Ru Li, Aimin Fei, Rong Guo, Xie Wu, Fang-Xiang Xi'an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China Xi'an University of Technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an China University of Saskatchewan Division of Biomedical Engineering Department of Computer Science Department of Mechanical Engineering Saskatoon Canada

ISBN: (纸本)9798350337488

As the largest class of small non-coding RNAs, piRNAs primarily present in the reproductive cells of mammals, which influence post-transcriptional processes of mRNAs in multiple ways. Effective methods for predicting piRNA and mRNA target relationships can help identify piRNA functions, investigate the possibility of piRNAs as biomarkers and therapeutic targets. In this study, we propose a computational approach for classifying the relationships of piRNA-mRNA pairs based on an interactive inference network (IIN). First, we gather piRNA-mRNA target data, collect sequence data by position alignment, and construct a benchmark dataset. Furthermore, a reliable negative set is constructed by positive-unlabeled learning. Finally, we view a piRNA and a mRNA sequence as a premise and hypothesis sentence, respectively, and IIN model is used to predict the relationship between them. The experiments demonstrate that our method effectively characterizes piRNA-mRNA interaction and could be beneficial for researchers to investigate piRNA functions. © 2023 IEEE.

关键词： interactive inference network noncoding RNA piRNA-mRNA interactions positive-unlabeled learning

来源：评论

学校读者我要写书评

暂无评论

Open-VCLIP: Transforming CLIP to an Open-vocabulary Video Model via Interpolated Weight Optimization

arXiv

引用

arXiv 2023年

作者： Weng, Zejia Yang, Xitong Li, Ang Wu, Zuxuan Jiang, Yu-Gang Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University China Shanghai Collaborative Innovation Center of Intelligent Visual Computing China Meta AI United States

Contrastive Language-Image Pretraining (CLIP) has demonstrated impressive zero-shot learning abilities for image understanding, yet limited effort has been made to investigate CLIP for zero-shot video recognition. We introduce Open-VCLIP, a simple yet effective approach that transforms CLIP into a strong zero-shot video classifier that can recognize unseen actions and events at test time. Our framework extends CLIP with minimal modifications to model spatial-temporal relationships in videos, making it a specialized video classifier, while striving for generalization. We formally show that training an Open-VCLIP is equivalent to continual learning with zero historical data. To address this problem, we propose Interpolated Weight Optimization, which utilizes the benefit of weight interpolation in both training and test time. We evaluate our method on three popular and challenging action recognition datasets following various zero-shot evaluation protocols and we demonstrate our approach outperforms state-of-the-art methods by clear margins. In particular, we achieve 87.9%, 58.3%, 81.1% zero-shot accuracy on UCF, HMDB and Kinetics-600 respectively, outperforming state-of-the-art methods by 8.3%, 7.8% and 12.2%. Code is released at https://***/wengzejia1/Open-VCLIP. Copyright © 2023, The Authors. All rights reserved.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

A Radiation Performance Improvement Method of Extremely Low Frequency Acoustics Promoted Antenna

A Radiation Performance Improvement Method of Extremely Low ...

引用

2023 IEEE International Workshop on Electromagnetics: Applications and Student Innovation Competition, iWEM 2023

作者： Qi, Junwei Zhang, Chenwei Li, Yingsong Huang, Zhixiang Loh, Tian Hong Chung, Kwok L. Harbin Engineering University College of Information and Communications Engineering Harbin150001 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education China National Physical Laboratory Electromagnetic and Eletrochemical Technologies Department Middlesex United Kingdom Huizhou University School of Computer Science and Engineering 516007 China

ISBN: (纸本)9798350336740

In this paper, Q-value theory of conventional antennas is used to analyze reasons of low radiation performance of acoustics promoted antennas, where we modify the radiating structure of existing acoustics promoting antenna using the simulations to get the required improvement on radiation performance. The simulation experiments are carried out in the finite element simulation software Comsol Multiphysics to analyze the radiating performance. © 2023 IEEE.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

Scheduling Multiple Mobile Agents with Abilities of Sensing and Executing Simultaneously

Scheduling Multiple Mobile Agents with Abilities of Sensing ...

引用

Artificial Intelligence of Things and Systems (AIoTSys), International Conference on

作者： Zhipeng Guo Zhiyong Yu Fangwan Huang Chunyu Tu College of Computer and Data Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

How to schedule public resources to maximize the coverage of crowds has always been a hot topic. There are mainly two types of research. One is the scheduling of static resources, whose coverage efficiency is lower because the resources cannot be moved; the other is the dynamic scheduling of movable public resources, but the existing methods require additional devices to collect crowd volume data. To address this issue, this article introduces a new category of mobile agents that can sense and execute simultaneously. This means that an agent can simultaneously perform crowd volume data collection tasks and crowds coverage tasks in its area. Taking these multi-ability agents as public resources, this article proposes a scheduling method called GE-STMC (Greedy Execute - Spatial and Temporal Monte-Carlo dropout). The method considers the spatiotemporal correlation between areas and evaluates the sensing value and the executing value of areas comprehensively to allocate the agents accordingly. Through the experimental on the real data of Beijing Happy Valley, this method can get 16% larger crowds volume coverage than other baseline methods with the same number of agents.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Privacy-friendly sequential progressive framework for segmented decision making

A Privacy-friendly sequential progressive framework for segm...

引用

Artificial Intelligence of Things and Systems (AIoTSys), International Conference on

作者： Peng Liu Zhiyong Yu Fangwan Huang College of Computer and Data Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

To achieve progressive and accurate decision-making for long-term time series data while meeting the needs of privacy-friendly and early, this paper proposes a universal framework for sequential progressive decision-making (SPD). This framework first segments the data and sets up multiple columns of neural networks according to the number of segments. Each column can make segmented decisions based on the inputs for the period. Additionally, without sharing the original data, the framework leverages lateral hidden layer connections between preceding and succeeding columns to obtain useful features for subsequent decision-making, gradually improving accuracy while avoiding the risk of data leakage. SPD has the advantages of privacy friendliness, column model diversification, prior knowledge reuse, and easy scalability, making it an effective framework for continuous decision-making. The effectiveness of that was validated using various network models in handwritten digit recognition and electrocardiogram classification tasks. The obtained experimental results reveal that SPD not only enables early decision-making while ensuring accuracy but also achieves accuracy levels comparable to or even surpassing those obtained using complete data, with the added benefit of privacy protection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Text-Driven Generative Domain Adaptation with Spectral Consistency Regularization

Text-Driven Generative Domain Adaptation with Spectral Consi...

引用

International Conference on Computer Vision (ICCV)

作者： Zhenhuan Liu Liang Li Jiayu Xiao Zheng-Jun Zha Qingming Huang Institute of Computing Technology Key Laboratory of Intelligent Information Processing CAS University of Chinese Academy of Sciences University of Science and Technology of China Peng Cheng Laboratory

Combined with the generative prior of pre-trained models and the flexibility of text, text-driven generative domain adaptation can generate images from a wide range of target domains. However, current methods still suffer from overfitting and the mode collapse problem. In this paper, we analyze the mode collapse from the geometric point of view and reveal its relationship to the Hessian matrix of generator. To alleviate it, we propose the spectral consistency regularization to preserve the diversity of source domain without restricting the semantic adaptation to target domain. We also design granularity adaptive regularization to flexibly control the balance between diversity and stylization for target model. We conduct experiments for broad target domains compared with state-of-the-art methods and extensive ablation studies. The experiments demonstrate the effectiveness of our method to preserve the diversity of source domain and generate high fidelity target images. Source code has been released in https://***/Victarry/Adaptation-SCR.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：