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

11th International Conference on Intelligent Computing and Applications, ICRTC 2023

作者： Yadav, Poonam Satheesh Kumar, S. Muthukumaran, V. Sandeep Kumar, Mathivanan Radhika, E.K. Department of Computer Science School of Applied Sciences Reva University Bangalore India Department of Mathematics College of Engineering and Technology SRM Institute of Science and Technology Tamil Nadu Kattankulathur 603203 India School of Computer Science and Engineering Galgotias University Uttar Pradesh Greater Noida203201 India Department of Computer Science and Applications Sindhi College Bangalore560024 India

ISBN: (纸本)9789819717231

In the polygram substitution, one set of characters is replaced by another set based on algorithm. The model is proposed for calculating and estimating secure online secret shares, where dynamic modification in any of the shares will be identified if number of the shares are more than specified threshold value. The security is based on the intractability of factoring as it uses Lagrange polynomial function. This is further enhanced by a graphical masking and unmasking technique;it includes two phases: encryption of the individual secrets and sharing of the data. The generation of the shares is done by masking using Polygram substitution, and the shares are regenerated and unmasking of the qualified shares is done to find original secret. Masking is done on original secret, then shares are generated. Each encrypted share contains information which is different than original secret. Masking by Polygram substitution gives additional protection of secret data on the Internet. Moreover, we achieve efficient recovery of the original secret data. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

Segment Visibility Counting Queries in Polygons 33

Segment Visibility Counting Queries in Polygons

引用

33rd International Symposium on Algorithms and Computation, ISAAC 2022

作者： Buchin, Kevin Custers, Bram van der Hoog, Ivor Löffler, Maarten Popov, Aleksandr Roeloffzen, Marcel Staals, Frank Department of Computer Science TU Dortmund Germany Department of Mathematics and Computer Science TU Eindhoven Netherlands Department of Applied Mathematics and Computer Science DTU Copenhagen Denmark Department of Information and Computing Sciences Utrecht University Netherlands

ISBN: (纸本)9783959772587

Let P be a simple polygon with n vertices, and let A be a set of m points or line segments inside P. We develop data structures that can efficiently count the objects from A that are visible to a query point or a query segment. Our main aim is to obtain fast, O(polylog nm), query times, while using as little space as possible. In case the query is a single point, a simple visibility-polygon-based solution achieves O(log nm) query time using O(nm2) space. In case A also contains only points, we present a smaller, O(n + m2+Ε log n)-space, data structure based on a hierarchical decomposition of the polygon. Building on these results, we tackle the case where the query is a line segment and A contains only points. The main complication here is that the segment may intersect multiple regions of the polygon decomposition, and that a point may see multiple such pieces. Despite these issues, we show how to achieve O(log nlog nm) query time using only O(nm2+Ε + n2) space. Finally, we show that we can even handle the case where the objects in A are segments with the same bounds. © Kevin Buchin, Bram Custers, Ivor van der Hoog, Maarten Löffler, Aleksandr Popov, Marcel Roeloffzen, and Frank Staals.

关键词： Visibility

来源：评论

学校读者我要写书评

暂无评论

Direct Machine Translation Indonesian-Batak Toba 7

Direct Machine Translation Indonesian-Batak Toba

引用

7th International Conference on New Media Studies, CONMEDIA 2023

作者： Abidin, Zaenal Junaidi, Akmal Wamiliana Togatorop, Frengky Marulitua Ahmad, Imam Puspaningrum, Ajeng Savitri Universitas Lampung Doctoral Program of Mathematics and Natural Sciences Bandarlampung Indonesia Universitas Lampung Department of Computer Science Bandarlampung Indonesia Universitas Lampung Department of Mathematics Bandarlampung Indonesia Universitas Teknokrat Indonesia Faculty of Engineering and Computer Science Bandarlampung Indonesia

ISBN: (纸本)9798350307504

The translation application was developed using Python and Visual Studio Code as the primary programming environment. Technological progress has led to the younger generation forsaking the Batak language in their daily interactions, perceiving it as inconsequential to their social circle and contributing to the decline of regional languages. There is concern that regional languages, namely the Batak language, may lose significance or face extinction if this trend persists. This translation program is being implemented to aid in preserving regional languages, specifically the Batak language, enabling it to conform to contemporary circumstances. The development of this translation engine utilized the Batak language dictionary. The process of designing, coding, and testing is responsible for creating this direct machine translation. The BLEU score is employed to assess the caliber of machine translation. The study's findings indicate that the % BLEU value for ten sentences was 32.3%. This score falls within the category of sentences whose meaning can be understood, but the sentence structure still needs development. The direct machine translation developed in this Web platform is highly proficient and practical. © 2023 IEEE.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

Detecting Gender Discrimination on Actor Level Using Linguistic Discourse Analysis 5

Detecting Gender Discrimination on Actor Level Using Linguis...

引用

5th Workshop on Gender Bias in Natural Language Processing, GeBNLP 2024, held in conjunction with the 62nd Annual Meeting of the Association for Computational Linguistics, ACL 2024

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

ISBN: (纸本)9798891761377

With the usage of tremendous amounts of text data for training powerful large language models such as ChatGPT, the issue of analysing and securing data quality has become more pressing than ever. Any biases, stereotypes and discriminatory patterns that exist in the training data can be reproduced, reinforced or broadly disseminated by the models in production. Therefore, it is crucial to carefully select and monitor the text data that is used as input to train the model. Due to the vast amount of training data, this process needs to be (at least partially) automated. In this work, we introduce a novel approach for automatically detecting gender discrimination in text data on the actor level based on linguistic discourse analysis. Specifically, we combine existing information extraction (IE) techniques to partly automate the qualitative research done in linguistic discourse analysis. We focus on two important steps: Identifying the respective person-named-entity (an actor) and all forms it is referred to (Nomination), and detecting the characteristics it is ascribed (Predication). As a proof of concept, we integrate these two steps into a pipeline for automated text analysis. The separate building blocks of the pipeline could be flexibly adapted, extended, and scaled for bigger datasets to accommodate a wide range of usage scenarios and specific ML tasks or help social scientists with analysis tasks. We showcase and evaluate our approach on several real and simulated exemplary texts. ©2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Analysis of a priority queueing system with the enhanced fairness of servers scheduling

引用

Journal of Ambient Intelligence and Humanized Computing 2024年第1期15卷 465-477页

作者： Lee, Seokjun Dudin, Alexander Dudina, Olga Kim, Chesoong Department of Management Information Systems Sangji University Wonju26339 Korea Republic of Department of Applied Mathematics and Computer Science Belarusian State University 4 Nezavisimosti Ave. Minsk220030 Belarus Department of Applied Probability and Informatics RUDN University 6 Miklukho-Maklaya st. Moscow117198 Russia Department of Business Administration Sangji University Wonju26339 Korea Republic of

A multi-server queueing system with two types of customers is analyzed. Both types of customers have own reserved servers and also there is a pool of servers that can be used by both types of customers. Type 1 customers have almost preemptive priority with flexible use of a priority depending on the current number of customers of this type in an infinite buffer. Type 2 customers do not have an input buffer and are lost in cases of absence of available servers upon arrival or expelling (forced termination) from service by Type 1 customers. A multi-dimensional Markov chain, which defines the dynamics of the considered system under the fixed total number of servers, numbers of reserved servers, a pattern of the correlated arriving processes, service rates, and the thresholds defining the mechanism of expelling Type 2 customers from service, is analyzed. A numerical example of solving an optimization problem based on the obtained results is considered. Results can be used for the elaboration of enhanced protocols of servers scheduling in many real-world systems including cognitive radio networks with channels leasing. © The Author(s) 2022.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

Using Videoconferencing Systems and Interactive Tools: Empirical French Investigation 13th

Using Videoconferencing Systems and Interactive Tools: Empir...

引用

13th International Conference on Methodologies and Intelligent Systems for Technology Enhanced Learning, mis4TEL 2023

作者： Impedovo, Maria Ett, Benjamin Khalid, Md Saiffudin ADEF Aix Marseille University Marseille France Stat & Data Section Department of Applied Mathematics and Computer Science Kongens Lyngby Denmark

ISBN: (纸本)9783031421334

This paper reports the existing methods, didactics, and problems experienced during video conferencing systems (VCS)-mediated live teaching sessions at a French higher educational institution. Data collected through surveys, interviews, observations, and other methods are analyzed by applying PACT (people, activities, context, and technology) framework. The study is conducted as part of defining the needs and criteria for designing portable video-conferencing toolkits containing a set of hardware and software, guidelines as good practices, and training. The paper contributes with empirical evidence from French higher education context and two main take-aways reconfirming findings in existing literature. First, individual teachers’ and students’ preferences and expectations play central role in the learning and integration of VCS. Second, the students’ perceived central problems are associated with either (1) technological and organizational (i.e. systems blame) or (2) communication and pedagogy - motivation, concentration, and academic engagement (individual blame). For desired-quality interactive live online teaching, training of students and teachers regarding the factors affecting the experience should facilitate reflection on action in VCS use, compared to the emphasis on VCS functionalities and teachers/student competence and behavior. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Robustness of Visual Explanations to Common Data Augmentation Methods

Robustness of Visual Explanations to Common Data Augmentatio...

引用

2023 IEEE/CVF Conference on computer Vision and Pattern Recognition Workshops, CVPRW 2023

作者： Tětková, Lenka Hansen, Lars Kai Technical University of Denmark Department of Applied Mathematics and Computer Science Richard Petersens Plads 321 Lyngby2800 Kgs. Denmark

ISBN: (纸本)9798350302493

As the use of deep neural networks continues to grow, understanding their behaviour has become more crucial than ever. Post-hoc explainability methods are a potential solution, but their reliability is being called into question. Our research investigates the response of post-hoc visual explanations to naturally occurring transformations, often referred to as augmentations. We anticipate explanations to be invariant under certain transformations, such as changes to the colour map while responding in an equivariant manner to transformations like translation, object scaling, and rotation. We have found remarkable differences in robustness depending on the type of transformation, with some explainability methods (such as LRP composites and Guided Backprop) being more stable than others. We also explore the role of training with data augmentation. We provide evidence that explanations are typically less robust to augmentation than classification performance, regardless of whether data augmentation is used in training or not. © 2023 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Inertial extrapolation method with regularization for solving a new class of bilevel problem in real Hilbert spaces

引用

SeMA Journal 2023年第3期80卷 503-524页

作者： Akutsah, Francis Mebawondu, Akindele Adebayo Ugwunnadi, Godwin Chidi Pillay, Paranjothi Narain, Ojen Kumar School of Mathematics Statistics and Computer Science University of KwaZulu-Natal Durban South Africa Department of Computer Science and Mathematics Mountain Top University Ogun State Prayer City Nigeria DST-NRF Centre of Excellence in Mathematical and Statistical Sciences (CoE-MaSS) Johannesburg South Africa Department of Mathematics University of Eswatini Kwaluseni Swaziland Department of Mathematics and Applied Mathematics Sefako Makgatho Health Sciences University Pretoria South Africa

The purpose of this paper is to introduce a new class of bilevel problem in the frame work of a real Hilbert space. In addition, we introduce an inertial iterative method with a regularization term and we establish the strong convergence of the resulting methods under certain conditions imposed on regularization parameters. Finally, we present some numerical experiments to show the efficiency and applicability of the proposed method. The results obtained in this paper extend, generalize and improve several results in this direction. © 2022, The Author(s), under exclusive licence to Sociedad Española de Matemática Aplicada.

关键词： Bilevel variational inequality Fixed point problem Inertial iterative scheme Split feasibility problem Split variational inequality problem

来源：评论

学校读者我要写书评

暂无评论

A Rewiring Contrastive Patch PerformerMixer Framework for Graph Representation Learning

A Rewiring Contrastive Patch PerformerMixer Framework for Gr...

引用

2023 IEEE International Conference on Big Data, BigData 2023

作者： Sun, Zhongtian Harit, Anoushka Cristea, Alexandra I. Wang, Jingyun Lio, Pietro Durham University Department of Computer Science Durham United Kingdom University of Cambridge Department of Applied Mathematics and Theoretical Physics Department of Psychology Cambridge United Kingdom University of Cambridge Department of Computer Science and Technology Cambridge United Kingdom

ISBN: (纸本)9798350324457

Integrating transformers with graph representation learning has emerged as a research focal point. However, recent studies showed that positional encoding in Transformers does not capture enough structural information between nodes. Additionally, existing graph neural network (GNN) models face the oversquashing issue, impeding information retention from distant nodes. To address, we transform graphs into regular structures, such as tokens, to enhance positional understanding and leverage transformer strengths. Inspired by the visual transformer (ViT) model, we propose partitioning graphs into patches and apply GNN models obtain fixed size vectors. Notably, our approach adopts contrastive learning for in-depth graph structure and incorporate more topological information via Ricci curvature to alleviate over-squashing problem by attenuating the effects of negatively curved edges while preserving the original graph structure. Unlike existing graph rewiring methods that directly modify graph structure by adding or removing edges, this approach is potentially more suitable for applications such as molecular learning where structural preservation is important. Our innovative pipeline subsequently introduces the PerformerMixer, a transformer variant with linear complexity, ensuring efficient computation. Evaluations on real-world benchmarks demonstrate our framework's superior performance, like Peptides-func and achieve 3-WL expressiveness. © 2023 IEEE.

关键词： Contrastive learning Graph representation learning Transformer

来源：评论

学校读者我要写书评

暂无评论

Intrusion Detection Systems in Internet of Things Using Machine Learning Algorithms: A Comparative Study 1

引用

International Conference on Advanced Intelligent Systems for Sustainable Development, AI2SD 2022

作者： Rachid, Hdidou Mohamed, El Alami Ahmed, Drissi ERMIA Team Department of Mathematics and Computer Science National School of Applied Sciences Tangier Abdelmalek Essaadi University Tétouan Morocco

ISBN: (数字)9783031352515

ISBN: (纸本)9783031352508

The Internet of Things, or IoT, refers to the ability of objects to communicate with one another via the Internet and these objects can transfer data using many types of sensors and mobile or web applications without the need for human intervention. This technology is becoming more important in several fields such as the field of transport and logistics to monitor the temperature of the warehouses of the materials to be transported or monitor the condition of the vehicles themselves. The health field for monitoring the health status of certain disease states, such as heart disease, using sensors. The field of general security as well to give alerts to water, electricity, and gas problems at homes or in factories, or alerts to the danger of forest incidents using sensors and web or mobile applications. Etc.……. Recently, the security of Internet of Things applications and data exchanged in Internet of Things networks will be a necessity with the increased use of this technology in our daily lives. Cybersecurity researchers are trying to offer solutions adapted to Internet of Things networks. Several solution paths have been proposed in recent years, including solutions based on cryptography to secure communication and data exchange, solutions based on Blockchain for the security of communication between devices in Internet of Things networks, and solutions based on Intrusion Detection Systems as well. Intrusion Detection Systems are considered one of the techniques most discussed by researchers to implement security solutions for the Internet of Things, especially IDSs based on artificial intelligence techniques such as Machine Learning. This paper presented a comparison between five Machine Learning algorithms (Support Vector Machine, J48, Random Forest, Decision Table, and Naive Bayes) in the context of intrusion detection. In this comparison, we used the NSL-KDD dataset (Network Security Laboratory - Knowledge Discovery in Databases). The main objective behind this

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：