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

arXiv 2025年

作者： Bereg, Sergey Capitán, Jesús Bañez, José Miguel Díaz López, José Manuel Higes Cutiño, Miguel Angel Pérez Canales, Vanesa Sánchez Ventura, Inmaculada Department of Computer Science University of Texas Dallas United States Multi-Robot & Control Systems Group University of Seville Spain Department of Applied Mathematics University of Seville Spain Department of Applied Mathematics University of Seville Spain Virtualmechanics S.L Seville Spain

Given a rectangular grid graph with a special vertex at a corner called base station, we study the problem of covering the vertices of the entire graph with tours that start and end at the base station and whose lengths do not exceed a given threshold, while minimizing a quality measure. We consider two objective functions: minimizing the number of tours and minimizing the sum of their lengths. We present an algorithm that computes the optimal solution for both objectives in linear time with respect to the grid size. © 2025, CC BY-NC-SA.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Dynamical Simulation Model of the Pyro-Process in Cement Clinker Production

arXiv

引用

arXiv 2025年

作者： Svensen, Jan Lorenz da Silva, Wilson Ricardo Leal Zhang, Zhanhao Hørsholt, Steen Jørgensen, John Bagterp Department of Applied Mathematics and Computer Science Technical University of Denmark Kgs. Lyngby2800 Denmark FLSmidth Cement A/S Valby2500 Denmark

This study presents a dynamic simulation model for the pyro-process of clinker production in cement plants. The study aims to construct a simulation model capable of replicating the real-world dynamics of the pyro-process to facilitate research into the improvements of operation, i.e., the development of alternative strategies for reducing CO2 emissions and ensuring clinker quality, production, and lowering fuel consumption. The presented model is an index-1 differential-algebraic equation (DAE) model based on first engineering principles and modular approaches. Using a systematic approach, the model is described on a detailed level that integrates geometric aspects, thermo-physical properties, transport phenomena, stoichiometry and kinetics, mass and energy balances, and algebraic volume and energy conservations. By manually calibrating the model to a steady-state reference, we provide dynamic simulation results that match the expected reference performance and the expected dynamic behavior from the industrial practices. Copyright © 2025, The Authors. All rights reserved.

关键词： Dynamic models

来源：评论

学校读者我要写书评

暂无评论

Partitions into an exact number of parts

引用

The Ramanujan Journal 2025年第3期67卷 1-19页

作者： Ballantine, Cristina Merca, Mircea Department of Mathematics and Computer Science College of The Holy Cross Worcester USA Department of Mathematical Methods and Models Fundamental Sciences Applied in Engineering Research Center National University of Science and Technology Politehnica Bucharest Bucharest Romania Academy of Romanian Scientists Bucharest Romania

In this paper, we examine the functions $$P_k(n)$$ , which counts the partitions of n into exactly k parts, and $$Q_k(n)$$ , which counts the partitions of n into exactly k distinct parts. These partition functions are closely linked to two classical identities of Euler. We explore this connection and establish several new relationships between $$P_k(n)$$ and $$Q_k(n)$$ . We give both analytic and combinatorial proofs of the theorems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Rule-Based Dialect of Tulang Bawang Stemmer

Rule-Based Dialect of Tulang Bawang Stemmer

引用

Advancement in Data science, E-learning and Information Systems (ICADEIS), International Conference on

作者： Zaenal Abidin Akmal Junaidi Wamiliana Favorisen Rosyking Lumbanraja Dian Kurniasari Rohmat Indra Borman Doctoral Program of Mathematics and Natural Sciences Universitas Lampung Bandar Lampung Indonesia Department of Computer Science Universitas Lampung Bandar Lampung Indonesia Department of Mathematics Universitas Lampung Bandar Lampung Indonesia Faculty of Engineering and Computer Science Universitas Teknokrat Indonesia Bandar Lampung Indonesia

ISBN: (数字)9798331513320

ISBN: (纸本)9798331513337

Stemming, an essential procedure in natural language processing (NLP), diminishes words to their base forms, facilitating tasks such as information retrieval and sentiment analysis. Although stemming techniques for highresource languages are well-developed, numerous low-resource languages, including dialect of Tulang Bawang, suffer from inadequate solutions owing to a scarcity of linguistic data and resources. Existing systems, including rule-based stemmers, have demonstrated efficacy in processing low-resource languages such as Indonesian and Javanese by utilizing established morphological rules. Nonetheless, these methods encounter considerable obstacles, such as restricted adaptability, inability to accommodate unusual root structures, and excessive dependence on fixed rules that might result in over- or understemming. Rule-based methodologies frequently misidentify roots when faced with intricate affixes or unconventional word forms. We introduce an improved rule-based Tulang Bawang Stemmer aimed at overcoming these constraints by enhancing current linguistic rules and integrating new patterns specific to the language's morphology. Assessed on 500 test samples and 200 independent test samples, our improved stemmer attained gold standard evaluation metrics of 96.2% and 94%, respectively, surpassing prior implementations in both precision and generalization. The findings demonstrate the potential of enhanced rule-based techniques to improving NLP for lowresource languages. Improved stemming performance enables better downstream applications, promotes more efficient text analysis, and advances research in underrepresented languages.

关键词： Measurement Sentiment analysis Text analysis Electronic learning Morphology Linguistics Data science Information retrieval Machine translation Information systems

来源：评论

学校读者我要写书评

暂无评论

Face Identification with Feature Learning Using Quasilinear Partial Differential Equation

Face Identification with Feature Learning Using Quasilinear ...

引用

15th International Conference on Soft Computing and Pattern Recognition, SoCPaR 2023 and 14th World Congress on Nature and Biologically Inspired Computing, NaBIC 2023

作者： Muthukumaran, V. Satheesh Kumar, S. Radhika, E.K. Arpana, G.K. Nalini, R. Department of Mathematics College of Engineering and Technology SRM Institute of Science and Technology Chennai India Department of Computer Science School of Applied Sciences REVA University Bangalore India Department of Computer Science Sindhi College Bangalore India Department of ECE East West College of Engineering Bangalore India

ISBN: (纸本)9783031810855

This study suggests a novel soft computing approach for enhancing face recognition performance using the feature learning methodology. The suggested system of Quasi-linear Partial Differential Equations (QPDE) based face recognition model is used to increase the accuracy of facial identification. The webcam first catches the user's image and saves it to the user's computer. The inference model receives the captured image. The input image is pre-processed to enhance the image, and then the image is split into numerous integral images at the inference model. Using speed-up robust features, an intriguing point is constructed for each integral image. The computed interest point is converted into a QPDE based weight matrix by representing the strength of features at all the regions of the face. With the generated weighted matrix of features extracted from the facial image, the method generates a Fast Artificial intelligence (AI) network with many layers. Each layer of the neural network has many neurons with dedicated functions to compute the similarity and feature weight using QPDE. The proposed approach has produced efficient results compared to earlier methods for the Flickr-Faces-HQ database (FFHQ) datasets. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Soft computing

来源：评论

学校读者我要写书评

暂无评论

Segment Intersection Representations, Level Planarity and Constrained Ordering Problems

arXiv

引用

arXiv 2025年

作者： Fink, Simon D. Pfretzschner, Matthias Stumpf, Peter Algorithms and Complexity Group Technische Universität Wien Austria Faculty of Computer Science and Mathematics University of Passau Germany Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University Prague Czech Republic Department of Applied Mathematics Charles University Prague Czech Republic

In the Segment Intersection Graph Representation Problem, we want to represent the vertices of a graph as straight line segments in the plane such that two segments cross if and only if there is an edge between the corresponding vertices. This problem is NP-hard (even ∃R-complete [19]) in the general case [13] and remains so if we restrict the segments to be axis-aligned, i.e., horizontal and vertical [12]. A long standing open question for the latter variant is its complexity when the order of segments along one axis (say the vertical order of horizontal segments) is already given [12,14]. We resolve this question by giving efficient solutions using two very different approaches that are interesting on their own. First, using a graph-drawing perspective, we relate the problem to a variant of the well-known Level Planarity problem, where vertices have to lie on preassigned horizontal levels. In our case, each level also carries consecutivity constraints on its vertices;this Level Planarity variant is known to have a quadratic solution. Second, we use an entirely combinatorial approach and show that both problems can equivalently be formulated as a linear ordering problem subject to certain consecutivity constraints. While the complexity of such problems varies greatly, we show that in this case the constraints are well-structured in a way that allows a direct quadratic solution. Thus, we obtain three different-but-equivalent perspectives on this problem: the initial geometric one, one from planar graph drawing and a purely combinatorial one. © 2025, CC BY.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

CAPE: Commitment-based Privacy-Preserving Payment Channel Scheme in Blockchain

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Gai, Keke Guo, Yunwei Yu, Jing Chan, Weilin Zhu, Liehuang Zhang, Yinqian Meng, Weizhi The School of Cyberspace Science and Technology Beijing Institute of Technology Beijing100081 China The Institute of Information Engineering Chinese Academy of Sciences Beijing China The Department of Computer Science and Engineering Southern University of Science and Technology Guangdong Shenzhen China Department of Applied Mathematics and Computer Science Cybersecurity Engineering Technical University of Denmark Kongens Lyngby Denmark

Ensuring scalability in cryptocurrency systems is significant in guaranteeing real-world utility along with the remarkable increment of cryptographic currency. As an alternative in solving scalability issue, payment channel allows users to deliver extensive offline transactions without uploading massive transaction details to the blockchain, such that increasing efficiency can be achieved. However, the implementation of payment channel still encounters privacy concerns when considering the publicly available transaction amounts and the potentials in mining associations between transaction parties. In this paper, we propose a novel payment channel scheme, entitled Commitment-based Anonymous Payment ChannEl (CAPE), to facilitate unlimited off-chain bidirectional payments while guaranteeing participants’ privacy. The proposed scheme adopts zero-knowledge proof (zk-SNARKs) and verifiable timed (VTD) commitments to ensure the anonymity of the relationship between on-chain and off-chain transactions, privacy of transaction amounts, and security of balances. We comprehensively formalize security definitions and present rigorous proofs for each security attribute. Experiment results further demonstrate the practical viability of CAPE. © 2025 IEEE. All rights reserved.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Multi-Level Feature Distillation of Joint Teachers Trained on Distinct Image Datasets

Multi-Level Feature Distillation of Joint Teachers Trained o...

引用

IEEE Workshop on Applications of computer Vision (WACV)

作者： Adrian Iordache Bogdan Alexe Radu Tudor Ionescu Department of Computer Science University of Bucharest Bucharest Romania “Gheorghe Mihoc - Caius Iacob” Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy Bucharest Romania

ISBN: (数字)9798331510831

ISBN: (纸本)9798331510848

We propose a novel teacher-student framework to distill knowledge from multiple teachers trained on distinct datasets. Each teacher is first trained from scratch on its own dataset. Then, the teachers are combined into a joint architecture, which fuses the features of all teachers at multiple representation levels. The joint teacher architecture is fine-tuned on samples from all datasets, thus gathering useful generic information from all data samples. Finally, we employ a multi-level feature distillation procedure to transfer the knowledge to a student model for each of the considered datasets. We conduct image classification experiments on seven benchmarks, and action recognition experiments on three benchmarks. To illustrate the power of our feature distillation procedure, the student architectures are chosen to be identical to those of the individual teachers. To demonstrate the flexibility of our approach, we combine teachers with distinct architectures. We show that our novel Multi-Level Feature Distillation (MLFD) can significantly surpass equivalent architectures that are either trained on individual datasets, or jointly trained on all datasets at once. Furthermore, we confirm that each step of the proposed training procedure is well motivated by a comprehensive ablation study. We publicly release our code at https://***/AdrianIordache/MLFD.

关键词： Training Convolutional codes Image segmentation Image recognition computer architecture Object detection Benchmark testing Transformers Natural language processing Image classification

来源：评论

学校读者我要写书评

暂无评论

Localization Coefficients of Functions with Applications in Partial Differential Equations

arXiv

引用

arXiv 2025年

作者： Karamehmedović, Mirza Triki, Faouzi Department of Applied Mathematics Computer Science Technical University of Den-ark Kgs Lyngby Denmark Laboratoire Jean Kuntzmann Université Grenoble-Alpes Grenoble France

We identify shortcomings in two popular measures of localization of functions: the Lp-Lq participation ratio and the mass concentration comparison. We then introduce a novel localization measure for functions on bounded subsets of Rd, d = 1, 2, 3, . . . , based on a Wasserstein metric. For efficient computation, we prove the equality of this measure with a suitable Sobolev norm in dimension one. We demonstrate our approach by numerical experiments in one and two dimensions. Finally, we discuss and mitigate challenges arising from boundary *** Codes 49Q22, 46E35, 35Bxx Copyright © 2025, The Authors. All rights reserved.

关键词： Differential equations

来源：评论

学校读者我要写书评

暂无评论

How Prevalent Is Gender Bias in ChatGPT? - Exploring German and English ChatGPT Responses

How Prevalent Is Gender Bias in ChatGPT? - Exploring German...

引用

European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2023

作者： Urchs, Stefanie Thurner, Veronika Aßenmacher, Matthias Heumann, Christian Thiemichen, Stephanie Faculty for Computer Science and Mathematics Munich University of Applied Sciences Munich Germany Department of Statistics LMU Munich Munich Germany LMU Munich Munich Germany

ISBN: (纸本)9783031746291

With the introduction of ChatGPT, OpenAI made large language models (LLM) accessible to users with limited IT expertise. However, users with no background in natural language processing (NLP) might lack a proper understanding of LLMs. Thus the awareness of their inherent limitations, and therefore will take the systems’ output at face value. In this paper, we systematically analyse prompts and the generated responses to identify possible problematic issues with a special focus on gender biases, which users need to be aware of when processing the system’s output. We explore how ChatGPT reacts in English and German if prompted to answer from a female, male, or neutral perspective. In an in-depth investigation, we examine selected prompts and analyse to what extent responses differ if the system is prompted several times in an identical way. On this basis, we show that ChatGPT is indeed useful for helping non-IT users draft texts for their daily work. However, it is absolutely crucial to thoroughly check the system’s responses for biases as well as for syntactic and grammatical mistakes. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： bias ChatGPT corpus analysis large language models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：