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

2018 International Conference on Information and Telecommunication Technologies and Radio Electronics, UkrMiCo 2018

作者： Goriushkina, A.E. Svyd, I.V. Zavolodko, G.E. Maistrenko, G.V. National Technical University KhPI NTU KhPI Department of Computer Science and Programming Kharkiv Ukraine Kharkiv National University of Radio Electronics KNURE Dept. Radiotechnologies Information and Communication Systems Kharkiv Ukraine National Technical University KhPI NTU KhPI Department of Information Systems Kharkiv Ukraine Kharkiv National University of Radio Electronics KNURE Department of Electronic Computers Kharkiv Ukraine

ISBN: (纸本)9781538652640

In the paper, based on a comparative analysis of the methods of processing time-interval codes used as secondary surveillance radar information signals consisting of a different sequence of performing joint decoding operations, selecting signals by duration and time position, it is shown that the most effective is the signal processing method in which first the signals are decoded, then the signals are selected in accordance with the duration and in the future with the selection according to the time position, which provides the lowest probability of a false alarm of the first kind. © 2018 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Lemma functions for frama-C: C programs as proofs

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

MAPA: An Automatic Memory Access Pattern Analyzer for GPU Applications

引用

ACM SIGPLAN Notices 2017年第8期52卷 443-444页

作者： Jo, Gangwon Jung, Jaehoon Park, Jiyoung Lee, Jaejin Center for Manycore Programming Department of Computer Science and Engineering Seoul National University Seoul08826 Korea Republic of

Various existing optimization and memory consistency management techniques for GPU applications rely on memory access patterns of kernels. However, they suffer from poor practicality because they require explicit user interventions to extract kernel memory access patterns. This paper proposes an automatic memory-access-pattern analysis framework called MAPA. MAPA is based on a source-level analysis technique derived from traditional symbolic analyses and a run-time pattern selection technique. The experimental results show that MAPA properly analyzes 116 real-world OpenCL kernels from Rodinia and Parboil. © 2017 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Impact of fluctuation interferences to the responders performance of secondary surveillance radar system

Impact of fluctuation interferences to the responders perfor...

引用

International Conference on Radio Electronics & Info Communications (UkrMiCo)

作者： I.V. Svyd A.E. Goriushkina G.E. Zavolodko O.S. Maltsev Dept. Radiotechnologies Information and Communication Systems Kharkiv National University of Radio Electronics KNURE Kharkiv Ukraine Department of Computer science and Programming National Technical University «KhPI» NTU «KhPI» Kharkiv Ukraine Department of Information Systems National Technical University «KhPI» NTU «KhPI» Kharkiv Ukraine

ISBN: (数字)9781538652640

ISBN: (纸本)9781538652657

The principle of network construction and the principle of request signals service of Secondary surveillance radar systems predetermined the work of the respondents of the considered systems in conditions of intra-system and intentional correlated and uncorrelated interferences. The article estimates the impact of masking fluctuation interferences on the quality of the request signals detection. It is shown that the choice of time-interval codes as the request signals predetermined the low noise immunity of the considered systems when a channel is exposed by the fluctuation interference.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Method for calculating of R-learning traffic peakedness 4

Method for calculating of R-learning traffic peakedness

引用

4th International Scientific-Practical Conference Problems of Infocommunications science and Technology, PIC S and T 2017

作者： Kuchuk, Nina Mozhaiev, Oleksandr Mozhaiev, Mykhailo Kuchuk, Heorgii Department of Computer Science Faculty V.N. Karazin Kharkiv National University Kharkiv Ukraine Department of Information Technologies Kharkiv National University of Internal Affairs Kharkiv Ukraine Laboratory on Speech and Audio Computer Engineering and Telecommunication Kharkov SRI examinations named Dist. prof. N.S. Bokariusa Kharkiv Ukraine Department of Computer science and programming National Technical University Kharkiv Polytechnic Institute Kharkiv Ukraine

ISBN: (纸本)9781538609835

In this article e-leaming traffic which is served by system on the hyper convergent platform is considered. It was done the analysis of the known methods of determine the degree of pulsation of traffic. The method for calculating of e-learning traffic peakedness is proposed. Simulation and calculation results peakedness is analyzed. © 2017 IEEE.

关键词： E-learning

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis of signal processing methods secondary surveillance radar

Comparative analysis of signal processing methods secondary ...

引用

International Conference on Radio Electronics & Info Communications (UkrMiCo)

作者： A.E. Goriushkina I.V. Svyd G.E. Zavolodko G.V. Maistrenko Department of Computer science and Programming National Technical University «KhPI» NTU «KhPI» Kharkiv Ukraine Dept. Radiotechnologies Information and Communication Systems Kharkiv National University of Radio Electronics Kharkiv Ukraine Department of Information Systems National Technical University «KhPI» NTU «KhPI» Kharkiv Ukraine Department of Electronic Computers Kharkiv National University of Radio Electronics Kharkiv Ukraine

ISBN: (数字)9781538652640

ISBN: (纸本)9781538652657

关键词： Radar Interference Decoding Security Radar signal processing Surveillance

来源：评论

学校读者我要写书评

暂无评论

Method for calculating of R-learning traffic peakedness

Method for calculating of R-learning traffic peakedness

引用

International Scientific-Practical Conference Problems of Infocommunications science and Technology

作者： Nina Kuchuk Oleksandr Mozhaiev Mykhailo Mozhaiev Heorgii Kuchuk Department of Computer Science National University Kharkiv Ukraine Laboratory on Speech and Audio Computer Engineering and Telecommunication Kharkov SRI examinations named Dist. prof. N.S. Bokariusa Kharkiv Ukraine Department of Information Technologies Kharkiv National University of Internal Affairs Kharkiv Ukraine Department of Computer science and programming National Technical University “Kharkiv Polytechnic Institute” Kharkiv Ukraine

关键词： Wireless networks Economic indicators System implementation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：