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

Blockchain-Assisted Trust Framework for Increased Survivability in Internet of Vehicles

Internet Technology Letters 2025年第3期8卷

作者： Sharma, Kanta Prasad Al-Rashed, Atheer Johar, M.G.M. Alsoud, Anas Ratib Singh, Amrita Dey, Protyay Pant, Shivani Amity University Uttar Pradesh Greater Noida India College of Administrative Sciences Applied Science University Al Eker Bahrain Management and Science University Selangor Shah Alam Malaysia Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman Jordan Department of Computer Science and Engineering Chandigarh Engineering College Chandigarh Group of Colleges-Jhanjeri Mohali India NIMS School of Computing Science and Artificial Intelligence NIMS University Rajasthan Jaipur India Uttaranchal Institute of Technology Uttaranchal University Dehradun India

VANETs enhance traffic efficiency and road safety, but they can be attacked by malicious vehicles. These malicious vehicles can cause accidents or endanger lives by broadcasting false event messages and disrupting Internet of Vehicles applications. Before responding to sender messages, receiver vehicles must estimate the legitimacy and trustworthiness of the source vehicles. Existing solutions struggle to balance security and efficiency effectively. This paper introduces a model that combines the advantages of blockchain technology and trust model models to improve the trustworthiness, efficacy, and security of vehicular networks, alongside secure trust-based optimized routing. Extensive experiments demonstrate the security and efficiency of the proposed model. The proposed model is adaptable to diverse VANET scenarios, addressing all security and privacy needs more comprehensively than current trust schemes. Efficiency analysis and simulation results show that our proposed framework outperforms baseline models, highlighting its security, effectiveness, and robustness in enhancing IoV communication security. © 2025 John Wiley & Sons Ltd.

关键词： Highway accidents

来源：评论

学校读者我要写书评

暂无评论

Efficient Learning of Continuous-Variable Quantum States

arXiv

引用

arXiv 2023年

作者： Wu, Ya-Dong Zhu, Yan Chiribella, Giulio Liu, Nana John Hopcroft Center for Computer Science Shanghai Jiao Tong University Shanghai200240 China QICI Quantum Information and Computation Initiative Department of Computer Science The University of Hong Kong Pokfulam Road Hong Kong Department of Computer Science Parks Road OxfordOX1 3QD United Kingdom Perimeter Institute for Theoretical Physics WaterlooONN2L 2Y5 Canada Institute of Natural Sciences Shanghai Jiao Tong University Shanghai200240 China Ministry of Education Key Laboratory in Scientific and Engineering Computing Shanghai Jiao Tong University Shanghai200240 China School of Mathematical Sciences Shanghai Jiao Tong University Shanghai200240 China University of Michigan-Shanghai Jiao Tong University Joint Institute Shanghai200240 China

The characterization of continuous-variable quantum states is crucial for applications in quantum communication, sensing, simulation and computing. However, a full characterization of multimode quantum states requires a number of experiments that grows exponentially with the number of modes. Here we propose an alternative approach where the goal is not to reconstruct the full quantum state, but rather to estimate its characteristic function at a given set of points. For multimode states with reflection symmetry, we show that the characteristic function at M points can be estimated using only O(log M) copies of the state, independently of the number of modes. When the characteristic function is known to be positive, as in the case of squeezed vacuum states, the estimation is achieved by an experimentally friendly setup using only beamsplitters and homodyne measurements. © 2023, CC BY-NC-SA.

关键词： Quantum communication

来源：评论

学校读者我要写书评

暂无评论

POLYLLA: Polygonal meshing algorithm based on terminal-edge regions

arXiv

引用

arXiv 2022年

作者： Salinas, Sergio Hitschfeld-Kahler, Nancy Ortiz-Bernardin, Alejandro Si, Hang Department of Computer Sciences Universidad de Chile Av. Beauchef 851 RM Santiago8370456 Chile Computational and Applied Mechanics Laboratory Department of Mechanical Engineering Universidad de Chile Av. Beauchef 851 RM Santiago8370456 Chile Numerical Mathematics and Scientific Computing Weierstrass Institute for Applied Analysis and Stochastics Mohrenstr. 39 Berlin Berlin10117 Germany

This paper presents an algorithm to generate a new kind of polygonal mesh obtained from triangulations. Each polygon is built from a terminal-edge region surrounded by edges that are not the longest-edge of any of the two triangles that share them. The algorithm is termed Polylla and is divided into three phases. The first phase consists of labeling each edge of the input triangulation according to its size;the second phase builds polygons (simple or not) from terminal-edges regions using the label system;and the third phase transforms each non simple polygon into simple ones. The final mesh contains polygons with convex and non convex shape. Since Voronoi based meshes are currently the most used polygonal meshes, we compare some geometric properties of our meshes against constrained Voronoi meshes. Several experiments were run to compare the shape and size of polygons, the number of final mesh points and polygons. For the same input, Polylla meshes contain less polygons than Voronoi meshes, and the algorithm is simpler and faster than the algorithm to generate constrained Voronoi meshes. Finally, we have validated Polylla meshes by solving the Laplace equation on an L-shaped domain using the Virtual Element Method (VEM). We show that the numerical performance of the VEM using Polylla meshes and Voronoi meshes is similar. Copyright © 2022, The Authors. All rights reserved.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Achievable Rate Maximization Pattern Design for Reconfigurable MIMO Antenna Array

arXiv

引用

arXiv 2022年

作者： Wang, Haonan Li, Ang Liu, Ya-Feng Qin, Qibo Song, Lingyang Li, Yonghui The School of Information and Communications Engineering Faculty of Electronic and Information Engineering Xi'an Jiaotong University Shaanxi Xi'An710049 China The State Key Laboratory of Integrated Services Networks Xidian University Shaanxi Xi'An China The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Wireless Network RAN Research Department Shanghai Huawei Technologies Co. Ltd. Shanghai201206 China The School of Electrical Engineering and Computer Science Peking University Beijing100871 China The School of Electrical and Information Engineering The University of Sydney SydneyNSW2006 Australia

Reconfigurable multiple-input multiple-output can provide performance gains over traditional MIMO by reshaping the channels, i.e., introducing more channel realizations. In this paper, we focus on the achievable rate maximization pattern design for reconfigurable MIMO systems. Firstly, we introduce the matrix representation of pattern reconfigurable MIMO (PR-MIMO), based on which a pattern design problem is formulated. To further reveal the effect of the radiation pattern on the wireless channel, we consider pattern design for both the single-pattern case where the optimized radiation pattern is the same for all the antenna elements, and the multi-pattern case where different antenna elements can adopt different radiation patterns. For the single-pattern case, we show that the pattern design is equivalent to a redistribution of gains among all scattering paths, and an eigenvalue optimization based solution is obtained. For the multi-pattern case, we propose a sequential optimization framework with manifold optimization and eigenvalue decomposition to obtain near-optimal solutions. Numerical results validate the superiority of PR-MIMO systems over traditional MIMO in terms of achievable rate, and also show the effectiveness of the proposed solutions. Copyright © 2022, The Authors. All rights reserved.

关键词： MIMO systems

来源：评论

学校读者我要写书评

暂无评论

Topology optimization including a model of the layer-by-layer additive manufacturing process

arXiv

引用

arXiv 2022年

作者： Haveroth, Geovane A. Thore, C.-J. Correa, M.R. Ausas, R.F. Jakobsson, S. Cuminato, J.A. Klarbring, A. Department of Applied Mathematics and Statistics Institute of Mathematics and Computer Sciences University of São Paulo SP São Carlos Brazil Division of Solid Mechanics Department of Management and Engineering Institute of Technology Linköping University Linköping581 83 Sweden Arcam EBM Mölndal Sweden Department of Applied Mathematics Institute of Mathematics Statistics and Scientific Computing University of Campinas Campinas-SP Brazil

A topology optimization formulation including a model of the layer-by-layer additive manufacturing (AM) process is considered. Defined as a multi-objective minimization problem, the formulation accounts for the performance and cost of both the final and partially manufactured designs and allows for considering AM-related issues such as overhang and residual stresses in the optimization. The formulation is exemplified by stiffness optimization in which the overhang is limited by adding mechanical or thermal compliance as a measure of the cost of partially manufactured designs. Convergence of the model as the approximate layer-by-layer model is refined is shown theoretically, and an extensive numerical study indicates that this convergence can be fast, thus making it a computationally viable approach useful for including AM-related issues into topology optimization. The examples also show that drips and sharp corners associated with some geometry-based formulations for overhang limitation can be avoided. The codes used in this article are written in Python using only open sources libraries and are available for reference. Copyright © 2022, The Authors. All rights reserved.

关键词： Stiffness

来源：评论

学校读者我要写书评

暂无评论

A Greedy Sensor Selection Algorithm for Hyperparameterized Linear Bayesian Inverse Problems

arXiv

引用

arXiv 2023年

作者： Aretz, Nicole Chen, Peng Degen, Denise D. Veroy, Karen Oden Institute for Computational Engineering and Sciences University of Texas at Austin 201 E 24th St AustinTX78712 United States School of Computational Science and Engineering Georgia Institute of Technology 756 W Peachtree St NW AtlantaGA30308 United States Computational Geoscience Geothermics and Reservoir Geophysics RWTH Aachen University Mathieustr. 30 Aachen52074 Germany Center for Analysis Scientific Computing and Applications Department of Mathematics and Computer Science Eindhoven University of Technology Eindhoven5612 AZ Netherlands

We consider optimal sensor placement for a family of linear Bayesian inverse problems characterized by a deterministic hyper-parameter. The hyper-parameter describes distinct configurations in which measurements can be taken of the observed physical system. To optimally reduce the uncertainty in the system’s model with a single set of sensors, the initial sensor placement needs to account for the non-linear state changes of all admissible configurations. We address this requirement through an observability coefficient which links the posteriors’ uncertainties directly to the choice of sensors. We propose a greedy sensor selection algorithm to iteratively improve the observability coefficient for all configurations through orthogonal matching pursuit. The algorithm allows explicitly correlated noise models even for large sets of candidate sensors, and remains computationally efficient for high-dimensional forward models through model order reduction. We demonstrate our approach on a large-scale geophysical model of the Perth Basin, and provide numerical studies regarding optimality and scalability with regard to classic optimal experimental design utility functions. © 2023, CC BY.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Electronic structure calculations for muon spectroscopy

Electronic Structure

引用

Electronic Structure 2025年第2期7卷

作者： Blundell, Stephen J. Bonacci, Miki Bonfà, Pietro De Renzi, Roberto Huddart, Benjamin M. Lancaster, Tom Liborio, Leandro M Onuorah, Ifeanyi J. Pizzi, Giovanni Pratt, Francis L. Wilkinson, John M Department of Physics University of Oxford Parks Road OxfordOX1 3PU United Kingdom Villigen PSICH-5232 Switzerland Department of Mathematical Physical and Computer Sciences University of Parma Parco Area delle Scienze 7/A Parma43124 Italy Department of Physics Durham University South Road DurhamDH1 3LE United Kingdom Scientific Computing Department Science and Technology Facilities Council Rutherford Appleton Laboratory Harwell Campus DidcotOX11 0QX United Kingdom ISIS Neutron and Muon Source STFC Rutherford Appleton Laboratory Chilton DidcotOX11 0QX United Kingdom

Muon spectroscopy has become a leading tool for the investigation of local magnetic fields in condensed matter physics, finding applications in the study of superconductivity, magnetism, ionic diffusion in battery materials, and numerous other fields. Though the muon yields quantitative information about the material, this can only be fully interpreted if the nature of the muon site and its stability is fully understood. Electronic structure calculations are of paramount importance for providing this understanding, particularly through a group of techniques that has become known as DFT + μ , density functional theory including the presence of the implanted muon. We describe how these electronic structure calculations can be used to underpin muon spectroscopy, and some examples of the science that follows from this, as well as some of the available software tools that are currently being developed. © 2025 The Author(s). Published by IOP Publishing Ltd.

关键词： Local density approximation

来源：评论

学校读者我要写书评

暂无评论

High order semi-implicit WENO schemes for all mach full euler system of gas dynamics

arXiv

引用

arXiv 2021年

作者： Boscarino, Sebastiano Qiu, Jing-Mei Russo, Giovanni Xiong, Tao Department of Mathematics and Computer Science University of Catania Catania95127 Italy Department of Mathematics University of Delaware NewarkDE19716 United States School of Mathematical Sciences Fujian Provincial Key Laboratory of Mathematical Modeling and High-Performance Scientific Computing Xiamen University Fujian Xiamen361005 China

In this paper, we propose a new high order semi-implicit scheme for the all Mach full Euler equations of gas dynamics. Material waves are treated explicitly, while acoustic waves are treated implicitly, thus avoiding severe CFL restrictions for low Mach flows. High order accuracy in time is obtained by semi-implicit temporal integrator based on the IMEX Runge-Kutta (IMEX-RK) framework. High order in space is achieved by finite difference WENO schemes with characteristic-wise reconstructions adapted to the semi-implicit IMEX-RK time discretization. Type A IMEX schemes are constructed to handle not well-prepared initial conditions. Besides, these schemes are proven to be asymptotic preserving and asymptotically accurate as the Mach number vanishes for well-prepared initial conditions. Divergence-free property of the time-discrete schemes is proved. The proposed scheme can also well capture discontinuous solutions in the compressible regime, especially for two dimensional Riemann problems. Numerical tests in one and two space dimensions will illustrate the effectiveness of the proposed schemes. © 2021, CC BY.

关键词： Mach number

来源：评论

学校读者我要写书评

暂无评论

DieT Transformer model with PCA-ADE integration for advanced multi-class brain tumor classification

引用

Intelligence-Based Medicine 2025年 11卷 100192-100192页

作者： Amin, Mohammad Nahar, Khalid M.O. Gharaibeh, Hasan Nasayreh, Ahmad Alsalmanc, Neda'a Alomar, Alaa Malkawi, Majd Alqasem, Noor Smerat, Aseel Zitar, Raed Abu Nusier, Shawd Ezugwu, Absalom E. Abualigah, Laith Department of Information Technology and Computer Sciences Yarmouk University Irbid 211633 Jordan Faculty of Computer Studies Arab Open University P.O.Box 84901 Riyadh 11681 Saudi Arabia Department of Computer Science Faculty of Information Technology Jordan University of Science and Technology Irbid 22110 Jordan Department of Medicine Faculty of Medicine Jordan University of Science and Technology Irbid 22110 Jordan Department of Biomedical Systems and Informatics Engineering Hijjawi Faculty for Engineering Technology Yarmouk University Irbid 21163 Jordan Centre for Research Impact & Outcome Chitkara University Institute of Engineering and Technology Chitkara University Punjab Rajpura 140401 India Department of Biosciences Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Chennai 602105 India Artificial Intelligence and Sensing Technologies (AIST) Research Center University of Tabuk Tabuk 71491 Saudi Arabia Faculty of Engineering and Computing Liwa College Abu Dhabi United Arab Emirates Department of Health and Clinical Outcomes Research Saint Louis University St. Louis MO United States Unit for Data Science and Computing North-West University 11 Hofman Street Potchefstroom 2520 South Africa Computer Science Department Al al-Bayt University Mafraq 25113 Jordan Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman 19328 Jordan

Early and accurate diagnosis of brain tumors is crucial to improving patient outcomes and optimizing treatment strategies. Long-term brain injury results from aberrant proliferation of either malignant or nonmalignant tissues in the brain. MRIs, or magnetic resonance imaging, are one of the most used approaches for detecting brain tumors. Professionals physically evaluate people after they have had MRI filtering, the process of enhancing MRI scans for radiologist interpretation, to establish if they have a brain tumor. Because different specialists use different frames to make judgments on the same MRI image, their analyses may yield contradictory results. Furthermore, simply detecting a tumor is insufficient. Inconsistent diagnoses can lead to delays in treatment, impacting survival rates and quality of care. It is also crucial to diagnose the patient's tumor so that treatment can begin as soon as possible. In this research, we investigate the multi-class classification of brain tumors utilizing a cutting-edge methodology that includes feature extraction from pictures using the DieT Transformer model, dimensionality reduction with PCA, and feature selection using the ADE algorithm. The proposed model, known in the publication as ADE_DieT, obtained an accuracy of 96.09 %. In addition, this article analyzes the performance of various pre-trained models, including MobileNetV3, NasNet, ResNet50, VGG16, VGG19, and DeiT. The proposed approach shortens the time required for manual diagnosis by clinicians by assisting in the rapid and accurate identification of brain tumors using MRI data. In oncology, this is important since it allows for early treatment. Integrating ADE_DieT into clinical workflows can support radiologists by reducing diagnosis time and enhancing diagnostic consistency. © 2024 The Authors

关键词： Brain tumor Medical image analysis MRI Vision Transformer

来源：评论

学校读者我要写书评

暂无评论

Portably parallel construction of a ci wave function from a matrix-product state using the charm++ framework

arXiv

引用

arXiv 2020年

作者： Ting, Wang Ma, Yingjin Zhao, Lian Jiang, Jinrong Computer Network Information Center Chinese Academy of Sciences Beijing100190 China Center of Scientific Computing Applications and Research Chinese Academy of Sciences Beijing100190 China School of Computer Science Shaanxi Normal University Xi'an710119 China

The constructions of configuration interaction (CI) expansions from a matrixproduct state (MPS) involves numerous matrix operations and the skillful sampling of important configurations when in a huge Hilbert space. In this work, we present an efficient procedure for constructing CI expansions from MPS using the CHARM++ parallel programming framework, upon which automatic load balancing and object migration facilities can be employed. This procedure was employed in the MPS-to-CI utility (Moritz et al., J. Chem. Phys. 2007, 126, 224109), sampling-reconstructed complete active space algorithm (SR-CAS, Boguslawski et al., J. Chem. Phys. 2011, 134, 224101) and entanglement-driven genetic algorithm (EDGA, Luo et al., J. Chem. Theory Comput. 2017, 13, 4699-4710). It enhances productivity and allows the sampling programs evolve to their population-expansion versions (e.g., EDGA with population expansion [PE-EDGA]). Examples of 1,2-dioxetanone and firefly dioxetanone anion (FDO-) molecules demonstrated that 1) the procedure could be flexibly employed among various multi-core architectures;2) the parallel efficiencies could be persistently improved simply by increasing the proportion of asynchronous executions;3) PE-EDGA could construct a CAS-type CI wave function from a huge Hilbert space, with 0.9952 CI completeness and 96.7% correlation energy via ∼1.66x106 configurations (only 0.0000028% of the total configurations) of a bi-radical state of FDO-molecule using the full valence active space within a few hours. Copyright © 2020, The Authors. All rights reserved.

关键词： Molecules

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：