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

On the parameterized complexity of the expected coverage problem 1

15th International computer Science Symposium in Russia, CSR 2020

作者： Fomin, Fedor V. Ramamoorthi, Vijayaragunathan Department of Informatics University of Bergen Bergen5020 Norway Department of Computer Science and Engineering IIT Madras Chennai India

ISBN: (数字)9783030500269

ISBN: (纸本)9783030500252

The Maximum covering location problem (MCLP) is a well-studied problem in the field of operations research. Given a network with demands (demands can be positive or negative) on the nodes, an integer budget k, the MCLP seeks to find k potential facility centers in the network such that the neighborhood coverage is maximized. We study the variant of MCLP where edges of the network are subject to random failures due to some disruptive events. One of the popular models capturing the unreliable nature of the facility location is the linear reliable ordering (LRO) model. In this model, with every edge e of the network, we associate its survival probability (formula presented), or equivalently, its failure probability (formula presented). The failure correlation in LRO is the following: If an edge e fails then every edge (formula presented) with (formula presented) surely fails. The task is to identify the positions of k facilities that maximize the expected coverage. We refer to this problem as Expected Coverage problem. We study the Expected Coverage problem from the parameterized complexity perspective and obtain the following results. *** the parameter treewidth, we show that the Expected Coverage problem is W[1]-hard. We find this result a bit surprising, because the variant of the problem with non-negative demands is fixed-parameter tractable (FPT) parameterized by the treewidth of a *** complement the lower bound by the proof that Expected Coverage is FPT being parameterized by the treewidth and the maximum vertex degree. We give an algorithm that solves the problem in time (formula presented), where (formula presented) is the treewidth, (formula presented) is the maximum vertex degree, and n the number of vertices of the input graph. In particular, since (formula presented), it means the problem is solvable in time (formula presented), that is, is in XP parameterized by treewidth. © Springer Nature Switzerland AG 2020.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

STAR-RIS-NOMA Assisted Power Constrained Covert Communication Systems

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Lei, Yuxin Huang, Gaojian Li, Xingwang Tian, Zhifa Mumtaz, Shahid Asif, Muhammad Henan Polytechnic University School of Physics and Electronic Information Engineering Jiaozuo454003 China City University of Macau Faculty of Data Science 999078 China Henan Polytechnic University School of Surveying and Land Information Engineering Jiaozuo454003 China Henan Polytechnic University School of Physics and Electronic Information Engineering Jiaozuo454099 China Southeast University National Mobile Communications Research Laboratory Nanjing210096 China Silesian University of Technology Department of Applied Informatics Gliwice Poland Department of Engineering Nottingham Trent University United Kingdom Jiangsu University School of Computer Science and Communication Engineering Zhenjiang China

In this paper, a covert communication system assisted by a simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) in non-orthogonal multiple access (NOMA) networks is proposed. When the maximum channel power gain from the transmitter in the main network to the users in adjacent networks is smaller than the threshold, the transmitter sends the NOMA signals to the users with the assistance of STAR-RIS. Moreover, channel estimation errors and imperfect successive interference cancellation (SIC) are considered in the system analysis. To characterize the covert performance, the detection error probability (DEP) and the average minimum detection error probability (AMDEP) are first derived. Then, the closed-form solutions of the outage probability (OP) for the users are obtained. Finally, the maximum effective covert rate (ECR) subject to the covertness constraint and non-interruption constraint is studied. The numerical simulation results show that: 1) the detection performance of Willie (warden) deteriorates as the channel estimation errors increase;2) when the transmitter power exceeds the threshold, communication in the main network is interrupted;3) under a certain transmit power, the maximum ECR increases with the increasing of the number of STAR-RIS reflection elements. © 2025 IEEE.

关键词： Channel estimation

来源：评论

学校读者我要写书评

暂无评论

Pre-trained Molecular Language Models with Random Functional Group Masking

arXiv

引用

arXiv 2024年

作者： Peng, Tianhao Li, Yuchen Li, Xuhong Bian, Jiang Xie, Zeke Sui, Ning Mumtaz, Shahid Xu, Yanwu Kong, Linghe Xiong, Haoyi Baidu Research Baidu Inc Haidian Beijing100085 China School of Computer Science and Engineering Beihang University Haidian Beijing100091 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai Minhang200240 China Guangdong Guangzhou511455 China Department of Molecular and Structural Biochemistry North Carolina State University RaleighNC27695 United States Department of Computer Science Nottingham Trent University Nottingham United Kingdom Department of Applied Informatics Silesian University of Technology Gliwice Poland School of Future Technology South China University of Technology Guangdong Guangzhou510641 China

Recent advancements in computational chemistry have leveraged the power of transformer-based language models, such as MoLFormer, pre-trained using a vast amount of simplified molecular-input line-entry system (SMILES) sequences, to understand and predict molecular properties and activities, a critical step in fields like drug discovery and materials science. To further improve performance, researchers have introduced graph neural networks with graph-based molecular representations, such as GEM, incorporating the topology, geometry, 2D or even 3D structures of molecules into pre-training. While most of molecular graphs in existing studies were automatically converted from SMILES sequences, it is to assume that transformer-based language models might be able to implicitly learn structure-aware representations from SMILES sequences. In this paper, we propose MLM-FG – a SMILES-based Molecular Language Model, which randomly masking SMILES subsequences corresponding to specific molecular Functional Groups to incorporate structure information of atoms during the pre-training phase. This technique aims to compel the model to better infer molecular structures and properties, thus enhancing its predictive capabilities. Extensive experimental evaluations across 11 benchmark classification and regression tasks in the chemical domain demonstrate the robustness and superiority of MLM-FG. Our findings reveal that MLM-FG outperforms existing pre-training models, either based on SMILES or graphs, in 9 out of the 11 downstream tasks, ranking as a close second in the remaining ones. Remarkably, MLM-FG also surpasses 3D-graph-based models, which explicitly incorporate molecular structures into their inputs, highlighting its exceptional capacity for representation learning even without explicit 3D structural information. These results indicate that MLM-FG effectively captures the nuanced language of molecules, offering promising implications for computational chemistry and related disci

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Evaluating Physician-AI Interaction for Cancer Management: Paving the Path towards Precision Oncology

arXiv

引用

arXiv 2024年

作者： Hussain, Zeshan Lam, Barbara D. Acosta-Perez, Fernando A. Riaz, Irbaz Bin Jacobs, Maia Yee, Andrew J. Sontag, David Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology United States Division of Hematology and Oncology Department of Medicine Beth Israel Deaconess Medical Center Division of Clinical Informatics Department of Medicine Beth Israel Deaconess Medical Center Department of Industrial and Systems Engineering University of Wisconsin-Madison United States Division of Hematology and Oncology Department of Medicine Mayo Clinic AZ United States Department of Computer Science McCormick School of Engineering Northwestern University United States Division of Hematology and Oncology Department of Medicine Massachusetts General Hospital United States

Purpose: Evaluate how clinicians approach clinical decision-making when given findings from both randomized controlled trials (RCTs) and machine learning (ML) models. Methods: We designed a clinical decision support system (CDSS) that displays survival curves and adverse event information from a synthetic RCT and ML model for 12 patients with multiple myeloma. We conducted an interventional study in a simulated setting to evaluate how clinicians synthesized the available data to make treatment decisions. Participants were invited to participate in a follow-up interview to discuss their choices in an open-ended format. Results: The cohort contained 32 physicians. When ML model results were concordant with RCT results, physicians had increased confidence in treatment choice compared to when they were given RCT results alone. When ML model results were discordant with RCT results, the majority of physicians followed the ML model recommendation in their treatment selection. Perceived reliability of the ML model was consistently higher after physicians were provided with data on how it was trained and validated. Follow-up interviews revealed four major themes: (1) variability in what variables participants used for decision-making, (2) perceived advantages to an ML model over RCT data, (3) uncertainty around decision-making when the ML model quality was poor, and (4) perception that this type of study is an important thought exercise for clinicians. Conclusion: ML-based CDSSs have the potential to change treatment decisions in cancer management. Meticulous development and validation of these systems as well as clinician training are required before deployment. Copyright © 2024, The Authors. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Generalized planar Turán numbers related to short cycles

arXiv

引用

arXiv 2024年

作者： Gyo, Ervin Karim, Hilal Hama Alfréd Rényi Institute of Mathematics HUN-REN Budapest Hungary Department of Computer Science and Information Theory Faculty of Electrical Engineering and Informatics Budapest University of Technology and Economics Műegyetem rkp. 3. BudapestH-1111 Hungary

Given two graphs H and F, the generalized planar Turán number exP(n, H, F) is the maximum number of copies of H that an n-vertex F-free planar graph can have. We investigate this function when H and F are short cycles. Namely, for large n, we find the exact value of exP(n, Cl, C3), where Cl is a cycle of length l, for 4 ≤ l ≤ 6, and determine the extremal graphs in each case. Also, considering the converse of these problems, we determine sharp upper bounds for exP(n, C3, Cl), for 4 ≤ l ≤ 6. © 2024, CC BY-NC-SA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Nudging through Friction: an Approach for Calibrating Trust in Explainable AI 8

Nudging through Friction: an Approach for Calibrating Trust ...

引用

8th IEEE International Conference on Behavioural and Social Computing, BESC 2021

作者： Naiseh, Mohammad Al-Mansoori, Reem S. Al-Thani, Dena Jiang, Nan Ali, Raian School of Electronics and Computer Science University of Southampton Southampton United Kingdom College of Science and Engineering Hamad Bin Khalifa University Doha Qatar Department of Computing and Informatics Bournemouth University Poole United Kingdom

ISBN: (纸本)9781665400237

Explainability has become an essential requirement for safe and effective collaborative Human-AI environments, especially when generating recommendations through black-box modality. One goal of eXplainable AI (XAI) is to help humans calibrate their trust while working with intelligent systems, i.e., avoid situations where human decision-makers over-trust the AI when it is incorrect, or under-trust the AI when it is correct. XAI, in this context, aims to help humans understand AI reasoning and decide whether to follow or reject its recommendations. However, recent studies showed that users, on average, continue to overtrust (or under-trust) AI recommendations which is an indication of XAI's failure to support trust calibration. Such a failure to aid trust calibration was due to the assumption that XAI users would cognitively engage with explanations and interpret them without bias. In this work, we hypothesize that XAI interaction design can play a role in helping users' cognitive engagement with XAI and consequently enhance trust calibration. To this end, we propose friction as a Nudge-based approach to help XAI users to calibrate their trust in AI and present the results of a preliminary study of its potential in fulfilling that role. © 2021 IEEE

关键词： Friction

来源：评论

学校读者我要写书评

暂无评论

The effect of data acquisition techniques in profiling analysis based on twitter 2

The effect of data acquisition techniques in profiling analy...

引用

2nd International Conference on Information and Communications Technology, ICOIACT 2019

作者： Adi, Sumarni Hartanto, Anggit Dwi Utami, Ema Raharjo, Suwanto Oyong, Irwan Faculty of Computer Science Universitas Amikom Yogyakarta Yogyakarta Indonesia Department of Informatics Engineering IST AKPRIND Yogyakarta Indonesia Informatics Engineering Universitas Amikom Yogyakarta Yogyakarta Indonesia

ISBN: (纸本)9781728116556

Twitter have a tremendous number of tweets from its user. The bigger of the data's volume and more complete the tweet's data that gathered, the more accurate the personality analysis will be. This study is sought to analyze and measure which acquisition technique that viable to be used on the personality profile analysis and to know whether the acquisition technique will always return a huge amount of data volume in a longer time period with a faster time or not. The most commonly used acquisition technique is crawling, streaming and scrapping. This study makes uses of those three acquisition methods to measure the compatibility toward the personality profile analysis. Based on the previous study, the usage of scrapping acquisition method is proved to be an arguably good method as it can acquire a more completed tweet data in a huge amount with bigger computation time and the acquisition time is faster. It caused by the big volume of the data and it need more computational time, so the acquisition speed of the tweet data is faster. Based on that result, scrapping technique is said to be a good option to analyze someone's personality profile. © 2019 IEEE

关键词： Data acquisition

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Logic-based Steganographic Scheme for high Payload Capacity with high Imperceptibility

Fuzzy Logic-based Steganographic Scheme for high Payload Cap...

引用

International Symposium on Digital Forensic and Security (ISDFS)

作者： Ingororano Théophile Ntivuguruzwa Jean De La Croix Tohari Ahmad Department of Computer Engineering Yeungnam University Gyeongsan South Korea Department of Information Management Adventist University of Central Africa Kigali Rwanda Department of Informatics Institut Teknologi Sepuluh Nopember Surabaya Indonesia African Center of Excellence in Internet of Things University of Rwanda Kigali Rwanda

When communicating confidential information between two parties, it is crucial to consider the security of the information. Cryptography, as well as steganography, are essentially used to keep hidden, secret data. Cryptography mainly focuses on changing private messages into an unreadable format. However, cryptography is questionable because it shows the existence of covert communication; hence there is a need to use it combined with other more secure techniques. On the other hand, steganography conceals confidential data in a cover media to avoid suspicion of covert communication. Most practitioners use different steganographic algorithms selected based on their capacity to carry large payloads with a quality cover image. This paper introduces a new algorithm to hide confidential data using fuzzy logic in digital images with increased payload and high imperceptibility. We use fuzzy logic to identify an image’s edges, which shows the level with which a pixel is attached to any edge during image processing; then, we apply a factor to the data to hide before embedding it to the pixels with low values. Our method effectively conceals large amounts of secret bits while producing a quality stego image that ensures confidentiality in communication through the insecure public network. Experimental results demonstrate the outperformance of our method over the existing schemes for both the peak signal-to-noise ratio and the payload size.

关键词： Fuzzy logic Steganography PSNR Image edge detection Image processing Digital images Digital forensics

来源：评论

学校读者我要写书评

暂无评论

Properties of single-walled carbon nanotube film/Si heterojunctions fabricated in situ

引用

Applied Nanoscience (Switzerland) 2025年第1期15卷 1-20页

作者： Dronina, L.A. Kovalchuk, N.G. Komissarov, I.V. Danilyuk, A.L. Labunov, V.A. Lutsenko, E.V. Danilchyk, A.V. Gaiduk, P.I. Sobolewski, Roman Salvato, M. Prischepa, S.L. Belarusian State University of Informatics and RadioElectronics P. Browka Str. 6 Minsk220013 Belarus Department of Electrical and Computer Engineering University of Rochester RochesterNY146270231 United States Stepanov Institute of Physics of NAS Belarus Nezavisimosti Av. 68 Minsk220072 Belarus Belarusian State University Nezavisimosti Av. 4 Minsk220030 Belarus Dipartimento di Fisica Universita di Roma ‘Tor Vergata’ Via della Ricerca Scientifica 1 Rome00133 Italy INFN Universita di Roma ‘Tor Vergata’ Via della Ricerca Scientifica 1 Rome00133 Italy

Single-walled carbon nanotube (SWCNT) film/Si heterojunctions were obtained by depositing SWCNT films directly on a Si substrate by the floating catalyst chemical vapor deposition. The single-walled nature of the nanotubes was proven and confirmed by Raman and infrared spectroscopy, respectively. An additional ethanol post-growth treatment improved the properties of the heterojunctions by increasing densification of SWCNTs and decreasing their sheet resistance. Peaks positions of radial breathing mode obtained from the Raman mapping analysis demonstrated a random chirality (varying between armchair and zigzag) of tube structures and their very narrow diameter distribution, centered at ≈ 1.06 nm. This latter result was also confirmed by infrared spectroscopy. Properties of SWCNT/Si heterojunctions, such as ideality factor, Schottky barrier height, series resistance, SWCNT film work function and density of interface states are presented. To obtain the last two parameters by a self-consistent method, the intermediate nanolayer of silicon oxide between the SWCNT film and Si is considered. Impact of interface states and the native silicon oxide at the SWCNT/Si interface on the properties of heterojunctions is also discussed. Finally, such basic optoelectronic figures of merit as the responsivity, detectivity, and external quantum efficiency in the visible spectral range were determined and found to be comparable to the best reported for other SWCNT-based photodetectors. © King Abdulaziz City for Science and Technology 2025.

关键词： Single-walled carbon nanotubes (SWCN)

来源：评论

学校读者我要写书评

暂无评论

Offline Content-based Recommendation System for Wikimedia Commons Contents

引用

Procedia computer Science 2025年 257卷 485-494页

作者： Ahidjo Maitaigahasse Jean Louis Kedieng Ebongue Fendji Marcellin Atemkeng Department Mathematics and Computer Science Faculty of Science University of Ngaoundere 454 Ngaoundere Cameroon Centre for Research Experimentation and Production School of Chemical Engineering and Mineral Industries University of Ngaoundere 454 Ngaoundere Cameroon Stellenbosch Institute for Advanced Study (STIAS) Wallenberg Research Centre at Stellenbosch University Stellenbosch South Africa Department of Robotics and Industrial Informatics School of Chemical Engineering and Mineral Industries University of Ngaoundere 454 Ngaoundere Cameroon Department of Mathematics Rhodes University P.O. Box 6140 Grahamstown South Africa

Recommendation systems are essential for enhancing digital experiences, but their reliance on internet connectivity limits accessibility in regions with limited or no access. This paper presents an offline content-based recommendation system designed to operate without internet dependency by leveraging precomputed Term Frequency-Inverse Document Frequency (TF-IDF) vectors and cosine similarity. To optimize offline performance, we store a locally computed TF-IDF matrix, allowing efficient retrieval of relevant media items through matrix multiplication instead of real-time computation. The system is evaluated using twenty simulated personas representing diverse user interests, demonstrating its ability to generate personalized relevant recommendations. By eliminating the need for online data access, our system makes educational content from Wikimedia Commons accessible in remote areas, schools, and offline learning environments. These findings highlight the potential of offline recommendation systems in bridging the digital divide and providing equitable access to personalized learning resources.

关键词： Content-based recommendation system Wikimedia commons TF-IDF Cosine Similarity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：