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

Intelligent Signal Processing and Effective Communication Technologies (INSPECT), IEEE International Conference on

作者： Aditya Dubey Ramnaresh Sharma Dhananjay Bisen Nookala Venu Varshali Jaiswal Bhagat Singh Raghuwanshi Khemchand Shakywar Centre for Internet of Things Madhav Institute of Technology & Science Gwalior India Centre for AI Madhav Institute of Technology & Science Gwalior India Data Science and Quantum Computing ABV Indian Institute of Information Technology and Management Gwalior India School of Engineering Avantika University Ujjain MP

ISBN: (数字)9798350379525

ISBN: (纸本)9798350379532

Many methods have been used to forecast stock market trends in the big data age, including real numbers, fuzzy time series data, fuzzy sets design, and conventional time series data. The control of semantic value data is made possible by the use of fuzzy time series data in stock market prediction, which makes accurate value predictions possible. These techniques are mostly used to forecast dynamic, non-linear datasets in a variety of industries, such as stock markets and cryptocurrencies. In order to predict stock prices, artificial intelligence (AI) methods such as neural networks (NN) have become increasingly important. Many methods have been developed to validate parametric and non-parametric theories for predicting trends and gains in the stock market using the feed-forward (FF) NN technique. A variety of soft computing techniques have been investigated in order to provide ways for decision-making based on profit and loss criteria without relying on artificial intelligence. This paper's main goal is to perform a comprehensive examination of the different prediction techniques used to estimate price and return in the stock market. The study includes a comparative review of several approaches as well as a variety of stock market forecasting strategies.

关键词： Computational modeling Time series analysis Signal processing algorithms Predictive models Prediction algorithms Market research Vectors Stock markets Forecasting Investment

来源：评论

学校读者我要写书评

暂无评论

Succinct Perfect Zero-knowledge for MIP

arXiv

引用

arXiv 2025年

作者： Fu, Honghao Zhang, Xingjian Concordia Institute for Information Systems Engineering Concordia University Montreal Canada QICI Quantum Information and Computation Initiative School of Computing and Data Science The University of Hong Kong Hong Kong

In the recent breakthrough result [MS24], Slofstra and Mastel show that there is a two-player one-round perfect zero-knowledge MIP∗ protocol for RE. We build on their result to show that there exists a succinct two-player one-round perfect zero-knowledge MIP∗ protocol for RE with polylog question size and O(1) answer size, or with O(1) question size and polylog answer size. To prove our result, we analyze the four central compression techniques underlying the MIP∗ = RE proof [JNV+20] — question reduction, oracularization, answer reduction, and parallel repetition — and show that they all preserve the perfect (as well as statistical and computational) zero-knowledge properties of the original protocol. Furthermore, we complete the study of the conversion between constraint-constraint and constraint-variable binary constraint system (BCS) nonlocal games, which provide a quantum information characterization of MIP∗ protocols. While Paddock [Pad22] established that any near-perfect strategy for a constraint-variable game can be mapped to a constraint-constraint version, we prove the converse, fully establishing their equivalence. © 2025, CC0.

关键词： Constraint theory

来源：评论

学校读者我要写书评

暂无评论

LossControl: Defending Membership Inference Attacks by Controlling the Loss

LossControl: Defending Membership Inference Attacks by Contr...

引用

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

作者： Bo Yang Hongwei Yang Renhao Lu Hui He Weizhe Zhang Haoyu He Rahul Yadav Faculty of Computing Harbin Institute of Technology Harbin China Department of Data Science and AI Faculty of Information Technology Monash University Melbourne Australia College of Computer Science and Technology Harbin Engineering University Harbin China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Machine learning models are vulnerable to membership inference attacks (MIAs), where adversaries attempt to predict whether specific samples are part of the model’s training set. Previous studies have demonstrated a strong correlation between the distinguishability of training and testing loss distributions and the model’s susceptibility to MIAs. Motivated by existing results, we propose a novel training framework called LossControl, which focuses on manipulating loss to mitigate privacy leaks. In LossControl, we first utilize Soft-label Training to replace the general learning process, which facilitates model training while improving generalization. Next, we monitor overfitting samples during the training process and prevent further loss reduction by applying our designed Loss Ascent to these samples without sacrificing model performance. Through extensive evaluations across four diverse datasets (including images, medical data, and transaction records), our method consistently outperforms defense mechanisms against state-of-the-art attacks and achieves optimal model performance in most experiments, demonstrating LossControl’s superior resilience against MIAs and its ability to strike an unparalleled balance between privacy and utility.

关键词： Training Privacy Process control Machine learning Predictive models Signal processing Speech processing Testing Resilience Overfitting

来源：评论

学校读者我要写书评

暂无评论

Guest Editorial Special Section on Generative AI and Large Language Models Enhanced 6G Wireless Communication and Sensing

IEEE Open Journal of the Communications Society

引用

IEEE Open Journal of the Communications Society 2025年 6卷 0-2页

作者： Jiacheng Wang Geng Sun Dusit Niyato Hina Tabassum Gabriel-Miro Muntean Nelson Fonseca College of Computing and Data Science Nanyang Technological University Jurong West Singapore College of Computer Science and Technology Jilin University Changchun China Department of Electrical Engineering and Computer Science Lassonde School of Engineering York University Toronto ON Canada School of Electronic Engineering Dublin City University Dublin 9 Ireland Institute of Computing State University of Campinas Campinas Brazil

来源：评论

学校读者我要写书评

暂无评论

Not All Diffusion Model Activations Have Been Evaluated as Discriminative Features 38

Not All Diffusion Model Activations Have Been Evaluated as D...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Meng, Benyuan Xu, Qianqian Wang, Zitai Cao, Xiaochun Huang, Qingming Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China Peng Cheng Laboratory China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China School of Computer Science and Tech. University of Chinese Academy of Sciences China Key Laboratory of Big Data Mining and Knowledge Management CAS China

Diffusion models are initially designed for image generation. Recent research shows that the internal signals within their backbones, named activations, can also serve as dense features for various discriminative tasks such as semantic segmentation. Given numerous activations, selecting a small yet effective subset poses a fundamental problem. To this end, the early study of this field performs a large-scale quantitative comparison of the discriminative ability of the activations. However, we find that many potential activations have not been evaluated, such as the queries and keys used to compute attention scores. Moreover, recent advancements in diffusion architectures bring many new activations, such as those within embedded ViT modules. Both combined, activation selection remains unresolved but overlooked. To tackle this issue, this paper takes a further step with a much broader range of activations evaluated. Considering the significant increase in activations, a full-scale quantitative comparison is no longer operational. Instead, we seek to understand the properties of these activations, such that the activations that are clearly inferior can be filtered out in advance via simple qualitative evaluation. After careful analysis, we discover three properties universal among diffusion models, enabling this study to go beyond specific models. On top of this, we present effective feature selection solutions for several popular diffusion models. Finally, the experiments across multiple discriminative tasks validate the superiority of our method over the SOTA competitors. Our code is available at this url. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Knowledge sharing via domain adaptation in customs fraud detection

arXiv

引用

arXiv 2022年

作者： Park, Sungwon Kim, Sundong Cha, Meeyoung School Of Computing Korea Advanced Institute Of Science And Technology Korea Republic of Data Science Group Institute For Basic Science Korea Republic of

Knowledge of the changing traffic is critical in risk management. Customs offices worldwide have traditionally relied on local resources to accumulate knowledge and detect tax fraud. This naturally poses countries with weak infrastructure to become tax havens of potentially illicit trades. The current paper proposes DAS, a memory bank platform to facilitate knowledge sharing across multi-national customs administrations to support each other. We propose a domain adaptation method to share transferable knowledge of frauds as prototypes while safeguarding the local trade information. data encompassing over 8 million import declarations have been used to test the feasibility of this new system, which shows that participating countries may benefit up to 2-11 times in fraud detection with the help of shared knowledge. We discuss implications for substantial tax revenue potential and strengthened policy against illicit trades. © 2022, CC BY-NC-SA.

关键词： Knowledge management

来源：评论

学校读者我要写书评

暂无评论

Combined Effect of Concept Drift and Class Imbalance on Model Performance During Stream Classification

引用

Computers, Materials & Continua 2023年第4期75卷 1827-1845页

作者： Abdul Sattar Palli Jafreezal Jaafar Manzoor Ahmed Hashmani Heitor Murilo Gomes Aeshah Alsughayyir Abdul Rehman Gilal Department of Computer and Information Sciences Universiti Teknologi PETRONAS(UTP)Seri Iskandar32610Malaysia Centre for Research in Data Science UTPPerak32610Malaysia High Performance Cloud Computing Centre(HPC3) UTPPerak32610Malaysia School of Engineering and Computer Science Victoria University of WellingtonWellington6012New Zealand AI Institute University of Waikato WellingtonHamilton3240New Zealand Anti-Narcotics Force Ministry of Narcotics ControlIslamabad46000Pakistan College of Computer Science and Engineering Taibah UniversityMadinah42353Saudi Arabia

Every application in a smart city environment like the smart grid,health monitoring, security, and surveillance generates non-stationary datastreams. Due to such nature, the statistical properties of data changes overtime, leading to class imbalance and concept drift issues. Both these issuescause model performance degradation. Most of the current work has beenfocused on developing an ensemble strategy by training a new classifier on thelatest data to resolve the issue. These techniques suffer while training the newclassifier if the data is imbalanced. Also, the class imbalance ratio may changegreatly from one input stream to another, making the problem more *** existing solutions proposed for addressing the combined issue of classimbalance and concept drift are lacking in understating of correlation of oneproblem with the other. This work studies the association between conceptdrift and class imbalance ratio and then demonstrates how changes in classimbalance ratio along with concept drift affect the classifier’s *** analyzed the effect of both the issues on minority and majority classesindividually. To do this, we conducted experiments on benchmark datasetsusing state-of-the-art classifiers especially designed for data stream ***, recall, F1 score, and geometric mean were used to measure theperformance. Our findings show that when both class imbalance and conceptdrift problems occur together the performance can decrease up to 15%. Ourresults also show that the increase in the imbalance ratio can cause a 10% to15% decrease in the precision scores of both minority and majority *** study findings may help in designing intelligent and adaptive solutionsthat can cope with the challenges of non-stationary data streams like conceptdrift and class imbalance.

关键词： Classification data streams class imbalance concept drift class imbalance ratio

来源：评论

学校读者我要写书评

暂无评论

Blockchain-based data Sharing Framework for Malaysia Government Aid Management System

Blockchain-based Data Sharing Framework for Malaysia Governm...

引用

2023 International Conference on Digital Applications, Transformation and Economy, ICDATE 2023

作者： Azmi, Azman Yahya, Farashazillah Moung, Ervin Gubin Sallehudin, Hasimi Utomo, Rio Guntur Azman, Nur Afrina Universiti Malaysia Sabah Advanced Machine Intelligence Research Lab Faculty of Computing and Informatics Sabah Kota Kinabalu Malaysia Universiti Malaysia Sabah Data Technologies and Application Research Lab Faculty of Computing and Informatics Sabah Kota Kinabalu Malaysia Universiti Kebangsaan Malaysia Centre for Software Technology and Management Faculty of Information Science and Technology Malaysia Telkom University School of Computing Bandung Indonesia Foundation Study and Language Institute University of Reading Malaysia Johor Iskandar Puteri Malaysia

ISBN: (纸本)9798350310689

The Covid-19 pandemic has impacted the world economy, and Malaysia is no exception. Due to the closure of businesses, the rate of unemployment has been recorded at an all-time high. The Malaysian Government through its agencies is assisting citizens through an online platform for incentives and an aid-giving platform. The current architecture of data sharing is using centralized, organization-oriented authentication and is not immutable for audit capability. In addition, the blockchain network is still a proof of concept in the digital government ecosystem. This paper studies the current aid data-sharing ecosystem and analyzes the potential of having a state government consortium blockchain framework that will be used in the Government Network Infrastructure for decentralized, transparent data sharing with audit capability. Several works involving Blockchain adoption based on domain, Blockchain consortium architecture and Government applications using blockchain are being presented. The need for a framework in implementing decentralized data sharing using consortium blockchain architecture for multi-agencies data sharing focusing on Malaysia Government Aid Management is discussed in this paper to provide the opportunity for the research domain. The findings in this paper will be used for future work on the requirement of a proposed government multi-layer consortium blockchain framework for data sharing in the Malaysian Government specifically for the Johore State Government ecosystem. © 2023 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

High Quality Global Routing Algorithm Based on Multi-Stage Optimization

引用

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics 2024年第4期36卷 607-614页

作者： Genggeng, Liu Zhenyu, Pei Ning, Xu College of Computer and Data Science Fuzhou University Fuzhou350116 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China School of Information Engineering Wuhan University of Technology Wuhan430070 China

Global routing is a crucial step in VLSI physical design. To address the problems that the low utilization rate of capacity and easy to fall into local optimum in the existing global routing algorithms, a high-quality global routing algorithm based on multi-stage optimization is proposed. First, the virtual capacity dynamic adjustment strategy is introduced in the pre-connection stage and the routing reorganization stage to improve the utilization rate of capacity. Then, in the routing reorganization stage, the routing subarea adaptive expansion strategy is proposed to narrow the search space and improve the routing efficiency. Finally, the A* algorithm heuristic search is combined with the global search capability of the particle swarm algorithm to avoid the algorithm to choose the shortest path in the routing process, and thus avoid the algorithm to fall into the local optimum. Experimental results comparing with existing global routing algorithms on ISPD benchmark circuits show that the routing results of proposed algorithm reduce the wirelength by 6.0% to 22.8%. © 2024 institute of computing Technology. All rights reserved.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees

Expressive Completeness of Two-Variable First-Order Logic wi...

引用

Annual Symposium on Logic in Computer science

作者： Jelle Hellings Marc Gyssens Jan Van Den Bussche Dirk Van Gucht Department of Computing and Software McMaster University Hamilton Canada Data Science Institute Hasselt University Diepenbeek Belgium Luddy School of Informatics Computing and Engineering Indiana University Bloomington IN USA

We consider the class of finite, rooted, unranked, unordered, node-labeled trees. Such trees are represented as structures with only the parent-child relation, in addition to any number of unary predicates for node labels. We prove that every unary first-order query over the considered class of trees is already expressible in two-variable first-order logic with counting. Somewhat to our surprise, we have not seen this result being conjectured in the extensive literature on logics for trees. Our proof is based on a global variant of local equivalence notions on nodes of trees. This variant applies to entire trees, and involves counting ancestors of locally equivalent nodes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：