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

17th IEEE International Congress on Intelligent and Service-Oriented systems Engineering (CISOSE)

作者： Schindewolf, Marc Wittler, Jan Willem Kuehn, Thomas Grimm, Daniel Sax, Eric Karlsruhe Inst Technol Inst Tech Informat Verarbeitung Karlsruhe Germany Karlsruhe Inst Technol Dependabil Software Intens Syst Karlsruhe Germany Martin Luther Univ Halle Wittenberg Software Engn & Programming Languages Halle Germany

ISBN: (纸本)9798350322392

The automotive industry faces challenges due to the increasing demand for customization and individualization by consumers. With a wide range of equipment levels and feature options, it has become impossible to test all possible configurations for a single vehicle during development and especially for vehicles already in service. As a basis for solving these challenges, integrated approaches for the development of upgradeable vehicles are required. In this context, future upgrade options should be considered and planned already in the design stage to enable sustainable business models for next vehicle generations. This paper proposes a refined variability model that combines two existing approaches to address the challenges faced by the industry. The same model can perform buildability or upgradeability checks and dynamic allocation optimization. The model is evaluated qualitatively by three exemplary use cases.

关键词： Automotive E/E architecture SOA software engineering reconfiguration model-driven software engineering software evolution software product lines

来源：评论

学校读者我要写书评

暂无评论

Adaptive Experiments for State Identification in Finite State Machines with Timeouts 1

引用

9th Conference on Machines, Computations and Universality (MCU)

作者： Tvardovskii, Aleksandr Yevtushenko, Nina Natl Res Tomsk State Univ Tomsk 634050 Russia RAS Ivannikov Inst Syst Programming Moscow 109004 Russia

ISBN: (数字)9783031135026

ISBN: (纸本)9783031135026;9783031135019

Homing and synchronizing sequences are used for the current state identification in finite state machines (FSMs). Adaptive homing and synchronizing sequences for which the next input depends on the outputs to the previous ones, exist more often and usually are shorter than the preset. Thus, a lot of attention is paid to the existence check, derivation complexity and length of shortest adaptive state identification sequences. In this paper, we adapt the notions of adaptive homing and synchronizing sequences for FSMs with timeouts which are widely used for solving verification and testing problems of components of telecommunication systems. Based on the corresponding FSM abstraction, the procedures for deriving adaptive homing and synchronizing sequences are proposed for FSMs with timeouts when such sequences exist.

关键词： Finite state machines Timeouts Homing sequence Synchronizing sequence

来源：评论

学校读者我要写书评

暂无评论

A Survey of Network Traffic Classification Methods Using Machine Learning

引用

programming AND COMPUTER SOFTWARE 2022年第7期48卷 413-423页

作者： Getman, A. I. Ikonnikova, M. K. Russian Acad Sci Ivannikov Inst Syst Programming Ul Solzhenitsyna 25 Moscow 109004 Russia Natl Res Univ Higher Sch Econ Ul Myasnitskaya 20 Moscow 101000 Russia

This survey is devoted to the task of network traffic classification, specifically, to the use of machine learning algorithms in this task. The survey begins with the description of the task, its different statements, and possible real-world applications. It then proceeds to the description of the methods historically used for network traffic classification, as well as their limitations and evolution of traffic making machine learning, which is the main way to solve the problem. The most popular machine learning algorithms used in this task are described and accompanied with examples of research papers that provide insight into their advantages and disadvantages. The problem of feature selection is discussed with subsequent consideration of a more global problem of acquiring a suitable dataset for network traffic classification;examples of popular datasets and their descriptions are provided. The paper concludes with an overview of some current problems in this field of research: model training and comparison, user data protection, and network traffic volatility.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Optimization of ProVerif Programs for AKE Protocols

引用

programming AND COMPUTER SOFTWARE 2022年第8期48卷 781-787页

作者： Vinarskii, E. M. Demakov, A. V. Russian Acad Sci Ivannikov Inst Syst Programming Ul Solzhenitsyna 25 Moscow 109004 Russia Natl Res Univ Higher Sch Econ Pokrovskii Bulv 11 Moscow 109028 Russia

Cryptographic protocols are used to establish secure connection between agents who communicate strictly in accordance with the rules specified by the protocol. To make sure that a newly designed cryptographic protocol is cryptographically strong, various software tools are usually employed. However, an adequate specification of a cryptographic protocol is generally represented as a set of requirements for sequences of transmitted messages, including their format. The fulfillment of all these requirements leads to the fact that the formal specification of a real-world cryptographic protocol becomes cumbersome and, therefore, difficult to analyze by formal methods. ProVerif is one of the intensively developed tools for formal verification of cryptographic protocols. However, ProVerif often fails to analyze large protocols, i.e., it can neither prove the security of the protocol nor refute it. In these cases, either the problem is approximated or equivalent transformations of a program model in the ProVerif language are carried out to simplify the ProVerif model. In this paper, we propose a technique to simplify ProVerif specifications for AKE protocols that use the ElGamal encryption scheme. In particular, we define equivalent transformations that make it possible to construct a ProVerif specification that facilitates the analysis for the ProVerif tool. Experimental results for the Needham-Schroeder and Yahalom cryptoprotocols show that this approach is promising for automatic verification of real-world protocols.

关键词： Formal specification

来源：评论

学校读者我要写书评

暂无评论

Deriving FSM-based tests using a,b-faults for Logic Circuits

Deriving FSM-based tests using a,b-faults for Logic Circuits

引用

IEEE-Computer-Society Annual Symposium on VLSI (ISVLSI)

作者： Laputenko, Andrey Yevtushenko, Nina Andreeva, Valentina Matrosova, Anzhela State Univ Natl Res Tomsk Tomsk Russia Russian Acad Sci Ivannikov Inst Syst Programming Moscow Russia

ISBN: (纸本)9781665466059

Finite state machines (FSM) are widely used in testing and verification of discrete event and hybrid systems. In order to guarantee fault coverage, various fault models and formal methods are utilized ranging from classical finite state machines (FSM) to logic circuits. The main problem for deriving an FSM-based test suite is the size of an FSM for real digital circuits, and thus, test engineers prefer to randomly derive a prefix of a test sequence and later on extend it with tests for hard detectable faults of a corresponding logic circuit. Usually at the latter step test sequences detecting hard detectable stuck-at faults are considered. In this paper, we are concerned about single functional faults, namely, a,b-faults, of a system of Boolean functions of the combinational part of a sequential circuit such as deleting a variable or a cube in a SoP which represents the ON-set or the OFF-set of a corresponding Boolean function and experimentally evaluate fault coverage of a corresponding complete test suite with respect to fault coverage of tests returned by other methods. The experimental results show high fault coverage of test suites complete with respect to a,b-faults and thus, it can be recommended to utilize such a test suite instead of a complete FSM-based test suite or to extend randomly generated test sequences for detecting a,b-faults not killed with the prefix.

关键词： finite state machine logic circuit testing

来源：评论

学校读者我要写书评

暂无评论

Optimal Approximation of Average Reward Markov Decision Processes

引用

COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2025年第3期65卷 567-581页

作者： Sapronov, Y. F. Yudin, N. E. Moscow Inst Phys & Technol Dolgoprudnyi 141701 Russia Higher Sch Econ Univ Moscow 109028 Russia Innopolis Univ Innopolis 420500 Russia Russian Acad Sci Inst Informat Transmiss Problems Kharkevich Inst Moscow 127051 Russia Russian Acad Sci Ivannikov Inst Syst Programming Moscow 109004 Russia Russian Acad Sci Fed Res Ctr Informat & Control Moscow 119333 Russia

We continue to develop the concept of studying the epsilon-optimal policy for Average Reward Markov Decision Processes (AMDP) by reducing it to Discounted Markov Decision Processes (DMDP). Existing research often stipulates that the discount factor must not fall below a certain threshold. Typically, this threshold is close to one, and as is well-known, iterative methods used to find the optimal policy for DMDP become less effective as the discount factor approaches this value. Our work distinguishes itself from existing studies by allowing for inaccuracies in solving the empirical Bellman equation. Despite this, we have managed to maintain the sample complexity that aligns with the latest results. We have succeeded in separating the contributions from the inaccuracy of approximating the transition matrix and the residuals in solving the Bellman equation in the upper estimate so that our findings enable us to determine the total complexity of the epsilon-optimal policy analysis for DMDP across any method with a theoretical foundation in iterative complexity.

关键词： Markov decision processes reinforcement learning sample complexity iteration complexity ICOMP2024

来源：评论

学校读者我要写书评

暂无评论

Timed Transition Tour for Race Detection in Distributed systems 18

Timed Transition Tour for Race Detection in Distributed Syst...

引用

18th International Conference on Evaluation of Novel Approaches to Software Engineering (ENASE)

作者： Vinarskii, Evgenii Kushik, Natalia Yevtushenko, Nina Lopez, Jorge Zeghlache, Djamal d Inst Polytech Paris SAMOVAR Telecom SudParis Palaiseau France Russian Acad Sci Ivanikov Inst Syst Programming Moscow Russia Higher Sch Econ Moscow Russia Airbus Issy Les Moulineaux France

ISBN: (纸本)9789897586477

The paper is devoted to detecting output races in distributed systems. We perform such detection through testing their implementations. As an underlying model for our test generation strategy we consider a Timed Finite State Machine or a TFSM (for short), where each input/output transition is augmented with a timed guard and an output delay. A potential output race can thus be simulated as an output delay mutant;this formalism is introduced in the paper. In order to build a test suite, we adapt a well-known test generation strategy, a transition tour method. The novelty of the proposed method relies on choosing appropriate timestamps for inputs, yielding a timed transition tour. We discuss its fault coverage for output race detection. As an application case study, we consider a Software Defined Networking (SDN) framework where the system under test is represented by the composition of a controller and a switch. Experimental results show that the timed transition tour can detect races in the behavior of the widely used ONOS controller.

关键词： Races Model Based Testing Timed Finite State Machines Timed Transition Tour

来源：评论

学校读者我要写书评

暂无评论

A Machine Learning Approach for Detecting Traffic Incidents from Video Cameras 4th

A Machine Learning Approach for Detecting Traffic Incidents ...

引用

4th Ibero-American Congress on Smart Cities (ICSC-CITIES)

作者： Gabrielli, Guillermo Ferreira, Ignacio Dalchiele, Pablo Tchernykh, Andrei Nesmachnow, Sergio Univ Republic Montevideo Uruguay CICESE Ensenada Baja California Mexico Russian Acad Sci Inst Syst Programming Moscow Russia

ISBN: (纸本)9783030967536;9783030967529

In the area of vehicular traffic analysis, many cities have surveillance devices (cameras) installed in different junctions as well as along roads, to obtain information on how vehicles behave in a certain area. To help in the process of preventing accidents, this article proposes a computer vision pipeline for detecting different types of dangerous/risky driving behavior. The pipeline includes object detection, tracking, speed normalization, and the application of computational intelligence, among other relevant features for pattern detection and traffic behavior analysis. The developed models are applied on videos from traffic cameras from eight different sites in the metropolitan area of the city of Montevideo. Three different algorithms were developed for detecting dangerous incidents in traffic in real time. Accurate results are reported for the case studies addressed in the experimental validation, reaching precision values up to 0.82 and recall values up to 0.91.

关键词： Vehicular traffic Road safety Image processing Computer vision Artificial intelligence Machine learning Neural networks Intelligent transport systems

来源：评论

学校读者我要写书评

暂无评论

RaQuN: a generic and scalable n-way model matching algorithm

引用

SOFTWARE AND systEMS MODELING 2023年第5期22卷 1495-1517页

作者： Schultheiss, Alexander Bittner, Paul Maximilian Boll, Alexander Grunske, Lars Thuem, Thomas Kehrer, Timo Humboldt Univ Berlin Germany Humboldt Univ Dept Comp Sci Berlin Germany Univ Ulm Inst Software Engn & Programming Languages Ulm Germany Univ Ulm Construct & Anal Secure Software Syst Ulm Germany Univ Bern Bern Switzerland Univ Bern Inst Comp Sci Bern Switzerland

Model matching algorithms are used to identify common elements in input models, which is a fundamental precondition for many software engineering tasks, such as merging software variants or views. If there are multiple input models, an n-way matching algorithm that simultaneously processes all models typically produces better results than the sequential application of two-way matching algorithms. However, existing algorithms for n-way matching do not scale well, as the computational effort grows fast in the number of models and their size. We propose a scalable n-way model matching algorithm, which uses multi-dimensional search trees for efficiently finding suitable match candidates through range queries. We implemented our generic algorithm named RaQuN (Range Queries on N input models) in Java and empirically evaluate the matching quality and runtime performance on several datasets of different origins and model types. Compared to the state of the art, our experimental results show a performance improvement by an order of magnitude, while delivering matching results of better quality.

关键词： Model-driven engineering n-Way model matching Clone-and-own development Software product lines

来源：评论

学校读者我要写书评

暂无评论

Tools for Capturing and Processing High-Speed Network Traffic

引用

programming AND COMPUTER SOFTWARE 2022年第8期48卷 756-769页

作者： Larin, D. V. Get'man, A. I. Moscow Inst Phys & Technol Dolgoprudnyi 141700 Moscow Oblast Russia Russian Acad Sci Ivannikov Inst Syst Programming Moscow 109004 Russia Natl Res Univ Higher Sch Econ HSE Univ Moscow 109028 Russia

In modern realities, the Internet experience a permanent increase in network traffic volume. However, standard network stacks currently implemented in modern operating systems are not able to cope with the capturing and processing of traffic that comes at a speed of 10 Gb/s and higher. Therefore, various software frameworks are developed, being able to cope with high-speed network traffic. They allow high-performance packet IO on commodity hardware, expanding the domain of its use to cases previously available only to specialized hardware. In this paper, we explore modern traffic capturing and processing frameworks. For each tool, we describe its architecture and provide measurements of performance. Furthermore, we provide a comparison between them and define the area of applicability.

关键词： HIgh speed networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：