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

23rd IEEE International Conference on High Performance computing and Communications, 7th IEEE International Conference on data Science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and big data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Gao, Haoyu Li, Leixiao Lin, Hao Chang, Xiangyang Wan, Jianxiong Li, Jie Zhu, Fangyuan College of Data Science and Application Inner Mongolia University of Technology China Inner Mongolia Autonomous Reg. Eng. and Technol. Research Center of Big Data Based Software Service China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781665494571

P2P Botnet is famous for the resilience against termination. However, its dependence on Neighbor List (NL) makes it susceptible to infiltration and poison, also leading to a dearth of adequate protection of Botmaster's identity. So as to overcome these weaknesses, the novel botnet infrastructure combined with blockchain emerges. But due to some flaws such like high latency and expensive transactions fees on blockchain, these new schemes can't satisfy the need of constructing hyper large-scale botnet in practice. We propose ZombieCoin3.0, a Botnet underlying overlay leveraging IoT devices to be maintainers and integrated with Distributed Ledger technology (DLT), which is able to deploy bots fully on blockchain. And it is versatile for file transfer, data feedback and other command and control scenarios that many contemporaries are impotent to cope with. Our proposal eliminates the P2P botnets' dependence on NL and the bottlenecks that other blockchain combined botnets have. Experiments' results authenticated that the effectiveness of our proposal as well as low latency of communication and nearly zero overhead of cost other comparatives unable to attain are achieved. © 2021 IEEE.

关键词： Costs Distributed ledger Botnet Blockchains Proposals Internet of Things Low latency communication

来源：评论

学校读者我要写书评

暂无评论

Differential-Trust-Mechanism Based Trade-off Method Between Privacy and Accuracy in Recommender Systems

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 5054-5068页

作者： Xu, Guangquan Feng, Shicheng Xi, Hao Yan, Qingyang Li, Wenshan Wang, Cong Wang, Wei Liu, Shaoying Tian, Zhihong Zheng, Xi Qingdao Huanghai University School of Big Data Qingdao China Tianjin University College of Intelligence and Computing Tianjin300350 China KLISS and School of Software Beijing100084 China Sichuan University School of Cyber Science and Engineering Chengdu610207 China Xi’an Jiaotong University School of Cyber Science and Engineering Xi’an710049 China East China Normal University Shanghai200062 China Hiroshima University School of Informatics and Data Science Higashihiroshima739-8511 Japan Guangzhou University Cyberspace Institute of Advanced Technology Guangdong Key Laboratory of Industrial Control System Security Huangpu Research School of Guangzhou University China Macquarie University School of Computing SydneyNSW2109 Australia

In the era where Web3.0 values data security and privacy, adopting groundbreaking methods to enhance privacy in recommender systems is crucial. Recommender systems need to balance privacy and accuracy, while also having the ability to overcome cold start problems. The Differential Trust Mechanism (DTM) introduced in this paper is such an approach. The DTM provides a unique use of Gaussian distributions in modeling trust relationships within data, offering a novel way to balance recommendation accuracy with user privacy. This mechanism innovatively applies differential privacy principles, using Gaussian noise addition to protect individual user data from inference attacks, while maintaining the integrity and utility of the overall dataset. Unlike traditional anonymization techniques that often compromise data utility or vulnerability to reverse engineering, DTM provides a robust solution by dynamically adjusting privacy levels based on the trustworthiness of data requests. By combining DTM with existing mainstream recommendation algorithms, the prediction accuracy of MAE and RMSE increases by at least 6.60% and 2.69%, respectively. This dual benefit positions DTM as a significant advancement in secure data processing, especially relevant for online businesses and platforms where personalized recommendations are crucial yet privacy concerns are paramount. © 2005-2012 IEEE.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

Feature Rotation Invariance Learning for Point Cloud Analysis 10

Feature Rotation Invariance Learning for Point Cloud Analysi...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Shi, Lu Cao, Qi Zhang, Guoqing Yi, Jin Huang, Yansen Cen, Yigang Beijing Jiaotong University State Key Laboratory of Advanced Rail Autonomous Operation The School of Computer Science and Technology Visual Intellgence +X International Cooperation Joint Laboratory of Moe Beijing100044 China University of Glasgow The School of Computing Science 567739 Singapore Beijing Jiaotong University With the Key Laboratory of Big Data & Artificial Intelligence in Transportation Ministry of Education The State Key Laboratory of Advanced Rail Autonomous Operation The School of Computer and Information Technology Beijing100044 China Guizhou University Guizhou Lianjian Civil Engineering Quality Testing Monitoring Center Co. Ltd The College of Civil Engineering Guizhou550025 China

ISBN: (纸本)9798331520861

While deep learning has significantly advanced point cloud analysis, extracting effective features from their disordered structure remains challenging. Existing approaches often rely on complex network architectures or manual feature engineering to achieve rotation invariance, which increases inference latency. This paper offers a novel perspective on this challenge, showing that rotation-sensitive models can achieve performance comparable to rotation-invariant models when trained with rotation-augmented data. Given the significant differences in the feature distributions of rotation-sensitive and rotation-invariant models, we propose Feature Rotation Invariance Learning (FRIL), a framework that leverages Distance Metric Learning and rotation-based constraints to help rotation-sensitive models extract rotation-invariant features. This approach eliminates the need for additional modules, enabling robust performance against rotations. Extensive experiments demonstrate that FRIL consistently outperforms existing rotation-invariant methods across various visual tasks. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Graph-Augmented Contrastive Clustering for Time Series

SSRN

引用

SSRN 2023年

作者： Zhang, Qin Liang, Zhuoluo Ngueilbaye, Alladoumbaye Zhang, Peng Chen, Junyang Chen, Xiaojun Huang, Joshua Zhexue Big Data Institute College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou510006 China

The recent emergence of time series contrastive clustering methods can be broadly categorized into two classes. The first class uses contrastive learning to learn universal representations for time series. Though they perform well in various downstream tasks, such methods disregard the important categorical information and clustering objective, leading to unsuitable representations of clustering tasks. The second class incorporates contrastive learning into the clustering objective. The potential connections and structures between the time series data are not fully explored during contrastive learning. To this end, we propose a graph-augmented contrastive learning framework called the "Time Series Graph-augmented Contrastive Clustering (Tsgcc) method." We observed that the original samples should be similar to their augmentations and other samples in the same cluster. Hence, we used a weighted $KNN$ graph to build positive and negative sample pairs for contrastive learning. Subsequently, we projected the instance samples into a feature space with the dimensionality number of clusters and learned cluster-friendly features and cluster assignments by iteratively optimizing the contrastive loss. Experimental results demonstrate that Tsgcc outperforms 16 advanced time-series clustering methods on 36 challenging UCR benchmarks, achieving the best clustering results on 12 datasets and the highest average rank (2.83) of RI overall methods. © 2023, The Authors. All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

DDNet: Deformable Convolution and Dense FPN for Surface Defect Detection in Recycled Books

DDNet: Deformable Convolution and Dense FPN for Surface Defe...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Jun Yu WenJian Wang School of Computer and Information Technology (School of Big Data) Shanxi University Taiyuan China Taihang Laboratory In Shanxi Province (Advanced Computing Laboratory In Shanxi Province) Taiyuan China Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education Shanxi University Taiyuan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Recycled and recirculated books, such as ancient texts and reused textbooks, hold significant value in the secondhand goods market, with their worth largely dependent on surface preservation. However, accurately assessing surface defects is challenging due to the wide variations in shape, size, and the often imprecise detection of defects. To address these issues, we propose DDNet, an innovative detection model designed to enhance defect localization and classification. DDNet introduces a surface defect feature extraction module based on a deformable convolution operator (DC) and a densely connected FPN module (DFPN). The DC module dynamically adjusts the convolution grid to better align with object contours, capturing subtle shape variations and improving boundary delineation and prediction accuracy. Meanwhile, DFPN leverages dense skip connections to enhance feature fusion, constructing a hierarchical structure that generates multi-resolution, high-fidelity feature maps, thus effectively detecting defects of various sizes. In addition to the model, we present a comprehensive dataset specifically curated for surface defect detection in recycled and recirculated books. This dataset encompasses a diverse range of defect types, shapes, and sizes, making it ideal for evaluating the robustness and effectiveness of defect detection models. Through extensive evaluations, DDNet achieves precise localization and classification of surface defects, recording a mAP value of 46.7% on our proprietary dataset—an improvement of 14.2% over the baseline model—demonstrating its superior detection capabilities.

关键词： Location awareness Accuracy Convolution Shape Semisupervised learning Feature extraction Robustness Speech processing Surface treatment Defect detection

来源：评论

学校读者我要写书评

暂无评论

High-Fidelity Editable Portrait Synthesis with 3D GAN Inversion

High-Fidelity Editable Portrait Synthesis with 3D GAN Invers...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Jindong Xie Jiachen Liu Yupei Lin Jinbao Wang Xianxu Hou Linlin Shen Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University School of Information Engineering Guangdong University of Technology Guangzhou China Guangdong Provincial Key Laboratory of Intelligent Information Processing School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

The 3D generative adversarial network (GAN) inversion converts an image into 3D representation to attain high-fidelity reconstruction and facilitate realistic image manipulation within the 3D latent space. However, previous approaches face challenges regarding the trade-off between the reconstruction ability and editability. That is, reversing a real-world image to a low-dimensional latent code would inevitably lead to information loss, and achieving a near-perfect reconstruction using high-rate triplane representation often limits the ability to manipulate the image freely in the latent space. To address these issues, we propose a novel latent conditioning encoder-based framework with the alignment between the low-dimensional latent and high-dimensional triplane. A non-semantic guided editing strategy bridges the intrinsic relation between the latent condition and triplane generation, making it possible to edit the high-dimensional representation by latent manipulation. As a result, our method can achieve high-fidelity reconstruction and editing simultaneously by directly controlling the latent code. Experimental results demonstrate that our approach excels in reconstruction and editing quality compared to previous 3D inversion methods. Furthermore, our method can also edit even real faces with large poses and out-of-domain cases.

关键词： Bridges Three-dimensional displays Codes Signal processing Generative adversarial networks Vectors Acoustics Speech processing Image reconstruction Faces

来源：评论

学校读者我要写书评

暂无评论

Personalized Federated Learning with Collaborative Aggregation Networks for Multi-Site Brain Disorder Diagnosis

Personalized Federated Learning with Collaborative Aggregati...

引用

Industrial Automation, Robotics and Control Engineering (IARCE), International Conference on

作者： Qian Si Yang Li School of Cyber Science and Technology Beihang University Beijing China Department of Automation Science and Electrical Engineering Beijing Advanced Innovation Center for Big Data and Brain Computing State Key Laboratory of Virtual Reality Technology and Systems Advanced Institute of Information Technology Peking University Beihang University Beijing China

ISBN: (数字)9798350380323

ISBN: (纸本)9798350380330

In multi-site brain disease diagnosis studies, traditional centralized training methods necessitate sharing medical data, posing significant privacy risks. Federated learning (FL) offers a privacy-preserving solution by enabling global model training through aggregating locally trained models from multiple data centers without sharing raw data. However, current FL approaches rely on a server-based network topology, where central server failure disrupts training. Additionally, data heterogeneity across sites often slows convergence and reduces accuracy. To overcome these issues, we introduce a decentralized personalized federated learning collaborative aggregation network (pFedCAN). This framework has two core components: (1) separating local models into shared and personalized layers, and (2) forming a collaborative aggregation network via similarity detection in the shared layers. Specifically, each center trains its local model, then separates it into shared and personalized layers. The shared layer is exchanged with other centers, while the personalized layer remains local. data centers analyze similarities in received shared layers to build a collaborative network, where shared layers from similar centers are aggregated to refine the model. This approach flexibly adapts to varying levels of data heterogeneity, enhancing model training efficiency. Validation on public datasets, ABIDE I and ADHD, shows that the proposed method outperforms current leading techniques.

关键词： Training Adaptation models data centers Federated learning Service robots Collaboration Brain modeling data models Servers Medical diagnostic imaging

来源：评论

学校读者我要写书评

暂无评论

Progress in research on ultrasound radiomics for predicting the prognosis of breast cancer

引用

Cancer Innovation 2023年第4期2卷 283-289页

作者： Xuantong Gong Xuefeng Liu Xiaozheng Xie Yong Wang Department of Ultrasound National Cancer Center/National Clinical Research Center for Cancer/Cancer HospitalChinese Academy of Medical Sciences and Peking Union Medical CollegeBijingChina State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and EngineeringBejjing Advanced Innovation Center for Big Data and Brain Computing(BDBC)Beihang UniversityBeijingChina School of Computer and Communication Engi neering.University of Science and Technology Beijing BeijingChina

Breast cancer is the most common malignant tumor and the leading cause of cancer-related deaths in women *** means of predicting the prognosis of breast cancer are very helpful in guiding treatment and improving patients'*** extracted by radiomics reflect the genetic and molecular characteristics of a tumor and are related to its biological behavior and the patient's ***,radiomics provides a new approach to noninvasive assessment of breast cancer *** is one of the commonest clinical means of examining breast *** recent years,some results of research into ultrasound radiomics for diagnosing breast cancer,predicting lymph node status,treatment response,recurrence and survival times,and other aspects,have been *** this article,we review the current research status and technical challenges of ultrasound radiomics for predicting breast cancer *** aim to provide a reference for radiomics researchers,promote the development of ultrasound radiomics,and advance its clinical application.

关键词： breast cancer deeplearning prognosisprediction radiomics ultrasound

来源：评论

学校读者我要写书评

暂无评论

Graph-Augmented Contrastive Clustering for Time Series data

SSRN

引用

SSRN 2024年

作者： Zhang, Qin Liang, Zhuoluo Ngueilbaye, Alladoumbaye Zhang, Peng Chen, Junyang Chen, Xiaojun Huang, Joshua Zhexue College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou510006 China

The recent emergence of time series contrastive clustering methods can be categorized into two classes. The first class uses contrastive learning for universal representations, which can be effective in various downstream tasks, but overlooks important categorical information and clustering objectives, leading to unsuitable models. The second class incorporates contrastive learning into clustering objectives but fails to fully explore potential connections and structures between time series data. To this end, we propose the "Time Series Graph-augmented Contrastive Clustering (Tsgcc) method", a graph-augmented contrastive learning framework aiming to create cluster-friendly features and assignments by iteratively optimizing contrastive loss. The method uses a weighted KNN graph to build positive and negative sample pairs, projecting the instances into a feature space with the dimensionality number of clusters. Experimental results demonstrate that Tsgcc outperforms 18 advanced time-series clustering methods on the 36 representatives out of the 128 UCR benchmarks, achieving the best clustering results on 12 datasets, with the highest average rank (3.22) of RI and the second-highest average rank (3.89) of NMI among 18 clustering methods. We further compared our method with recent approaches on the entire set of 128 UCR datasets, demonstrating our method's broad applicability and effectiveness. © 2024, The Authors. All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

EFFICIENTLY PARAMETERIZED NEURAL METRIPLECTIC SYSTEMS

arXiv

引用

arXiv 2024年

作者： Gruber, Anthony Lee, Kookjin Lim, Haksoo Park, Noseong Trask, Nathaniel Center for Computing Research Sandia National Laboratories AlbuquerqueNM United States School of Computing and Augmented Intelligence Arizona State University TempeAZ United States Big Data Analytics Laboratory Yonsei University Seoul Korea Republic of Big Data Analytics Laboratory Korea Advanced Institute of Science and Technology Daejeon Korea Republic of School of Engineering and Applied Science University of Pennsylvania PhiladelphiaPA United States

Metriplectic systems are learned from data in a way that scales quadratically in both the size of the state and the rank of the metriplectic data. Besides being provably energy conserving and entropy stable, the proposed approach comes with approximation results demonstrating its ability to accurately learn metriplectic dynamics from data as well as an error estimate indicating its potential for generalization to unseen timescales when approximation error is low. Examples are provided which illustrate performance in the presence of both full state information as well as when entropic variables are unknown, confirming that the proposed approach exhibits superior accuracy and scalability without compromising on model expressivity. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：