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

IEEE NW Russia Young Researchers in Electrical and Electronic engineering Conference (EIConRusNW)

作者： Vladimir Kulagin Kirill Selivanov Andrey Vlasov Dmitrii Aminev Lyudmila Bunina Sergey Bikovsky Moscow technical university of communications and informatics Moscow Russian Federation Department of Design and Technology of Electronic Devices Bauman Moscow State Technical University BMSTU Moscow Russian Federation Department of Development of software solutions and system programming Russian Technological University – MIREA Moscow Russian Federation Department of Electrical Engineering Systems Russian Technological University – MIREA Moscow Russian Federation

The problem of the rational use of energy resources remains constantly relevant and requires the search for new approaches. One of them is power control. In AC circuits, the authors see the most promising method of phase AC power control. Based on it, a power control module was developed. The structural and circuit diagrams of the developed device are presented to implement the proposed solution. The authors produced its experimental prototype and conducted experimental testing at various levels of regulated power. Savings when using the proposed power control module were calculated using the example of energy consumption in various sectors of energy-intensive systems. According to the data obtained, the module allows saving energy consumption without significant discomfort to the energy user. The calculated results allow concluding that the proposed AC power control module is fully operational, and its widespread use will significantly reduce the need for electricity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using Machine Learning Techniques for Assessing Media Text Readability

Using Machine Learning Techniques for Assessing Media Text R...

引用

Annual Siberian Russian Workshop on Electron Devices and Materials (EDM)

作者： Andrey Laputenko Tatiana Evtushenko Elena Klochkova Nina Yevtushenko Department of Information Technologies National Research Tomsk State University Tomsk Russian Federation Graduate School of Applied Linguistics and Translation Studies Peter the Great St. Petersburg Polytechnic University Saint Petersburg Russian Federation Department of Software Engineering Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow Russian Federation

The paper addresses the problem of assessing media text readability depending on the correlation of objective and subjective text complexity. Objective text complexity refers to a set of measurable characteristics such as baseline, morphological, syntactic and lexical characteristics of a media text (a piece of news published on university websites), which is calculated automatically for each text. In total, 34 parameters are considered. Subjective text complexity score is assigned to each text by human experts who assess the clarity, structure, cohesion and coherence of the text. The correlation between subjective and objective text complexity is studied using machine learning models. The readability level is measured using machine learning methods and regression-correlation analysis. Namely, an artificial neural network and regression models are used. It is demonstrated that the use of polynomial features and lasso regularization allows to get a compact regression model of a high quality. The use of the chosen machine learning techniques made it possible to estimate the impact of distinct linguistic features on the readability level.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Domain-Specific Language and Interactive User Interface for Model-Driven engineering of Technology Roadmaps

A Domain-Specific Language and Interactive User Interface fo...

引用

Euromicro Conference on software engineering and Advanced Applications (SEAA)

作者： Alexander Breckel Jakob Pietron Katharina Juhnke Matthias Tichy Institute of Software Engineering and Programming Languages Ulm University Ulm Germany

ISBN: (数字)9781728195322

ISBN: (纸本)9781728195339

The introduction of major innovations in industry requires a collaboration across the whole supply chain. A common way to organize such a collaboration is the use of technology roadmaps, which act as an industry-wide long-term planning tool. Technology roadmaps are used to identify industry needs, estimate the availability of technological solutions, and identify the need for innovation in the future. Roadmaps are inherently both time-dependent and based on uncertain values, i.e., properties and structural components can change over time. Current approaches for model-driven engineering do not inherently support these aspects. We present a novel model-driven approach treating those aspects as first-class citizens. To address the problem of missing support for time in the context of roadmap modeling, we introduce the concepts of a common global time, time-dependent properties, and time-dependent availability. This includes requirements, properties, and the structure of the model or its components as well. These concepts result in a continuous range of various valid models over time instead of a single valid model at a certain point of time. We present concepts for an interactive graphical user interface to enable the user to efficiently interact with those models. We illustrate the application of these concepts on an industrial example of a next generation electrical fuse.

关键词： Fuses Unified modeling language Tools Technological innovation Switches Analytical models Automobiles

来源：评论

学校读者我要写书评

暂无评论

ANALYZING ROBUSTNESS OF ANGLUIN'S L∗ ALGORITHM IN PRESENCE OF NOISE

arXiv

引用

arXiv 2023年

作者： Ye, Lina Khmelnitsky, Igor Haddad, Serge Barbot, Benoît Bollig, Benedikt Leucker, Martin Neider, Daniel Roy, Rajarshi Université Paris-Saclay CNRS ENS Paris-Saclay CentraleSupélec LMF France Université Paris-Saclay CNRS ENS Paris-Saclay LMF France Université Paris-Est Créteil France Institute for Software Engineering and Programming Languages Universität zu Lübeck Germany TU Dortmund University Germany Center for Trustworthy Data Science and Security University Alliance Ruhr Germany Max Planck Institute for Software Systems Kaiserslautern Germany

Angluin's L∗ algorithm learns the minimal deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively correct (PAC) version substitutes an equivalence query by numerous random membership queries to get a high level confidence to the answer. Thus it can be applied to any kind of device and may be viewed as an algorithm for synthesizing an automaton abstracting the behavior of the device based on observations. Here we are interested on how Angluin's PAC learning algorithm behaves for devices which are obtained from a DFA by introducing some noise. More precisely we study whether Angluin's algorithm reduces the noise and produces a DFA closer to the original one than the noisy device. We propose several ways to introduce the noise: (1) the noisy device inverts the classification of words w.r.t. the DFA with a small probability, (2) the noisy device modifies with a small probability the letters of the word before asking its classification w.r.t. the DFA, (3) the noisy device combines the classification of a word w.r.t. the DFA and its classification w.r.t. a counter automaton, and (4) the noisy DFA is obtained by a random process from two DFA such that the language of the first one is included in the second one. Then when a word is accepted (resp. rejected) by the first (resp. second) one, it is also accepted (resp. rejected) and in the remaining cases, it is accepted with probability 0.5. Our main experimental contributions consist in showing that: (1) Angluin's algorithm behaves well whenever the noisy device is produced by a random process, (2) but poorly with a structured noise, and, that (3) is able to eliminate pathological behaviours specified in a regular way. Theoretically, we show that randomness almost surely yields systems with non-recursively enumerable languages. © 2023, CC BY.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

Evaluating the length of distinguishing sequences for nondeterministic Input/Output automata

Evaluating the length of distinguishing sequences for nondet...

引用

2019 IEEE East-West Design and Test Symposium, EWDTS 2019

作者： Burdonov, Igor Kossachev, Alexandr Yevtushenko, Nina Demakov, Alexey Software Engineering Department Ivannikov Institute for System Programming of RAS Moscow Russia

ISBN: (纸本)9781728110035

Distinguishing sequences are used in model based mutation testing in order to distinguish the specification from its mutants that usually represent critical implementation faults. In this paper, we consider distinguishing sequences for Input/Output automata when a sequence of inputs can be applied before getting any response or a sequence of output responses from an implementation under test. We propose a technique for deriving an r- distinguishing trace, i.e. a distinguishing trace with respect to the trace inclusion (quasi-reduction) relation, and obtain the least and upper bounds on the length of a shortest r- distinguishing trace showing that the exponential upper bound with respect to the number of states of the specification automaton is reachable;the results are then adapted for a proper case of Input/Output automata when each input is followed by an output, i.e., for Finite State Machines. © 2019 IEEE.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Carrot and Stick approaches when managing Technical Debt

Carrot and Stick approaches when managing Technical Debt

引用

IEEE/ACM International Conference on Technical Debt (TechDebt)

作者： Terese Besker Antonio Martini Jan Bosch Computer Science and Engineering Software Engineering Chalmers University of Technology Göteborg Sweden University of Oslo Programming and Software Engineering Oslo Norway

When developing software, it is vitally important to keep the level of technical debt down since it is well established from several studies that technical debt can, e.g., lower the development productivity, decrease the developers’ morale, and compromise the overall quality of the software. However, even if researchers and practitioners working in today’s software development industry are quite familiar with the concept of technical debt and its related negative consequences, there has been no empirical research focusing specifically on how software managers actively communicate and manage the need to keep the level of technical debt as low as *** paper aims to explore how software companies encourage and reward practitioners for actively keeping the level of technical debt down and also whether the companies use any forcing or penalizing initiatives when managing technical *** paper reports the results of both an online web-survey provided quantitative data from 258 participants and follow-up interviews with 32 industrial software practitioners. The findings show that having a TD management strategy can significantly impact the amount of TD in the software. When surveying how commonly used different TD management strategies are, we found that only the encouraging strategy is, to some extent, adopted in today’s’ software industry. This study also provides a model describing the four assessed strategies by presenting its strategies and tactics, together with recommendations on how they could be operationalized in today’s software companies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Prediction and graph visualization of cyber attacks using graph attention networks

引用

Computers & Security 2025年 157卷

作者： Mucahit Soylu Resul Das Inonu University Department of Organized Industrial Zone Vocational School Computer Programming Malatya Turkiye Firat University Faculty of Technology Department of Software Engineering 23119 Elazig Turkiye

This study proposes a hybrid approach for visualizing cyberattacks by combining the deep learning-based GAT model with JavaScript-based graph visualization tools. The model processes large, heterogeneous data from the UNSW-NB15 dataset to generate dynamic and meaningful graphs. In the data cleaning phase, missing and erroneous data were removed, unnecessary columns were discarded, and the data was transformed into a format suitable for modeling. Then, the data was converted into homogeneous graphs, and heterogeneous structures were created for analysis using the GAT model. GAT prioritizes relationships between nodes in the graph with an attention mechanism, effectively detecting attack patterns. The analyzed data was then converted into interactive graphs using tools like SigmaJS, with attacks between the same nodes grouped to reduce graph complexity. Users can explore these dynamic graphs in detail, examine attack types, and track events over time. This approach significantly benefits cybersecurity professionals, allowing them to better understand, track, and develop defense strategies against cyberattacks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An approach to finding the most optimal route in a dynamic graph

An approach to finding the most optimal route in a dynamic g...

引用

2021 International Conference on Information Science and Communications Technologies, ICISCT 2021

作者： Nishanov, Akhram Khasanovich Allamov, Oybek Turabaevich Ruzibaev, Ortiq Bakhtiyorovich Abdullaev, Anvar Shukhratbekovich Allamova, Shakhlo Turabaevna Tashkent University of Information Technologies Named after Muhammad Al-Khwarizmi Department of Systematic and Practical Programming Tashkent Uzbekistan Urgench Branch of Tashkent University of Information Technologies Named after Muhammad Al-Khwarizmi Department of Software Engineering Khorezm region Urgench Uzbekistan Software Enginering Tashkent University of Information Technologies Named after Muhammad Al-Khwarizmi Tashkent Uzbekistan Urgench Branch of Tashkent University of Information Technologies Named after Muhammad Al-Khwarizmi Department of Information Engineering Khorezm region Urgench Uzbekistan

ISBN: (纸本)9781665432580

The article proposes an algorithm for determining the optimal ways for users to travel from one place to another. Traffic jams occur in cities as a result of road repairs and car accidents. As a result, the shortest route planned for the trip can become a useless route. Given these circumstances, the article presents a parallel processing method distributed on a large-scale graph to control traffic. As a result, an algorithm for parallel and distributed processing of large-volume graphs was developed and tested for large-volume data. The test algorithm is illustrated with a wide range of graphs. Experimental experiments of the algorithm were conducted on the basis of data from the city of Urgench, Uzbekistan. © 2021 IEEE.

关键词： Smart city

来源：评论

学校读者我要写书评

暂无评论

Automated Computation of Therapies Using Failure Mode and Effects Analysis in the Medical Domain

arXiv

引用

arXiv 2024年

作者： Luttermann, Malte Baake, Edgar Bouchagiar, Juljan Gebel, Benjamin Grüning, Philipp Manikwadura, Dilini Schollemann, Franziska Teifke, Elisa Rostalski, Philipp Möller, Ralf Institute of Information Systems University of Lübeck Germany Institute of Telematics University of Lübeck Germany Institute for Software Engineering and Programming Languages University of Lübeck Germany Department of Infectious Diseases and Microbiology University Hospital Schleswig-Holstein Campus Lübeck Germany Institute for Neuro- and Bioinformatics University of Lübeck Germany Institute for Molecular Medicine University of Lübeck Germany Institute for Electrical Engineering in Medicine University of Lübeck Germany franziska.schollemann Department of Anesthesiology and Intensive Care University Hospital Schleswig-Holstein Campus Lübeck Germany

Failure mode and effects analysis (FMEA) is a systematic approach to identify and analyse potential failures and their effects in a system or process. The FMEA approach, however, requires domain experts to manually analyse the FMEA model to derive risk-reducing actions that should be applied. In this paper, we provide a formal framework to allow for automatic planning and acting in FMEA models. More specifically, we cast the FMEA model into a Markov decision process which can then be solved by existing solvers. We show that the FMEA approach can not only be used to support medical experts during the modelling process but also to automatically derive optimal therapies for the treatment of patients. © 2024, CC BY.

关键词： Patient treatment

来源：评论

学校读者我要写书评

暂无评论

Empowering multilevel DSMLs with integrated runtime verification

arXiv

引用

arXiv 2020年

作者： Macías, Fernando Rutle, Adrian Stolz, Volker Scheffel, Torben Schmitz, Malte Western Norway University of Applied Sciences Bergen Norway Institute for Software Engineering and Programming Languages University of Lübeck Germany

Within Model-Driven software engineering, Domain-Specific Modelling has proven to be a powerful technique to specify systems and systems' behaviour in a formal, yet understandable way. Runtime verification (RV) has been successfully used to verify the correctness of such behaviour. Specifying behaviour requires managing various levels of abstractions, making multilevel modelling (MLM) a suitable approach for this task. In this paper, we present an approach to combine MLM and RV with an example from the domain of distributed real-time systems. The semantics of the specified behaviour as well as the evaluation of correctness properties are given by model transformation rules. This facilitates simulation of the system and checking against real-time temporal logic correctness properties. Copyright © 2020, The Authors. All rights reserved.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：