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

An improved verification algorithm for nonlinear systems of equations based on Krawczyk operator

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2019年 359卷 145-152页

作者： Hou, Guoliang Zhang, Shugong Jilin Univ Sch Math Changchun 130012 Jilin Peoples R China Jilin Univ Minist Educ Key Lab Symbol Computat & Knowledge Engn Changchun 130012 Jilin Peoples R China Changchun Normal Univ Sch Math Changchun 130032 Jilin Peoples R China

In this paper an improved version of a verification algorithm for solving nonlinear systems of equations based on Krawczyk operator is presented. Compared with the original algorithm, the improved verification algorithm not only saves computing time, but also computes a narrower (or at least the same) inclusion of the solution to nonlinear systems of equations for certain classes of problems. Numerical results demonstrate the performance of the proposed algorithms. (C) 2019 Elsevier B.V. All rights reserved.

关键词： verification algorithm Krawczyk operator Nonlinear system INTLAB

来源：评论

学校读者我要写书评

暂无评论

A verification algorithm for the Automatic Topology Discovery of the Adaptive Avionics Platform 37

A Verification Algorithm for the Automatic Topology Discover...

引用

IEEE/AIAA 37th Digital Avionics Systems Conference (DASC)

作者： Schulz, Bernd Annighoefer, Bjoern Univ Stuttgart Inst Luftfahrtsyst Stuttgart Germany

ISBN: (纸本)9781538641125

This paper introduces the concept, development and realisation of a topology verification algorithm for the autonomous topology discovery mechanism of the Adaptive Avionics Platform (AAP). The AAP is a fault-tolerant and self-configuring general-purpose avionics platform. An AAP instance is built from a set of generic hard-and software components, which can be combined to avionic systems of arbitrary extent, similar to Integrated Modular Avionics. It configures automatically during an organisation phase, based on information received through the topology discovery step. During this topology discovery, the topology of hardware components and physical connections is detected. Since the organisation phase is conducted without human interaction, errors during the topology discovery could solely be detected manually after the completion of the organisation phase. The objective of the topology verification algorithm is to verify discovered system topologies against expected topologies. This additional verification step guarantees an exact match of composed real-world system architectures with expected target architectures. In case of topology deviations, they are visualised as well as tracked to their respective error sources. Moreover, the verification algorithm shall enable the possibility to run automatic verification scenarios for a variety of different system topologies for automatic validation of the topology discovery mechanism. The implementation of the topology verification algorithm on an Adaptive Cabin Management System demonstrator shows that it is able to reliably evaluate if an auto-detected topology is congruent to an expected topology and provide a distinct method for the verification of the AAP.

关键词： adaptive avionics verification algorithm topology discovery self-configuration model-based autonomic computing

来源：评论

学校读者我要写书评

暂无评论

Compliance verification algorithm for Computer Systems Security Policies 7th

Compliance Verification Algorithm for Computer Systems Secur...

引用

7th International MCETECH Conference on E-Technologies

作者： Pene, Liviu Hamza, Lamia Adi, Kamel Univ Quebec Outaouais Comp Secur Res Lab Gatineau PQ Canada Univ Bejaia Lab Informat Med Bejaia Algeria

ISBN: (纸本)9783319590417;9783319590400

This paper proposes an algebraic formalism and a dedicated logic for computer systems and security policies specifications. A tableau-based proof system is then developed for assessing whether policies are satisfied for a given model of a computer system. A practical example and an implementation within a theorem prover show the effectiveness of our specification and verification technique.

关键词： Computer security Formal methods Process algebra Modal logic Security policy verification algorithm Tableau-based proof Theorem prover

来源：评论

学校读者我要写书评

暂无评论

A GLONASS Navigation Data verification algorithm Under High Bit-error Rates 1

引用

6th China Satellite Navigation Conference (CSNC)

作者： Hu, Jian Rao, Aishui Zhang, Long Sun, Yimei Satellite Maritime Tracking & Control Dept China Jiangyin 214431 Peoples R China

ISBN: (数字)9783662466384

ISBN: (纸本)9783662466384;9783662466377

This paper analyzes some GLONASS abnormal data of receiver software processing, and locates the source of the problem in navigation data handling error under high bit-error rates. Through the derivation of the Hamming check method, limitations of the method and mistakes in the interface document were pointed out. This paper proposes a navigation data verification algorithm under high bit-error rates.

关键词： GLONASS High bit-error rate Navigation data verification algorithm

来源：评论

学校读者我要写书评

暂无评论

Study on verification of Slope Angle Recognition algorithm based on Vehicle Speed 36

Study on Verification of Slope Angle Recognition Algorithm b...

引用

36th Chinese Control and Decision Conference (CCDC)

作者： Gu, Mingqi Gao, Yang Han, Lele Li, Hongmei Xuan, Feng Liu, Jun Zhejiang Remote Commercial Vehicle Res & Dev Co L Elect Control Dev Dept Hangzhou Peoples R China Ningbo Geely Royal Engine Components Co Ltd Transmiss & Elect Drive Control Dept Ningbo Peoples R China Zhejiang Remote Commercial Vehicle Res & Dev Co L Technol & Project Management Dept Hangzhou Peoples R China

ISBN: (纸本)9798350387780;9798350387797

In this paper, a verification algorithm for the vehicle slope angle recognition is studied. The actual slope signal is extracted from the longitudinal acceleration and the actual vehicle speed of the three-coordinate acceleration sensor. The problem that the longitudinal acceleration signal of the three-coordinate acceleration sensor includes both the actual slope and the vehicle acceleration information is solved. The longitudinal acceleration of the sensor is subtracted from the acceleration calculated from the actual vehicle speed to obtain the actual slope angle. In order to engineering the algorithm, two Kalman filters arc added to optimize the algorithm, and filter the longitudinal comprehensive value and the calculated slope angle measured by the three-coordinate acceleration sensor. The method is suitable for different vehicle load, speed, actual acceleration, wind resistance and braking torque. Based on Simulink simulation environment, four kinds of working conditions were simulated respectively. The vehicle load variation condition based on dynamics algorithm;The vehicle speed variation condition based on dynamic algorithm;The condition that the acceleration signal is increased step by step, and then reduced step by step, based on the optimization algorithm;Based on the optimization algorithm, the vehicle speed is increased from a standstill and then reduced in the uphill condition. The simulation results show that the effectiveness of the proposed verification algorithm based on the longitudinal acceleration and vehicle speed signals of the three coordinate acceleration sensor. And it is obviously better than that of the slope angle calculated by the dynamic algorithm.

关键词： Slope Angle Three Coordinate Acceleration Sensor Vehicle Engineering verification algorithm

来源：评论

学校读者我要写书评

暂无评论

A GLONASS Navigation Data verification algorithm under

A GLONASS Navigation Data Verification Algorithm under

引用

第六届中国卫星导航学术年会

作者： Jian Hu AishuiRao Long Zhang YimeiSun Satellite Maritime Tracking and Control Department of China Jiangyin 214431China

This paper analyzes some GLONASS abnormal data of receiver software processing,and locates the source of the problem in navigation data handling error under high bit-error *** the derivation of the Hamming check method,limitations of the method and mistakes in the interface document were pointed *** paper proposes a navigation data verification algorithm under high bit-error rates.

关键词： GLONASS High bit-error rate Navigation data verification algorithm

来源：评论

学校读者我要写书评

暂无评论

Polynomial modular product verification and its implications

引用

JOURNAL OF SYMBOLIC COMPUTATION 2023年 116卷 98-129页

作者： Giorgi, Pascal Grenet, Bruno du Cray, Armelle Perret Univ Montpellier LIRMM CNRS Montpellier France

Polynomial multiplication is known to have quasi-linear complexity in both the dense and the sparse cases. Yet no truly linear algorithm has been given in any case for the problem, and it is not clear whether it is even possible. This leaves room for a better algorithm for the simpler problem of verifying a polynomial product. While finding deterministic methods seems out of reach, there exist probabilistic algorithms for the problem that are optimal in number of algebraic operations. We study the generalization of the problem to the verification of a polynomial product modulo a sparse divisor. We investigate its bit complexity for both dense and sparse multiplicands. In particular, we are able to show the primacy of the verification over modular multiplication when the divisor has a constant sparsity and a second highest-degree monomial that is not too large. We use these results to obtain new bounds on the bit complexity of the standard polynomial multiplication verification. In particular, we provide optimal algorithms in the bit complexity model in the dense case by improving a result of Kaminski and develop the first quasi-optimal algorithm for verifying sparse polynomial product. (C) 2022 Published by Elsevier Ltd.

关键词： Polynomial multiplication Modular multiplication verification algorithm Dense and sparse polynomials Bit complexity

来源：评论

学校读者我要写书评

暂无评论

Cost Efficient Flip-Flop Designs With Multiple-Node Upset-Tolerance and algorithm-Based verifications

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2025年第1期44卷 390-394页

作者： Yan, Aibin He, Yuting Huang, Zhengfeng Yan, Wenjie Cui, Jie Wang, Xiaolei Ni, Tianming Girard, Patrick Wen, Xiaoqing Anhui Univ Sch Comp Sci & Technol Hefei 230601 Peoples R China Anhui Univ Sch Comp Hefei 230601 Peoples R China Hefei Univ Technol Sch Microelect Hefei 230601 Peoples R China Anhui Polytech Univ Sch Integrated Circuits Wuhu 241000 Peoples R China Univ Montpellier Robot & Microelect Montpellier CNRS Lab Informat F-34095 Montpellier France Networks Kyushu Inst Technol Dept Comp Sci Fukuoka 8208502 Japan

This article presents radiation-hardened flip-flop (FF) designs capable of tolerating soft errors, e.g., single-node upsets (SNUs), double-node upsets (DNUs) and multiple-node upsets (MNUs). First, a 2-input FF and a 3-input FF are proposed as the baseline FFs that not only, respectively, tolerate SNUs and DNUs but also exhibit cost efficiency in terms of delay, power, and area. Through adding two stages of c-elements, a 4-input FF and a 5-input FF are proposed as the baseline FFs as well. Utilizing the structural characteristics of these FFs, an N-1 input FF and an N input FF are proposed as the extended FFs capable of tolerating more node upsets. Moreover, a highly efficient algorithm for verifying MNU-tolerance of these FFs is proposed. algorithm and HSPICE-tool-based verification results both demonstrate the MNU-tolerance for the proposed FFs with more inputs.

关键词： Latches Flip-flops Integrated circuits Design automation Layout Costs Nickel C-element (CE) flip-flop (FF) multiple-node-upset radiation hardness verification algorithm

来源：评论

学校读者我要写书评

暂无评论

Admissible Control Laws for Constrained Linear Power Flow: The General Case

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2024年第1期39卷 658-670页

作者： Mora, Edwin Steinke, Florian Tech Univ Darmstadt Energy Informat Networks & Syst Lab D-64183 Darmstadt Germany

Linearized power flow with line flow and voltage constraints can be modeled as a system of linear inequalities depending on the power injections. When some injections are controlled by the grid operator while others are determined exogenously, robust control aims at determining grid operator's actions under imperfect system observability such that the grid state is feasible for all possible realizations of the exogenous actions. It was shown how to design and analyze such admissible control policies efficiently for the subclass of affine control laws, but this paper shows that there are important cases that require more general control policies. We show that, for the constrained linear power flow setting, general admissible control policies can always be chosen as piecewise affine (PWA) mappings. The PWA mapping can be explicitly characterized offline or control actions can be computed online by solving an optimization problem given a current observation. For the latter setup, we provide an algorithm that verifies offline that the online control scheme is admissible. This verification step is a crucial precondition to apply the online control scheme in real, safety-critical power grids. The proposed framework is demonstrated with applications to voltage regulation in active distribution grids subject to uncertain prosumers and low observability.

关键词： Admissible control law imperfect observability multiparametric programming robust power flow verification algorithm

来源：评论

学校读者我要写书评

暂无评论

Method for Complexing Information from Intelligent Sensors of Mobile Components of Monitoring Systems 13th

Method for Complexing Information from Intelligent Sensors o...

引用

13th Computer Science Online Conference

作者： Melnik, E. V. Orda-Zhigulina, M. V. Safronenkova, I. B. Kapustyan, S. G. Rodina, A. A. Puha, I. S. Russian Acad Sci Southern Sci Ctr St Chehova 41 Rostov Na Donu 344006 Russia

ISBN: (纸本)9783031705946;9783031705953

It is proposed in the work a method for integrating information from smart sensors of mobile components of monitoring systems based on distributed ledger technologies, "fog" and "cloud" computing. The method combines a developed method for recording user data into a distributed key-value database at the level of a distributed functional application DApp and a modified method for dynamically changing consensus and a modified method for validation of block's in open distributed decentralized systems with unreliable information. The developed method provides high write speed and increases the reliability of storing user data by dynamically changing the volume of transactions when writing useful data to the registry and dynamically taking into account the network configuration features when writing data to the registry. The use of the proposed method of integrating information from smart sensors makes it possible to reduce the speed of writing user data to the registry by reducing the degree of "openness" of the registry, which is suitable for heterogeneous monitoring systems where participants have different access rights.

关键词： Monitoring data collection systems processing distributed ledger mobile components consensus algorithm verification algorithm data storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：