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

1st Asian Conference on Communication and Networks, ASIANComNet 2024

作者： Bhaskar, Seelam Ch Vijaya Kalyani, Gedela Al-Fatlawy, Ramy Alsalamy, Fatima Kurdi, Waleed Hadi Madhloom Al-Aboudy, H.M. Sujatha, G. MVSR Engineering College Department of IT Telangana Hyderabad India Karpaga Vinayaga College of Engineering and Technology Big Data Analytics Tamil Nadu Chengalpattu India The Islamic University College of Technical Engineering Department of Computer Technical Engineering Najaf Iraq Al-Mustaqbal University Medical Laboratories Techniques Department Hillah Iraq Altoosi University College Department of Computer Science Iraq Mazaya University College Department of Computer Techniques Engineering DhiQar Iraq Arunai Engineering College Department of ECE Tamil Nadu Tiruvannamalai India

ISBN: (纸本)9798350367003

Applications such as industrial automation, healthcare, and environmental monitoring need the use of wireless sensor networks (WSNs). However, due to their dispersed organizational makeup, they have become vulnerable to security risks, particularly clone assaults. To protect confidentiality, availability, and confidentiality, several attacks must be recognized and prevented. This project aims to offer an effective method for identifying and averting clone assaults. To identify cloned both nationally and internationally use a low-cost verification process. In this study, we offer a new adaptive sea-horse optimized light gradient boosting machine (ASHO-LGBM) technique for protecting the network against node identity duplicates. The ASHO approach is used in the ASHO-LGBM framework to improve the recognition accuracy of the light gradient boosting machine (LGBM) characteristics. The replications with the nodes intrusion detection (ID) are used to choose a most trustworthy communication mode. The procedure is intended to be implemented and used for gathering data through an internet component. Using a Python tool, the suggested technique is simulated and its delay, packet delivery ratio, packet drop, and energy are evaluated. When compared to other approaches, the study's results show that the ASHO-LGBM strategy's performance analysis achieves the highest accuracy rate. © 2024 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

StyleAdv: Meta Style Adversarial Training for Cross-Domain Few-Shot Learning

arXiv

引用

arXiv 2023年

作者： Fu, Yuqian Xie, Yu Fu, Yanwei Jiang, Yu-Gang Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University China Purple Mountain Laboratories Nanjing China School of Data Science Fudan University China

Cross-Domain Few-Shot Learning (CD-FSL) is a recently emerging task that tackles few-shot learning across different domains. It aims at transferring prior knowledge learned on the source dataset to novel target datasets. The CD-FSL task is especially challenged by the huge domain gap between different datasets. Critically, such a domain gap actually comes from the changes of visual styles, and wave-SAN [10] empirically shows that spanning the style distribution of the source data helps alleviate this issue. However, wave-SAN simply swaps styles of two images. Such a vanilla operation makes the generated styles "real" and "easy", which still fall into the original set of the source styles. Thus, inspired by vanilla adversarial learning, a novel model-agnostic meta Style Adversarial training (StyleAdv) method together with a novel style adversarial attack method is proposed for CD-FSL. Particularly, our style attack method synthesizes both "virtual" and "hard" adversarial styles for model training. This is achieved by perturbing the original style with the signed style gradients. By continually attacking styles and forcing the model to recognize these challenging adversarial styles, our model is gradually robust to the visual styles, thus boosting the generalization ability for novel target datasets. Besides the typical CNN-based backbone, we also employ our StyleAdv method on large-scale pretrained vision transformer. Extensive experiments conducted on eight various target datasets show the effectiveness of our method. Whether built upon ResNet or ViT, we achieve the new state of the art for CD-FSL. Code is available at https://***/lovelyqian/StyleAdv-CDFSL. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

PAIL: Performance based Adversarial Imitation Learning Engine for Carbon Neutral Optimization

arXiv

引用

arXiv 2024年

作者： Ye, Yuyang Tang, Lu-An Wang, Haoyu Yu, Runlong Yu, Wenchao He, Erhu Chen, Haifeng Xiong, Hui Department of Management Science and Information Systems Rutgers Business School Rutgers University NewarkNJ United States Department of Data Science and System Security NEC Laboratories PrincetonNJ United States Department of Computer Science University of Pittsburgh PittsburghPA United States Department of Computer Science and Engineering The Hong Kong University of Science and Technology Guangzhou China

Achieving carbon neutrality within industrial operations has become increasingly imperative for sustainable development. It is both a significant challenge and a key opportunity for operational optimization in industry 4.0. In recent years, Deep Reinforcement Learning (DRL) based methods offer promising enhancements for sequential optimization processes and can be used for reducing carbon emissions. However, existing DRL methods need a pre-defined reward function to assess the impact of each action on the final sustainable development goals (SDG). In many real applications, such a reward function cannot be given in advance. To address the problem, this study proposes a Performance based Adversarial Imitation Learning (PAIL) engine. It is a novel method to acquire optimal operational policies for carbon neutrality without any pre-defined action rewards. Specifically, PAIL employs a Transformer-based policy generator to encode historical information and predict following actions within a multi-dimensional space. The entire action sequence will be iteratively updated by an environmental simulator. Then PAIL uses a discriminator to minimize the discrepancy between generated sequences and real-world samples of high SDG. In parallel, a Q-learning framework based performance estimator is designed to estimate the impact of each action on SDG. Based on these estimations, PAIL refines generated policies with the rewards from both discriminator and performance estimator. PAIL is evaluated on multiple real-world application cases and datasets. The experiment results demonstrate the effectiveness of PAIL comparing to other state-of-the-art baselines. In addition, PAIL offers meaningful interpretability for the optimization in carbon neutrality. Copyright © 2024, The Authors. All rights reserved.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

WIT-Greedy: Hardware System Design of Weighted ITerative Greedy Decoder for Surface Code

WIT-Greedy: Hardware System Design of Weighted ITerative Gre...

引用

Asia and South Pacific Design Automation Conference

作者： Wang Liao Yasunari Suzuki Teruo Tanimoto Yosuke Ueno Yuuki Tokunaga Photon Science Center the University of Tokyo Japan NTT Computer and Data Science Laboratories Japan Faculty of Information Science and Electrical Engineering Kyushu University Japan Graduate School of Information Science and Technology the University of Tokyo Japan

Large error rates of quantum bits (qubits) are one of the main difficulties in the development of quantum computing. Performing quantum error correction (QEC) with surface codes is considered the most promising approach to reduce the error rates of qubits effectively. To perform error correction, we need an error-decoding unit, which estimates errors in the noisy physical qubits repetitively, to create a robust logical qubit. While complicated graph-matching problems must be solved within a strict time restriction for the error decoding, several hardware implementations that satisfy the restriction at a large code distance have been proposed. However, the existing decoder designs are still challenging in reducing the logical error rate. This is because they assume that the error rates of physical qubits are uniform while they have large variations in practice. According to our numerical simulation based on the quantum chip with the largest qubit number, neglecting the non-uniform error properties of a real quantum chip in the decoding process induces significant degradation of the logical error rate and spoils the benefit of QEC. To take the non-uniformity into account, decoders need to solve matching problems on a weighted graph, but they are difficult to solve using the existing designs without exceeding the time limit of decoding. Therefore, a decoder that can treat both the non-uniform physical error rates and the large surface code is strongly demanded. In this paper, we propose a hardware design of decoding units for the surface code that can treat the non-identical error properties with small latency at a large code distance. The key idea of our design is 1) constructing a look-up table for calculating the shortest paths between nodes in a weighted graph and 2) enabling parallel processing during decoding. The implementation results in field programmable gate array (FPGA) indicate that our design scales up to code distance 11 within a microsecond-level delay,

关键词： Codes Error analysis Qubit Hardware Decoding Delays Table lookup

来源：评论

学校读者我要写书评

暂无评论

Iterative Feature Space Optimization through Incremental Adaptive Evaluation

arXiv

引用

arXiv 2025年

作者： Wu, Yanping Huang, Yanyong Chen, Zhengzhang Yao, Zijun Fu, Yanjie Liu, Kunpeng Luo, Xiao Wang, Dongjie University of Kansas Department of Electrical Engineering and Computer Science United States Southwestern University of Finance and Economics Department of Statistics China NEC Laboratories America Data Science and System Security United States Arizona State University Department of Computing and Augmented Intelligence United States Portland State University Department of Computer Science United States University of California Los Angeles Department of Computer Science United States

Iterative feature space optimization involves systematically evaluating and adjusting the feature space to improve downstream task performance. However, existing works suffer from three key limitations: 1) overlooking differences among data samples leads to evaluation bias;2) tailoring feature spaces to specific machine learning models results in overfitting and poor generalization;3) requiring the evaluator to be retrained from scratch during each optimization iteration significantly reduces the overall efficiency of the optimization process. To bridge these gaps, we propose a gEneralized Adaptive feature Space Evaluator (EASE) to efficiently produce optimal and generalized feature spaces. This framework consists of two key components: Feature-Sample Subspace Generator and Contextual Attention Evaluator. The first component aims to decouple the information distribution within the feature space to mitigate evaluation bias. To achieve this, we first identify features most relevant to prediction tasks and samples most challenging for evaluation based on feedback from the subsequent evaluator. These identified feature and samples are then used to construct feature subspaces for next optimization iteration. This decoupling strategy makes the evaluator consistently target the most challenging aspects of the feature space. The second component intends to incrementally capture evolving patterns of the feature space for efficient evaluation. We propose a weighted-sharing multi-head attention mechanism to encode key characteristics of the feature space into an embedding vector for evaluation. Moreover, the evaluator is updated incrementally, retaining prior evaluation knowledge while incorporating new insights, as consecutive feature spaces during the optimization process share partial information. Extensive experiments on fourteen real-world datasets demonstrate the effectiveness of the proposed framework. Our code and data are publicly available Copyright © 2025, The Autho

关键词： Vector spaces

来源：评论

学校读者我要写书评

暂无评论

Quantum variational autoencoder utilizing regularized mixed-state latent representations

引用

Physical Review A 2025年第4期111卷 042416-042416页

作者： Gaoyuan Wang Jonathan Warrell Prashant S. Emani Mark Gerstein Program in Computational Biology and Bioinformatics Yale University New Haven Connecticut 06520 USA Department of Molecular Biophysics and Biochemistry Yale University New Haven Connecticut 06520 USA NEC Laboratories America Princeton New Jersey 08540 USA Department of Computer Science Yale University New Haven Connecticut 06520 USA Department of Statistics & Data Science Yale University New Haven Connecticut 06520 USA Department of Biomedical Informatics & Data Science Yale University New Haven Connecticut 06520 USA

A major challenge in near-term quantum computing is its application to large real-world datasets due to scarce quantum hardware resources. One approach to enabling tractable quantum models for such datasets involves finding low-dimensional representations that preserve essential information for downstream analysis. In classical machine learning, variational autoencoders (VAEs) facilitate efficient data compression, representation learning for subsequent tasks, and novel data generation. However, no quantum model has been proposed that exactly captures all of these features for direct application to quantum data on quantum computers. Some existing quantum models for data compression lack regularization of latent representations, thus preventing direct use for generation and control of generalization. Others are hybrid models with only some internal quantum components, impeding direct training on quantum data. To address this, we present a fully quantum framework, ζ-QVAE, which encompasses all the capabilities of classical VAEs and can be directly applied to map both classical and quantum data to a lower-dimensional space, while effectively reconstructing much of the original state from it. Our model utilizes regularized mixed states to attain optimal latent representations. It accommodates various divergences for reconstruction and regularization. Furthermore, by accommodating mixed states at every stage, it can utilize the full data density matrix and allow for a training objective defined on probabilistic mixtures of input data. Doing so, in turn, makes efficient optimization possible and has potential implications for private and federated learning. In addition to exploring the theoretical properties of ζ-QVAE, we demonstrate its performance on representative genomics and synthetic data. Our results indicate that ζ-QVAE consistently learns representations that better utilize the capacity of the latent space and exhibits similar or better performance compared with

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

A Closer Look at Benchmarking Self-Supervised Pre-training with Image Classification

arXiv

引用

arXiv 2024年

作者： Marks, Markus Knott, Manuel Kondapaneni, Neehar Cole, Elijah Defraeye, Thijs Perez-Cruz, Fernando Perona, Pietro California Institute of Technology United States ETH Zurich Institute for Machine Learning Department of Computer Science Switzerland Swiss Data Science Center ETH Zurich and EPFL Switzerland Empa Swiss Federal Laboratories for Materials Science and Technology Switzerland Altos Labs Switzerland

Self-supervised learning (SSL) is a machine learning approach where the data itself provides supervision, eliminating the need for external labels. The model is forced to learn about the data's inherent structure or context by solving a pretext task. With SSL, models can learn from abundant and cheap unlabeled data, significantly reducing the cost of training models where labels are expensive or inaccessible. In computer Vision, SSL is widely used as pre-training followed by a downstream task, such as supervised transfer, few-shot learning on smaller labeled data sets, and/or unsupervised clustering. Unfortunately, it is infeasible to evaluate SSL methods on all possible downstream tasks and objectively measure the quality of the learned representation. Instead, SSL methods are evaluated using in-domain evaluation protocols, such as fine-tuning, linear probing, and k-nearest neighbors (kNN). However, it is not well understood how well these evaluation protocols estimate the representation quality of a pre-trained model for different downstream tasks under different conditions, such as dataset, metric, and model architecture. In this work, we study how classification-based evaluation protocols for SSL correlate and how well they predict downstream performance on different dataset types. Our study includes eleven common image datasets and 26 models that were pre-trained with different SSL methods or have different model backbones. We find that in-domain linear/kNN probing protocols are, on average, the best general predictors for out-of-domain performance. We further investigate the importance of batch normalization for the various protocols and evaluate how robust correlations are for different kinds of dataset domain shifts. In addition, we challenge assumptions about the relationship between discriminative and generative self-supervised methods, finding that most of their performance differences can be explained by changes to model backbones. Copyright © 2024, The

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Stimulated emission from superradiant atoms in waveguide QED

Stimulated emission from superradiant atoms in waveguide QED

引用

CLEO: science and Innovations, S and I 2022

作者： Asaoka, Rui Gea-Banacloche, Julio Tokunaga, Yuuki Koshino, Kazuki Computer and Data Science Laboratories NTT Corporation Musashino180-8585 Japan Department of Physics University of Arkansas FayettevilleAR72701 United States College of Liberal Arts and Sciences Tokyo Medical and Dental University Ichikawa272-0827 Japan

We investigate the stimulated emission from superradiant atoms coupled to a waveguide induced by a coherent-state pulse. We provide the dynamical properties of this system and also evaluate the system as a amplifier. ... 详细信息

ISBN: (纸本)9781557528209

关键词： Stimulated emission

来源：评论

学校读者我要写书评

暂无评论

Improving Power Allocation and Installation in WSN Using Novel Nature-Inspired Optimization for Cyber Security Applications 1

Improving Power Allocation and Installation in WSN Using Nov...

引用

1st Asian Conference on Communication and Networks, ASIANComNet 2024

作者： Balamurugan, K.S. Kalyani, Gedela Al-Fatlawy, Ramy Kurdi, Waleed Hadi Madhloom Alsalamy, Fatima Al-Aboudy, H.M. Manikandan, K. Karpaga Vinayaga College of Engineering and Technology Department of ECE Tamil Nadu Chengalpattu India Karpaga Vinayaga College of Engineering and Technology Big Data Analytics Tamil Nadu Chengalpattu India The Islamic University College of Technical Engineering Department of Computer Technical Engineering Najaf Iraq Altoosi University College Department of Computer Science Najaf Iraq Al-Mustaqbal University Medical Laboratories Techniques Department Hillah Iraq Mazaya University College DhiQar Department of Computer Techniques Engineering Iraq Sona College of Technology Department of Biomedical Engineering Tamil Nadu Salem India

ISBN: (纸本)9798350367003

Wireless sensor network (WSN) installation and power allocation optimization for cybersecurity purposes are difficult tasks which include a well-thought-out method that strikes a balance between goals such as the energy efficiency, connectivity and cyber threat resistance while improving overall system performance and cybersecurity. A novel multi-task walrus optimization (MTWO) technique is offered in this study. The installation and power allocation problem (IPAP) with several jobs is established in this research. The suggested MTWO is used to split the IPAP into numerous scalar components, which are consequently grouped and treated by their desired goals. We evaluate the proposed MTWO approach using simulations and show that it works well in practice. The findings demonstrate that power distribution and installation for cybersecurity activities on WSNs can be improved by the MTWO. The superiority of the problem specific MTWO over the MOGA has been demonstrated by simulation outcome in several network cases, offering a wide range of excellent network designs to aid in the decision-maker selection. © 2024 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

A Proposal to Find Mutually Contributable Business or Life Activities Using Conformance Checking 26

A Proposal to Find Mutually Contributable Business or Life A...

引用

26th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2022

作者： Kaiya, Haruhiko Misawa, Tomoya Ogata, Shinpei Saito, Shinobu Nakagawa, Hiroyuki Takeuchi, Hironori Kanagawa University Hiratsuka259-1293 Japan Shinshu University Nagano380-8553 Japan NTT Computer and Data Science Laboratories Tokyo108-0023 Japan Osaka University Suita565-0871 Japan Musashi University Tokyo176-8534 Japan

We propose a method to comprehensively find a pair of business or life activities, which can mutually contribute to each other. We assume that the activities with synchronized processes can mutually contribute to each other. A process model of an activity is thus compared to a log of another activity for measuring whether the activities can synchronize their processes to a certain extent using a conformance checking technique. The threshold of the extent is defined on the basis of a randomly generated log containing the same events as those in the compared log. We tentatively evaluated the method through a case study, and confirmed that the method seemed to be valid. © 2022 The Authors. Published by Elsevier B.V.

关键词： Conformance checking Cross-organizational process Process mining Sharing process

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：