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

17th IEEE International Conference on computer Research and Development, ICCRD 2025

作者： Zhou, Hui Wang, Xiaofeng Xie, Yujia Cao, Yongxiang Tang, Yu Huo, Yongchun Wen, Huan Zhao, Xiongbo Li, Chaoran National Key Laboratory of Science and Technology on Aerospace Intelligent Control Beijing Aerospace Automatic Control Institute Beijing China Beihang University Computer Science and Engineering Beijing China Beihang University National Superior College for Engineers Beijing China

ISBN: (纸本)9798331531881

The structure of the rocket-borne model is inherently complex, with processed images exhibiting high resolution and generating substantial amounts of data and calculations. Achieving robust real-Time computing on an embedded platform poses significant challenges due to strictly limited resources, power consumption constraints, and size limitations. Our review of rocket-borne applications reveals considerable variability in the design resources of different devices, indicating a need for expanded design approaches. Upon evaluating existing methods, we identified two primary drawbacks. First, certain operators within the high-resolution target detection model are difficult to parallelize, resulting in significant inference delays that hinder the ability to meet task requirements. Although existing methods have been extended, there remains significant potential for performance enhancement in core scheduling for poor acceleration. This paper proposes an optimized architecture for the target detection algorithm accelerator designed for high-resolution images, along with a novel highly parallel data pre-processing and post-processing module implemented on FPGA to address these issues. Compared to the ARM implementation, this architecture demonstrates an improved performance of 24.64x. Furthermore, to ensure flexible application across various rocket launch scenarios, we introduce an optimization structure for convolution, pooling, and fusion operators and a multi-core expansion optimization method. This approach yields a 1.29x improvement in computing unit utilization compared to state-of-The-Art multi-core scaling efforts. Finally, we assessed the accelerator architecture across multiple FPGA platforms, achieving a peak processing element utilization rate of 99.71% for a single core and layer. The overall computing efficiency, excluding the first layer, exceeded 90%. The peak computing power for the four cores reached 1638.4 GOPS, and the end-To-end computation time for

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Robust control and data reconstruction for nonlinear epidemiological models using feedback linearization and state estimation

引用

Mathematical Biosciences and Engineering 2025年第1期22卷 109-137页

作者： Csutak, Balázs Szederkényi, Gábor Faculty of Information Technology and Bionics Pázmány Péter Catholic University Práter u. 50/A BudapestH-1083 Hungary Systems and Control Laboratory HUN-REN Institute for Computer Science and Control Kende u. 13-17 BudapestH-1111 Hungary

It has been clearly demonstrated over the past years that control theory can provide an efficient framework for the solution of several complex tasks in epidemiology. In this paper, we present a computational approach for the state estimation based reference tracking control and historical data reconstruction using nonlinear compartmental epidemic models. The control model is given in nonlinear input-affine form, where the manipulable input is the disease transmission rate influenced by possible measures and restrictions, while the observed or computed output is the number of infected people. The control design is built around a simple SEIR model and relies on a feedback linearization technique. We examine and compare different control setups distinguished by the availability of state information, complementing the directly measurable data with an extended Kalman filter used for state estimation. To illustrate the capabilities and robustness of the proposed method, we carry out multiple case studies for output tracking and data reconstruction on Swedish and Hungarian data, all in the presence of serious model and parameter mismatch. Computation results show that a well-designed feedback, even in the presence of significant observation uncertainties, can sufficiently reduce the effect of modeling errors. © 2025 the Authors,

关键词： Feedback linearization

来源：评论

学校读者我要写书评

暂无评论

Secure-by-Construction Synthesis for control Systems

引用

IEEE Transactions on Automatic control 2025年第6期70卷 4170-4177页

作者： Zhong, Bingzhuo Liu, Siyuan Caccamo, Marco Zamani, Majid Thrust of Artificial Intelligence Information Hub The Thrust of Intelligent Transportation System Hub China KTH Royal Institute of Technology Division of Decision and Control Systems Stockholm Sweden Technical University of Munich TUM School of Engineering and Design Germany University of Colorado Boulder Department of Computer Science United States Ludwig Maximilian University Department of Computer Science Munich Germany

In this note, we present the synthesis of secure-by-construction controllers that address safety and security properties simultaneously in cyber-physical systems. Our focus is on studying a specific security property called opacity, which characterizes the system's ability to maintain plausible deniability of its secret behavior in the presence of an intruder. These controllers are synthesized based on a concept of so-called (augmented) control barrier functions. We propose conditions that facilitate the construction of the desired (augmented) control barrier functions and their corresponding secure-by-construction controllers. To compute these functions, we propose an iterative scheme that leverages iterative sum-of-square programming techniques. This approach enables efficient computation of these functions, particularly for polynomial systems. Finally, we validate the effectiveness of our results through a case study of a vehicle. © 1963-2012 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

TreeSwap: Data Augmentation for Machine Translation via Dependency Subtree Swapping

TreeSwap: Data Augmentation for Machine Translation via Depe...

引用

2023 International Conference Recent Advances in Natural Language Processing: Large Language Models for Natural Language Processing, RANLP 2023

作者： Nagy, Attila Lakatos, Dorina Barta, Botond Ács, Judit Department of Automation and Applied Informatics Budapest University of Technology and Economics Hungary Institute for Computer Science and Control Hungary

ISBN: (纸本)9789544520922

Data augmentation methods for neural machine translation are particularly useful when limited amount of training data is available, which is often the case when dealing with low-resource languages. We introduce a novel augmentation method, which generates new sentences by swapping objects and subjects across bisentences. This is performed simultaneously based on the dependency parse trees of the source and target sentences. We name this method TreeSwap. Our results show that TreeSwap achieves consistent improvements over baseline models in 4 language pairs in both directions on resource-constrained datasets. We also explore domain-specific corpora, but find that our method does not make significant improvements on law, medical and IT data. We report the scores of similar augmentation methods and find that TreeSwap performs comparably. We also analyze the generated sentences qualitatively and find that the augmentation produces a correct translation in most cases. Our code is available on Github1. © 2023 Incoma Ltd. All rights reserved.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Self-assembly Phenomenon Implementation Problems in Recurrent-Dynamic Architecture

Self-assembly Phenomenon Implementation Problems in Recurren...

引用

2023 Seminar on Information Computing and Processing, ICP 2023

作者： Khilko, Dmitry V. Stepchenkov, Yuri A. Orlov, Georgy A. Shikunov, Yury I. Institute of Informatics Problems Federal Research Center 'Computer Science and Control' of the Russian Academy of Sciences Moscow Russia

ISBN: (纸本)9798350369830

This paper covers the research of self-assembly phenomenon implementation problems within the recurrent-dynamic approach to the construction of computing architectures. The self-assembly phenomenon that occurs during the nanostructure formation process is approached in relation to the computing systems. An approach to implement the computational process based on this phenomenon has been previously proposed. The recurrent-dynamic approach has been developed as a step towards the implementation of the self-assembly phenomenon. Its main principles are self-sufficient data and recurrence, which are covered within the paper. Based on this approach the prototype of multi-core recurrent data-flow architecture has been developed and a description of its features is provided. An analysis of the existing method for implementing the self-assembly phenomenon within the architecture prototype is also presented. Self-assembly phenomenon implementation issues and their possible solutions are formulated. © 2023 IEEE.

关键词： Self assembly

来源：评论

学校读者我要写书评

暂无评论

ScDCMAC:adaptive feedback clustering of scRNA-seq data with deep gene correlation mining

ScDCMAC:adaptive feedback clustering of scRNA-seq data with ...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Pang, Shanchen Wang, Ruiqian Wu, Wenhao Li, Hengxiao Wu, Jiarui Zhang, Yuanyuan Wang, Shudong College of Computer Science and Technology Qingdao Institute of Software Qingdao China Qingdao University of Technology School of Information and Control Engineering Qingdao China

ISBN: (纸本)9798350386226

Cluster assignment is crucial for analyzing single-cell RNA sequencing (scRNA-seq) data, essential for studying cell diversity and biological functions at the single-cell level. Deep learning-based clustering methods have been extensively applied in scRNA-seq data analysis. However, current deep models frequently overlook the deep exploration of potential gene correlation, resulting in networks lacking guidance from gene correlation information when learning hidden layer features. This paper proposes an adaptive feedback fuzzy clustering method based on deep gene correlation mining(scDCMAC). The deep gene correlation mining network employs contrast learning to compute the contrast loss on two cell similarity matrices, constructed from denoised autoencoder hidden layer features and original input features, to uncover potential gene correlation. The adaptive feedback clustering network further denoises the hidden layer features using a self-attention mechanism, computes the affiliation matrix, and supervises the denoising autoencoder's dimensionality reduction using the affiliation matrix. Experiments on 13 real scRNA-seq datasets demonstrate that scDCMAC excels in clustering accuracy and stability, showing great potential in scRNA-seq sample analysis. © 2024 IEEE.

关键词： Dimensionality reduction

来源：评论

学校读者我要写书评

暂无评论

Learning in Memristive Electrical Circuits 63

Learning in Memristive Electrical Circuits

引用

63rd IEEE Conference on Decision and control, CDC 2024

作者： Heidema, H.M. Van Waarde, H.J. Besselink, B. Bernoulli Institute for Mathematics Computer Science and Artificial Intelligence University of Groningen Jan C. Willems Center for Systems and Control Netherlands Netherlands

ISBN: (纸本)9798350316339

Memristors are nonlinear two-terminal circuit elements whose resistance at a given time depends on past electrical stimuli. Recently, networks of memristors have received attention in neuromorphic computing since they can be used as a tool to perform linear algebraic operations, like matrix-vector multiplication, directly in hardware. In this paper, the aim is to resolve two fundamental questions pertaining to a specific, but relevant, class of memristive circuits called crossbar arrays. In particular, we show (1) how the resistance values of the memristors at a given time can be determined from external (voltage and current) measurements, and (2) how the resistances can be steered to desired values by applying suitable external voltages to the network. The results will be applied to solve a prototypical learning problem, namely linear least squares, by applying and measuring voltages and currents in a suitable memristive circuit. © 2024 IEEE.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Slow Convergence of Interacting Kalman Filters in Word-of-Mouth Social Learning 60

Slow Convergence of Interacting Kalman Filters in Word-of-Mo...

引用

60th Annual Allerton Conference on Communication, control, and Computing, Allerton 2024

作者： Krishnamurthy, Vikram Rojas, Cristian R. School of Electrical and Computer Engineering Cornell University United States School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Division of Decision and Control Systems Stockholm Sweden

ISBN: (纸本)9798331541033

We consider word-of-mouth social learning involving m Kalman filter agents that operate sequentially. The first Kalman filter receives the raw observations, while each subsequent Kalman filter receives a noisy measurement of the conditional mean of the previous Kalman filter. The prior is updated by the m-th Kalman filter. When m=2, and the observations are noisy measurements of a Gaussian random variable, the covariance goes to zero as k-1/3 for 7kappa;observations, instead of O(k-1) in the standard Kalman filter. In this paper we prove that for m agents, the covariance decreases to zero as k-(2m-1), i.e, the learning slows down exponentially with the number of agents. We also show that by artificially weighing the prior at each time, the learning rate can be made optimal as k-1. The implication is that in word-of-mouth social learning, artificially re-weighing the prior can yield the optimal learning rate. © 2024 IEEE.

关键词： Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Diversity and Freshness-Aware Regret Minimizing Set Queries 29th

Diversity and Freshness-Aware Regret Minimizing Set Queries

引用

29th International Computing and Combinatorics Conference, COCOON 2023

作者： Guo, Hongjie Li, Jianzhong Shen, Fangyao Gao, Hong Faculty of Computing Harbin Institute of Technology Heilongjiang Harbin China School of Computer Science and Technology Zhejiang Normal University Zhejiang Jinhua China Faculty of Computer Science and Control Engineering Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China

ISBN: (纸本)9783031491924

Multi-criteria decision-making often involves selecting a small representative set from a database. A recently proposed method is the regret minimization set (RMS) queries. It aims to rectify the shortcomings of needing a utility function in top-k queries and the overly large result size of skyline queries. However, the existing definition of RMS only ensures one result under any utility function, and do not consider the diversity and freshness of the returned results. In this paper, we define a strong regret set, which guarantees the utility value error of k data points under any utility function. Given this new definition, we propose two problems, namely the Minimum Size problem and the Max-sum Diversity and Freshness problem. Both proposed problems have been proven to be NP-hard. Correspondingly, we devise approximation algorithms for them, and analyze algorithms’ time complexities and the approximation ratios of the solutions obtained. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

IEARACDA: Predicting circRNA-disease associations based on information enhancement and arctangent rank approximation

IEARACDA: Predicting circRNA-disease associations based on i...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Pang, Shanchen Song, Zheqi Liu, Tiyao Wu, Wenhao Zhang, Yuanyuan Wang, Shudong College of Computer Science and Technology Qingdao Institute of Software Qingdao China Qingdao University of Technology School of Information and Control Engineering Qingdao China

ISBN: (纸本)9798350386226

Circular RNAs (circRNAs) are non-coding RNA molecules that play a significant role in cell regulation and disease occurrence. In recent years, the use of computational methods to predict circRNAs associated with diseases has become a research focus. However, these methods are often constrained by the noise interference and an insufficient exploration of the underlying information in known associations. Therefore, this paper proposes an information enhancement and arctangent rank approximation based method to predict potential circRNA-disease associations (IEARACDA). Firstly, information enhancement methods are used to make circRNA and disease similarity information more complete and to reduce the sparsity of known association. Subsequently, the arctangent rank approximation method is employed to mitigate the potential bias issues that may arise from the nuclear norm, and optimization is carried out using the inexact augmented Lagrange multiplier (IALM) method. Finally, potential associations are predicted through heterogeneous graph inference method. The experimental results demonstrate that IEARACDA exhibits superior performance compared to existing methods. Furthermore, case studies for hepatocellular carcinoma and lung cancer provide additional confirmation of the accuracy and practical significance of the model predictions. © 2024 IEEE.

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：