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

α-Reliable Shortest Path Problem in Uncertain Time-Dependent Networks

International Journal of Applied and Computational Mathematics 2022年第4期8卷 1-12页

作者： Biswal, Sagarika Ghorai, Ganesh Mohanty, S.P. Department of Mathematics Nimapara Autonomous College Nimapara Puri 752106 India Department of Applied Mathematics With Oceanology and Computer Programming Vidyasagar University West Bengal Midnapore 721102 India Department of Mathematics Siksha ‘O’ Anusandhan University (SOA) Bhubaneswar 751030 India

In a congested road network, it is always desirable to find a reliable shortest path so far as travel time is concerned. Physical distance and travel time are invariably uncertain due to large-scale maintenance work, natural disaster, heavy accident, weather conditions, etc. Many researchers considered travel time to be stochastic where the Bellman’s principle of optimality is not preserved. Also, any sub-path of a shortest path is not necessarily shortest. Some researchers find non-dominated paths under different variants as a multi-objective optimization problem. Moreover, in the absence of sample data, probability theory cannot be used. In this work, the travel time is considered to be uncertain variable, where no sample data is required and it is established that Bellman’s principle of optimality is preserved. So, in contrast to the stochastic environment, classical dynamic approach can be used to find the α-reliable shortest path using uncertainty theory. © 2022, The Author(s), under exclusive licence to Springer Nature India Private Limited.

关键词： Dijkstra’s algorithm Non-dominated path Pre-trip planning Reliable shortest path Travel time Uncertain variable

来源：评论

学校读者我要写书评

暂无评论

Development the Numerical Method to Solve the Inverse Initial Value Problem for the Thermal Conductivity Equation of Composite Materials

Development the Numerical Method to Solve the Inverse Initia...

引用

2020 Ibn Al-Haitham International Conference for Pure and Applied Sciences, IHICPS 2020

作者： Al-Mahdawi, H.K. Department of System Programming School of Electronic Engineering and Computer Science South Ural State University Lenina 76 Chelyabinsk454080 Russia

In this paper, the heat conduction equation for composite materials posed and solved. This problem is known as an inverse initial value problem for the heat conduction equation. In order to solve and formulate this inverse problem, the function spaces must be defined and represented. By studying and solving the direct problem for the heat equation in composite materials, it is possible to determine the function spaces and solve the inverse initial value problem. Scientific methods used: the separation of variables method used to solve the direct problem for the heat equation. It found that method separation of variables does not completely lead to the solution of the inverse initial value problem, since this method leads to a divergent series of solutions and rather massive errors. The heat conduction problem can be formulated as Fredholm integral first kind equations. The discretization algorithm applied to reformulated the problem as linear operator problem as matrix and vectors form. Then, Tikhonov's regularization inversion method has been used to find an approximation solution. Finally, as shown in the numerical example the regularized approximate solutions obtained. © Published under licence by IOP Publishing Ltd.

关键词： Initial value problems

来源：评论

学校读者我要写书评

暂无评论

Classified emotion as implicit recommendation system feedback

Classified emotion as implicit recommendation system feedbac...

引用

Advanced Technology (KhPIWeek), IEEE KhPI Week on

作者： Andrii Kuliahin Heorhii Kuchuk Department of Computer Systems Networks and Cybersecurity National Aerospace University “Kharkiv Aviation Institute” Kharkiv Ukraine Department of Computer Engineering and Programming National Technical University “Kharkiv Polytechnic Institute” Kharkiv Ukraine

the paper proposes the use of 3D convolutional neural network for recognizing user emotions on videos in a recommender system. The data approach aims to use the recognized emotion as important implicit feedback and improve the recommendation result. This is expected to significantly improve the performance of the recommender system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Method of Detection of Intrusions Based on Stacking Meta-Algorithm

Method of Detection of Intrusions Based on Stacking Meta-Alg...

引用

Advanced Technology (KhPIWeek), IEEE KhPI Week on

作者： Svitlana Gavrylenko Vladislav Zozulia Nataliia Khatsko Department of Computer Engineering and Programming National Technical University “Kharkiv Polytechnic Institute” Kharkiv Ukraine Department Information Systems and Technologies National Technical University «Kharkiv Polytechnic Institute» Kharkiv Ukraine

ISBN: (数字)9798350384499

ISBN: (纸本)9798350384505

An analysis of modern computer network intrusion detection systems was carried out. The application of machine and deep learning methods for classification problems has been investigated. The UNSW-NB15 dataset, developed at the Australian Cyber Security Center's (ACCS) Cyber Range Laboratory, contains data on normal network operations and synthetic intrusions. Data pre-processing was performed, including class balancing using the SMOTEENN method and selection of informative features using the Recursive Feature Elimination method. The possibility of using the stacking meta-algorithm to detect intrusions into computer networks has been investigated. A new algorithm for generating packets of raw data is proposed, which generates two sets of training data: one for training basic models, the other for a meta-model. A study of the effectiveness of using Random Forest, ANN, K Nearest Neighbor methods and Support Vector Machine and Random Forest as a decision-making meta-model was conducted. The use of the stacking meta-algorithm with the proposed algorithm for forming packets of output data, as well as basic models and a meta-model, led to a significant improvement in the quality of the model. It was found that, on average, recall and f1 score increased by 55.6% and 37.4%, respectively, compared to raw data and other models.

关键词： Training Support vector machines Computational modeling Stacking Training data Intrusion detection Predictive models Nearest neighbor methods Data models Random forests

来源：评论

学校读者我要写书评

暂无评论

Estimation of optimal safety parameters for a communication channel with required SIL 3 at runtime 29

Estimation of optimal safety parameters for a communication ...

引用

29th European Safety and Reliability Conference, ESREL 2019

作者： Gaus, Larissa Schwarz, Michael Börcsök, Josef Computer Architecture and System Programming University of Kassel Germany

ISBN: (纸本)9789811127243

In this paper, the optimization of safety parameters for a communication channel with the required safety integrity level (SIL) 3 at runtime is investigated. In order to guarantee the safe communication additional measures are needed. One of them is the black channel principle. It allows the transfer of safety related packets over the safety layer parallel to safety irrelevant data. Another method is the protection by a linear code, typically by cyclic redundancy check (CRC). In terms of the safety level, the information channel can be assumed as a generalized erasure channel (GEC) with the set of output symbols (0, e, 1). For this channel a formula for probability of failure per hour (PFH) can be derived using the parameters: bit error ratio, bit loss rate, message rate, code block length and weight spectrum. Within the safety layer, the communication occurs in the send-/receive-response principle (cyclic mode) and the messages can have a length defined by bounds on nmin and nmax. Accordingly, the optimization problem is formulated to minimize the PFH value by optimizing the message length for changing parameter values. © 2019 European Safety and Reliability Association. Published by Research Publishing, Singapore.

关键词： Bit error rate

来源：评论

学校读者我要写书评

暂无评论

Cyclic Quasi-Orthogonal Matrices in Image and Signal Encoding

Cyclic Quasi-Orthogonal Matrices in Image and Signal Encodin...

引用

International Conference on Information Science and Communications Technologies (ICISCT)

作者： Sergeev Alexandr Department of computer technology and programming Saint Petersburg State University of Aerospace Instrumentation Saint Petersburg Russia

orthogonal and quasi-orthogonal matrices with a limited number of element values and structured in some way are of considerable interest for many technical applications related to image processing and signal coding. The paper classifies and considers cyclic matrices and matrices with cyclic blocks. Descriptions of noise-resistant encoding methods of images and their protective masking using such matrices are given. Based on the analysis of the autocorrelation functions of new code sequences obtained from strings of modified cyclic quasi-orthogonal matrices and the simulation performed, numerical values of the quality parameters of the new code sequences are given. It is shown that their application makes it possible to reduce the maximum level of the side lobe of the aperiodic autocorrelation function, which allows us to conclude that their application is promising and that signal coding algorithms can be revised.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A blockchain-oriented covert communication technology with controlled security level based on addressing confusion ciphertext

引用

Frontiers of computer Science 2025年第2期19卷 133-135页

作者： Lejun ZHANG Bo ZHANG Ran GUO Zhujun WANG Guopeng WANG Jing QIU Shen SU Yuan LIU Guangxia XU Zhihong TIAN Sergey GATAULLIN Cyberspace Institute Advanced Technology Guangzhou UniversityGuangzhou 510006China Research and Development Center for E-Learning Ministry of EducationBeijing 100039China College of Information Engineering Yangzhou UniversityYangzhou 225009China School Math and Computer Science Quanzhou Normal UniversityQuanzhou 362000China Pazhou Lab Guangzhou 510330China School of Physics and Materials Science Guangzhou UniversityGuangzhou 510006China Central Economic and Mathematics Institute Russian Academy of SciencesMoscow 117418Russia Industrial Programming Department MIREA-Russian Technological UniversityMoscow 119454Russia

1 Introduction Traditional covert communication[1]usually relies on centralized channels,which are efficient in transmission but susceptible to eavesdropping and attacks,leading to information ***,distributed methods also exist,such as peer-to-peer networks and distributed hash *** technology,which is decentralized,anonymous,non-tamperable and anti-attack,can be applied to covert communication to solve the problems of traditional methods and improve the quality of communication.

关键词： communication tables networks

来源：评论

学校读者我要写书评

暂无评论

Actegories for the Working Amthematician

arXiv

引用

arXiv 2022年

作者： Capucci, Matteo Gavranović, Bruno Mathematically Structured Programming Group Department of Computer and Information Sciences University of Strathclyde Glasgow United Kingdom

Actions of monoidal categories on categories, also known as actegories, have been familiar to category theorists for a long time, and yet a comprehensive overview of this topic seems to be missing from the literature. Recently, actegories have been increasingly employed in applied category theory, thereby encouraging an effort to fill this gap according to the new needs of these applications. This work started as an investigation of the notion of monoidal actegory, a compatible pair of monoidal and actegorical structures, and ended up including a sizable reference on the elementary theory of actegories. We cover basic definitions and results on actegories and biactegories, spelling out explicitly many folkloric definitions, including their tensor product and their hom-tensor adjunction. We give new definitions of actegories with monoidal, braided monoidal and symmetric monoidal structure. In the last section, we provide three Cayley-like classification results for these *** Codes 18-02 © 2022, CC BY-SA.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Epistemic Multiagent Reasoning with Collaborative Robots 37

Epistemic Multiagent Reasoning with Collaborative Robots

引用

37th Italian Conference on Computational Logic, CILC 2022

作者： Soldà, Davide Fabiano, Francesco Dovier, Agostino Constraint and Logic Programming Lab University of Udine Udine33100 Italy Embedding System Unit of Fondazione Bruno Kessler Trento38123 Italy Department of Mathematical Physical and Computer Sciences University of Parma Parma43124 Italy Department of Mathematics Computer Science and Physics University of Udine Udine33100 Italy

Over the last few years, the fields of Artificial Intelligence, Robotics and IoT have gained a lot of attention. This increasing interest has brought, among other things, to the development of autonomous multi-agent systems where robotic entities may interact with each other. As for all the other autonomous settings, also these systems require arbitration. Our work tries to address this problem by presenting a framework that embeds both a classical and a multi-agent epistemic (epistemic, for brevity) planner in a robotic control architecture. The idea is to combine the (i) classical and the (ii) epistemic solvers to model efficiently the interaction with: the (i) physical world and the (ii) information flows, respectively. In particular, the presented architecture starts by planning on the "epistemic level" refining then single-agent world-altering actions thanks to the classical planner. To further optimize the solving process, we also introduce the concept of macros in epistemic planning. Macros, in fact, have been successfully employed in classical planning as they allow for opportune aggregations of actions that may lead to a reduction of plans' length. Finally, the overall framework is exemplified and validated with two Franka Emika manipulators. This allowed us to empirically justify how the combination of the two planning approaches (classical and epistemic), and the introduction of macros, reduce the computational time required by the orchestrating phase. © 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0)

关键词： Robot programming

来源：评论

学校读者我要写书评

暂无评论

Ensuring the reliability of remote online monitoring systems

Ensuring the reliability of remote online monitoring systems

引用

International Conference on Information Science and Communications Technologies (ICISCT)

作者： Sergeev Alexandr Sergeev Mikhail Department of computer technology and programming Saint Petersburg State University of Aerospace Instrumentation Saint Petersburg Russia

the issue of ensuring the reliability of the functioning of global systems of remote online monitoring of the condition of patients is considered. Remote monitoring is in demand when supervision the health status of disabled people with cardiovascular diseases, pregnant women and children. It is especially in demand in the context of a pandemic and the accompanying restrictions on movement. Monitoring is carried out “transparently” for the patient, without involving him in the subtleties of the process of interaction with a medical institution, ensuring the preservation of his mobility due to the proposed concept of implementing a wearable online monitor device. The procedures of the online monitor initialization and distribution of functions in it are considered. Threats to the normal functioning of distributed systems with online monitors are presented, including existing problems of a general nature related mainly to global communications. Solutions are offered to ensure reliable operation of wearable devices as part of online monitors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：