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

23rd Conference Information Technologies - Applications and Theory, ITAT 2023

作者： Eze, Leonard Chidiebere Jajcay, Robert Mihálová, Dominika Department of Algebra and Geometry Faculty of Mathematics Physics and Informatics Comenius University Mlynska Dolina Bratislava84248 Slovakia Department of Applied Informatics Faculty of Mathematics Physics and Informatics Comenius University Mlynska Dolina Bratislava84248 Slovakia

A (k, g)-graph Γ, k ≥ 2, g ≥ 3, is k-regular of girth g. We refer to the complete set of possible orders of connected (k, g)-graphs for each pair of parameters (k, g) as the spectrum of orders of (k, g)-graphs;or the (k, g)-spectrum. The smallest member of the (k, g)-spectrum is the order n(k, g) of a smallest (k, g)-graph;called a (k, g)-cage. Determining the complete spectrum of orders of connected (k, g)-graphs for a specific pair (k, g) is extremely difficult as it requires (among other things) determining the cage order n(k, g), which is a notoriously hard problem. This paper provides an algorithmic approach for producing (k, g)-graphs of larger orders from smaller (k, g)-graphs in a manner allowing for repeated applications. We use this approach to determine/estimate the smallest member N(k, g) of a (k, g)-spectrum having the property that starting from N(k, g) all (even;in case of odd k) n ≥ N(k, g) belong to the (k, g)-spectrum;i.e., for all (even) n ≥ N(k, g), there exists a (k, g)-graph of order n. © 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0). CEUR Workshop Proceedings (***)

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Fuzzy logic trigger in the distinction of Pierre Auger Observatory's signals from neutrino-induced showers - application and analysis in the study of ultra-high-energy cosmic rays 74

Fuzzy logic trigger in the distinction of Pierre Auger Obser...

引用

74th International Astronautical Congress, IAC 2023

作者： Pawlicki, Diana Stasiak, Krzysztof Szadkowski, Zbigniew Pytel, Krzysztof Faculty of Physics and Applied Informatics University of Lodz Pomorska 149/153 Lodz90-236 Poland

One of the most influential factors in space development is cosmic radiation and its detrimental effects on microelectronics and life outside of the protection of Earth's atmosphere. While most primary cosmic rays are ∼ 300 MeV protons, the energies of the most energetic ultra-high-energy cosmic rays (UHECR) have been observed to approach 3 · 1020 eV. The question of origin and precise composition of those is a subject of extensive studies, in which a crucial role is played by neutrinos due to lack of deviation by magnetic fields and thus the possibility of back-tracing to their original sources. This paper presents the application and analysis of fuzzy logic in the distinction of signal profiles originating from neutrino-induced showers from the photomultipliers of the water Cherenkov detectors of Pierre Auger Observatory. The patterns of ADC traces from surface detectors were simulated in CORSIKA and OffLine packages for various zenith angles, slant depth (the 1st point of interaction), energy and type of particles (protons and neutrinos), uploaded via In-System Memory Editor into FPGA ROM, processed and read from corresponding RAM, and finally analyzed offline and compared with MATLAB platform. Based on four estimators (Coefficients of Exponentially Attenuated Tails, Rising Speed, Area over Threshold and Shape) a fuzzy logic trigger has been verified, resulting in a promising preliminary analysis. The trigger also serves as additional saturation input for the transmission channel from the surface detector to the Central Data Acquisition System allowing for registration of a particular, possibly crucial, event - even if the trace is misrecognized it can be later easily rejected in offline analysis. Copyright © 2023 by the International Astronautical Federation (IAF). All rights reserved.

关键词： cosmic rays FPGA fuzzy logic neutrino Pierre Auger Observatory UHECR

来源：评论

学校读者我要写书评

暂无评论

On a Combinatorial Problem Arising in Machine Teaching 41

On a Combinatorial Problem Arising in Machine Teaching

引用

41st International Conference on Machine Learning, ICML 2024

作者： Sunde, Joakim Håvardstun, Brigt Kratochvíl, Jan Telle, Jan Arne Department of Informatics University of Bergen Bergen Norway Department of Applied Mathematics Faculty of Mathematics and Physics Charles University Praha Czech Republic

We study a model of machine teaching where the teacher mapping is constructed from a size function on both concepts and examples. The main question in machine teaching is the minimum number of examples needed for any concept, the so-called teaching dimension. A recent paper (Ferri et al., 2024) conjectured that a worst case for this model, as a function of the size of the concept class, occurs when the consistency matrix contains the binary representations of numbers from zero and up. In this paper we prove their conjecture. The result can be seen as a generalization of a theorem resolving the edge isoperimetry problem for hypercubes (Hart, 1976). Our proof is based on a generalization of a lemma of (Graham, 1970). Copyright 2024 by the author(s)

关键词：

来源：评论

学校读者我要写书评

暂无评论

Long-living periodic solutions of complex cubic-quintic Ginzburg-Landau equation in the presence of intrapulse Raman scattering: A bifurcation and numerical study

引用

Physical Review E 2024年第2期110卷 024214页

作者： Ivan M. Uzunov Svetoslav G. Nikolov Todor N. Arabadzhiev Zhivko D. Georgiev Department of Applied Physics Faculty of Applied Mathematics and Informatics Department of Mechanics Department of Theoretical Electrical Egineering

We have found long-living periodic solutions of the complex cubic-quintic Ginzburg-Landau equation (CCQGLE) perturbed with intrapulse Raman scattering. To achieve this we have applied a model system of ordinary differential equations (SODE). A set of the fixed points of the system has been described. A complete phase portrait as well as phase portraits near the fixed points have been built for a proper choice of parameters. The behavior of the model system near the fixed points has been determined. We have presented a detailed description of the subcritical Poincaré-Andronov-Hopf bifurcation due to the intrapulse Raman scattering that appears at one of the fixed points. We have established that there appears an unstable limit cycle in the SODE. To check the validity of the obtained results from the model system we have compared them with the results of the numerical solution of the CCQGLE perturbed with intrapulse Raman scattering. There has been found a remarkable correspondence between the obtained numerical results for the amplitude and frequency of the soliton pulses and the results for these parameters of the bifurcation theory. We have observed that the numerical characteristics of the propagating solitonlike pulses—amplitude, frequency, width, and position—periodically change if we change the distance with a period determined by the bifurcation analysis.

关键词： Bifurcations Nonlinear optics Ultrafast optics Fiber lasers Optical fibers

来源：评论

学校读者我要写书评

暂无评论

CREDO-Maze Project: after-school activities in contemporary physics for talented high school students

CREDO-Maze Project: after-school activities in contemporary ...

引用

2022 Engaging Citizen Science Conference, CitSci 2022

作者： Wibig, Tadeusz Faculty of Physics and Applied Informatics University of Lodz Lodz Poland

We propose to create the global network of small, cheap and simple school Extensive Air Shower mini-arrays. The data registered in each school will be sent to a local database of the city/region supervised by the nearby universities or research institutes. Each student could use them to create their own (or the student science club) scientific research program, in consultation with scientists. Local databases will be parts of the central CREDO (Cosmic Ray Extremely Distributed Observatory) database system collecting all registration. They could be used, certainly, by each individual student, but also for "professional" research on cosmic rays, searching for sources, determining parameters of particles with the highest energies, but also for searching for the new physic. Our school array network, and particularly the portable single particle detector modules can help teachers to teach elements of modern physics and to extend standard physics curricula. Additionally, they will provide the set of themes for gifted students, for science clubs, to create a student science project for science fairs, and other similar events. Currently, high school students test a prototype version of the station at the University. They perform measurements on their own, albeit under expert supervision, which will eventually form a part of a set of issues we are preparing to help teachers, gifted students, and science clubs create individual student projects for science fairs and other similar events. © Copyright owned by the author(s) under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (CC BY-NC-ND 4.0)

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Computer Verifications of Regular Representations of Groups of Orders Smaller than 33 via k-Hypergraphs 22

Computer Verifications of Regular Representations of Groups ...

引用

22nd Conference Information Technologies - Applications and Theory, ITAT 2022

作者： Mihálová, Dominika Comenius University Faculty of Mathematics Physics and Informatics Department of Applied Informatics Bratislava Slovakia

Given a finite group G, the hypergraphical regular representation problem asks about the existence of a hypergraph whose full automorphism group is equal to G acting regularly on the set of its vertices. In our paper, we work with k-hypergraphs which are hypergraphs in which each hyperedge is of the same size k. Since the existence or non-existence of hypergraphical regular representations for groups of the order exceeding the value 32 has been proved theoretically, our focus is on a computational verification of hypergraphical regular representation via k-hypergraphs for groups of order smaller than or equal to 32. For all groups of order less than or equal to 32, except for the group Z52, we computationally proved a conjecture stating that if a group G admits a hypergraphical regular representation via some n-hypergraph, it admits the hypergraphical regular representation for every k-hypergraph in the range n ≤ k ≤ |G| − n. To obtain our results, we created and implemented algorithms in the computational system GAP. © 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： computer verification k-kypergraphs regular representation

来源：评论

学校读者我要写书评

暂无评论

Neutrino afterglows from dense environment of GRB jets 37

Neutrino afterglows from dense environment of GRB jets

引用

37th International Cosmic Ray Conference, ICRC 2021

作者： Bednarek, Wlodzimierz Śmialkowski, Andrzej Faculty of Physics and Applied Informatics Department of Astrophysics University of Lodz Poland

The progenitors of gamma-ray bursts (GRBs) are massive stars still immersed in dense stellar clusters. We consider a scenario in which protons accelerated within the jet of GRB can escape to dense regions. Protons interact efficiently with the matter of the cluster and produce high energy neutrinos. We calculate the spectra of relativistic protons within the cluster and spectra of neutrinos from their interactions with the matter. Neutrinos produced by the whole population of the GRBs should contribute to the extragalactic neutrino background. We calculate extragalactic neutrino background from GRBs and compare it with the observations of the IceCube. © Copyright owned by the author(s).

关键词： Gamma rays

来源：评论

学校读者我要写书评

暂无评论

Federated Learning for Offensive Security in Cyber-Medical Systems Inspired by Petri Nets 11

Federated Learning for Offensive Security in Cyber-Medical S...

引用

11th IEEE International Conference on Computational Cybernetics and Cyber-Medical Systems, ICCC 2024

作者： Stano, Michal Hluchy, Ladislav Dora, Jean Rosemond Nguyen, Ngoc Diep Institute of Informatics Slovak Academy of Sciences Bratislava Slovakia Comenius University Faculty of Mathematics Physics and Informatics Bratislava Slovakia Institute of Theoretical and Applied Research Duy Tan University Hanoi Viet Nam

ISBN: (纸本)9798350350142

Federated learning is a machine learning method that allows models to be trained on decentralised data without participants sharing it with a central server. Federated learning can be modelled using Petri nets, mathematical models for sequence sequences. Devices train on their own data and send model updates to a central server. The central server averages the updates and returns the global model to the devices. The devices then update their local models using the global model. © 2024 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Prefix-Free Parsing for Building Large Tunnelled Wheeler Graphs 22

Prefix-Free Parsing for Building Large Tunnelled Wheeler Gra...

引用

22nd International Workshop on Algorithms in Bioinformatics, WABI 2022

作者： Goga, Adrián Baláž, Andrej Department of Computer Science Faculty of Mathematics Physics and Informatics Comenius University Bratislava Slovakia Department of Applied Informatics Faculty of Mathematics Physics and Informatics Comenius University Bratislava Slovakia

ISBN: (纸本)9783959772433

We propose a new technique for creating a space-efficient index for large repetitive text collections, such as pangenomic databases containing sequences of many individuals from the same species. We combine two recent techniques from this area: Wheeler graphs (Gagie et al., 2017) and prefix-free parsing (PFP, Boucher et al., 2019). Wheeler graphs are a general framework encompassing several indexes based on the Burrows-Wheeler transform (BWT), such as the FM-index. Wheeler graphs admit a succinct representation which can be further compacted by employing the idea of tunnelling, which exploits redundancies in the form of parallel, equally-labelled paths called blocks that can be merged into a single path. The problem of finding the optimal set of blocks for tunnelling, i.e. the one that minimizes the size of the resulting Wheeler graph, is known to be NP-complete and remains the most computationally challenging part of the tunnelling process. To find an adequate set of blocks in less time, we propose a new method based on the prefix-free parsing (PFP). The idea of PFP is to divide the input text into phrases of roughly equal sizes that overlap by a fixed number of characters. The phrases are then sorted lexicographically. The original text is represented by a sequence of phrase ranks (the parse) and a list of all used phrases (the dictionary). In repetitive texts, the PFP representation of the text is generally much shorter than the original since individual phrases are used many times in the parse, thus reducing the size of the dictionary. To speed up the block selection for tunnelling, we apply the PFP to obtain the parse and the dictionary of the original text, tunnel the Wheeler graph of the parse using existing heuristics and subsequently use this tunnelled parse to construct a compact Wheeler graph of the original text. Compared with constructing a Wheeler graph from the original text without PFP, our method is much faster and uses less memory on collections of

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Enhancing Accessibility with Informed VR and AR Authoring for Hybrid Geometry Learning 10

Enhancing Accessibility with Informed VR and AR Authoring fo...

引用

10th International Conference on Software Development and Technologies for Enhancing Accessibility and Fighting Info-Exclusion, DSAI 2022

作者： Ferko, Andrej Berger Haladova, Zuzana Batorova, Martina Department of Algebra and Geometry Faculty of Mathematics Physics and Informatics Comenius University Bratislava Slovakia Department of Applied Informatics Faculty of Mathematics Physics and Informatics Comenius University Bratislava Slovakia

ISBN: (纸本)9781450398077

We use educational VR and AR solutions in hybrid learning and authoring and present several approaches for teachers enabling them to better engage their students in the educational process. We propose ideas for working with students with attention difficulties and multiple means to intentionally hold their attention. Methodological suggestions are provided for teachers helping them to improve their lectures and thinking in terms of rhetoric and semiotics. © 2022 ACM.

关键词： Semiotics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：