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

2023 International Symposium on Networks, Computers and Communications, ISNCC 2023

作者： Abubaker, Ali Adnan Eleyan, Derar Eleyan, Amna Bejaoui, Tarek Katuk, Norliza Al-Khalidi, Mohammed Palestine Technical University Kadoorie Applied Computing Department Palestine Manchester Metropolitan University Department of Computing and Mathematics Manchester United Kingdom University of Carthage Computer Engineering Department Tunisia School of Computing University Utara Malaysia Kedah Sintok06010 Malaysia

ISBN: (纸本)9798350335590

Social engineering is hacking and manipulating people's minds to obtain access to networks and systems in order to acquire sensitive data. A social engineering attack happens when victims are unaware of the strategies utilised and how to avoid them. Although rapid developments in communication technology made communication between individuals easier and faster, on the other hand, individuals' personal and private information is likely to be available online via social networking or other services without adequate security measures to protect such sensitive data. Hackers can use social engineering to target them no matter the technology they use to protect themselves. The methods differ, and the goal is the same, which is to manipulate and deceive organisations, companies, and individuals to obtain sensitive and private in-formation that attackers can benefit from, perhaps to sell it on the dark web or steal the payment card information of victims. The current research presents the attack techniques used in social engineering, as well as ways for pre-venting social engineering assaults. The major purpose of this study is to systematically and impartially conduct a systematic review of previous research on current social engineering attacks and the methods used to reduce these attacks. © 2023 IEEE.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

Automated Ensemble Multimodal Machine Learning for Healthcare

引用

IEEE Journal of Biomedical and Health Informatics 2025年第6期29卷 4213-4226页

作者： Imrie, Fergus Denner, Stefan Brunschwig, Lucas S. Maier-Hein, Klaus Van Der Schaar, Mihaela University of Oxford Department of Statistics Oxford United Kingdom Heidelberg University Faculty of Mathematics and Computer Science Germany École Polytechnique Fédérale de Lausanne Switzerland Division of Medical Image Computing Germany Heidelberg University Hospital Pattern Analysis and Learning Group Department of Radiation Oncology Germany Heidelberg Germany University of Cambridge Department of Applied Mathematics and Theoretical Physics United Kingdom

The application of machine learning in medicine and healthcare has led to the creation of numerous diagnostic and prognostic models. However, despite their success, current approaches generally issue predictions using data from a single modality. This stands in stark contrast with clinician decision-making which employs diverse information from multiple sources. While several multimodal machine learning approaches exist, significant challenges in developing multimodal systems remain that are hindering clinical adoption. In this paper, we introduce a multimodal framework, AutoPrognosis-M, that enables the integration of structured clinical (tabular) data and medical imaging using automated machine learning. AutoPrognosis-M incorporates 17 imaging models, including convolutional neural networks and vision transformers, and three distinct multimodal fusion strategies. In an illustrative application using a multimodal skin lesion dataset, we highlight the importance of multimodal machine learning and the power of combining multiple fusion strategies using ensemble learning. We have open-sourced our framework as a tool for the community and hope it will accelerate the uptake of multimodal machine learning in healthcare and spur further innovation. © 2013 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Quantum expanders and property (T) discrete quantum groups

arXiv

引用

arXiv 2025年

作者： Brannan, Michael Culf, Eric Vernooij, Matthijs Department of Pure Mathematics University of Waterloo Canada Department of Applied Mathematics Institute for Quantum Computing University of Waterloo Canada Delft Institute of Applied Mathematics TU Delft Netherlands

Families of expander graphs were first constructed by Margulis from discrete groups with property (T). Within the framework of quantum information theory, several authors have generalised the notion of an expander graph to the setting of quantum channels. In this work, we use discrete quantum groups with property (T) to construct quantum expanders in two ways. The first approach obtains a quantum expander family by constructing the requisite quantum channels directly from finite-dimensional irreducible unitary representations, extending earlier work of Harrow using groups. The second approach directly generalises Margulis’ original construction and is based on a quantum analogue of a Schreier graph using the theory of coideals. To obtain examples of quantum expanders, we apply our machinery to discrete quantum groups with property (T) coming from compact bicrossed products. © 2025, CC BY.

关键词： Quantum channel

来源：评论

学校读者我要写书评

暂无评论

Strongly Convergent Inertial Proximal Point Algorithm Without On-line Rule

引用

Journal of Optimization Theory and Applications 2024年第2期200卷 555-584页

作者： Jolaoso, Lateef O. Shehu, Yekini Yao, Jen-Chih Department of Mathematics and Applied Mathematics Sefako Makgatho Health Sciences University Medunsa P.O. Box 94 Pretoria0204 South Africa School of Mathematical Sciences University of Southampton SouthamptonS017 1BJ United Kingdom School of Mathematical Sciences Zhejiang Normal University Jinhua321004 China Research Center for Interneural Computing China Medical University Hospital China Medical University Taizhong Taiwan Academy of Romanian Scientists Bucharest50044 Romania Department of Applied Mathematics National Sun Yat-sen University Kaohsiung Taiwan

We present a strongly convergent Halpern-type proximal point algorithm with double inertial effects to find a zero of a maximal monotone operator in Hilbert spaces. The strong convergence results are obtained without on-line rule of the inertial parameters and the iterates. This makes our proof arguments different from what is obtainable in the literature where on-line rule is imposed on a strongly convergent proximal point algorithm with inertial extrapolation. Numerical examples with applications to image restoration and compressed sensing show that our proposed algorithm is useful and has practical advantages over existing ones. © 2023, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

关键词： Hilbert spaces

来源：评论

学校读者我要写书评

暂无评论

computing the TCCD-Number for the Strong Product of Graphs and Its Application in Urban Water Treatment: Addressing Water Scarcity Through Drainage Purification

Computing the TCCD-Number for the Strong Product of Graphs a...

引用

Women in computing (InCoWoCo), International Conference for

作者： S. Kaviya G. Mahadevan C. Sivagnanam The Gandhigram Rural Institute Deemed to be University Gandhigram Tamilnadu India Mathematics and Computing Skills Unit University of Technology and Applied Sciences Sur Sultanate Oman

ISBN: (数字)9798331518943

ISBN: (纸本)9798331518950

A dominating set $S$ of a graph $G$ is termed as a triple connected certified dominating set (TCCD-set) if, for every vertex $v\in S$ , the condition $\vert N(v)\cap(V-S)\vert \neq 1$ holds, and the subgraph $\langle S \rangle$ is triple connected. The minimum size of a TCCD-set is known as the triple connected certified domination number (TCCD-number), denoted by $\gamma_{TCC}(G)$ . This study investigates the behavior of the strong product of graphs with respect to the TCCD-number. The TCCD-set concept offers valuable insights into graph connectivity and its applications in enhancing network reliability. In addition to graph theory, this study examines practical applications, such as the establishment of advanced water treatment plants in strategically chosen locations within cities. These plants enable companies to efficiently purify water while utilizing sufficient resources. This model facilitates a reduction in the installation and maintenance costs of drainage water systems, with a primary focus on transforming drainage water into purified water.

关键词： Costs Purification Computational modeling Urban areas Companies Reliability theory Water pollution Graph theory Maintenance Water resources

来源：评论

学校读者我要写书评

暂无评论

Critical factors inhibiting information and communication technology (ICT) adoption in Côte d'Ivoire: a study of small and medium enterprises (SMEs) in metropolitan Abidjan

引用

International Journal of Technology, Policy and Management 2024年第1期24卷 19-49页

作者： Assiélou, N'Doli Guillaume Bourgault, Mario Department of Fundamental and Applied Sciences Mathematics and Computing Laboratory Nangui Abrogoua University Côte d'Ivoire 02 Abidjan 02 AbidjanBP 801 Ivory Coast Department of Mathematics and Industrial Engineering Polytechnique Montreal P.O. Box 6079 Station Centre-ville MontréalQCH3C 3A7 Canada

The paper aims to investigate and categorise the barriers influencing information and communication technology (ICT) adoption among small and medium-sized enterprises (SMEs). A questionnaire-based survey was used to collect data from 77 owners/managers of SMEs in metropolitan Abidjan, Côte d'Ivoire. A research framework based on the technology-organisationenvironment- individual-economy (T-O-E-I-E) model was used to guide the research effort. The results suggest that technological, economic and environmental factors such as unreliable basic fixed internet, cybercrime, a lack of government support and a high cost of access to fixed broadband internet are the most significant barriers to ICT adoption in the sample. Manufacturing firms had the most difficulties adopting ICTs;smaller enterprises also had more difficulties. The findings of this study offer valuable insights to SME owners/managers, policy-makers, financial institutions and local ICT companies wishing to understand why SMEs are slow to adopt ICTs, and actions that can be taken to strengthen the level of ICT adoption among SMEs. © 2024 Inderscience Enterprises Ltd.

关键词： barriers critical factors Côte d'Ivoire ICT adoption small and medium-sized enterprises T-O-E-I-E

来源：评论

学校读者我要写书评

暂无评论

Adaptive energy-preserving algorithms for guiding center system

引用

Plasma Science and Technology 2023年第4期25卷 11-22页

作者：朱贝贝刘健张嘉炜祝爱卿唐贻发 Department of Applied Mathematics School of Mathematics and PhysicsUniversity of Science and Technology BeijingBeijing 100083Peopleʼs Republic of China School of Nuclear Science and Technology University of Science and Technology of ChinaHefei 230026Peopleʼs Republic of China Advanced algorithm Joint Lab Shandong Computer Science CenterQilu University of TechnologyJinan 250014Peopleʼs Republic of China The State Key Laboratory of Scientific and Engineering Computing The Institute of Computational Mathematics and Scientific/Engineering ComputingAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190Peopleʼs Republic of China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049Peopleʼs Republic of China

We develop two types of adaptive energy preserving algorithms based on the averaged vector field for the guiding center dynamics,which plays a key role in magnetized *** adaptive scheme is applied to the Gauss Legendre’s quadrature rules and time stepsize respectively to overcome the energy drift problem in traditional energy-preserving *** new adaptive algorithms are second order,and their algebraic order is carefully *** results show that the global energy errors are bounded to the machine precision over long time using these adaptive algorithms without massive extra computation cost.

关键词： guiding center system energy-preserving methods adaptive energy conservation

来源：评论

学校读者我要写书评

暂无评论

An average-value-at-risk criterion for Markov decision processes with unbounded costs

引用

Frontiers of mathematics in China 2022年第4期17卷 673-687页

作者： Qiuli LIU Wai-Ki CHING Junyu ZHANG Hongchu WANG School of Mathematical Sciences South China Normal UniversityGuangzhou510631China Advanced Modeling and Applied Computing Laboratory Department of MathematicsThe University of Hong KongHong KongChina School of Mathematics Sun Yat-Sen UniversityGuangzhou510275China

We study the Markov decision processes under the average-value-at-risk *** state space and the action space are Borel spaces,the costs are admitted to be unbounded from above,and the discount factors are state-action *** suitable conditions,we establish the existence of optimal deterministic stationary ***,we apply our main results to a cash-balance model.

关键词： Markov decision processes average-value-at-risk(AVaR) state-action dependent discount factors optimal policy

来源：评论

学校读者我要写书评

暂无评论

INVARIANCE ANALYSIS, SYMMETRY REDUCTION AND CONSERVATION LAWS FOR A BIOLOGICAL POPULATION MODEL IN POROUS MEDIA

arXiv

引用

arXiv 2024年

作者： Joshi, Urvashi Sharma, Aniruddha Kumar Arora, Rajan Department of Applied Mathematics and Scientific Computing Indian Institute of Technology Roorkee India

This research paper talks about using complex mathematical tools to study and figure out the behavior of biological populations in porous media. Porous media offer a unique environment where various factors, including fluid flow and nutrient diffusion, significantly influence population dynamics. The theory of Lie symmetries is used to find inherent symmetries in the governing equation of the population model, helping to find conservation laws and invariant solutions. The derivation and analysis of the optimal system provide insights into the most influential parameters affecting population growth and distribution. Furthermore, the study explores the construction of invariant solutions, which aid in characterizing long-term population behavior. The article concludes with the non-linear self-adjointness property and conservation laws for the model. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Fixed-Point Fast Sweeping WENO Method with Inverse Lax-Wendroff Boundary Treatment for Steady State of Hyperbolic Conservation Laws

引用

Communications on applied mathematics and Computation 2023年第1期5卷 403-427页

作者： Liang Li Jun Zhu Chi-Wang Shu Yong-Tao Zhang Key Laboratory of Mathematical Modelling and High Performance Computing of Air Vehicles(NUAA) MIITNanjing University of Aeronautics and AstronauticsNanjing 210016JiangsuChina State Key Laboratory of Mechanics and Control of Mechanical Structures and Key Laboratory of Mathematical Modelling and High Performance Computing of Air Vehicles(NUAA) MIITNanjing University of Aeronautics and AstronauticsNanjing 210016JiangsuChina Division of Applied Mathematics Brown UniversityProvidenceRI 02912USA Department of Applied and Computational Mathematics and Statistics University of Notre DameNotre DameIN 46556USA

Fixed-point fast sweeping WENO methods are a class of efficient high-order numerical methods to solve steady-state solutions of hyperbolic partial differential equations(PDEs).The Gauss-Seidel iterations and alternating sweeping strategy are used to cover characteristics of hyperbolic PDEs in each sweeping order to achieve fast convergence rate to steady-state solutions.A nice property of fixed-point fast sweeping WENO methods which distinguishes them from other fast sweeping methods is that they are explicit and do not require inverse operation of nonlinear local ***,they are easy to be applied to a general hyperbolic *** deal with the difficulties associated with numerical boundary treatment when high-order finite difference methods on a Cartesian mesh are used to solve hyperbolic PDEs on complex domains,inverse Lax-Wendroff(ILW)procedures were developed as a very effective approach in the *** this paper,we combine a fifthorder fixed-point fast sweeping WENO method with an ILW procedure to solve steadystate solution of hyperbolic conservation laws on complex computing *** experiments are performed to test the method in solving various problems including the cases with the physical boundary not aligned with the *** results show highorder accuracy and good performance of the ***,the method is compared with the popular third-order total variation diminishing Runge-Kutta(TVD-RK3)time-marching method for steady-state *** examples show that for most of examples,the fixed-point fast sweeping method saves more than half CPU time costs than TVD-RK3 to converge to steady-state solutions.

关键词： Fixed-point fast sweeping methods Multi-resolution WENO schemes Steady state ILW procedure Convergence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：