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

2025 IEEE International Conference on big data and Smart Computing, bigComp 2025

作者： Zabin, Mahe Ayon, Syed Tasnimul Karim Siraj, Farhan Md Shuvo, Mehedi Hasan Choi, Ho-Jin Uddin, Jia Korea Advanced Institute of Science and Technology School of Computing Daejeon Korea Republic of BRAC University Department of Computer Science and Engineering Dhaka Bangladesh Dhaka University of Engineering & Technology Department of Computer Science and Engineering Dhaka Gazipur Bangladesh Woosong University AI and Big Data Department Endicott College Daejeon Korea Republic of

The deep learning models are computationally burdensome, and their accuracy depends on the number of labeled datasets used in training. The scarcity of the labeled dataset in industrial machine diagnosis is a significant concern as it is pretty impossible to collect data from faulty machines in industrial environments. To address this issue, in this paper, we presented a few-shot learning-based machine fault diagnosis model on a lightweight SqueezeNet architecture using generated texture images from audio sensor data. Subsets of two public audio datasets, MIMII and ToyADMOS, containing limited data- 10 images per class were used to validate the model. The experimental results demonstrate that the model has exhibited 89.6% and 98.3% accuracy for MIMII and ToyADMOS, respectively, with only ten labeled images of each fault class. As the model has only 73 thousand trainable parameters and requires only 300 KB of memory, it is expected to be deployable in a portal device for machine fault diagnosis. © 2025 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Image Compressive Sensing With Scale-Variable Adaptive Sampling and Hybrid-Attention Transformer Reconstruction

引用

IEEE Transactions on Multimedia 2025年

作者： Hui, Chen Zhao, Debin Lin, Weisi Liu, Shaohui Jiang, Feng Nanjing University of Information Science and Technology School of Future Technology Nanjing210044 China Harbin Institute of Technology Department of Computer Science and Technology Harbin150001 China Nanyang Technological University College of Computing and Data Science Singapore639798 Singapore

Recently, a large number of image compressive sensing (CS) methods with deep unfolding networks (DUNs) have been proposed. However, existing methods either use fixed-scale blocks for sampling that leads to limited insights into the image content or employ a plain convolutional neural network (CNN) in each iteration that weakens the perception of broader contextual prior. In this paper, we propose a novel DUN (dubbed SVASNet) for image compressive sensing, which achieves scale-variable adaptive sampling and hybrid-attention Transformer reconstruction with a single model. Specifically, for scale-variable sampling, a sampling matrix-based calculator is first employed to evaluate the reconstruction distortion, which only requires measurements without access to the ground truth image. Then, a Block Scale Aggregation (BSA) strategy is presented to compute the reconstruction distortion under block divisions at different scales and select the optimal division scale for sampling. To realize hybrid-attention reconstruction, a dual Cross Attention (CA) submodule in the gradient descent step and a Spatial Attention (SA) submodule in the proximal mapping step are developed. The CA submodule introduces inter-phase inertial forces in the gradient descent, which improves the memory effect between adjacent iterations. The SA submodule integrates local and global prior representations of CNN and Transformer, and explores local and global affinities between dense feature representations. Extensive experimental results show that the proposed SVASNet achieves significant improvements over the state-of-the-art methods. © 1999-2012 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Robust Correlation Clustering Problem with Locally Bounded Disagreements

Robust Correlation Clustering Problem with Locally Bounded D...

引用

作者： Ji, Sai Li, Min Liang, Mei Zhang, Zhenning Institute of Mathematics Hebei University of Technology Tianjin300401 China School of Mathematics and Statistics Shandong Normal University Jinan250358 China College of Statistics and Data Science Beijing University of Technology Beijing100124 China Beijing University of Technology Department of Operations Research and Information Engineering Beijing100124 China

Min-max disagreements are an important generalization of the correlation clustering problem (CorCP). It can be defined as follows. Given a marked complete graph G=(V, E), each edge in the graph is marked by a positive label '+' or a negative label '-' based on the similarity of the connected vertices. The goal is to find a clustering C of vertices V, so as to minimize the number of disagreements at the vertex with the most disagreements. Here, the disagreements are the positive cut edges and the negative non-cut edges produced by clustering C. This paper considers two robust min-max disagreements: min-max disagreements with outliers and min-max disagreements with penalties. Given parameter δ\in(0,1/14), we first provide a threshold-based iterative clustering algorithm based on LP-rounding technique, which is a (1/δ, 7/(1-14δ))-bi-criteria approximation algorithm for both the min-max disagreements with outliers and the min-max disagreements with outliers on one-sided complete bipartite graphs. Next, we verify that the above algorithm can achieve an approximation ratio of 21 for min-max disagreements with penalties when we set parameter δ=1/21. © 1996-2012 Tsinghua University Press.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A Decision Support Framework for Sustainable Waste Disposal technology Selection

A Decision Support Framework for Sustainable Waste Disposal ...

引用

2024 ASU International Conference in Emerging Technologies for Sustainability and Intelligent Systems, ICETSIS 2024

作者： Lakkireddy, Venkateswara Reddy Mohana, R. Madana Ganesh, B. Rama Reddy, Lakkireddy Udanth Gochhait, Saikat Chogle, Shrish Hyderabad India Chaitanya Bharathi Institute of Technology Department of Artificial Intelligence and Data Science Hyderabad India Sri Venkatesa Perumal College of Engineering and Technology Department of Computer Science and Engineering Tirupathi India Ap University Dept. of Electronics and Communication Engineering Vit Amaravathi India Symbiosis Institute of Digital and Telecom Management Symbiosis International Deemed University India

ISBN: (纸本)9798350372229

Waste Disposal technology (WDT) selection is a primary issue in Municipal Solid Waste (MSW) that affects the development of the environmental and economic perspectives/aspects, particularly in developing countries. The selection of appropriate WDT is a complex Multi-Attribute Decision-Making (MADM) problem with both qualitative and quantitative elements. The existent MADM approaches with fuzzy sets (removal of uncertainty), different subjective weight methods (significance of attributes), and rank reversal phenomenon leads to improper selection of WDT due to the involvement of different opinions of decision-makers. To avoid this, a Decision Support Framework (DSF) was proposed for optimal WDT selection for the growth of economic and environmental development. The proposed DSF integrates Preference Selection Index (PSI) and a Modified-Comprehensive distance Based Ranking (M-COBRA) approaches to determine the significance of attributes and ranking the alternatives, respectively. The DSF is illustrated using a case study collected from Iran and compared with state-of-the-art MADM approaches. Further, the DSF is validated in terms of sensitivity analysis, rank reversal phenomenon, and Pearson's rank correlation coefficient to ensure the stability of ranking. © 2024 IEEE.

关键词： multi-attribute decision-making Municipal solid waste preference selection index rank reversal phenomenon sensitivity analysis waste disposal technology

来源：评论

学校读者我要写书评

暂无评论

Quantum partial least squares regression algorithm for multiple correlation problem

引用

Chinese Physics B 2022年第3期31卷 177-186页

作者： Yan-Yan Hou Jian Li Xiu-Bo Chen Yuan Tian School of Artificial Intelligence Beijing University of Post and TelecommunicationsBeijing 100876China College of Information Science and Engineering Zaozhuang UniversityZaozhuang 277160China Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Post and TelecommunicationsBeijing 100876China GuiZhou University Guizhou Provincial Key Laboratory of Public Big DataGuiyang 550025China

Partial least squares(PLS) regression is an important linear regression method that efficiently addresses the multiple correlation problem by combining principal component analysis and multiple regression. In this paper, we present a quantum partial least squares(QPLS) regression algorithm. To solve the high time complexity of the PLS regression, we design a quantum eigenvector search method to speed up principal components and regression parameters construction. Meanwhile, we give a density matrix product method to avoid multiple access to quantum random access memory(QRAM)during building residual matrices. The time and space complexities of the QPLS regression are logarithmic in the independent variable dimension n, the dependent variable dimension w, and the number of variables m. This algorithm achieves exponential speed-ups over the PLS regression on n, m, and w. In addition, the QPLS regression inspires us to explore more potential quantum machine learning applications in future works.

关键词： quantum machine learning partial least squares regression eigenvalue decomposition

来源：评论

学校读者我要写书评

暂无评论

Situation Awareness on Blockchain Based on Markov Game Model 4

Situation Awareness on Blockchain Based on Markov Game Model

引用

4th International Symposium on Smart and Healthy Cities, ISHC 2022

作者： Wang, Peng Qian, Baojian Yan, Yaoxi Sun, Jinyu Chen, Fubing Huaiyin Normal University Huai'an Key Laboratory of Big Data Intelligent Computing and Analysis Jiangsu Huaian223300 China School of Computer Science and Technology Huaiyin Normal University Jiangsu Huaian223300 China

ISBN: (纸本)9781665491808

Aiming at the network security problem of the blockchain system, the game model based on Markov is proposed. The model perceives the network security situation of the blockchain system, accurately and comprehensively evaluates the current security status of the system through clustering screening and attack game, dynamically evaluates the security situation of the system, and establishes an attack transfer network and the best reinforcement scheme. The experiment shows that the Markov game model based on 51% double spend attack can evaluate and predict the current and future security status of the blockchain system, and can reduce the asset loss caused by blockchain attacks to a certain extent. © 2022 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Efficient Drinking Water Quality Analysis using Machine Learning Model with Hyper-Parameter Tuning 7

Efficient Drinking Water Quality Analysis using Machine Lear...

引用

7th International Conference on Intelligent Computing and Control Systems, ICICCS 2023

作者： Maheswari, M Uma Sudharsanan, R. Arthy, M. Jenefer, Anne Oormila, L. Samuthira Pandi, V. RMD Engineering College Department of Electrical and Electronics Engineering Tamil Nadu India SRM Institute of Science and Technology Department of Information Technology Tamil Nadu Ramapuram India SRM Institute of Science and Technology Department of Data Science and Business Systems Tamil Nadu Kattankulathur India Panimalar Engineering College Department of Electronics and Communication Engineering Tamil Nadu India Agni College of Technology Department of Computer Science Engineering Tamil Nadu India SRM Institute of Science and Technology Department of Electronics Ad Communication Engineering Tamilnadu Ramapuram India

ISBN: (纸本)9798350397253

The conventional approaches to determining the quality of water include costly and lengthy statistical and laboratory testing;hence, the concept of real-time monitoring is no longer applicable in the modern day. The disastrous implications of poor water quality demand that there be a remedy that is both more expedient and more realistic. This research study examines a variety of supervised machine learning algorithms in order to identify the quality of the water. A variety of variables, such as the pH value, the hardness, the solids, the chloramines, the sulfates, the conductivity, the organic carbon, the trihalomethanes, the turbidity, and the potability of the water, are essential for determining the quality of the water. Random Forest (RF) and Decision Tree (DT) are used in order to ascertain the caliber of the water that is suitable for human consumption. The standard laboratory approach for testing the quality of water is one that takes a lot of time and may be somewhat expensive at times. In a very short length of time, the algorithms that are proposed in this study are able to provide an estimation of the quality of drinking water. DT has a height accuracy F1 score of 99%, whereas RF has a score of 87.86% and a precision of 82.36%. The difference in these two scores is due to the fact that DT's precision is lower. The suggested method demonstrates its potential for usage in real-time water quality monitoring systems by achieving appropriate accuracy with a minimal set of parameters. To prove the usefulness of this program, this is essential. © 2023 IEEE.

关键词： Water quality

来源：评论

学校读者我要写书评

暂无评论

JobViz: Skill-driven Visual Exploration of Job Advertisements

arXiv

引用

arXiv 2024年

作者： Wang, Ran Chen, Qianhe Wang, Yong Shen, Boyang Xiong, Lewei School of Journalism and Information Communication Huazhong University of Science and Technology Wuhan China Philosophy and Social Science Laboratory of Big Data and National Communication Strategy Ministry of Education Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Wuhan National Laboratory for Optoelectronics Wuhan China College of Computing and Data Science Nanyang Technological University Singapore Singapore

Online job advertisements on various job portals or websites have become the most popular way for people to find potential career opportunities nowadays. However, the majority of these job sites are limited to offering fundamental filters such as job titles, keywords, and compensation ranges. This often poses a challenge for job seekers in efficiently identifying relevant job advertisements that align with their unique skill sets amidst a vast sea of listings. Thus, we propose well-coordinated visualizations to provide job seekers with three levels of details of job information: a skill-job overview visualizes skill sets, employment posts as well as relationships between them with a hierarchical visualization design;a post exploration view leverages an augmented radar-chart glyph to represent job posts and further facilitates users' swift comprehension of the pertinent skills necessitated by respective positions;a post detail view lists the specifics of selected job posts for profound analysis and comparison. By using a real-world recruitment advertisement dataset collected from 51Job, one of the largest job websites in China, we conducted two case studies and user interviews to evaluate JobViz. The results demonstrated the usefulness and effectiveness of our approach. © 2024, CC BY-NC-ND.

关键词： Marketing

来源：评论

学校读者我要写书评

暂无评论

A Linear Programming Enhanced Genetic Algorithm for Hyperparameter Tuning in Machine Learning

arXiv

引用

arXiv 2024年

作者： Sinha, Ankur Pankaj, Paritosh Brij Disa Centre for Data Science and Artificial Intelligence Indian Institute of Management Gujarat Ahmedabad380015 India Department of Statistics and Data Science Indian Institute of Technology Uttar Pradesh Kanpur208016 India

In this paper, we formulate the hyperparameter tuning problem in machine learning as a bilevel program. The bilevel program is solved using a micro genetic algorithm that is enhanced with a linear program. While the genetic algorithm searches over discrete hyperparameters, the linear program enhancement allows hyper local search over continuous hyperparameters. The major contribution in this paper is the formulation of a linear program that supports fast search over continuous hyperparameters, and can be integrated with any hyperparameter search technique. It can also be applied directly on any trained machine learning or deep learning model for the purpose of fine-tuning. We test the performance of the proposed approach on two datasets, MNIST and CIFAR-10. Our results clearly demonstrate that using the linear program enhancement offers significant promise when incorporated with any populationbased approach for hyperparameter *** Codes 49M37 © 2024, CC BY.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Detector Collapse: Physical-World Backdooring Object Detection to Catastrophic Overload or Blindness in Autonomous Driving

arXiv

引用

arXiv 2024年

作者： Zhang, Hangtao Hu, Shengshan Wang, Yichen Zhang, Leo Yu Zhou, Ziqi Wang, Xianlong Zhang, Yanjun Chen, Chao School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China Cluster and Grid Computing Lab China School of Information and Communication Technology Griffith University Australia University of Technology Sydney Australia RMIT University Australia

Object detection tasks, crucial in safety-critical systems like autonomous driving, focus on pinpointing object locations. These detectors are known to be susceptible to backdoor attacks. However, existing backdoor techniques have primarily been adapted from classification tasks, overlooking deeper vulnerabilities specific to object detection. This paper is dedicated to bridging this gap by introducing Detector Collapse (DC), a brand-new backdoor attack paradigm tailored for object detection. DC is designed to instantly incapacitate detectors (i.e., severely impairing detector's performance and culminating in a denial-of-service). To this end, we develop two innovative attack schemes: SPONGE for triggering widespread misidentifications and BLINDING for rendering objects invisible. Remarkably, we introduce a novel poisoning strategy exploiting natural objects, enabling DC to act as a practical backdoor in real-world environments. Our experiments on different detectors across several benchmarks show a significant improvement (∼10%-60% absolute and ∼2-7× relative) in attack efficacy over state-of-the-art attacks. Copyright © 2024, The Authors. All rights reserved.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：