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

46th International conference on current trends in theory and practice of Informatics (SOFSEM)

作者： Castellano, Giovanna Castiello, Ciro Mencar, Corrado Vessio, Gennaro Univ Bari Dept Comp Sci Bari Italy

ISBN: (纸本)9783030389192;9783030389185

In this paper, we propose a novel crowd detection method for drone safe landing, based on an extremely light and fast fully convolutional neural network. Such a computer vision application takes advantage of the technical tools some commercial drones are equipped with. the proposed architecture is based on a two-loss model in which the main classification task, aimed at distinguishing between crowded and non-crowded scenes, is simultaneously assisted by a regression task, aimed at people counting. In addition, the proposed method provides class activation heatmaps, useful to semantically augment the flight maps. To evaluate the effectiveness of the proposed approach, we used the challenging VisDrone dataset, characterized by a very large variety of locations, environments, lighting conditions, and so on. the model developed by the proposed two-loss deep architecture achieves good values of prediction accuracy and average precision, outperforming models developed by a similar one-loss architecture and a more classic scheme based on MobileNet. Moreover, by lowering the confidence threshold, the network achieves very high recall, without sacrificing too much precision. the method also compares favorably with the state-of-the-art, providing an effective and efficient tool for several safe drone applications.

关键词： Unmanned aerial vehicles Crowd detection Public safety Safe landing computer vision Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

SOFSEM 2000: theory and practice of Informatics 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Václav Hlaváč Keith G. Jeffery Jiří Wiedermann

ISBN: (数字)9783540444114

ISBN: (纸本)9783540413486

the international conference on current trends in the theory and practice of informatics SOFSEM 2000 was held 25 November–2 December 2000 in the c- ference facilities of the Dev?et Skal (Nine Rocks) Hotel, Milovy, Czech-Moravian Highlands, the Czech Republic. It was already the 27th annual meeting in the series of SOFSEM conferences organized in either the Czech or the Slovak Rep- lic. Since its establishment in 1974, SOFSEM has gone through a long dev- opment in parallel with the entire ?eld of informatics. currently SOFSEM is a wide-scope, multidisciplinary conference, with stress on the interplay between the theory and practice of informatics. the SOFSEM scienti?c program consists mainly of invited talks which determine the topics of the conference. Invited talks are complemented by short refereed talks contributed by SOFSEM parti- pants. the topics of invited talks are chosen so as to cover the span from theory to practice and to bring interesting research areas to the attention of conf- ence participants. For the year 2000, the following three streams were chosen for presentation by the SOFSEM Steering Committee: – trends in Algorithmics – Information Technologies in practice – Computational Perception the above streams were covered through 16 invited talks given by prominent researchers. there were 18 contributed talks also presented, chosen by the int- national Program Committee from among 36 submitted papers. the program also included a panel on lessons learned from the Y2K problem.

关键词： theory of Computation Software Engineering/Programming and Operating Systems Artificial Intelligence Information Storage and Retrieval computer Communication Networks

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2009年 5404 LNCS卷 v-vi页

作者： Nielsen, Mogens Kučera, Antonín Miltersen, Peter Bro Palamidessi, Catuscia Tůma, Petr University of Aarhus Aarhus Graduate School of Science Ny Munkegade Bldg 1521-110 DK-8000 Aarhus C Denmark Masaryk University Department of Informatics Botanická 68a 60200 Brno Czech Republic University of Aarhus Department of Computer Science IT-parken Aabogade 34 DK-8200 Aarhus N Denmark Frank Valencia Ecole Polytechnique Rue de Saclay 91128 Palaiseau Cedex France Charles University Departmetn of Mathematics and Physics Malostranské náměstí 25 118 00 Prague 1 Malá Strana Czech Republic

来源：评论

学校读者我要写书评

暂无评论

How to employ reverse search in distributed single source shortest paths 28th

引用

28th International conference on current trends in theory and practice of Informatics, SOFSEM 2001

作者： Brim, Luboš Černá, Ivana Krčál, Pavel Pelánek, Radek Department of Computer Science Masaryk University Brno Czech Republic

ISBN: (纸本)9783540429128

A distributed algorithm for the single source shortest path problem for directed graphs with arbitrary edge lengths is proposed. the new algorithm is basedon relaxations anduses reverse search for inspecting edges and thus avoids using any additional data structures. At the same time the algorithm uses a novel way to recognize a reachable negative-length cycle in the graph which facilitates the scalability of the algorithm. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Bounding Lamport’s bakery algorithm 28th

引用

28th International conference on current trends in theory and practice of Informatics, SOFSEM 2001

作者： Jayanti, Prasad Tan, King Friedland, Gregory Katz, Amir 6211 Sudikoff Lab for Computer Science Dartmouth College HanoverNH03755 United States

ISBN: (纸本)9783540429128

Lamport’s Bakery algorithm is among the best known mutual exclusion algorithms. A drawback of Lamport’s algorithm is that it requires unbounded registers for communication among processes. By making a small modification to Lamport’s algorithm, we remove the need for unbounded registers. the main appeal of our algorithm lies in the fact that it overcomes a drawback of a famous algorithm while preserving its elegance. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

the Complexity of Online Graph Games 49th

The Complexity of Online Graph Games

引用

49th International conference on current trends in theory and practice of computer science (SOFSEM)

作者： Fuchs, Janosch Gruene, Christoph Janssen, Tom Rhein Westfal TH Aachen Dept Comp Sci Aachen Germany

ISBN: (纸本)9783031521126;9783031521133

Online computation is a concept to model uncertainty where not all information on a problem instance is known in advance. An online algorithm receives requests which reveal the instance piecewise and has to respond with irrevocable decisions. Often, an adversary is assumed that constructs the instance knowing the deterministic behavior of the algorithm. thus, the adversary is able to tailor the input to any online algorithm. From a game theoretical point of view, the adversary and the online algorithm are players in an asymmetric two-player game. To overcome this asymmetry, the online algorithm is equipped with an isomorphic copy of the graph, which is referred to as unlabeled map. By applying the game theoretical perspective on online graph problems, where the solution is a subset of the vertices, we analyze the complexity of these online vertex subset games. For this, we introduce a framework for reducing online vertex subset games from TQBF. this framework is based on gadget reductions from 3-SATISFIABILITY to the corresponding offline problem. We further identify a set of rules for extending the 3-SATISFIABILITY-reduction and provide schemes for additional gadgets which assure that these rules are fulfilled. By extending the gadget reduction of the vertex subset problem with these additional gadgets, we obtain a reduction for the corresponding online vertex subset game. At last, we provide example reductions for online vertex subset games based on VERTEX COVER, INDEPENDENT SET, and DOMINATING SET, proving that they are PSPACE-complete. thus, this paper establishes that the online version with a map of NP-complete vertex subset problems form a large class of PSPACE-complete problems.

关键词： Online Algorithms Computational Complexity Online Algorithms Complexity Two-Player Games NP-complete Graph Problems PSPACE-completeness Gadget Reduction

来源：评论

学校读者我要写书评

暂无评论

CPSO based optimization in multiphase homing trajectory of powered parafoils with insufficient altitude 35

CPSO based optimization in multiphase homing trajectory of p...

引用

第35届中国控制会议

作者： TAO Jin SUN Qinglin LUO Shuzhen LIANG Wei CHEN Zengqiang College of Computer and Control Engineering Nankai University

ISBN: (纸本)9781509009107

In order to realize safe and accurate homing of powered parafoils with insufficient altitude,a multiphase homing trajectory planning scheme is proposed making use of basic flight characteristics of powered *** the basis of geometric relationships of each phase trajectory,the problem of trajectory planning is transformed to a parameters optimizing ***,a new particle swarm optimization（PSO） algorithm based on chaos searching（CPSO） is proposed,of which global searching ability and the speed of convergence is significantly ***,CPSO is applied as a tool to optimize the established objective function,and the designed parameters of the multiphase homing trajectory are *** simulation results show that the multiphase homing trajectory of powered parafoils can fulfill the requirements of fixed-point homing and upwind landing under the condition of insufficient initial altitude,which is simple in control and facile in practice as well.

关键词： Powered parafoil multiphase homing trajectory insufficient altitude CPSO

来源：评论

学校读者我要写书评

暂无评论

Idris 2: Quantitative type theory in practice 35

Idris 2: Quantitative type theory in practice

引用

35th European conference on Object-Oriented Programming, ECOOP 2021

作者： Brady, Edwin School of Computer Science University of St Andrews Scotland United Kingdom

ISBN: (纸本)9783959771900

Dependent types allow us to express precisely what a function is intended to do. Recent work on Quantitative Type theory (QTT) extends dependent type systems with linearity, also allowing precision in expressing when a function can run. this is promising, because it suggests the ability to design and reason about resource usage protocols, such as we might find in distributed and concurrent programming, where the state of a communication channel changes throughout program execution. As yet, however, there has not been a full-scale programming language with which to experiment with these ideas. Idris 2 is a new version of the dependently typed language Idris, with a new core language based on QTT, supporting linear and dependent types. In this paper, we introduce Idris 2, and describe how QTT has influenced its design. We give examples of the benefits of QTT in practice including: Expressing which data is erased at run time, at the type level;and, resource tracking in the type system leading to type-safe concurrent programming with session types. © 2021 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Mikhail Atallah Xiang-Yang Li Binhai Zhu

ISBN: (数字)9783642212048

ISBN: (纸本)9783642212031

this book constitutes the joint refereed proceedings of the 5th International Frontiers of Algorithmics Workshop, FAW 2011, and the 7th International conference on Algorithmic Aspects in Information and Management, AAIM 2011, jointly held in Jinhua, China, in May 2011. the 35 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 92 submissions. the papers cover a wide range of topics in the areas of algorithmics, combinatorial optimization and their applications presenting current trends of research.

关键词： Algorithm Analysis and Problem Complexity Discrete Mathematics in computer science Mathematics of Computing theory of Computation Management of Computing and Information Systems Data Structures

来源：评论

学校读者我要写书评

暂无评论

Some afterthoughts on hopfield networks 26th

Some afterthoughts on hopfield networks

引用

26th conference on current trends in theory and practice of Informatics, SOFSEM 1999

作者： Šíma, Jiří Orponen, Pekka Antti-Poika, Teemu Institute of Computer Science Academy of Sciences of the Czech Republic Pod vodárenskou věží 2 Prague 8182 07 Czech Republic Department of Mathematics University of Jyvaskyla P.O. Box 35 JyvaskylaFIN-40351 Finland

ISBN: (纸本)354066694X

In the present paper we investigate four relatively independent issues, which complete our knowledge regarding the computational aspects of popular Hopfield nets. In Section 2 of the paper, the computational equivalence of convergent asymmetric and Hopfield nets is shown with respect to network size. In Section 3, the convergence time of Hopfield nets is analyzed in terms of bit representations. In Section 4, a polynomial time approximate algorithm for the minimum energy problem is shown. In Section 5, the Turing universality of analog Hopfield nets is studied. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：