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

2024 IEEE 22nd World Symposium on Applied Machine Intelligence and informatics, SAMI 2024

作者： Jalili, Amirreza Tabrizchi, Hamed Razmara, Jafar Mosavi, Amir College of Science University of Tehran School of Mathematics Statistics and Computer Science Department of Computer Science Tehran Iran University of Tabriz Faculty of Mathematics Statistics and Computer Science Department of Computer Science Tabriz Iran Obuda University John von Neumann Faculty of Informatics Budapest Hungary Ludovika University of Public Service Budapest Hungary

ISBN: (纸本)9798350317206

In the era of digital recruitment and increasing volumes of job applications, the effective categorization and classification of resumes have become essential for streamlining the hiring process. The purpose of this paper is to present a Bidirectional LSTM architecture method designed to enhance the accuracy and efficiency of resume screening and classification. Leveraging the power of the presented bidirectional LSTM architecture allows the network to effectively capture complex information and context. To enhance the model's performance, we also incorporate word embedding, further enriching textual data representation. We evaluate the proposed method using a comprehensive dataset of resumes across various industries and job roles, demonstrating its superior performance in terms of classification accuracy and speed compared to traditional methods. Furthermore, we discuss the potential applications of this method in recruitment automation and offer insights into its scalability and adaptability in real-world scenarios, providing a valuable tool for human resource (HR) professionals and recruitment agencies seeking to optimize their hiring processes. © 2024 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

High-Quality Hypergraph Partitioning

引用

ACM Journal of Experimental Algorithmics 2023年第11期27卷 1-39页

作者： Schlag, Sebastian Heuer, Tobias Gottesbüren, Lars Akhremtsev, Yaroslav Schulz, Christian Sanders, Peter Karlsruhe Institute of Technology Institute of Theoretical Informatics Postfach 6980 Karlsruhe76128 Germany Heidelberg University Faculty for Mathematics and Computer Science Heidelberg69120 Germany

Hypergraphs are a generalization of graphs where edges (aka nets) are allowed to connect more than two vertices. They have a similarly wide range of applications as graphs. This article considers the fundamental and intensively studied problem of balanced hypergraph partitioning (BHP), which asks for partitioning the vertices into k disjoint blocks of bounded size while minimizing an objective function over the hyperedges. Here, we consider the two most commonly used objectives: the cut-net metric and the connectivity *** describe our open-source hypergraph partitioner KaHyPar which is based on the successful multi-level approach - driving it to the extreme of using one level for (almost) every vertex. Using carefully designed data structures and dynamic update techniques, this approach turns out to have a very good time-quality tradeoff. We present two preprocessing techniques - pin sparsification using locality-sensitive hashing (LSH) and community detection based on the Louvain algorithm. The community structure is used to guide the coarsening process that incrementally contracts vertices. Portfolio-based partitioning of the contracted hypergraph then already achieves a good initial solution. While reversing the contraction process, a combination of several refinement techniques achieves a good final partitioning. In particular, we support a highly-localized local search that can directly produce a k-way partitioning and complement this with flow-based techniques that take a more global view. Optionally, a memetic algorithm evolves a pool of solution candidates to an overall good *** evaluate KaHyPar for a large set of instances from a wide range of application domains. With respect to quality, KaHyPar outperforms all previously considered systems that can handle large hypergraphs such as hMETIS, PaToH, Mondriaan, or Zoltan. Somewhat surprisingly, to some extend, this even extends to graph partitioners such as KaHIP when considering the special case

关键词： Coarsening

来源：评论

学校读者我要写书评

暂无评论

A bug in Linux ACL implementation 24

A bug in Linux ACL implementation

引用

24th Conference Information Technologies - Applications and Theory, ITAT 2024

作者： Janáček, Jaroslav Comenius University in Bratislava Faculty of Mathematics Physics and Informatics Department of Computer Science Mlynská dolina Bratislava842 48 Slovakia

We demonstrate and analyse a long-standing bug in the Linux kernel ACL permission checking code that, under specific circumstances, allows users and/or groups to access filesystem objects they should not be allowed to... 详细信息

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Q-Rung Orthopair Fuzzy Sets-Enhanced FMEA for COVID-19 Risk Assessment

Informatica (Slovenia)

引用

Informatica (Slovenia) 2025年第1期49卷 81-92页

作者： Abdullah, Lazim Awang, Noor Azzah Qiyas, Muhammad Special Interest Group of Modelling and Data Analytics Faculty of Computer Science and Mathematics Universiti Malaysia Terengganu Kuala Nerus21030 Malaysia College of Computing Informatics and Mathematics Universiti Teknologi MARA Selangor Shah Alam40450 Malaysia Department of Mathematics Riphah International University Failsabad Campus Pakistan

Failure Modes and Effects Analysis (FMEA) is a widely used tool for risk analysis, primarily to identify risk factors affecting system quality. Due to the limitations of the traditional FMEA model, several recent models incorporating advanced fuzzy set extensions have been developed to enhance the reliability of risk assessment outcomes. However, most of these models limit expert flexibility in expressing preferences and often overlook the impact of unequal expert weights and the stability of risk ranking results. This study introduces a new FMEA model based on Q-Rung Orthopair Fuzzy Sets (Q-ROFSs), termed Q-ROFSs-FMEA. Q-ROFSs, an extension of intuitionistic fuzzy sets, introduce a new linguistic term. The Q-ROFSs-FMEA model considers the unequal weights of experts, enabling a dynamic representation of expert preferences. These weights and the linguistic evaluation of risk factors are integrated through an aggregation operator, facilitating consensus among experts. The model is applied to a case study on COVID-19 risk factors, revealing that ‘older age’ (risk priority number 0.000012) is the highest risk factor, while ‘gender’ (risk priority number -0.0037) is the lowest. It is found that the ranking of risk factors determined by the Q-ROFSs-FMEA model is obtained as FM1 FM3 FM6 FM4 FM5 FM7 FM8 FM2 . Furthermore, a comparative analysis indicates consistent ranking results across different models, demonstrating the reliability of the proposed model. The case study and comparative analysis validate the effectiveness and applicability of the Q-ROFSsbased risk assessment model. © 2025 Slovene Society Informatika. All rights reserved.

关键词： Failure modes

来源：评论

学校读者我要写书评

暂无评论

On the Uncrossed Number of Graphs 32

On the Uncrossed Number of Graphs

引用

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

来源：评论

学校读者我要写书评

暂无评论

RT-PPS: Real-time privacy-preserving scheme for cloud-hosted IoT data

引用

Journal of High Speed Networks 2025年第1期31卷 71-89页

作者： Elhoseny, Mohamed Riad, Khaled College of Computing and Informatics University of Sharjah Sharjah27272 United Arab Emirates Faculty of Computers and Information Mansoura University Mansoura35516 Egypt Computer Science Department College of Computer Sciences & Information Technology King Faisal University Al-Ahsa 31982 Saudi Arabia Mathematics Department Faculty of Science Zagazig University Zagazig44519 Egypt

The Internet of Things (IoT) is a rapidly growing network of devices that can communicate with each other and with cloud-based services. These devices generate vast amounts of data that can be used to provide valuable insights into user behavior, environmental conditions, and other important factors. However, as this data is collected and processed by cloud-hosted services, there is a growing concern about privacy and security. Without adequate protection, sensitive information could be exposed to hackers or other malicious actors, putting both individuals and organizations at risk. To address this challenge, real-time privacy-preserving techniques can be used to protect IoT data without compromising its value. This paper introduces an efficient Real-time privacy-preserving scheme (RT-PPS) for cloud-hosted IoT data. RT-PPS employs multi-authority attribute-based encryption on a hybrid cloud environment to keep data secure and private, while still allowing it to be processed and analyzed by cloud-hosted services. RT-PPS has efficient response time and resource consumption, which gives it the ability to handle a huge number of concurrent users at the same time without notable delay. The proposed RT-PPS has been validated through extensive experimental evaluation on a variety of configurations. Moreover, the proposed scheme has been computationally compared with the state-of-the-artwork. RT-PPS has shown excellent performance, effectiveness, and efficiency. The RT-PPS encryption time for a 1 GB dataset while considering 1024 slices is approximately 1000 ms. Also, the RT-PPS decryption time for a 1 GB ciphertext while considering 1024 slices are approximately 235 ms. Finally, RT-PPS is proven secure against any polynomial-time attacks and their variations that have at most a negligible advantage in the introduced security model. Moreover compared to most of the state-of-the-artwork, RT-PPS reduced the ciphertext size and lowered the computations in the encryption, key g

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds 32

Separable Convex Mixed-Integer Optimization: Improved Algori...

引用

32nd Annual European Symposium on Algorithms, ESA 2024

作者： Brand, Cornelius Koutecký, Martin Lassota, Alexandra Ordyniak, Sebastian Faculty for Informatics and Computer Science University of Regensburg Germany Computer Science Institute Faculty of Mathematics and Physics Charles University Prague Czech Republic Eindhoven University of Technology Netherlands University of Leeds United Kingdom

ISBN: (纸本)9783959773386

We provide several novel algorithms and lower bounds in central settings of mixed-integer (non-)linear optimization, shedding new light on classic results in the field. This includes an improvement on record running time bounds obtained from a slight extension of Lenstra's 1983 algorithm [Math. Oper. Res.'83] to optimizing under few constraints with small coefficients. This is important for ubiquitous tasks like knapsack-, subset sum- or scheduling problems [Eisenbrand and Weismantel, SODA'18, Jansen and Rohwedder, ITCS'19]. Further, we extend our algorithm to an intermediate linear optimization problem when the matrix has many rows that exhibit 2-stage stochastic structure, which adds to a prominent line of recent results on this and similarly restricted cases [Jansen et al. ICALP'19, Cslovjecsek et al. SODA'21, Brand et al. AAAI'21, Klein, Reuter SODA'22, Cslovjecsek et al. SODA'24]. We also show that the generalization of two fundamental classes of structured constraints from these works (n-fold and 2-stage stochastic programs) to separable-convex mixed-integer optimization are harder than their mixed-integer, linear counterparts. This counters a widespread belief popularized initially by an influential paper of Hochbaum and Shanthikumar, namely that "convex separable optimization is not much harder than linear optimization" [J. ACM'90]. To obtain our algorithms, we employ the mixed Graver basis introduced by Hemmecke [Math. Prog.'03], and our work is the first to give bounds on the norm of its elements. Importantly, we use these bounds differently from how purely-integer Graver bounds are exploited in related approaches, and prove that, surprisingly, this cannot be avoided. © Cornelius Brand, Martin Koutecký, Alexandra Lassota, and Sebastian Ordyniak;licensed under Creative Commons License CC-BY 4.0.

关键词： Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Large Scale Study of Binary Galaxy Image Classification and the Impact of Image Augmentation Techniques 23rd

Large Scale Study of Binary Galaxy Image Classification and...

引用

23rd International Conference on Computational science and Its Applications , ICCSA 2023

作者： Mūžas, Tomas Misiukas Misiūnas, Andrius Vytautas Meškauskas, Tadas Institute of Computer Science Faculty of Mathematics and Informatics Vilnius University Didlaukio 47 Vilnius08303 Lithuania

ISBN: (纸本)9783031368073

Current galaxy classification studies are usually conducted on small, expert-classified datasets, constrained within a low redshift (z) range. Lower redshift implies better image quality – the lower the z value, the closer the object is, thus more features and details can be observed. Additionally, various augmentation methods are used to further improve classification accuracy, however, there is a lack of studies measuring their impact on other metrics. Therefore, we study the impact of augmentation techniques using the largest dataset that covers a broad redshift range (315,942 galaxies, 0 © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Morphology

来源：评论

学校读者我要写书评

暂无评论

On the complexity of Maslov's class K¯ 24

On the complexity of Maslov's class K¯

引用

39th Annual ACM/IEEE Symposium on Logic in computer science, LICS 2024

作者： Fiuk, Oskar Kieronski, Emanuel Michielini, Vincent Institute of Computer Science University of Wroclaw Wroclaw60016147 Poland Faculty of Mathematics Informatics and Mechanics University of Warsaw Warsaw60013756 Poland

ISBN: (纸本)9798400706608

Maslov's class K is an expressive fragment of First-Order Logic known to have decidable satisfiability problem, whose exact complexity, however, has not been established so far. We show that K has the exponential-sized model property, and hence its satisfiability problem is NExpTime-complete. Additionally, we get new complexity results on related fragments studied in the literature, and propose a new decidable extension of the uniform one-dimensional fragment (without equality). Our approach involves a use of satisfiability games tailored to K and a novel application of paradoxical tournament graphs. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Computability and decidability

来源：评论

学校读者我要写书评

暂无评论

Optimizing Symbol Visibility Through Displacement 19

Optimizing Symbol Visibility Through Displacement

引用

19th Scandinavian Symposium on Algorithm Theory, SWAT 2024

作者： Gärtner, Bernd Kalani, Vishwas Reddy, Meghana M. Meulemans, Wouter Speckmann, Bettina Stojaković, Miloš Department of Computer Science ETH Zürich Switzerland Department of Computer Science and Engineering I.I.T. Delhi India Department of Mathematics and Computer Science TU Eindhoven Netherlands Department of Mathematics and Informatics Faculty of Sciences University of Novi Sad Serbia

ISBN: (纸本)9783959773188

In information visualization, the position of symbols often encodes associated data values. When visualizing data elements with both a numerical and a categorical dimension, positioning in the categorical axis admits some flexibility. This flexibility can be exploited to reduce symbol overlap, and thereby increase legibility. In this paper we initialize the algorithmic study of optimizing symbol legibility via a limited displacement of the symbols. Specifically, we consider unit square symbols that need to be placed at specified y-coordinates. We optimize the drawing order of the symbols as well as their x-displacement, constrained within a rectangular container, to maximize the minimum visible perimeter over all squares. If the container has width and height at most 2, there is a point that stabs all squares. In this case, we prove that a staircase layout is arbitrarily close to optimality and can be computed in O(n log n) time. If the width is at most 2, there is a vertical line that stabs all squares, and in this case, we give a 2-approximation algorithm (assuming fixed container height) that runs in O(n log n) time. As a minimum visible perimeter of 2 is always trivially achievable, we measure this approximation with respect to the visible perimeter exceeding 2. We show that, despite its simplicity, the algorithm gives asymptotically optimal results for certain instances. © Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, and Miloš Stojaković;licensed under Creative Commons License CC-BY 4.0.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：