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

arXiv 2018年

作者： Volkov, Grigoriy Mandrykin, Mikhail Efremov, Denis Faculty of Computer Science National Research University Higher School of Economics Moscow Russia Software Engineering Department Ivannikov Institute for System Programming Russian Academy of Sciences Moscow Russia

This paper describes the development of an auto-active verification technique in the Frama-C framework. We outline the lemma functions method and present the corresponding ACSL extension, its implementation in Frama-C, and evaluation on a set of string-manipulating functions from the Linux kernel. We illustrate the benefits our approach can bring concerning the effort required to prove lemmas, compared to the approach based on interactive provers such as Coq. Current limitations of the method and its implementation are discussed. Copyright © 2018, The Authors. All rights reserved.

关键词： Formal verification

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Application of Bipolar Fuzzy Sets in Planar Graphs

引用

International Journal of Applied and Computational Mathematics 2017年第2期3卷 773-785页

作者： Akram, Muhammad Samanta, Sovan Pal, Madhumangal Department of Mathematics University of the Punjab New Campus Lahore Pakistan Department of Mathematics JKHS Tamluk India Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore 721 102 India

A bipolar fuzzy set is a generalization of a fuzzy set. In this paper, we apply the concept of bipolar fuzzy sets to multigraphs and planar graphs. We introduce the notions of bipolar fuzzy multigraphs, bipolar fuzzy planar graphs, bipolar fuzzy dual graphs, and investigate some of their interesting properties. We also study isomorphism between bipolar fuzzy planar graphs. © 2016, Springer India Pvt. Ltd.

关键词： Bipolar fuzzy dual graphs Bipolar fuzzy graphs Bipolar fuzzy multigraphs Bipolar fuzzy planar graphs

来源：评论

学校读者我要写书评

暂无评论

Multi-item EPQ model with learning effect on imperfect production over fuzzy-random planning horizon

引用

Journal of Management Analytics 2017年第1期4卷 80-110页

作者： Amalesh Kumar Manna Barun Das Jayanta Kumar Dey Shyamal Kumar Mondal Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar UniversityMidnapore-721102WBIndia Department of Mathematics Sidho-Kanho-Birsha UniversityPuruliaWBIndia Department of Mathematics Mahishadal Raj CollegeMahishadal721628WBIndia

Uncertainty is certain in the world of *** study revisits an economic production quantity(EPQ)model with shortages for stock-dependent demand of the items with reworking and disposing of the imperfect ones over a random planning horizon under the joint effect of inflation and time value of money,where the expected time length is imprecise in *** of learning effect has been incorporated to reduce the defective *** total expected profit over the random planning horizon is maximized subject to the imprecise space *** possibility,necessity and credibility measures have been introduced to defuzzify the *** simulation-based genetic algorithm is used to make decision for the above EPQ model in different measures of *** model is illustrated through an *** analysis shows the impacts of different parameters on the objective function in the model.

关键词： imperfect production rework shortage learning effect random planning horizon genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Application of (α,β)-soft intersectional sets on BCK/BCI-algebras

引用

International Journal of Intelligent Systems Technologies and Applications 2017年第3期16卷 269-288页

作者： Jana, Chiranjibe Pal, Madhumangal Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore721102 India

In this paper, the notion of (α,β)-soft intersectional set is introduced and explained with some examples. Then, some properties of (α,β)-soft intersectional BCK/BCI-algebras and (α,β)-soft intersectional BCK/BCI-ideals are investigated. Strong (α,β)- soft intersectional BCI-algebra is defined on the basis of BCI-subalgebras. The concept of an (α,β)-intersectional t-support of a soft set is introduced and proposed a condition for an (α,β)- intersectional t-support to be a soft BCK/BCI-subalgebras and soft ideal of a BCK/BCI-algebras. Also, it is shown that the image and inverse image of a BCK/BCI-algebras are also (α,β)-soft intersectional BCK/BCI-algebras. Again, (α,β)-soft intersectional BCK/BCI-ideal is developed on the basis of a homomorphism of BCK/BCI-algebras. Copyright © 2017 Inderscience Enterprises Ltd.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Coordinating particle swarm optimization, ant colony optimization and k-opt algorithm for traveling salesman problem 3rd

Coordinating particle swarm optimization, ant colony optimiz...

引用

3rd International Conference on Mathematics and Computing, ICMC 2017

作者： Khan, Indadul Maiti, Manas Kumar Maiti, Manoranjan Department of Computer Science Chandrakon Vidyasagar Mahavidyalaya Paschim-Medinipur West Bengal721201 India Department of Mathematics Mahishadal Raj College Mahishadal Purba-MedinipurWest Bengal721628 India Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Paschim-Medinipur West Bengal India

ISBN: (纸本)9789811046414

In this paper combining the features of swap sequence and swap operation based Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO) and K-Opt operation a hybrid algorithm is proposed to solve well known Traveling Salesman Problem (TSP). Interchange of two cities of a path of a TSP is known as swap operation and a sequence of such operations is called swap sequence. Using swap operation and swap sequence PSO operations are redefined to solve TSP. Here ACO is used a small number of iterations to generate initial swarm of PSO. Then PSO operations are made on this swarm a sufficient number of times to find optimal path. During PSO iterations if a particle does not change its position for a predefined number of iterations then K-Opt operation is made on it a finite number of times to improve its position. The algorithm is tested with bench mark test problems from TSPLIB and it is observed that algorithm is more efficient with respect to accuracy as well as execution time to solve standard TSPs (Symmetric as well as Asymmetric) compared to existing algorithms. Details of the proposed algorithm along with swap operation, swap sequence and K-opt operation for the algorithm are elaborately discussed for the readers. © Springer Nature Singapore Pte Ltd. 2017.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

SPar: A DSL for High-Level and Productive Stream Parallelism

SPar: A DSL for High-Level and Productive Stream Parallelism

引用

作者： Griebler, Dalvan Danelutto, Marco Torquati, Massimo Fernandes, Luiz Gustavo Av. Ipiranga 6681 - Building 32 Porto Alegre - CEP90619-900 Brazil Department of Computer Science Parallel Programming Models Group Largo Pontecorvo 3 PISA56127 Italy

This paper introduces SPar, an internal C++ Domain-Specific Language (DSL) that supports the development of classic stream parallel applications. The DSL uses standard C++ attributes to introduce annotations tagging the notable components of stream parallel applications: stream sources and stream processing stages. A set of tools process SPar code (C++ annotated code using the SPar attributes) to generate FastFlow C++ code that exploits the stream parallelism denoted by SPar annotations while targeting shared memory multi-core architectures. We outline the main SPar features along with the main implementation techniques and tools. Also, we show the results of experiments assessing the feasibility of the entire approach as well as SPar's performance and expressiveness. © 2017 World Scientific Publishing Company.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Design of a low cost equipment that may limit Sudden Infant Death Syndrome 4

Design of a low cost equipment that may limit Sudden Infant ...

引用

4th International Conference on Advances in Biomedical Engineering, ICABME 2017

作者： Daou, Roy Abi Zeid Maalouf, Frederic Geagea, Christian Hayek, Ali Boercsoek, Josef Lebanese German University Faculty of Public Health Biomedical Technologies Department Sahel-Alma Lebanon MART Learning Education and Research Center Chananiir Lebanon Department of Computer Architecture and System Programming University of Kassel Kassel Germany

ISBN: (纸本)9781538616420

This paper deals with the Sudden Infant Death Syndrome (SIDS) problem. The main objective is to limit it by controlling the main reasons that may lead to it. Sudden infant death syndrome is the death without specific reason of a healthy newborn, usually during sleep. Although the causes are unknown, SIDS may be related to abnormalities in the infant's brain that controls breathing and arousal from sleep. Researchers have identified several measures that increase the risk on their babies. Thus, this paper proposes a low cost system that may help in monitoring the baby vital signs responsible for the SIDS and sending notifications to parents when abnormalities are encountered. The system is based on a microcontroller that regroups all sensors' outputs and a mobile application that displays these values, controls the video coming from a camera and send notifications in case of abnormal signals. The system was tested over 10 newborns (between 1 month and 2 years) over 3 weeks and the alarms were going well. © 2017 IEEE.

关键词： Alarm systems

来源：评论

学校读者我要写书评

暂无评论

Forming the logical conclusion about sufficiency of information of software requirements specification for software quality assessment by ISO 25010:2011

Forming the logical conclusion about sufficiency of informat...

引用

IEEE Ukraine Conference on Electrical and computer Engineering (UKRCON)

作者： Tetiana Hovorushchenko Computer Engineering & System Programming Department Khmelnitsky National University Khmelnitsky Ukraine

The aim of this study is the development of the method of generating and filling the template of ontology for the quality of the concrete software and method of forming the logical conclusion about the sufficiency of information of software requirements specification (SRS) for software quality assessment (by ISO 25010:2011). The first time proposed method of generating and filling the template of ontology for the quality of the concrete software leaves in the relevant ontology only measures, which are available in the SRS for the concrete software. It provides forming the ontology for the quality of the concrete software. The first time developed method of forming the logical conclusion about the sufficiency of the SRS information for software quality assessment provides the conclusion about the sufficiency or insufficiency of the SRS information for software quality assessment by ISO 25010:2011. If the SRS information is insufficient, this method: provides the conclusion for which characteristics and sub-characteristics the information is insufficient; creates the sorted list of missing measures as the recommended priority of their addition in the SRS; evaluates the veracity of software quality assessment based on the available in the SRS measures.

关键词： Software quality Ontologies Software measurement Concrete ISO Standards

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：