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

Application of an online judge and contester system in academic tuition

6th International Conference on Advances in Web Based Learning, ICWL 2007

作者： Kosowski, Adrian Malafiejski, Michal Noiński, Tomasz Department of Algorithms and System Modeling Gdańsk University of Technology Narutowicza 11/12 Gdańsk 80-952 Poland Computer Architecture Department Gdańsk University of Technology Narutowicza 11/12 Gdańsk 80-952 Poland

ISBN: (纸本)3540781382

The paper contains a description of the SPOJ online judge and contester system, used for E-Learning of programming, which has been successfully applied in the tuition of students at the Gdańsk University of Technology. We study the implementation of the system with security demands and present our experiences connected with the use of such systems in academic courses at an undergraduate and graduate level in the last four years. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： E-learning

来源：评论

学校读者我要写书评

暂无评论

Distributed largest-first algorithm for graph coloring

引用

10th International European Conference on Parallel Processing, Euro-Par 2004

作者： Hansen, Jennie Kubale, Marek Kuszner, Lukasz Nadolski, Adam Department of Actuarial Mathematics and Statistics Heriot-Watt University EdinburghEH14 4AS United Kingdom Department of Algorithms and System Modeling Gdańsk University of Technology Narutowicza 11/12 Gdańsk80-952 Poland

ISBN: (纸本)3540229248

In the paper we present a distributed probabilistic algorithm for coloring the vertices of a graph. Since this algorithm resembles a largest-first strategy, we call it the distributed LF (DLF) algorithm. The coloring obtained by DLF is optimal or near optimal for numerous classes of graphs e.g. complete k-partite, caterpillars, crowns, bipartite wheels. We also show that DLF runs in O(Δ2 log n) rounds for an arbitrary graph, where n is the number of vertices and Δ denotes the largest vertex degree. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Application of genetic algorithms in graph searching problem

Application of genetic algorithms in graph searching problem

引用

International Conference on Information Technology (ICIT)

作者： Lukasz Wrona Bartosz Jaworski Department of Algorithms and System Modeling Gdansk University of Technology Gdansk Poland Control Engineering Department Gdansk University of Technology Gdansk Poland

Graph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in an environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called the (edge) search strategy. Unfortunately calculating both the optimal search strategy and the search number is NP-hard for general graphs. Furthermore, due to the complexity of the pursuit rules, the application of heuristic solutions is not straightforward. In this paper we suggest a method of applying genetic algorithms to solve graph searching problem. The idea is based on LaPaugh's result on graph searching monotonicity and utilizes representation of a search strategy as a permutation of edges.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Generalized measurements on qubits in quantum randomness certification and expansion

arXiv

引用

arXiv 2024年

作者： Mironowicz, Piotr Grünfeld, Marcus Bourennane, Mohamed Department of Physics Stockholm University StockholmS-10691 Sweden Department of Algorithms and System Modeling Faculty of Electronics Telecommunications and Informatics Gdańsk University of Technology Poland

Quantum mechanics has greatly impacted our understanding of the microscopic nature. One of the key concepts of this theory is generalized measurements, which have proven useful in various quantum information processing tasks. However, despite their significance, they have not yet been shown empirically to provide an advantage in quantum randomness certification and expansion protocols. This investigation explores scenarios where generalized measurements can yield more than one bit of certified randomness with a single qubit system measurement on untrusted devices and against a quantum adversary. We compare the robustness of several protocols to exhibit the advantage of exploiting generalized measurements. In our analysis of experimental data, we were able to obtain 1.21 bits of min-entropy from a measurement taken on one qubit of an entangled state. We also obtained 1.07 bits of min-entropy from an experiment with quantum state preparation and generalized measurement on a single qubit. We also provide finite data analysis for a protocol using generalized measurements and the Entropy Accumulation Theorem. Our exploration demonstrates the potential of generalized measurements to improve the certification of quantum sources of randomness and enhance the security of quantum cryptographic protocols and other areas of quantum information. Copyright © 2024, The Authors. All rights reserved.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Optimization of experimental quantum randomness expansion

arXiv

引用

arXiv 2024年

作者： Piveteau, Amelie Seguinard, Alban Mironowicz, Piotr Bourennane, Mohamed Department of Physics Stockholm University StockholmS-10691 Sweden Department of Algorithms and System Modeling Faculty of Electronics Telecommunications and Informatics Gdańsk University of Technology Poland

Quantum technologies provide many applications for information processing tasks that are impossible to realize within classical physics. These capabilities include such fundamental resources as generating secure, i.e. private and unpredictable random values. Yet, the problem of quantifying the amount of generated randomness is still not fully solved. This work presents a comprehensive analysis of the design and performance optimization of a Quantum Random Number Generator (QRNG) based on Bell inequality violations. We investigate key protocol parameters, including the smoothing parameter (ϵs), test round probability (γ), and switching delays, and their effects on the generation rate and quality of randomness. We identify optimal ranges for γ and pΩ (the protocol’s non-aborting probability) to balance the trade-off between randomness consumption and net randomness generation. Additionally, we explore the impact of switching delays on the system’s performance, providing strategies to mitigate these effects. Our results indicate substantial developments in QRNG implementations and offer higher randomness expansion rates. The work provides practical guidelines for the efficient and secure design of QRNG systems and other cryptographic protocols. Copyright © 2024, The Authors. All rights reserved.

关键词： Random number generation

来源：评论

学校读者我要写书评

暂无评论

On symmetries of non-plane trees in a non-uniform model 14

On symmetries of non-plane trees in a non-uniform model

引用

14th Workshop on Analytic Algorithmics and Combinatorics 2017, ANALCO 2017

作者： Cichoń, Jacek Magnery, Abram Szpankowskiz, Wojciech Turowskix, Krzysztof Department of Computer Science Faculty of Fundamental Problems of Technology Wroclaw University of Science and Technology Wroclaw Poland Coordinated Science Lab. Univ. of Illinois at Urbana-Champaign UrbanaIL United States Dept. of Algorithms and System Modeling Gdańsk University of Technology Gdansk Poland Department of Computer Science Purdue University IN47907 United States

ISBN: (纸本)9781611974775

Binary trees come in two varieties: plane trees, often simply called binary trees, and non-plane trees, in which the order of subtrees does not matter. Nonplane trees find many applications;for example in modeling epidemics, in studying phylogenetic trees, and as models in data compression. While binary trees have been studied very extensively, non-plane trees still pose some challenges. Moreover, in most analyses a uniform probabilistic model is assumed;that is, a tree is selected uniformly from among all trees. Such a model limits significantly applications of the analysis. In this paper we study by analytic techniques non-plane trees in a non-uniform model. In our model, we grow the tree on n leaves by selecting randomly a leaf and appending two children to it. We can show that this is equivalent to an alternative model, also used to analyze the averagecase performance of binary search trees, that is more easily amenable to study by recurrences and generating functions. Here, one of the most important questions is the number of symmetries in such trees (i.e., the number of internal nodes with two isomorphic subtrees), or the sizes of such symmetric subtrees. We first present a functional-differential equation characterizing tree symmetries, and then analyze it. In this conference paper we focus on the expected number of symmetries, the size of symmetric subtrees, and the tree entropy. © Copyright by SIAM.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

The Game Chromatic Number of Complete Multipartite Graphs with No Singletons

arXiv

引用

arXiv 2023年

作者： Obszarski, Pawel Turowski, Krzysztof Zięba, Hubert Department of Algorithms and System Modeling Gdansk University of Technology Gdańsk80-233 Poland Theoretical Computer Science Department Jagiellonian University Kraków30-348 Poland

In this paper we investigate the game chromatic number for complete multipartite graphs, an important class of dense graphs. Several strategies for Alice and one strategy for Bob are proposed. We prove their optimality for all complete multipartite graphs with no singletons, which is a step us very close to a solution for all complete multipartite graphs. The strategies presented are computable in linear time, and the values of the game chromatic number depend directly only on the number and the sizes of sets in the partition. © 2023, CC BY.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Connections between Mutually Unbiased Bases and Quantum Random Access Codes

引用

Physical Review Letters 2018年第5期121卷 050501-050501页

作者： Edgar A. Aguilar Jakub J. Borkała Piotr Mironowicz Marcin Pawłowski Institute of Theoretical Physics and Astrophysics National Quantum Information Center Faculty of Mathematics Physics and Informatics 80-308 Gdansk Poland Department of Algorithms and System Modeling Faculty of Electronics Telecommunications and Informatics Gdańsk University of Technology Gdańsk 80-233 Poland

We present a new quantum communication complexity protocol, the promise-quantum random access code, which allows us to introduce a new measure of unbiasedness for bases of Hilbert spaces. The proposed measure possesses a clear operational meaning and can be used to investigate whether a specific number of mutually unbiased bases exist in a given dimension by employing semidefinite programming techniques.

关键词： Quantum algorithms Quantum communication Quantum measurements Quantum protocols

来源：评论

学校读者我要写书评

暂无评论

Complementarity between entanglement-assisted and quantum distributed random access code

引用

Physical Review A 2017年第5期95卷 052345-052345页

作者： Alley Hameedi Debashis Saha Piotr Mironowicz Marcin Pawłowski Mohamed Bourennane Department of Physics Stockholm University S-10691 Stockholm Sweden Institute of Theoretical Physics and Astrophysics University of Gdańsk 80-952 Gdańsk Poland Department of Algorithms and System Modeling Faculty of Electronics Telecommunications and Informatics Gdańsk University of Technology Gdańsk 80-233 Poland

Collaborative communication tasks such as random access codes (RACs) employing quantum resources have manifested great potential in enhancing information processing capabilities beyond the classical limitations. The two quantum variants of RACs, namely, quantum random access code (QRAC) and the entanglement-assisted random access code (EARAC), have demonstrated equal prowess for a number of tasks. However, there do exist specific cases where one outperforms the other. In this article, we study a family of 3→1 distributed RACs [J. Bowles, N. Brunner, and M. Pawłowski, Phys. Rev. A 92, 022351 (2015)] and present its general construction of both the QRAC and the EARAC. We demonstrate that, depending on the function of inputs that is sought, if QRAC achieves the maximal success probability then EARAC fails to do so and vice versa. Moreover, a tripartite Bell-type inequality associated with the EARAC variants reveals the genuine multipartite nonlocality exhibited by our protocol. We conclude with an experimental realization of the 3→1 distributed QRAC that achieves higher success probabilities than the maximum possible with EARACs for a number of tasks.

关键词： Quantum communication Quantum entanglement Quantum information processing

来源：评论

学校读者我要写书评

暂无评论

Quantum strategies for rendezvous and domination tasks on graphs with mobile agents

引用

Physical Review A 2024年第4期109卷 042201-042201页

作者： Giuseppe Viola Piotr Mironowicz International Centre for Theory of Quantum Technologies University of Gdańsk Wita Stwosza 63 80-308 Gdańsk Poland Department of Physics Stockholm University S-10691 Stockholm Sweden Department of Algorithms and System Modeling Faculty of Electronics Telecommunications and Informatics Gdańsk University of Technology 80-308 Gdańsk Poland

This paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph domination problem. Through an investigation across various graph scenarios, we showcase the quantum advantage. Additionally, we scrutinize deterministic strategies, highlighting their comparatively lower efficiency compared to quantum strategies. The paper concludes with a numerical analysis, providing further insights into our findings.

关键词： Quantum communication Quantum computation Quantum information processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：