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

Continuity Scaling: A Rigorous Framework for Detecting and Quantifying Causality Accurately

research 2022年第4期2022卷 137-146页

作者： Xiong Ying Si-Yang Leng Huan-Fei MaD Qing Nie Ying-Cheng Lai Wei Lin School of Mathematical Sciences SCMSand SCAMFudan UniversityShanghai 200433China Research Institute for Inteligent Complex Systems CCSBand LCNBIFudan UniversityShanghai 200433China State Key Laboratory of Medical Neurobiology and MOE Frontiers Center for Brain Science Institutes of Brain ScienceFudan UniversityShanghai 200032China Institute of AI and Robotics Academy for Engineering and TechnologyFudan UniversityShanghai 200433China School of Mathematical Sciences Soochow UniversitySuzhou 215006China Department of Mathematics Department of Developmental and Cll BiologyAnd NSF-Simons Center for Multiscale Cell Fate ResearchUniversity of CaliforniaIrvineCA 92697-3875USA School of Electrical ComputerAnd Energy EngineeringArizona State UniversityTempeArizona 85287-5706USA Shanghai Artificial Intelligence Laboratory Shanghai 200232China

Data-based detection and quantification of causation in complex,nonlinear dynamical systems is of paramount importance to science,engineering,and *** by the widely used methodology in recent years,the cross-map-based techniques,we develop a general framework to advance towards a comprehensive understanding of dynamical causal mechanisms,which is consistent with the natural interpretation of *** particular,instead of measuring the smoothness of the cross-map as conventionally implemented,we define causation through measuring the scaling law for the continuity of the investigated dynamical system *** uncovered scaling law enables accurate,reliable,and eficient detection of causation and assessment of its strength in general complex dynamical systems,outperforming those existing representative *** continuity scaling-based framework is rigorously established and demonstrated using datasets from model complex systems and the real world.

关键词： dynamical scaling continuity

来源：评论

学校读者我要写书评

暂无评论

Correction to: A Systematic Survey on Implementation of Fuzzy Regression Models for Real Life Applications (Archives of Computational Methods in engineering, (2024), 31, 1, (291-311), 10.1007/s11831-023-09978-x)

引用

Archives of Computational Methods in engineering 2024年 1-1页

作者： Khan, Mufala Kumar, Rakesh Aledaily, Arwa N. Kariri, Elham Viriyasitavat, Wattana Yadav, Kusum Dhiman, Gaurav Kaur, Amandeep Sharma, Ashutosh Vimal, S. Department of Mathematics Lovely Professional University Punjab Phagwara144411 India Department of Computer Science Government Bikram College of Commerce Punjab Patiala147001 India College of Computer Science and Engineering University of Ha’il Hail Saudi Arabia College of Computer Science and Engineering Prince Sattam Bin Abdulaziz University Al-Kharj Saudi Arabia Business Information Technology Division Department of Statistics Faculty of Commerce and Accountancy Chulalongkorn University Bangkok Thailand Department of Electrical and Computer Engineering Lebanese American University Byblos Lebanon University Centre for Research and Development Department of Computer Science and Engineering Chandigarh University Gharuan Mohali140413 India Department of Computer Science and Engineering Graphic Era Deemed to be University Dehradun248002 India Division of Research and Development Lovely Professional University Phagwara India Chitkara University Institute of Engineering and Technology Chitkara University Punjab Rajpura India School of Computer Science University of Petroleum and Energy Studies Dehradun India Department of Artificial Intelligence and Data Science Ramco Institute of Technology Tamil Nadu Rajaplayam India

Typesetter overlooked corrections regarding affiliations of author Rakesh Kumar and needs to be correctly read as only affiliated to: Department of mathematics, Lovely Professional University, Phagwara, Punjab 144411, India. The original article has been corrected. © The Author(s) under exclusive licence to International center for Numerical Methods in engineering (CIMNE) 2024.

关键词：

来源：评论

学校读者我要写书评

暂无评论

How graph neural networks learn: lessons from training dynamics 24

How graph neural networks learn: lessons from training dynam...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Chenxiao Yang Qitian Wu David Wipf Ruoyu Sun Junchi Yan School of Artificial Intelligence & Department of Computer Science and Engineering & MoE Lab of AI Shanghai Jiao Tong University Amazon Web Services School of Data Science The Chinese University of Hong Kong Shenzhen and Shenzhen International Center for Industrial and Applied Mathematics Shenzhen Research Institute of Big Data

A long-standing goal in deep learning has been to characterize the learning behavior of black-box models in a more interpretable manner. For graph neural networks (GNNs), considerable advances have been made in formalizing what functions they can represent, but whether GNNs will learn desired functions during the optimization process remains less clear. To fill this gap, we study their training dynamics in function space. In particular, we find that the gradient descent optimization of GNNs implicitly leverages the graph structure to update the learned function, as can be quantified by a phenomenon which we call kernel-graph alignment. We provide theoretical explanations for the emergence of this phenomenon in the overparameterized regime and empirically validate it on real-world GNNs. This finding offers new interpretable insights into when and why the learned GNN functions generalize, highlighting their limitations in heterophilic graphs. Practically, we propose a parameter-free algorithm that directly uses a sparse matrix (i.e. graph adjacency) to update the learned function. We demonstrate that this embarrassingly simple approach can be as effective as GNNs while being orders-of-magnitude faster.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using Z3 to Verify Inferences in Fragments of Linear Logic

arXiv

引用

arXiv 2023年

作者： Docef, Alen Negulescu, Radu Prunescu, Mihai Department of Electrical and Computer Engineering Virginia Commonwealth University RichmondVA United States Research Center for Logic Optimization and Security Faculty of Mathematics and Computer Science University of Bucharest Bucharest Romania Simion Stoilow Institute of Mathematics Romanian Academy Bucharest Romania

Linear logic is a substructural logic proposed as a refinement of classical and intuitionistic logics, with applications in programming languages, game semantics, and quantum physics. We present a template for Gentzen-style linear logic sequents that supports verification of logic inference rules using automatic theorem proving. Specifically, we use the Z3 Theorem Prover [8] to check targeted inference rules based on a set of inference rules that are presumed to be valid. To demonstrate the approach, we apply it to validate several derived inference rules for two different fragments of linear logic: MLL+Mix (Multiplicative Linear Logic extended with a Mix rule) and MILL (Multiplicative Intuitionistic Linear Logic). © 2023, CC BY.

关键词： Linear algebra

来源：评论

学校读者我要写书评

暂无评论

PFV2: Packet fragmentation with variable size and vigorous mapping in time-sensitive networking

引用

Journal of Systems Architecture 2025年 166卷

作者： Yan, Wenyan Fu, Bin Wei, Dongsheng Li, Renfa Lei, Yixue Jia, Yuhang Xie, Guoqi Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan University Hunan Changsha410082 China Center for Convergence of Automobile and Cyberspace Research Institute of Hunan University in Chongqing Chongqing401120 China Future Network Laboratory Tencent Beijing100080 China Hunan Engineering Research Center of Advanced Embedded Computing and Intelligent Medical Systems School of Computer and Artificial Intelligence Xiangnan University Hunan Chenzhou423000 China

With the rapid advancement of intelligent automobiles, the ever-growing communication data put forward high bandwidth and low latency requirements. To meet these requirements, automotive Original Equipment Manufacturers (OEMs) widely adopt domain-centralized Electrical/Electronic (E/E) architecture. In this architecture, Time-Sensitive Networking (TSN) is expected to serve as the backbone network because of its high bandwidth and deterministic communication. TSN uses the Gate Control List (GCL) to divide its time length into multiple time slots, and the time intervals of these time slots are non-uniform (equal or unequal). Different flows have varying requirements for time slot sizes. To enhance the acceptance ratio of Time-Triggered (TT) flows through GCL time slot allocation, packet fragmentation (i.e., flow fragmentation) is introduced into TSN in the recent study. The state-of-the-art packet fragmentation solution divides one un-schedulable TT flow into multiple equal-sized packets (i.e., equal-sized time slots). In other words, these fixed-size packets are difficult to be mapped into the time slots with different sizes. This study develops a Packet Fragmentation with Variable-size and Vigorous-mapping (PFV2) technique based on the following three innovations: (1) we implement variable-size packet fragmentation, which iteratively divides the un-schedulable TT flow into smaller packets and then dynamically reschedules these packets;(2) we implement the vigorous mapping solution from packets to time slots by deeply searching for available time slots within the flow's deadline;and (3) we verify PFV2 based on the LS1028A with Cortex-A72 (i.e., the NXP automotive-grade development board). PFV2 improves the acceptance ratio by up to 20.18% and bandwidth utilization by up to 7.024% compared with the state-of-the-art solution. The theoretical and practical co-verification experiments demonstrate that the PFV2 can effectively improve the flow acceptance ratio and outperf

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Quantum Linear System Solvers: A Survey of Algorithms and Applications

arXiv

引用

arXiv 2024年

作者： Morales, Mauro E.S. Pira, Lirandë Schleich, Philipp Koor, Kelvin Costa, Pedro C.S. An, Dong Aspuru-Guzik, Alán Lin, Lin Rebentrost, Patrick Berry, Dominic W. Joint Center for Quantum Information and Computer Science University of Maryland United States Centre for Quantum Software and Information University of Technology Sydney Australia Centre for Quantum Technologies National University of Singapore Singapore Department of Computer Science University of Toronto Canada Vector Institute for Artificial Intelligence Toronto Canada ContinoQuantum Sydney Australia Beijing International Center for Mathematical Research Peking University Beijing China Department of Chemistry University of Toronto Canada Canadian Institute for Advanced Research Toronto Canada Acceleration Consortium Toronto Canada Department of Chemical Engineering & Applied Chemistry University of Toronto Toronto Canada Department of Materials Science & Engineering University of Toronto Toronto Canada Lebovic Fellow Canadian Institute for Advanced Research Toronto Canada Department of Mathematics University of California Berkeley United States Applied Mathematics and Computational Research Division Lawrence Berkeley National Laboratory Berkeley United States Department of Computer Science National University of Singapore Singapore School of Mathematical and Physical Sciences Macquarie University Sydney Australia

Solving linear systems of equations plays a fundamental role in numerous computational problems from different fields of science. The widespread use of numerical methods to solve these systems motivates investigating the feasibility of solving linear systems problems using quantum computers. In this work, we provide a survey of the main advances in quantum linear systems algorithms, together with some applications. We summarize and analyze the main ideas behind some of the algorithms for the quantum linear systems problem in the literature. The analysis begins by examining the Harrow-Hassidim-Lloyd (HHL) solver. We note its limitations and reliance on computationally expensive quantum methods, then highlight subsequent research efforts which aimed to address these limitations and optimize runtime efficiency and precision via various paradigms. We focus in particular on the post-HHL enhancements which have paved the way towards optimal lower bounds with respect to error tolerance and condition number. By doing so, we propose a taxonomy that categorizes these studies. Furthermore, by contextualizing these developments within the broader landscape of quantum computing, we explore the foundational work that have inspired and informed their development, as well as subsequent refinements. Finally, we discuss the potential applications of these algorithms in differential equations, quantum machine learning, and many-body physics. © 2024, CC BY.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Trust Online Over-the-air Computation for Wireless Federated Learning

引用

IEEE Transactions on Mobile Computing 2025年

作者： Sun, Mingjie Zheng, Jie Du, Hongyang Zhang, Haijun Niyato, Dusit Kang, Jiawen Wang, Jiacheng Ren, Jie Gao, Ling Wang, Zheng Northwest University State-Province Joint Engineering and Research Center of Advanced Networking and Intelligent Information Services School of Information Science and Technology Shaanxi Xian710127 China University of Hong Kong department of electrical and electronic engineering Hong Kong University of Science and Technology Beijing Institute of Artificial Intelligence Beijing100083 China Nanyang Technological University School of Computer Science and Engineering 639798 Singapore Guangdong University of Technology Automation of School Guangzhou510006 China Shaanxi Normal University School of Computer Science Xi'an710062 China University of Leeds School of Computing LS2 9JT United Kingdom

Using the wireless waveform superposition property, over-the-air computation (OAC) enables federated learning (FL) to achieve fast model aggregation. However, this computing paradigm is vulnerable to poisoning attacks due to the openness of a wireless channel over time, where malicious mobile devices can introduce cumulative errors for the global FL model in a time-varying wireless environment for each communication round. This article presents a trust online OAC (TO-OAC) scheme to minimize impacts on the global model introduced by malicious devices adjusting to dynamic attack and wireless channel fluctuations over time. TO-OAC achieves this by utilizing trustworthy security quantification of OAC for each FL training round. To optimize the cumulative training loss at the aggregation node with the long-term power and trust constraints of mobile devices, we propose a joint trust, power, and channel-aware algorithm to flexibly update local and global models in response to the dynamic changes in the wireless and secure environment. We analyze the performance limits for the aggregation of trust models, considering metrics for computation and communication through time. We then propose another trust online regularization over-the-air computation (TOR-OAC) as an improved version of the TO-OAC scheme to decrease convergence time while ensuring long-term trust and power limitation. Experimental results performed on real-life datasets show that the two proposed schemes (TO-OAC and TOR-OAC) outperform prior works, especially in noisy, time-varying wireless channels and malicious attacks. 2002-2012 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Minimal Ternary Linear Codes from Vectorial Functions

arXiv

引用

arXiv 2024年

作者： Li, Yanjun Kan, Haibin Liu, Fangfang Peng, Jie Zheng, Lijing Zhuo, Zepeng Institute of Statistics and Applied Mathematics Anhui University of Finance and Economics Anhui Bengbu233030 China School of Computer Sciences Fudan University Shanghai200433 China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai Engineering Research Center of Blockchain Shanghai Institute for Advanced Communication and Data Science Shanghai200433 China School of Mathematics and Statistics Huaibei Normal University Anhui Huaibei235000 China Mathematics and Science College Shanghai Normal University Guilin Road #100 Shanghai200234 China The School of Mathematics and Physics University of South China Hunan Hengyang421001 China

The study on minimal linear codes has received great attention due to their significant applications in secret sharing schemes and secure two-party computation. Until now, numerous minimal linear codes have been discovered. However, to the best of our knowledge, no infinite family of minimal ternary linear codes was found from vectorial functions. In this paper, we present a necessary and sufficient condition for a large class of ternary linear codes from vectorial functions such that those codes are minimal. Based on that, we construct several minimal ternary linear codes with three-weight from vectorial regular plateaued functions, and determine their weight distributions. Moreover, we also give a necessary and sufficient condition for a large family of ternary linear codes from vectorial functions such that the codes are minimal and violate the AB condition simultaneously. According to this characterization, we find several minimal ternary linear codes violating the AB condition. Notably, our results show that our method can be applied to solve a problem on minimal linear codes proposed by Li et al. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Development of a deep learning system for preventive detection of heart failure due to pulmonary disease

Development of a deep learning system for preventive detecti...

引用

International Conference on Software Process Improvement (CIMPS)

作者： Axel Frederick Félix Jiménez Isaul Ibarra Belmonte Vania Stephany Sánchez Lee Uziel Jaramillo Avila Ezra Federico Parra González Computer Systems Engineering National Polytechnic Institute Zacatecas México Software Engineer Center for Research in Mathematics Zacatecas Zacatecas México Computer Science Department Center for Research in Mathematics Zacatecas Zacatecas México

ISBN: (纸本)9798350398977

In the context of addressing the problem of people who do not undergo a diagnosis of heart failure due to pulmonary conditions on time, a solution to this problem would allow early preventive detection to avoid the development of severe disease efficiently. Our approach employs the use of medical data retrieved from the user to determine and predict whether there is a likelihood of a potential condition. To solve this problem, according to a users medical measurement history, a deep learning model can be implemented to determine a preventive diagnosis or otherwise to follow up on an already detected condition. By posing the problem as a classification task, it can be taken advantage of a deep learning model focused on heart failure or pulmonary conditions to make a preliminary diagnosis and determine if there are signs of any symptomatology.

关键词： Cardiovascular diseases Diseases Deep learning Medical diagnostic imaging Lung Prediction algorithms Medical services

来源：评论

学校读者我要写书评

暂无评论

Fast and Scalable Gate-Level Simulation in Massively Parallel Systems

Fast and Scalable Gate-Level Simulation in Massively Paralle...

引用

IEEE International Conference on computer-Aided Design

作者： Haichuan Hu Zichen Xu Yuhao Wang Fangming Liu Services Computing Technology and System Lab Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Mathematics and Computer Science Nanchang University Nanchang China Pengcheng Laboratory Shenzhen China

The natural bijection between a proposed circuit design and its graph representation shall allow any graph optimization algorithm deploying into many-core systems efficiently. However, this process suffers from the exponentially growing overhead and heavy memory footprint with the signal propagation. To conquer the unique challenge, we systematically study the simulation with millions of gates, and identify that the processing complexity could grow exponentially from the signal inputs, the skewness of the computational graph stays. Thus, we present ZhouBi, a fast and scalable gate-level simulation framework to fully exploit the parallelism from many-core systems. ZhouBi contributes in threefolds, (I) a graph representation that colors gate-level netlists and identifies skew partitions based on the graph skewness; (II) A set of heuristic algorithms that picks opportunistic and conservative algorithms to accelerate the simulation; (III) A system facility that supports selective mapping between simulation and many-core, providing a tradeoff between the risk of concurrent simulation fail and performance gain. We have prototyped ZhouBi and evaluated it with practical baselines. ZhouBi can achieve a 27.6× performance gain, as compared to the state-of-the-practice Veriwell without compromising any correctness. Our framework supports large graphs enabling scale-out gate-level simulations for chip design.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：