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

Journal of Network Intelligence 2024年第2期9卷 1046-1055页

作者： Zhang, Fu-Quan Ma, Lin-Juan Zhou, Jun-Xian Wang, Run-Hong Zhang, Guang-Zhen College of Computer and Control Engineering Minjiang University Fuzhou China Digital Media Art Key Laboratory of Sichuan Province Sichuan Conservatory of Music Chengdu China Fuzhou Technology Innovation Center of Intelligent Manufacturing Information System Minjiang University Fuzhou China Fujian Province University Fuzhou China School of Computer Science and Technology Beijing Institute of Technology Beijing China Minjiang University Fuzhou China Information Media School of Tianjin Technician Institute of Mechanical & Electrical Technology Tianjin China

The purpose of this paper is to present a new GAN-ID algorithm to gener-ate interior scene intelligently based on Artificial Intelligence of Things (AIoT). Although great progress has been made when GAN algorithm applied in smart homes and smart cities, the issue of the trade-off between the accuracy and the efficiency in interior scene has been overlooked. A number of experiments were performed to check the performance and it is indicated that the results of the proposed GAN-ID has great advantages in model sample generation than other common methods when generating interior scene intelligently, which is similar to state-of-the-art. It is meaningful when it can be applied in smart cities and smart homes filed based on AIoT in the future. © 2024, J. Network Intell. All rights reserved.

关键词： Automation

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed algorithms for holistic aggregation functions on random regular graphs

引用

science China(Information sciences) 2022年第5期65卷 32-50页

作者： Lin JIA Qiang-Sheng HUA Haoqiang FAN Qiuping WANG Hai JIN National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and Technology Institute for Interdisciplinary Information Science Tsinghua University

In this paper, we propose efficient distributed algorithms for three holistic aggregation functions on random regular graphs that are good candidates for network topology in next-generation data *** three holistic aggregation functions include SELECTION（select the k-th largest or smallest element）,DISTINCT（query the count of distinct elements）, MODE（query the most frequent element）. We design three basic techniques — Pre-order Network Partition, Pairwise-independent Random Walk, and Random Permutation Delivery, and devise the algorithms based on the techniques. The round complexity of the distributed SELECTION is Θ（log N） which meets the lower bound where N is the number of nodes and each node holds a numeric element. The round complexity of the distributed DISTINCT and MODE algorithms are O（log3N/log log N） and O（log2N log log N） respectively. All of our results break the lower bounds obtained on general graphs and our distributed algorithms are all based on the CON GE S T model, which restricts each node to send only O（log N） bits on each edge in one round under synchronous communications.

关键词： distributed algorithms holistic aggregation function random regular graph \({\cal C}{\cal O}{\cal N}{\cal G}{\cal E}{\cal S}{\cal T}\) model communication complexity round complexity

来源：评论

学校读者我要写书评

暂无评论

Hybrid cloud storage system with enhanced multilayer cryptosystem for secure deduplication in cloud

引用

International Journal of Intelligent Networks 2023年第1期4卷 301-309页

作者： Mageshkumar, Nagappan Swapna, J. Pandiaraj, A. Rajakumar, R. Krichen, Moez Ravi, Vinayakumar Department of Computer Science and Technology Madanapalle Institute of Technology and Science Madanapalle India Department of Computer Science & Engineering Veltech Rangarajan Dr.Sagunthala R&D Institute of Science and Technology Chennai India Department of Computing Technology SRM Institute of Science and Technology Kattankulathur chennai India Al-Baha University Alaqiq 65779-7738 Saudi Arabia ReDCAD Laboratory University of Sfax Sfax3038 Tunisia Center for Artificial Intelligence Prince Mohammad Bin Fahd University Khobar34754 Saudi Arabia Centre for Automation School of Computer Science and Engineering Vellore Institute of Technology Chennai Campus Chennai India

Data deduplication is a crucial technique in the field of data compression that aims to eliminate redundant copies of recurring data. This technique has gained significant popularity in the realm of cloud storage due to its ability to effectively reduce storage requirements and optimize bandwidth utilization. To ensure the safeguarding of sensitive data while simultaneously facilitating deduplication, researchers have put forth the concept of convergent encryption as a potential solution. This technique involves encrypting the data prior to its outsourcing, thereby enhancing the confidentiality of the information. In this work, an earnest endeavor is undertaken to formally tackle the issue of authorized data deduplication, with the aim of enhancing data security. Our approach combines the Diffie-Hellman algorithm and symmetrical external decision to protect and popularize information, ensuring end-to-end encryption to encourage user adoption of cloud storage. The proposed model employs block-level deduplication and guarantees the randomness of ciphertexts by generating encryption keys using the Diffie-Hellman algorithm. This method effectively counters both internal and external brute-force attacks, enhancing data security while reducing computational costs. An extensive experimentation is carried out to demonstrate that our approach is particularly beneficial in scenarios with multiple privilege sets. Overall, the proposed model offers an elaborate framework that maintains data privacy and strengthens security measures, contributing to a more efficient and secure cloud-based document search. © 2023 The Author(s)

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

OUTLIER SYNTHESIS VIA HAMILTONIAN MONTE CARLO FOR OUT-OF-DISTRIBUTION DETECTION

arXiv

引用

arXiv 2025年

作者： Li, Hengzhuang Zhang, Teng National Engineering Research Center for Big Data Technology and System Service Computing Technology and Systems Laboratory Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Out-of-distribution (OOD) detection is crucial for developing trustworthy and reliable machine learning systems. Recent advances in training with auxiliary OOD data demonstrate efficacy in enhancing detection capabilities. Nonetheless, these methods heavily rely on acquiring a large pool of high-quality natural outliers. Some prior methods try to alleviate this problem by synthesizing virtual outliers but suffer from either poor quality or high cost due to the monotonous sampling strategy and the heavy-parameterized generative models. In this paper, we overcome all these problems by proposing the Hamiltonian Monte Carlo Outlier Synthesis (HamOS) framework, which views the synthesis process as sampling from Markov chains. Based solely on the in-distribution data, the Markov chains can extensively traverse the feature space and generate diverse and representative outliers, hence exposing the model to miscellaneous potential OOD scenarios. The Hamiltonian Monte Carlo with sampling acceptance rate almost close to 1 also makes our framework enjoy great efficiency. By empirically competing with SOTA baselines on both standard and large-scale benchmarks, we verify the efficacy and efficiency of our proposed HamOS. Our code is available at: https://***/Fir-lat/HamOS_OOD. © 2025, CC BY.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

Research on Fault Diagnosis Method Based on Structural Causal Model in Tennessee Eastman Process 7th

Research on Fault Diagnosis Method Based on Structural Causa...

引用

7th International Conference on computing, Control and Industrial Engineering, CCIE 2023

作者： Pu, Haoyuan Liu, Jie Chen, Zhi Yang, Xiaohua Ren, Changan Xu, Zhuoran Jian, Yifan School of Computer Science University of South China Hengyang China Science and Technology on Reactor System Design Technology Laboratory Nuclear Power Institute of China Chengdu China Intelligent Equipment Software Evaluation Engineering Technology Research Center of Hunan Hengyang China CNNC Key Laboratory on High Trusted Computing Hengyang China School of Nuclear Science and Technology University of South China Hengyang China

ISBN: (纸本)9789819927296

In the practical application of fault diagnosis in large-scale chemical systems, due to the danger of faults, the machine learning diagnosis methods used in current research often face the problem of scarcity of fault samples. This makes it difficult for the model to be trained effectively, thus affecting the fault detection rate of the model. Therefore, for the fault diagnosis of chemical system with small sample data, this paper proposes a diagnostic method that uses structural causal model to further combine the diagnostic results of the two machine learning methods, thereby improving global diagnostic performance. With the help of powerful system description ability of structural causal model, we can establish a causal graph for diagnostic process of the chemical system, and accurately construct the corresponding structural equations for the various diagnostic results of the two machine learning methods to combine them, thus improve the fault detection rate. The global results make up for the shortcomings of single machine learning method in small sample chemical system fault diagnosis. The verification on the chemical system simulation platform Tennessee Eastman process shows that, compared with the diagnosis results of the selected Gaussian Naive Bayes method and the K-nearest neighbour method, the results obtained by our method are effectively improved in fault detection rate of each fault in TEP. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Failure analysis

来源：评论

学校读者我要写书评

暂无评论

HighlightRemover: Spatially Valid Pixel Learning for Image Specular Highlight Removal 24

HighlightRemover: Spatially Valid Pixel Learning for Image S...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Zhang, Ling Ma, Yidong Jiang, Zhi He, Weilei Bao, Zhongyun Fu, Gang Xu, Wenju Xiao, Chunxia School of Computer Science and Technology Hubei Key Laboratory of Intelligent Information Processing and Realtime Industrial Systems Wuhan University of Science and Technology Wuhan China School of Computer Science Wuhan University Wuhan China Department of Computing Hong Kong Polytechnic University Hong Kong Amazon Palo Alto United States

ISBN: (纸本)9798400706868

Recently, learning-based methods have made significant progress for image specular highlight removal. However, many of these approaches treat all the image pixels uniformly, overlooking the negative impact of invalid pixels on feature reconstruction. This oversight often leads to undesirable outcomes, such as color distortion or residual highlights. In this paper, we propose a novel image specular highlight removal network called HighlightRNet, which utilizes valid pixels as references to reconstruct the highlight-free image. To achieve this, we introduce a context-aware fusion block (CFBlock) that aggregates information in four directions, effectively capturing global contextual information. Additionally, we introduce a location-aware feature transformation module (LFTModule) to adaptively learn the valid pixels for feature reconstruction, thereby avoiding information errors caused by invalid pixels. With these modules, our method can produce high-quality highlight-free results without color distortion and highlight residual. Furthermore, we develop a multiple light image-capturing system to construct a large-scale highlight dataset called NSH, which exhibits minimal misalignment in image pairs and minimal brightness variation in non-highlight regions. Experimental results on various datasets demonstrate the superiority of our method over state-of-the-art methods, both qualitatively and quantitatively. © 2024 ACM.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent Diffusion 38

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent D...

引用

38th Conference on Neural Information Processing systems, NeurIPS 2024

作者： Zeng, Yu Zhang, Yang Liu, Jiachen Shen, Linlin Deng, Kaijun He, Weizhao Wang, Jinbao Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FIRE: A Dataset for Feedback Integration and Refinement Evaluation of Multimodal Models 38

FIRE: A Dataset for Feedback Integration and Refinement Eval...

引用

38th Conference on Neural Information Processing systems, NeurIPS 2024

作者： Li, Pengxiang Gao, Zhi Zhang, Bofei Yuan, Tao Wu, Yuwei Harandi, Mehrtash Jia, Yunde Zhu, Song-Chun Li, Qing Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China State Key Laboratory of General Artificial Intelligence BIGAI China State Key Laboratory of General Artificial Intelligence Peking University China Department of Electrical and Computer System Engineering Monash University Australia Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Department of Automation Tsinghua University China

Vision language models (VLMs) have achieved impressive progress in diverse applications, becoming a prevalent research direction. In this paper, we build FIRE, a feedback-refinement dataset, consisting of 1.1M multi-turn conversations that are derived from 27 source datasets, empowering VLMs to spontaneously refine their responses based on user feedback across diverse tasks. To scale up the data collection, FIRE is collected in two components: FIRE-100K and FIRE-1M, where FIRE-100K is generated by GPT-4V, and FIRE-1M is freely generated via models trained on FIRE-100K. Then, we build FIRE-Bench, a benchmark to comprehensively evaluate the feedback-refining capability of VLMs, which contains 11K feedback-refinement conversations as the test data, two evaluation settings, and a model to provide feedback for VLMs. We develop the FIRE-LLaVA model by fine-tuning LLaVA on FIRE-100K and FIRE-1M, which shows remarkable feedback-refining capability on FIRE-Bench and outperforms untrained VLMs by 50%, making more efficient user-agent interactions and underscoring the significance of the FIRE dataset. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

OpenDrift: Online Evolving Fraud Detection for Open-Category and Concept-Drift Transactions

OpenDrift: Online Evolving Fraud Detection for Open-Category...

引用

2023 IEEE International Conference on Web services, ICWS 2023

作者： Wang, Cheng Chai, Songyao Zhu, Hangyu Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education China Shanghai Artificial Intelligence Laboratory Shanghai China

ISBN: (纸本)9798350304855

The rapid growth of electronic commerce brings convenience to modern life but comes with security risks by various cybercrimes in online payment services. Most existing security methods for fraud detection depend on the static learning paradigm, which trains a model over a static training dataset and deploys the trained model for inference with the frozen model parameters under the i.i.d. assumption. Unfortunately, this paradigm becomes incommensurate with the increasingly complicated and varying fraud patterns due to the untimely and delayed responses in the offline environment. Without sensing the evolution of fraud timely, it is challenging to train and deploy targeted countermeasures. The emerging means of fraud are not only reflected in the openness of their category, but also in the drift of their superimposed risk features. The interweaving of open-category and concept drift accelerates the process of existing methods becoming powerless. In this paper, we propose EvoFD, an online evolving fraud detection framework to enable continual learning to cope with undercurrent surges of evolving fraud. The core idea of EvoFD is to weaken the bias caused by the anchoring effect on the learned information. It learns in an online streaming fashion by using instructive representations as anchors. Specially, we maintain the progressively updatable class anchors and optimize the representation network to embed features and class anchors into a unified normalized space, where the training and predicting can be conducted simultaneously or independently. In the framework, we preserve the balanced replay memory for each class to accumulate knowledge and avoid forgetting. The advantages of our method are validated by extensive experiments over the real-world dataset from a prestigious bank. © 2023 IEEE.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

NfvInsight:A Framework for Automatically Deploying and Benchmarking VNF Chains

引用

Journal of computer science & technology 2022年第3期37卷 680-698页

作者： Tian-Ni Xu Hai-Feng Sun Di Zhang Xiao-Ming Zhou Xiu-Feng Sui Sa Wang Qun Huang Yun-Gang Bao State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China School of Information and Electronics Beijing Institute of TechnologyBeijing 100081China Peng Cheng Laboratory Shenzhen 518055China Department of Computer Science and Technology Peking UniversityBeijing 100871China

With the advent of virtualization techniques and software-defined networking(SDN),network function virtualization(NFV)shifts network functions(NFs)from hardware implementations to software appliances,between which exists a performance *** to narrow the gap is an essential issue of current NFV ***,the cumbersomeness of deployment,the water pipe effect of virtual network function(VNF)chains,and the complexity of the system software stack together make it tough to figure out the cause of low performance in the NFV *** pinpoint the NFV system performance,we propose NfvInsight,a framework for automatic deployment and benchmarking VNF *** framework tackles the challenges in NFV performance *** framework components include chain graph generation,automatic deployment,and fine granularity *** design and implementation of each component have their *** the best of our knowledge,we make the first attempt to collect rules forming a knowledge base for generating reasonable chain *** deploys the generated chain graphs automatically,which frees the network operators from executing at least 391 lines of bash commands for a single *** diagnose the performance bottleneck,NfvInsight collects metrics from multiple layers of the software ***,we collect the network stack latency distribution ingeniously,introducing only less than 2.2%*** showcase the convenience and usability of NfvInsight in finding bottlenecks for both VNF chains and the underlying *** our framework,we find several design flaws of the network stack,which are unsuitable for packet forwarding inside one single server under the NFV *** optimization for these flaws gains at most 3x performance improvement.

关键词： network function virtualization(NFV) service chain performance bottleneck network stack latency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：