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

32nd International Symposium on Graph Drawing and Network Visualization, GD 2024

作者： Balko, Martin Hliněný, Petr Masařík, Tomáš Orthaber, Joachim Vogtenhuber, Birgit Wagner, Mirko H. Department of Applied Mathematics Faculty of Mathematics and Physics Charles University Prague Czech Republic Faculty of Informatics Masaryk University Brno Czech Republic Institute of Informatics Faculty of Mathematics Informatics and Mechanics University of Warsaw Poland Institute of Software Technology Graz University of Technology Austria Institute of Computer Science Osnabrück University Germany

ISBN: (纸本)9783959773430

Visualizing a graph G in the plane nicely, for example, without crossings, is unfortunately not always possible. To address this problem, Masařík and Hliněný [GD 2023] recently asked for each edge of G to be drawn without crossings while allowing multiple different drawings of G. More formally, a collection D of drawings of G is uncrossed if, for each edge e of G, there is a drawing in D such that e is uncrossed. The uncrossed number unc(G) of G is then the minimum number of drawings in some uncrossed collection of G. No exact values of the uncrossed numbers have been determined yet, not even for simple graph classes. In this paper, we provide the exact values for uncrossed numbers of complete and complete bipartite graphs, partly confirming and partly refuting a conjecture posed by Hliněný and Masařík [GD 2023]. We also present a strong general lower bound on unc(G) in terms of the number of vertices and edges of G. Moreover, we prove NP-hardness of the related problem of determining the edge crossing number of a graph G, which is the smallest number of edges of G taken over all drawings of G that participate in a crossing. This problem was posed as open by Schaefer in his book [Crossing Numbers of Graphs 2018]. © Martin Balko, Petr Hliněný, Tomáš Masařík, Joachim Orthaber, Birgit Vogtenhuber, and Mirko H. Wagner.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Review of Lane Change Systems Based on Reinforcement Learning

Review of Lane Change Systems Based on Reinforcement Learnin...

引用

2024 International Conference "Quality Management, Transport and Information Security, Information Technologies", QM and TIS and IT 2024

作者： Konovalov, Mikhail D. Uvarova, Liudmila A. Institute for Design-Technological Informatics Ras Moscow Russia Institute for Design-Technological Informatics Ras Moscow State University of Technology Stankin Department of Applied Mathematics Moscow Russia

ISBN: (纸本)9798350367522

The decision of lane change problem is one of the sophisticated and accuracy demanding task in ADAS development process. Lane change task can be characterized as non- linearity with high fraction of uncertainties. This is caused by dynamic changeable traffic environment and thus one of state of the art approach to solve this problem is the use of machine learning technic. In this work lane change systems based on reinforcement learning methods were observed. These lane change systems are provided by specific modification of deep Q-network (DQN), deep deterministic policy gradient (DDPG). In the process of consideration descriptions and the comparison of proposed methods are given from position of Average Velocity and Collision Times. © 2024 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Semi-analytical finite element method applied for characterizing micropolar fibrous composites

引用

applied mathematics and Mechanics(English Edition) 2024年第12期45卷 2147-2164页

作者： J.A.OTERO Y.ESPINOSA-ALMEYDA R.RODRIGUEZ-RAMOS J.MERODIO School of Engineering and Sciences Monterrey Institute of TechnologyEstado de Mexico 52926Mexico Institute of Engineering and Technology Autonomous University of Ciudad JuarezCiudad JuarezChihuahua 32310Mexico Postgraduate Program in Computational Modeling in Science and Technology Federal Fluminense UniversityRıo de Janeiro 27255-125Brazil Faculty of Mathematics and Computer Science University of HavanaLa Habana 10400Cuba Department of Mathematics Applied to ICT School of Informatics Systems EngineeringTechnical University of MadridMadrid 28031Spain

A semi-analytical finite element method(SAFEM),based on the two-scale asymptotic homogenization method(AHM)and the finite element method(FEM),is implemented to obtain the effective properties of two-phase fiber-reinforced composites(FRCs).The fibers are periodically distributed and unidirectionally aligned in a homogeneous *** framework addresses the static linear elastic micropolar problem through partial differential equations,subject to boundary conditions and perfect interface contact *** mathematical formulation of the local problems and the effective coefficients are presented by the *** local problems obtained from the AHM are solved by the FEM,which is denoted as the *** numerical results are provided,and the accuracy of the solutions is analyzed,indicating that the formulas and results obtained with the SAFEM may serve as the reference points for validating the outcomes of experimental and numerical computations.

关键词： semi-analytical approach fiber-reinforced composite(FRC) effective property finite element method(FEM) asymptotic homogenization method(AHM) micropolar elasticity

来源：评论

学校读者我要写书评

暂无评论

Research on the online portfolio problem with transaction costs and long short-term predictions 24

Research on the online portfolio problem with transaction co...

引用

13th International Conference on Computing and Pattern Recognition, ICCPR 2024

作者： Hu, Junwei Yao, Xiaoting Zhang, Na Department of Applied Mathematics College Mathematics and Informatics South China Agricultural University Guangzhou Guangdong China School of General Education Guangzhou Institute of Science and Technology Guangzhou Guangdong China

ISBN: (纸本)9798400717482

In this paper, we consider the issue of online portfolios with transaction costs, and combine long and short term forecasting approaches to address both returns and risks. Specifically, we measure transaction costs by adding the ĝ.,"1 norm to the objective function regarding the difference between the previous period and the next period's portfolio. On the other hand, we use short-term historical prices information to consider returns, because it prices reflect existing market trends, and we use the conditional value at risk of long-term historical data to consider risk. In addition, in order to reduce the computational complexity, we transform the nonlinear optimization problem into a linear programming problem and prove their equivalence. Our large number of numerical experiments show that our proposed method is better than other algorithms in most cases. © 2024 Copyright held by the owner/author(s).

关键词： Computational cost

来源：评论

学校读者我要写书评

暂无评论

Mitigation of wind turbine echoes in weather radar measurements of the DWD

Mitigation of wind turbine echoes in weather radar measureme...

引用

2022 Kleinheubach Conference, KHB 2022

作者： Blank, Ulrike Koster, Uwe Teschke, Gerd University of Applied Sciences Neubrandenburg Institute for Applied Mathematics and Informatics in Science and Technology Neubrandenburg Germany

ISBN: (纸本)9783948571078

Zusammenfassung-Wind energy is one of the central pillars of the energy transition in Germany. As wind turbines might dramatically influence atmospheric backscatter of weather radars, the important question arises: is it possible to reduce or to completely circumvent the negative impact of wind turbines to weather radar measurements. Within this paper we propose a two step proceeding:1)Raw data identification step: on raw data level we construct classifiers that are able to discriminate between 'clean' and 'contaminated' radar echoes. This allows an identification of spatial cells that are affected by wind turbines. These identified cells will be completely removed and recovered in a second step.2)Momemt data recovery step: on the level of higher moment data the removed spatial cells will be recovered by formulating an incomplete data context and solve an associated inverse problem that yields a 'gap-infilling' routine that recovers the removed spatial moment data on the basis of informations from its temporal and spatial *** provide numerical examples and evaluations on the recovery quality vs. gap size. © 2022 URSI Landesausschuss in der Bundesrepublik Deutsch.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

VALIDATION TOWARDS REALISTIC SYNTHETIC DATASETS IN PRODUCTION PLANNING

VALIDATION TOWARDS REALISTIC SYNTHETIC DATASETS IN PRODUCTIO...

引用

2024 Winter Simulation Conference, WSC 2024

作者： Spoor, Jan Michael Matthes, Marvin Krockert, Martin Weber, Jens Institute for Information Management in Engineering Karlsruhe Institute of Technology Germany Dept. of Informatics & Mathematics University of Applied Sciences Dresden Germany Faculty of Technology Baden-Wuerttemberg Cooperative State University Lörrach Germany

ISBN: (纸本)9798331534202

For large-scale simulations, a sufficient data amount is required. Despite an increasing data availability, it is still challenging to gather large-scale datasets, which are comprehensive, correct, accessible, and realistic, to validate new algorithms and models. An alternative is the use of synthetic data. Thus, we propose a novel methodology to generate realistic datasets. Based upon the statistical properties of real-world data, synthetic datasets are generated by ML models and filtered for anomalous values. The generated datasets are then compared to find the most suitable one. For this validation procedure, a modified Hopfield neural network model is extended to enable an analysis of sequences and to derive a comparison metric. The method demonstrates its applicability by providing an in-depth comparison of all tested data generators using a real-world dataset of a mid-size manufacturing company, whereby transformer-based generators proved most suitable. More diverse use cases should be evaluated in future research. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ROAR: A Benchmark for NFT Rarity Meters 6

ROAR: A Benchmark for NFT Rarity Meters

引用

6th IEEE International Conference on Blockchain and Cryptocurrency, ICBC 2024

作者： Belousov, Dmitry Shuklin, Maksim Stepin, Alexander Yanovich, Yury Moscow Institute of Physics and Technology Phystech School of Applied Mathematics and Informatics Moscow Russia Hse University Faculty of Computer Science Moscow Russia Skolkovo Institute of Science and Technology Wireless Center Moscow Russia

ISBN: (纸本)9798350316742

Rarity meters are incorporated by industry and discursive by academia. Rarity, as an intuitive term, attracted numerous researchers to present their own view of it. While there is existing literature on comparing rarity meters, it requires access to NFT collection data, which can be challenging for researchers without a background in blockchain technology. This has created a demand for an easily accessible rarity meter benchmark. In this paper, we introduce the Rating over all Rarities (ROAR) benchmark, which includes data from one hundred popular NFT collections from the Ethereum blockchain, implemented a weighted correlation-based performance measurement function, as well as four state-of-the-art rarity meters (***, Kramer, OpenRarity, and NFTGo), along with a new rarity meter called ROAR. Our experiments show that the ROAR rarity meter, an ensemble of the other four meters, outperforms its competitors, with *** and Kramer as runner-ups. The ROAR benchmark is a tool for examination and testing of rarity meter ideas, and we challenge readers to develop models that can outperform the ROAR rarity meter. © 2024 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Zero-one laws for random k-partite graphs

引用

Moscow Journal of Combinatorics and Number Theory 2022年第4期10卷 315-337页

作者： Oropeza, Juan Carlos Buitrago Department of Applied Mathematics and Informatics Moscow Institute of Physics and Technology (National Research University) Dolgoprudny Russian Federation

We study the validity of the first-order zero-one law for the binomial k-partite random graph in two settings: dense (the probability p of appearance of an edge is a constant) and sparse (p = n^−α, where n is the cardinality of each part of the graph). On the way, we prove that, for every rational ρ ≥ 1, there exists a bipartite strictly balanced graph with density ρ. © 2022, Mathematical Science Publishers. All rights reserved.

关键词： First-order properties Random graphs Strictly balanced bipartite graphs Zero-one laws

来源：评论

学校读者我要写书评

暂无评论

Computation of the zeros of a quaternionic polynomial using matrix methods

引用

Arab Journal of Basic and applied Sciences 2024年第1期31卷 65-70页

作者： Rather, N.A. Bhat, Tanveer Dar, Ishfaq Khan, Bilal Sama, Arjika Department of Mathematics University of Kashmir Srinagar India Department of Applied Sciences Institute of Technology University of Kashmir Srinagar India School of Mathematical Sciences and Shanghai Key Laboratory of PMMP East China Normal University Shanghai China Department of Mathematics and Informatics University of Agadez Agadez Niger

In a recent paper, Ishfaq Dar (2024), worked on the problem of locating the zeros of quaternion polynomials by introducing various matrix techniques. In this paper, we use those newly developed matrix methods to locate the left eigenvalues of the quaternion companion matrix of the polynomial, which in turn yield various results concerning the location of the zeros of quaternionic polynomials including extensions of the results of Rubinstein and A. Aziz to the quaternionic setting as well. © 2024 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group on behalf of the university of Bahrain.

关键词： Companion matrix quaternionic polynomials right (and left) quaternionic eigenvalues

来源：评论

学校读者我要写书评

暂无评论

TIME SERIES PREDICTION FOR THE HOUSING CONSTRUCTION MARKET WITH THE USE OF NARNET 37

TIME SERIES PREDICTION FOR THE HOUSING CONSTRUCTION MARKET W...

引用

37th ECMS International Conference on Modelling and Simulation, ECMS 2023

作者： Wotzka, Daria Suchacka, Grażyna Mach, Lukasz Frącz, Pawel Foltys, Joachim Maniu, Ionela Opole University of Technology Faculty of Electrical Engineering ul. Prószkowska 76 Opole45-758 Poland University of Opole Institute of Informatics ul. Oleska 48 Opole45-052 Poland Opole University of Technology Faculty of Economics and Management ul. Prószkowska 76 Opole45-758 Poland University of Opole Faculty of Economics ul. Oleska 48 Opole45-040 Poland Humanitas University in Sosnwiec ul. Kilińskiego 43 Sosnowiec41-200 Poland Lucian Blaga University of Sibiu Dept. of Mathematics and Informatics str. Dr. Ioan Ratiu Sibiu550012 Romania

ISBN: (纸本)9783937436807

The paper discusses the study to develop and tune parameters of a nonlinear autoregressive neural network (NARNet or NARNN) model for predicting the number of housing units. Predictions were made for the housing construction market in Poland, which is a dynamically growing European market. Three stages of the housing construction process have been taken into consideration: permits issued for house construction, houses under construction, and completed new houses. Experimental results have shown that a NARNet model can be a very effective tool in the considered scenario. A network model using the Levenberg-Marquardt backpropagation training function achieved the best model fit, as well as the most accurate one-month predictions. © ECMS Enrico Vicario, Romeo Bandinelli, Virginia Fani, Michele Mastroianni (Editors) 2023.

关键词： Houses

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：