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

Enhancing Missing Data Imputation for Migrants Data: A Neutrosophic Set-Based Machine Learning Approach

Neutrosophic Sets and Systems 2025年 81卷 479-502页

作者： Abdo, Doaa A. Salama, A.A. Abdelmegaly, Alaa A. Mahmoud, Hanan Khadari Mahdi Applied statistics and insurance department faculty of commerce Mansoura university Mansoura Egypt Dept. of Math and Computer Sci. Faculty of Science Port Said Univ. Egypt Higher Institute of Advanced Management Sciences and Computers Al-Buhayrah Egypt Depatrment of applied statistics at the Nile Higher Institute of commercial sciences and Computer Technology in Mansoura Egypt

This study tackles the problem of missing data in migrant datasets by introducing a new framework that combines machine learning techniques with neutrosophic sets. These sets, which can represent uncertainty and ambiguity, are well-suited for managing the complex nature of missing information in sensitive fields like migration research. We test the effectiveness of KNN, SVM, decision tree, random forest, and Ada Boost algorithms on a migrant dataset, comparing their results using different imputation methods (mean/mode, model-based imputer (simple tree), and random values). Our research showed that our proposed approach, which used neutrosophic sets, improved imputation accuracy and strengthened model reliability. Our results underscored the potential of neutrosophic set-based machine learning for addressing missing data issues across various fields. © 2025, University of New Mexico. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

On the Parallelizability of Approval-Based Committee Rules

arXiv

引用

arXiv 2025年

作者： Fitzsimmons, Zack Hassan, Zohair Raza Hemaspaandra, Edith Dept. of Math. and Computer Science College of the Holy Cross WorcesterMA01610 United States Department of Computer Science Rochester Institute of Technology RochesterNY14623 United States

Approval-Based Committee (ABC) rules are an important tool for choosing a fair set of candidates when given the preferences of a collection of voters. Though finding a winning committee for many ABC rules is NP-hard, natural variations for these rules with polynomial-time algorithms exist. The Method of Equal Shares, an important ABC rule with desirable properties, is also computable in polynomial time. However, when working with very large elections, polynomial time is not enough and parallelization may be necessary. We show that computing a winning committee using these ABC rules (including the Method of Equal Shares) is P-hard, thus showing they cannot be parallelized. In contrast, we show that finding a winning committee can be parallelized when the votes are single-peaked or single-crossing for the important ABC rule Chamberlin-Courant. Copyright © 2025, The Authors. All rights reserved.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Protocol Design Rules from Hiding Patterns to Avoid Steganographic Channels in Wireless Communication

Protocol Design Rules from Hiding Patterns to Avoid Steganog...

引用

IEEE Conference on Wireless Communications and Networking

作者： Jörg Keller Daniel Spiekermann Markus Walter Fac. Math. & Computer Science Fernllniversität in Hagen Hagen Germany Computer Science Department Univ. of Appl. Science & Arts Dortmund Dortmund Germany Federal Office for Information Security Bonn Germany

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

Covert channels for the transmission of stegano-graphic messages are not only possible in classic internet protocols but also in wireless communications such as 4G and 5G air interface. Hiding patterns collect the central ideas behind these channels. We therefore derive rules for protocol design, conformance to which disables at least the most frequently used covert channel approaches. Starting from 5G, we investigate where 6G standardization might take such rules into account to better protect 6G protocols against covert channels from the beginning,

关键词： 6G mobile communication Wireless communication Steganography Protocols 5G mobile communication Standardization Bandwidth Communication channels Timing Complexity theory

来源：评论

学校读者我要写书评

暂无评论

'Simple Mistakes' in College Algebra: an Analysis of Students' Perceptions of Their Errors Using Attribution Theory

引用

International Journal of Research in Undergraduate math.matics Education 2025年 1-28页

作者： Ryals, Megan Hill-Lindsay, Sloan Pilgrim, Mary E. Burks, Linda C. Center for Applied Mathematics University of Virginia 156 Engineer’s Way Charlottesville 22904 VA United States Department of Math and Statistics San Diego State University 5500 Campanile Dr San Diego 92182 CA United States Department of Mathematics and Computer Science Santa Clara University 500 El Camino Real Santa Clara 95053 CA United States

Analyzing their mistakes affords students opportunities for improved learning and success in problem solving disciplines, especially when students are able to identify reasons for their errors and modify their future study behavior. To help students make appropriate adjustments, instructors must understand the language students use to describe their own academic performance. This study explores what students mean when they say they made “simple mistakes.” Eight students participated in interviews where they reviewed errors from a recent exam, explaining why errors were simple or not simple. We analyzed the interview data using Causal Attribution Theory and discovered how students’ attributions of their errors influence their classification of their errors as simple or not simple. Results include descriptions of simple and not simple distinctions for three categories of students and evidence of similarities among students within each category regarding their self-efficacy and persistence through struggle. The analysis also reveals how students plan to adjust their study approach based on their classification of their errors. Across categories, students believe simple mistakes are preventable through repetitive practice or memorization, while not simple mistakes require help seeking, but students within different categories differ in how they use these strategies. The results show that that different students can use the same language to convey very different meanings for their own error categorizations and that there is need for instructors to probe these meanings before providing guidance. Our results also provide support for previous calls for interventions aimed at retraining students’ causal attribution styles towards controllable, unstable causes. © The Author(s) 2025.

关键词： Attribution theory College Algebra Motivation Student errors

来源：评论

学校读者我要写书评

暂无评论

Randomized graph products, chromatic numbers, and the Lovasz theta-function

引用

COMBINATORICA 1997年第1期17卷 79-90页

作者： Feige, U Department of Applied Math. and Computer Science The Weizmann Institute Rehovot Israel

For a graph G, let alpha(G) denote the size of the largest independent set in G, and let theta(G) denote the Lovasz theta-function on G. We prove that for some c > 0, there exists an infinite family of graphs such that theta(G) > alpha(G)n/2(c root log n), where n denotes the number of vertices in a graph. This disproves a known conjecture regarding the theta function. As part of our proof, we analyse the behavior of the chromatic number in graphs under a randomized version of graph products. This analysis extends earlier work of Linial and Vazirani, and of Berman and Schnitger, and may be of independent interest.

关键词： math.matics Subject Classification (1991) 05 C 15 90 C 35

来源：评论

学校读者我要写书评

暂无评论

Power-fractional distributions and branching processes

arXiv

引用

arXiv 2025年

作者： Alsmeyer, Gerold Hoang, Viet Hung Inst. Math. Stochastics Department of Mathematics and Computer Science University of Münster Orléans-Ring 10 MünsterD-48149 Germany Faculty of Fundamental Science Industrial University of Ho Chi Minh City No. 12 Nguyen Van Bao Ward 4 Go Vap District Ho Chi Minh City Viet Nam

In branching process theory, linear-fractional distributions are commonly used to model individual reproduction, especially when the goal is to obtain more explicit formulas than those derived under general model assumptions. In this article, we explore a generalization of these distributions, first introduced by Sagitov and Lindo, which offers similar advantages. We refer to these as power-fractional distributions, primarily because, as we demonstrate, they exhibit power-law behavior. Along with a discussion of their additional properties, we present several results related to the Galton-Watson branching process in both constant and randomly varying environments, illustrating these advantages. The use of power-fractional distributions in continuous time, particularly within the framework of Markov branching processes, is also briefly *** Codes Primary 60J80, Secondary 60K37, 60H25 © 2025, CC BY.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Parsoffensive: Persian Offensive Comments Dataset

Parsoffensive: Persian Offensive Comments Dataset

引用

International Conference on Web Research (ICWR)

作者： Ali Nazarizadeh Minoo Sayyadpour Omid Ebrahimkhani Amirmasoud Iravani Golnaz Ghannadan Shirazi Mojgan Behravan Department of Computer Engineering Central Tehran Branch Islamic Azad University Tehran Iran Dept. Math and Computer Science Kharazmi University Tehran Iran Department of English Translation Studies Faculty of Persian Literature and Foreign Languages Allameh Tabataba'i University Tehran Iran Department of Linguistics Faculty of Letters and Humanities Ferdowsi University of Mashhad Mashhad Iran Department of Engineering Faculty of Computer Engineering Alzahra University Tehran Iran Department of IT& Technology IU International University of Applied science Tehran Iran

ISBN: (数字)9798331508913

ISBN: (纸本)9798331508920

Offensive language detection is essential for maintaining respectful and inclusive online environments. By implementing detection systems, platforms aim to protect users from harmful content, curb the spread of hate speech, and promote positive interactions within digital communities. Leveraging natural language processing (NLP) techniques, this area has become a key focus in computational linguistics research and development. To address this challenge, we created the ParsOffensive dataset, consisting of approximately 8,433 Persian comments labeled as Offensive or Neutral. These comments were sourced from Instagram and labeled by two linguists. Machine learning models were trained on this dataset, with the ParsBert model achieving 90% accuracy in detecting offensive speech in Persian.

关键词： Accuracy Social networking (online) Computational modeling Prevention and mitigation Hate speech Text categorization Natural language processing Web sites Multimedia communication Research and development

来源：评论

学校读者我要写书评

暂无评论

Beam Maps of the Canadian Hydrogen Intensity Mapping Experiment (CHIME) Measured with a Drone

IEEE Open Journal of Antennas and Propagation

引用

IEEE Open Journal of Antennas and Propagation 2025年第3期6卷 928-940页

作者： Tyndall, Will Reda, Alex Shaw, J. Richard Bandura, Kevin Chakraborty, Arnab Halpern, Mark Harris, Maile Kuhn, Emily MacEachern, Joshua Mena-Parra, Juan Newburgh, Laura Ordog, Anna Pinsonneault-Marotte, Tristan Polish, Anna Rose Saliwanchik, Ben Sanghavi, Pranav Siegel, Seth R. Whitmer, Audrey Wulf, Dallas Yale University Department of Physics New HavenCT06511 United States McGill University Department of Physics MontrealQC Canada McGill University Trottier Space Institute MontrealQC Canada University of British Columbia Department of Physics and Astronomy VancouverBC Canada West Virginia University Department of Computer Science and Electrical Engineering MorgantownWV United States West Virginia University Center for Gravitational Waves and Cosmology MorgantownWV United States Johns Hopkins University Applied Physics Laboratory LaurelMD United States Jet Propulsion Laboratory California Institute of Technology 4800 Oak Grove Drive PasadenaCA91109 United States University of Toronto Dunlap Institute for Astronomy and Astrophysics TorontoON Canada David A. Dunlap Department of Astronomy and Astrophysics University of Toronto TorontoON Canada Department of Computer Science Math Physics and Statistics University of British Columbia Okanagan Campus KelownaBC Canada Dominion Radio Astrophysical Observatory Herzberg Astronomy and Astrophysics Research Center National Research Council Canada PentictonBC Canada Center for Astrophysics Harvard and Smithsonian CambridgeMA02138 United States Brookhaven National Laboratory Instrumentation Division UptonNY11973 United States Perimeter Institute for Theoretical Physics WaterlooON Canada

We present beam measurements of the CHIME telescope using a radio calibration source deployed on a drone payload. During test flights, the pulsing calibration source and the telescope were synchronized to GPS time, enabling in-situ background subtraction for the full N2 visibility matrix for one CHIME cylindrical reflector. We use the autocorrelation products to estimate the primary beam width and centroid location, and compare these quantities to solar transit measurements and holographic measurements where they overlap on the sky. We find that the drone, solar, and holography data have similar beam parameter evolution across frequency and both spatial coordinates. This paper presents the first drone-based beam measurement of a large cylindrical radio interferometer. Furthermore, the unique analysis and instrumentation described in this paper lays the foundation for near-field measurements of experiments like CHIME. © 2020 IEEE.

关键词： Drones

来源：评论

学校读者我要写书评

暂无评论

Self-Coexistence Among Cognitive Radio Networks Using Risk-Motivated Channel Selection Based Deference Structure

引用

Tsinghua science and Technology 2013年第3期18卷 242-249页

作者： Kenneth Ezirim Shamik Sengupta Department of Computer Science Graduate Center Department of Math. and Comp. Sci. John Jay College

Among cognitive radio networks there is a persistent trend of competition to acquire under-utilized and idle channels for data transmission. The competition for spectrum resources often results in the misuse of the spectrum resources as networks experience contention in attempt to access unoccupied spectrum bands. The competitive scenario causes cognitive radio networks to incur a huge amount of loss, which constitutes a major problem of self-coexistence among networks. As a way to minimize these losses we present a self-coexistence mechanism that allows cognitive radio networks to coexist with each other by implementing a risk-motivated channel selection based on deference structure. Cognitive radio networks form deference structure community to have more efficient access to a channel of interest and can defer transmission to one another on that channel, thereby minimizing the chances of conflicts. As part of the decision making process to become a member of a deference structure community, cognitive radio networks rely on a risk-motivated channel selection scheme to evaluate the tentative deference structure channel. We provide numerical and simulation results that demonstrates the benefits of the proposed self-coexistence mechanism and show how it helps networks to coordinate their spectrum activities, minimize contention experienced and improve their utility. We also emphasize on the importance of the deference structure community size with regards to the average performance of member networks.

关键词： dynamic spectrum access cognitive radio self-coexistence deference deference structure

来源：评论

学校读者我要写书评

暂无评论

Strategies for polyhedral surface decomposition: An experimental study 95

Strategies for polyhedral surface decomposition: An experime...

引用

Proceedings of the 11th Annual Symposium on Computational Geometry

作者： Chazelle, B. Dobkin, D.P. Shouraboura, N. Tal, A. Department of Computer Science Princeton University Program in Applied and Computer. Math. Princeton University

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：