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

International Scientific and Technical Conference on computer Science and Information Technologies

作者： George Markowsky Oleg Savenko Anatoliy Sachenko Department of Computer Science Missouri University of Science and Technology Rolla USA Department of Computer Engineering and System Programming Khmelnytsky National University Khmelnytsky Ukraine Department of Informatics Kazimierz Pulaski University of Technology and Humanities in Radom Radom Poland

The paper proposes the architecture of distributed multilevel detection system of malicious software in local area networks. Its feature is the synthesis of its requirements of distribution, decentralization, multilevel. This allows you to use it autonomously. In addition, the feature of autonomous program modules of the system is the same organization, which allows the exchange of knowledge in the middle of the system, which, unlike the known systems, allows you to use the knowledge gained by separate parts of the system in other parts. The developed system allows to fill it with subsystems of detection of various types of malicious software in local area networks.

关键词： Architecture Distributed system Malware Local area networks

来源：评论

学校读者我要写书评

暂无评论

Couette-Poiseuille flow based non-linear flow over a square cylinder near plane wall

Couette-Poiseuille flow based non-linear flow over a square ...

引用

作者： Bhatt, Rajesh Maiti, Dilip K. Alam, Md. Mahbub Rehman, S. Institute for Turbulence-Noise-Vibration Interaction and Control Shenzhen Graduate School Harbin Institute of Technology Shenzhen China Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapur721102 India Center for Engineering Research Research Institute King Fahd University of Petroleum and Minerals Dhahran31261 Saudi Arabia

A numerical study on the flow over a square cylinder in the vicinity of a wall is conducted for different Couette-Poiseuille-based non-uniform flow with the non-dimensional pressure gradient P varying from 0 to 5. The nondimensional gap ratio L (=H /a ) is changed from 0.1 to 2, where H is gap height between the cylinder and wall, and a is the cylinder width. The governing equations are solved numerically through finite volume method based on SIMPLE algorithm on a staggered grid system. Both P and L have a substantial influence on the flow structure, time-mean drag coefficient CD, fluctuating (rms) lift coefficient (C′L), and Strouhal number St. The changes in P and L leads to four distinct flow regimes (I, II, III and IV). Following the flow structure change, the CD , C′L, and St all vary greatly with the change in L and/or P. The CD and C′L both grow with increasing P and/or L. The St increases with P for a given L, being less sensitive to L for a smaller P ( 2). A strong relationship is observed between the flow regimes and the values of CD , CL and St. An increase in P affects the pressure distribution more on the top surface than on bottom surface while an increase in L does the opposite. © 2018 Techno-Press, Ltd.

关键词： Flow structure

来源：评论

学校读者我要写书评

暂无评论

Effects on prey-predator with different functional responses

引用

International Journal of Biomathematics 2017年第8期10卷 141-162页

作者： Banani Roy Sankar Kumar Roy M. H. A. Biswas Department of Applied Mathematicswith Oceanology and Computer Programming Vidyasagar University Midnapore 721102 West Bengal India Mathematics Discipline Science Engineering and Technology SchoolKhulna University Khulna 9208 Bangladesh

In this paper, we investigate the effects on prey of two predators which are also related in terms of prey-predator relationship. Different types of functional responses are con- sidered to formulate the mathematical model for predator and generalist predator of our proposed model. Harvesting effort for the generalist predator is considered and the density-dependent mortality rate for predator and generalist predator is incorporated in our proposed model. Local stability as well as global stability for the system is dis- cussed. We analyze the different bifurcation parameters to evaluate Hopf bifurcation in the neighborhood of interior equilibrium point. Finally, some numerical simulations and graphical figures are provided to verify our analytical results with the help of different sets of parameters.

关键词： Prey-predator model local and global stabilities Hopf bifurcation.

来源：评论

学校读者我要写书评

暂无评论

Correction to: A new cognitive clock matching phenotypic and epigenetic ages

引用

Translational psychiatry 2022年第1期12卷 452页

作者： M I Krivonosov E V Kondakova N A Bulanov S A Polevaya C Franceschi M V Ivanchenko M V Vedunova Institute of Biology and Biomedicine Department of Neurotechnology N. I. Lobachevsky State University Nizhny Novgorod Russia. krivonosov@itmm.unn.ru. Institute of Information Technology Mathematics and Mechanics Department of Applied Mathematics N. I. Lobachevsky State University Nizhny Novgorod Russia. krivonosov@itmm.unn.ru. Research Center for Trusted Artificial Intelligence The Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow 109004 Russia. krivonosov@itmm.unn.ru. Research Center for Trusted Artificial Intelligence The Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow 109004 Russia. Institute of Biology and Biomedicine Department of Basic and Medical Genetics N. I. Lobachevsky State University Nizhny Novgorod Russia. Faculty of Computer Science School of Data Analysis and Artificial Intelligence HSE University Moscow Russia. Faculty of Social Sciences Department of Psychophysiology N. I. Lobachevsky State University Nizhny Novgorod Russia. Institute of Information Technology Mathematics and Mechanics Department of Applied Mathematics N. I. Lobachevsky State University Nizhny Novgorod Russia. Department of Experimental Diagnostic and Specialty Medicine (DIMES) University of Bologna Bologna Italy.

来源：评论

学校读者我要写书评

暂无评论

An investigation of technical debt in automatic production systems 17

An investigation of technical debt in automatic production s...

引用

2017 XP Scientific Workshops, XP 2017

作者： Besker, Terese Martini, Antonio Bosch, Jan Tichy, Matthias Chalmers University of Technology Computer Science and Engineering Gothenburg Sweden Ulm University Institute of Software Engineering and Programming Languages Ulm Germany

ISBN: (纸本)9781450352642

Technical Debt is a recent concept, borrowed from the financial domain. It has been recently used in software development to describe technical sub-optimal solutions that have short-term benefits but long-term extra-costs. However, no body of literature investigates how Automatic Production Systems companies deal with Technical Debt. We investigated how Technical Debt is known, how much it hurts and how is managed in an automatic production systems company. Results from one in-depth investigation show that the automatic production systems company spend quite a lot of resources because of Technical Debt, both in the extra-costs (interest) and in its management. The company presents moderate awareness of what Technical Debt is and how much is present in its systems. However, the tracking level is quite low. We, therefore, claim that Technical Debt needs more research in this domain, as it is a source of substantial extracosts and the current practices to manage it are not suitable. © 2017 Association for Computing Machinery.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

L(0, 1)-Labelling of Trapezoid Graphs

引用

International Journal of Applied and Computational Mathematics 2017年第1期3卷 599-610页

作者： Paul, Satyabrata Pal, Madhumangal Pal, Anita Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore 721102 India Department of Mathematics National Institute of Technology Durgapur Durgapur 713209 India

L(0, 1)-labelling of a graph G= (V, E) is a function f from the vertex set V(G) to the set of non-negative integers such that adjacent vertices get number zero apart, and vertices at distance two get distinct numbers. The L(0, 1)-labelling number denoted by λ _{0 , 1} (G) of G is the minimum range of labels over all such labelling. In this article, it is shown that, for a trapezoid graph G with maximum vertex degree Δ , the upper bound of λ _{0 , 1} (G) is Δ - 1. © 2017, Springer (India) Private Ltd.

关键词： Frequency assignment L(0 , 1) -labelling Trapezoid graphs

来源：评论

学校读者我要写书评

暂无评论

Scheduling Algorithm to Select Optimal Programme Slots in Television Channels: A Graph Theoretic Approach

引用

International Journal of Applied and Computational Mathematics 2017年第3期3卷 1931-1950页

作者： Pal, Madhumangal Pal, Anita Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore 721 102 India Department of Mathematics National Institute of Technology Durgapur Mahatma Gandhi Avenue Durgapur 713 209 West Bengal India

In this paper, it is shown that all programmes of all television channels can be modelled as an interval graph. The programme slots are taken as the vertices of the graph and if the time duration of two programme slots have non-empty intersection, the corresponding vertices are considered to be connected by an edge. The number of viewers of a programme is taken as the weight of the vertex. A set of programmes that are mutually exclusive in respect of time scheduling is called a session. We assume that a company sets the objective of selecting the popular programmes in k parallel sessions among different channels so as to make its commercial advertisement reach the maximum number of viewers, that is, a company selects k suitable programme slots simultaneously for advertisement. The aim of the paper is, therefore, to help the companies to select the programme slots, which are mutually exclusive with respect to the time schedule of telecasting time, in such a way that the total number of viewers of the selected programme in k parallel slots rises to the optimum level. It is shown that the solution of this problem is obtained by solving the maximum weight k-colouring problem on an interval graph. An algorithm is designed to solve this just-in-time optimization problem using O(kMn ² ) time, where n and M represent the total number of programmes of all channels and the upper bound of the viewers of all programmes of all channels respectively. The problem considered in this paper is a daily life problem which is modeled by k-colouring problem on interval graph. © 2016, Springer India Pvt. Ltd.

关键词： Design and analysis of algorithms Graph colouring Graph theory Interval graphs Modelling

来源：评论

学校读者我要写书评

暂无评论

Evaluation of full-text retrieval system using collection of Serially Evolved Documents 17

Evaluation of full-text retrieval system using collection of...

引用

3rd International Conference on Industrial and Business Engineering, ICIBE 2017

作者： Cho, Hwan-Gue Kim, Yeoneo Tak, Hae-Sung Shin, Young-Ju Choi, Kwang-Nam Kim, Han-Ho Lim, Chulsu Dep. of Computer Sci. and Eng. PUSAN National Univ. Korea Republic of Programming Language Laboratory PUSAN National Univ. Korea Republic of Korea Institute of Science and Technology Information Korea Republic of

ISBN: (纸本)9781450353519

Finding a document that is similar to a specified query document within a large document database is one of important issues in the Big Data era, as most data available is in the form of unstructured texts. Our testing collection consists of two parts: In the first part texts were produced by human work by artificial plagiarism approach through the linear pipelined procedure. In the second part, texts are generated by software that inserts, deletes, and substitutes certain parts of the target documents to make a similar document from an input document. These document set is known as the Serially Evolved Documents (SED). We propose new methods: Order Preserving Precision (OPP) and Order Preserving Recall (OPR), to compute how the evolutionary order is kept among output documents obtained from the subject IR system. Using those testing texts we evaluated KONAN, a document retrieval system for Korean documents. © 2017 Association for Computing Machinery.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Reliable Code Generation and Test Environment demonstrated on a PI-Controller Design

引用

IFAC-PapersOnLine 2016年第3期49卷 465-470页

作者： Schwarz, M.H. Sheng, H. Üstoglu, I. Chabaan, W. Börcsök, J. Safety Computer Technology University of Kassel Germany Control and Automation Engineering Department Yildiz Technical University Istanbul Turkey Computer Architecture and System Programming University of Kassel Germany

This paper focuses on the latest version of a tool developed within the department to guide developer through the various steps of requirements, test-procedures and documentations to finally download the derived algorithm on a safety programmable logic controller (PLC). Requirements on how to develop and how to test software are steadily increasing due to international standards, which have to be obeyed in industries in general, and in the process- and automation industries in particular. A simple model is derived to be used to develop a PI controller that has to pass several steps to be qualified for execution on a PLC. The paper explains the different steps and describes the various problems that might occur. © 2016

关键词： Controllers Accident prevention Reliability Software testing Automated code generation Automation industry International standards P i controller designs PI control Programmable Logic Controller (PLC) Simple modeling Test Environment

来源：评论

学校读者我要写书评

暂无评论

The SCIP optimization suite 8.0

arXiv

引用

arXiv 2021年

作者： Bestuzheva, Ksenia Besançon, Mathieu Chen, Wei-Kun Chmiela, Antonia Donkiewicz, Tim Van Doornmalen, Jasper Eifler, Leon Gaul, Oliver Gamrath, Gerald Gleixner, Ambros Gottwald, Leona Graczyk, Christoph Halbig, Katrin Hoen, Alexander Hojny, Christopher Van Der Hulst, Rolf Koch, Thorsten Lübbecke, Marco Maher, Stephen J. Matter, Frederic Mühmer, Erik Müller, Benjamin Pfetsch, Marc E. Rehfeldt, Daniel Schlein, Steffan Schlösser, Franziska Serrano, Felipe Shinano, Yuji Sofranac, Boro Turner, Mark Vigerske, Stefan Wegscheider, Fabian Wellner, Philipp Weninger, Dieter Witzig, Jakob Zuse Institute Berlin Department AIS2T Takustr. 7 Berlin14195 Germany School of Mathematics and Statistics Beijing Institute of Technology Beijing100081 China RWTH Aachen University Lehrstuhl für Operations Research Kackertstr. 7 Aachen52072 Germany Technische Universiteit Eindhoven Department of Mathematics and Computer Science P.O. Box 513 Eindhoven5600 MB Netherlands I2DAMO GmbH Englerallee 19 Berlin14195 Germany Friedrich-Alexander Universität Erlangen-Nürnberg Department of Data Science Cauerstr. 11 Erlangen91058 Germany University of Twente Department of Discrete Mathematics and Mathematical Programming P.O. Box 217 Enschede7500 AE Netherlands Technische Universität Berlin Software and Algorithms for Discrete Optimization Straße des 17. Juni 135 Berlin10623 Germany Zuse Institute Berlin Department A2IM Takustr. 7 Berlin14195 Germany University of Exeter College of Engineering Mathematics and Physical Sciences Exeter United Kingdom Technische Universität Darmstadt Fachbereich Mathematik Dolivostr. 15 Darmstadt64293 Germany Technische Universität Berlin Straße des 17. Juni 135 Berlin10623 Germany Software and Algorithms for Discrete Optimization Institute of Mathematics Technische Universität Berlin Straße des 17. Juni 135 Berlin10623 Germany GAMS Software GmbH C/o Zuse Institute Berlin Department AIS2T Takustr. 7 Berlin14195 Germany

The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. This paper discusses enhancements and extensions contained in version 8.0 of the SCIP Optimization Suite. Major updates in SCIP include improvements in symmetry handling and decomposition algorithms, new cutting planes, a new plugin type for cut selection, and a complete rework of the way nonlinear constraints are handled. Additionally, SCIP 8.0 now supports interfaces for Julia as well as Matlab. Further, UG now includes a unified framework to parallelize all solvers, a utility to analyze computational experiments has been added to GCG, dual solutions can be postsolved by PaPILO, new heuristics and presolving methods were added to SCIP-SDP, and additional problem classes and major performance improvements are available in *** Codes 90C05, 90C10, 90C11, 90C30, 90C90, 65Y05 Copyright © 2021, The Authors. All rights reserved.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：