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

International Symposium on Digital Forensic and Security (ISDFS)

作者： Bahaddin Erdem Murat Karabatak Department of Computer Programming Bitlis Eren University Bitlis Turkey Department of Software Engineering Firat University Elaziğ Turkey

ISBN: (数字)9798331509934

ISBN: (纸本)9798331509941

This study aims to reveal the best deep learning models that are improved and optimized by predicting undesirable behavior patterns using a dataset consisting of artificial and real exam data of students taking online distance education courses in an online environment through the distance education system. Using online exam data of 129 students, the researchers conducted analysis with two different scenarios to determine the best prediction performance through regression and classification models. The model we proposed was determined as a four-layer DNN with 80.4% test performance in detecting students who “cheated” from undesirable behavior patterns, which was performed with K-10, K-5 and K-3 cross-validation. The results prove that students' online distance education exam data can be easily applied to the DNN model. The models presented in the study provide a roadmap for educational institutions to evaluate their online examination practices and develop more effective strategies for academic honesty.

关键词： Deep learning Analytical models Digital forensics Predictive models Nonhomogeneous media Data models Educational courses Fraud Security

来源：评论

学校读者我要写书评

暂无评论

Research and Development of Kubernetes Operator for Machine Learning Pipelines

Research and Development of Kubernetes Operator for Machine ...

引用

International Russian Smart Industry Conference (SmartIndustryCon)

作者： Andrey Trapezin Ivan Filianin Faculty of Programming and Infocommunications ITMO University St. Petersburg Russia Faculty of Software Engineering and Computer Engineering ITMO University St. Petersburg Russia

ISBN: (数字)9798331511241

ISBN: (纸本)9798331511258

The current research work addresses the problem of automating the delivery of machine learning models from MLflow to Kubernetes infrastructure. To solve the mentioned problem, a Kubernetes operator has been developed to automate the delivery of machine learning models to production by integrating MLflow for model tracking and Seldon Core for model serving. The developed operator allows data scientists to deploy models while maintaining the familiar MLflow environment. The operator's automatic deployment triggers upon tagging models in MLflow, greatly simplifying engineers' tasks and minimizing the need for manual infrastructure configuration. By automating configuration tasks and optimizing deployment workflows, the solution achieves a 40-50% reduction in model time to deployment (TTD) metric compared to manual processes and decreases error rates from 15% to around 3%. The practical relevance of the work is that it simplifies collaboration between data and infrastructure teams by providing a unified deployment framework, resulting in faster, more reliable, and automated integration of machine learning models into an organisation's business processes.

关键词： Production systems Error analysis Machine learning Manuals Tagging Data models Reliability Research and development Load modeling Resilience

来源：评论

学校读者我要写书评

暂无评论

Verifying Multiple Virtual Networks in software Defined Networks

Verifying Multiple Virtual Networks in Software Defined Netw...

引用

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

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

ISBN: (纸本)9781665445030

software Defined Network (SDN) technology is one of the modern network virtualization technologies. When implementing a virtual network on the SDN data plane, undesired effects may occur: the appearance of undesired paths where packages can be sent, 'looping' when the packages are infinitely cycled and infinitely cloned, duplicate paths when the host receives the same package several times. We show that these effects can occur for the joint implementation of several virtual networks even if the implementation of each separate virtual network does not cause these effects. A method for verifying the implementation of several virtual networks is proposed. A sufficient condition is established for the graph of physical connections when any set of virtual networks can be implemented without the occurrence of the above undesirable effects. © 2021 IEEE.

关键词： Verification

来源：评论

学校读者我要写书评

暂无评论

Practical Escape Analysis in an Open World

引用

电子学报(英文版) 2009年第1期18卷 31-36页

作者： SHI Xiaohua JIN Maozhong WU Gansha LUEH Gueiyuan Software Engineering Institute Beihang University Beijing 100083 China Programming System Laboratory Microprocessor Technology Laboratory Intel Corporation China

A novel escape analysis framework that handles the Java open-world features is proposed and evaluated. The novel approach analyzes a Java program with an optimistic view that the program is in a closed world and applies optimizations aggressively. The framework also provides a mechanism that controls the analysis complexity. The results show that the escape analysis framework, which has been implemented in Intel's Open Runtime Platform on X86, eliminated about 70% and 94% synchronization operations, and improved the runtime performance 15.77% and 31.28%, for SPECjbb2000 and 209_db respectively.

关键词：世界逃逸 Java程序运行性能同步操作开放式框架复杂性

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Jif and Joana as information flow analyzers in a model-driven approach

Evaluation of Jif and Joana as information flow analyzers in...

引用

7th International Workshop on Data Privacy Management, DPM 2012 and 5th International Workshop on Autonomous and Spontaneous Security, SETOP 2012

作者： Katkalov, Kuzman Fischer, Peter Stenzel, Kurt Moebius, Nina Reif, Wolfgang Department of Software Engineering and Programming Languages University of Augsburg Germany

ISBN: (纸本)9783642358890

Checking for information leaks in real-world applications is a difficult task. IFlow is a model-driven approach which allows to develop information flow-secure applications using intuitive modeling guidelines. It supports the automatic generation of partial Java code while also providing the developer with the ability to formally verify complex information flow properties. To simplify the formal verification, we integrate an automatic Java application information flow analyzer, allowing to check simple noninterference properties. In this paper, we evaluate both Jif and Joana as such analyzers to determine the best suiting information flow control tool in the context of, but not limited to the IFlow approach. © 2013 Springer-Verlag.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Faster verification of partially ordered runs in Petri nets using compact tokenflows

Faster verification of partially ordered runs in Petri nets ...

引用

34th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2013

作者： Bergenthum, Robin Department of Software Engineering and Theory of Programming FernUniversität in Hagen Germany

ISBN: (纸本)9783642386961

In this paper we tackle the problem of verifying whether a labeled partial order (LPO) is executable in a Petri net. In contrast to sequentially ordered runs an LPO includes both, information about dependencies and independencies of events. Consequently an LPO allows a precise and intuitive specification of the behavior of a concurrent or distributed system. In this paper we consider Petri nets with arc weights, namely marked place/transition-nets (p/t-nets). Accordingly the question is whether a given LPO is an execution of a given p/t-net. Different approaches exist to define the partial language (i.e. the set of executions) of a p/t-net. Each definition yields a different verification algorithm, but in terms of runtime all these algorithms perform quite poorly for most examples. In this paper a new compact characterization of the partial language of a p/t-net will be introduced, optimized with respect to the verification problem. The goal is to develop an algorithm to efficiently decide the verification problem. © 2013 Springer-Verlag.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Guest editor's introduction

引用

International Journal on software Tools for Technology Transfer 2009年第3期11卷 173-174页

作者： Hinchey, Mike Margaria, Tiziana Steffen, Bernhard Lero The Irish Software Engineering Research Centre Limerick Ireland Department of Service and Software Engineering University of Potsdam Potsdam Germany Department of Programming Systems TU Dortmund Dortmund Germany

来源：评论

学校读者我要写书评

暂无评论

Formal specification of the semantics of control state diagrams 1

引用

6th International Conference on ABZ Conference on ASM, Alloy, B, TLA, VDM, and Z, ABZ 2018

作者： Leitz, Markus Raschke, Alexander Institute of Software Engineering and Programming Languages Ulm University Ulm Germany

ISBN: (数字)9783319912714

ISBN: (纸本)9783319912707

Control State Diagrams (CSD) are a graphical representation of Control State Abstract State Machines, a subclass of Abstract State Machines (ASM). We extend the existing semi-formal specification of this diagram type by a concrete syntax and its formal semantics. The semantics is given by a translation approach that transforms combinations of nodes into ASM snippets which are inserted into a textual ASM. This node-by-node translation is not only the basis for a code generation tool, but it also allows users to capture the behavior of a CSD more easily. © Springer International Publishing AG, part of Springer Nature 2018.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Efficient profile routing for electric vehicles

Efficient profile routing for electric vehicles

引用

1st International Conference on Internet of Vehicles, IOV 2014

作者： Schönfelder, René Leucker, Martin Walther, Sebastian Institute for Software Engineering and Programming Languages University of Lübeck Germany

ISBN: (纸本)9783319111667

This paper introduces a powerful, efficient and generic framework for optimal routing of electric vehicles in the setting of flexible edge cost functions and arbitrary initial states. More precisely, the introduced state-based routing problem is a consolidated model covering energy-efficiency and time-dependency. Given two vertices and an initial state the routing problem is to find optimal paths yielding minimal final states, while the profile routing problem is to find optimal paths for all initial states. A universal method for applying shortest path techniques to profile routing is developed. To show the genericity and efficiency of this approach it is instantiated for two typical shortest path algorithms, namely for A*and Contraction Hierarchies. Especially using the latter, a highly efficient solution for energy-efficient profile routing is obtained. © 2014 Springer International Publishing Switzerland.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：