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

Indoor Uncertain Semantic Trajectory Similarity Join

Journal of Computer science & technology 2024年第6期39卷 1441-1465页

作者： Hong-Bo Yin Dong-Hua Yang Kai-Qi Zhang Hong Gao Jian-Zhong Li Faculty of Computing Harbin Institute of TechnologyHarbin 150001China Center of Analysis Measurement and ComputingHarbin Institute of TechnologyHarbin 150001China Faculty of Computer Science and Control Engineering Shenzhen Institute of Advanced TechnologyChinese Academy of SciencesShenzhen 518055China

With the widespread deployment of indoor positioning systems, an unprecedented scale of indoor trajectories is being produced. By considering the inherent uncertainties and the text information contained in such an indoor trajectory, a new definition named Indoor Uncertain Semantic Trajectory is defined in this paper. In this paper, we focus on a new primitive, yet quite essential query named Indoor Uncertain Semantic Trajectory Similarity Join (IUST-Join for short), which is to match all similar pairs of indoor uncertain semantic trajectories from two sets. IUST-Join targets a number of essential indoor applications. With these applications in mind, we provide a purposeful definition of an indoor uncertain semantic trajectory similarity metric named IUS. To process IUST-Join more efficiently, both an inverted index on indoor uncertain semantic trajectories named 3IST and the first acceleration strategy are proposed to form a filtering-and-verification framework, where most invalid pairs of indoor uncertain semantic trajectories are pruned at quite low computation cost. And based on this filtering-and-verification framework, we present a highly-efficient algorithm named Indoor Uncertain Semantic Trajectory Similarity Join Processing (USP for short). In addition, lots of novel and effective acceleration strategies are proposed and embedded in the USP algorithm. Thanks to these techniques, both the time complexity and the time overhead of the USP algorithm are further reduced. The results of extensive experiments demonstrate the superior performance of the proposed work.

关键词： filtering-and-verification framework indoor uncertain semantic trajectory inverted index trajectory similarity join

来源：评论

学校读者我要写书评

暂无评论

Real-Time Multi Fractal Trust Evaluation Model for Efficient Intrusion Detection in Cloud

引用

Intelligent Automation & Soft computing 2023年第8期37卷 1895-1907页

作者： S.Priya R.S.Ponmagal Department of Computer Science and Engineering School of ComputingSRM Institute of Science and TechnologyChengapattu603203Tamil NaduIndia Department of Computing Technologies School of ComputingSRM Institute of Science and TechnologyChengapattu603203Tamil NaduIndia

Handling service access in a cloud environment has been identified as a critical challenge in the modern internet world due to the increased rate of intrusion *** address such threats towards cloud services,numerous techniques exist that mitigate the service threats according to different *** rule-based approaches are unsuitable for new threats,whereas trust-based systems estimate trust value based on behavior,flow,and other ***,the methods suffer from mitigating intrusion attacks at a higher *** article presents a novel Multi Fractal Trust Evaluation Model(MFTEM)to overcome these *** method involves analyzing service growth,network growth,and quality of service *** process estimates the user’s trust in various ways and the support of the user in achieving higher service performance by calculating Trusted Service Support(TSS).Also,the user’s trust in supporting network stream by computing Trusted Network Support(TNS).Similarly,the user’s trust in achieving higher throughput is analyzed by computing Trusted QoS Support(TQS).Using all these measures,the method adds the Trust User Score(TUS)value to decide on the clearance of user *** proposed MFTEM model improves intrusion detection accuracy with higher performance.

关键词： Intrusion detection cloud systems trusted service support trusted network support trust user score trusted QoS support

来源：评论

学校读者我要写书评

暂无评论

The quantum Ising model for perfect matching and solving it with variational quantum eigensolver

引用

science China(Information sciences) 2024年第9期67卷 306-320页

作者： Qilin ZHENG Pingyu ZHU Chao WU Miaomiao YU Weihong LUO Ping XU Institute for Quantum Information and State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Hefei National Laboratory

Obtaining all perfect matchings of a graph is a tough problem in graph theory, and its complexity belongs to the #P-Complete class. The problem is closely related to combinatorics, marriage matching problems, dense subgraphs, the Gaussian boson sampling, chemical molecular structures, and dimer *** this paper, we propose a quadratic unconstrained binary optimization formula of the perfect matching problem and translate it into the quantum Ising model. We can obtain all perfect matchings by mapping them to the ground state of the quantum Ising Hamiltonian and solving it with the variational quantum eigensolver. Adjusting the model's parameters can also achieve the maximum or minimum weighted perfect matching. The experimental results on a superconducting quantum computer of the Origin Quantum computing technology Company show that our model can encode 2~n dimensional optimization space with only O（n） qubits consumption and achieve a high success probability of the ground state corresponding to all perfect matchings. In addition, the further simulation results show that the model can support a scale of more than 14 qubits, effectively resist the adverse effects of noise, and obtain a high success probability at a shallow variational depth. This method can be extended to other combinatorial optimization problems.

关键词： perfect matching Ising model quantum Hamiltonian variational quantum eigensolver quadratic unconstrained binary optimization

来源：评论

学校读者我要写书评

暂无评论

Efficient allocation of independent gridlet on small, medium, and large grid

引用

Personal and Ubiquitous computing 2023年第3期27卷 1029-1037页

作者： Rajeswari, D. Ramamoorthy, S. Srinivasan, R. Department of Data Science and Business Systems School of Computing College of Engineering and Technology SRM Institute of Science and Technology Tamil Nadu Kattankulathur603203 India Department of Computing Technologies School of Computing College of Engineering and Technology SRM Institute of Science and Technology Tamil Nadu Kattankulathur603203 India

Gridlet allocation in a computational grid environment is a major research issue to obtain not only the efficient gridlet allocation technique but also the time needed to obtain the efficient allocation technique. Grid computing networks have various nodes to process user jobs. To achieve the high performance of computational grid, task scheduling is an important issue. The users who are using services of grid systems are more cautious about time to complete their job. Hence, this work concentrates on gridlet allocation method used for time reduction by a genetic algorithm with the MapReduce programming model for independent tasks in computational grid. In computational grid environment, multi-objective problem formulation minimization of makespan and flowtime is considered. In this proposed technique, fitness function formulation for makespan and flowtime has been formulated mathematically. The genetic algorithm with the MapReduce programming model is implemented using MapReduce written in Java and then combined with GridSim. The experimental outcome with regard to time needed, flowtime, and makespan clearly reveals that the genetic algorithm with the MapReduce model effectively optimizes time, makespan, and flowtime in computational grid environment. A comparative study of performance efficiency among genetic algorithm with the MapReduce and sequential genetic algorithm (SGA) and parallel genetic algorithm (PGA) depicts the usefulness of the model. The execution time achieved by GA with the MapReduce model in small grid is 10.48 s, medium grid is 18.76 s, and large grid is 33.73 s. © 2023, The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Nanophononic metamaterials induced proximity effect in heat flux regulation

引用

Frontiers of physics 2024年第2期19卷 149-156页

作者： Jian Zhang Haochun Zhang Gang Zhang School of Energy Science and Engineering Harbin Institute of TechnologyHarbin 150001China Institute of High Performance Computing Agency for ScienceTechnology and Research(A*STAR)Singapore 138632Singapore

Recent studies have shown that the construction of nanophononic metamaterials can reduce thermal conductivity without affecting electrical properties,making them promising in many fields of application,such as energy conversion and thermal ***,although extensive studies have been carried out on thermal conductivity reduction in nanophononic metamaterials,the local heat flux characteristic is still *** this work,we construct a heat flux regulator which includes a silicon nanofilm with silicon *** regulator has remarkable heat flux regulation ability,and various impacts on the regulation ability are ***,even in the region without nanopillars,the local heat current is still lower than that in pristine silicon nanofilms,reduced by the neighboring nanopillars through the thermal proximity *** combine the analysis of the phonon participation ratio with the intensity of localized phonon modes to provide a clear *** findings not only provide insights into the mechanisms of heat flux regulation by nanophononic metamaterials,but also will open up new research directions to control local heat flux for a broad range of applications,including heat management,thermoelectric energy conversion,thermal cloak,and thermal concentrator.

关键词： nanophononic metamaterials proximity effect

来源：评论

学校读者我要写书评

暂无评论

Massively parallel algorithms for fully dynamic all-pairs shortest paths

引用

Frontiers of Computer science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：评论

学校读者我要写书评

暂无评论

Research Progress in Solar Flare Prediction Methods

引用

Research in Astronomy and Astrophysics 2025年第3期25卷 280-309页

作者： Ke Han Zhen Liu Xian-Yi Zhao Yi-Fei Li De-Quan Zheng Jie Wan School of Computer and Information Engineering Harbin University of Commerce Faculty of Computing Harbin Institute of Technology School of Energy Science and Engineering Harbin Institute of Technology

Solar flares are one of the strongest outbursts of solar activity,posing a serious threat to Earth’s critical infrastructure,such as communications,navigation,power,and ***,it is essential to accurately predict solar flares in order to ensure the safety of human ***,the research focuses on two directions:first,identifying predictors with more physical information and higher prediction accuracy,and second,building flare prediction models that can effectively handle complex observational *** terms of flare observability and predictability,this paper analyses multiple dimensions of solar flare observability and evaluates the potential of observational parameters in *** flare prediction models,the paper focuses on data-driven models and physical models,with an emphasis on the advantages of deep learning techniques in dealing with complex and high-dimensional *** reviewing existing traditional machine learning,deep learning,and fusion methods,the key roles of these techniques in improving prediction accuracy and efficiency are *** prevailing challenges,this study discusses the main challenges currently faced in solar flare prediction,such as the complexity of flare samples,the multimodality of observational data,and the interpretability of *** conclusion summarizes these findings and proposes future research directions and potential technology advancement.

关键词： Sun: activity Sun: flares (Sun:) sunspots Sun: magnetic fields magnetohydrodynamics (MHD)

来源：评论

学校读者我要写书评

暂无评论

Adaptive sail fish optimizer based optimized region selection for robust video steganography

引用

International Journal of Information technology (Singapore) 2025年第4期17卷 2417-2427页

作者： Babu, J. Suresh Niranjana, G. Ramana, Kadiyala Department of Computing Science & Engineering School of Computing College of Engineering and Technology SRM Institute of Science and Technology Tamil Nadu Kattankulathur Chengalpattu India Department of Computing Technologies SRM Institute of Science and Technology Kattankulathur Chengalpattu India Department of Artificial Intelligence and Data Science Chaitanya Bharathi Institute of Technology (Autonomous) Hyderabad India

Securing data transmission in a digital era is a difficult one due to the broad application of the Internet, personal computers, and mobile phones for communication. Traditional video steganography techniques sometimes fail to identify the best pixels for encoding hidden data, resulting in lowerquality and robustness. To solve this issue, this article proposes an innovative steganography technique that improves the security and quality of data hiding. The proposed method takes cover video and secret images as input. The Structural Similarity Index Measurement (SSIM) first collects key frames from the input video. The adaptive sailfish optimizer (ASFO) is then used to find the best regions within these keyframes to insert the secret data in. To improve security, the discrete wavelet transform (DWT) is applied to the specified region, and the LL band is used for the hiding process. The secret image is encrypted by Adaptive elliptical curve cryptography (AECC) and transformed to binary bits, which then get embedded in the chosen band. This method leads to the construction of a stego-video. The extraction procedure is repeated using the same approach, which ensures secure and robust data transmission. Performance metrics, including PSNR, BER, NAE, TAF, and NC are analyzed to compare each method's efficacy. © Bharati Vidyapeeth's Institute of Computer Applications and Management 2025.

关键词： Adaptive elliptical curve cryptography And stego-video Discrete wavelet transform Structural similarity index measurement Video steganography

来源：评论

学校读者我要写书评

暂无评论

Adapted Runge-Kutta Methods for Nonlinear First-Order Delay BVPs with Time-variable Delay

引用

Acta Mathematicae Applicatae Sinica 2025年第2期41卷 400-413页

作者： Cheng-jian ZHANG Yang WANG Hao HAN School of Mathematics and Statistics Huazhong University of Science and TechnologyWuhan 430074China Hubei Key Laboratory of Engineering Modeling and Scientific Computing Huazhong University of Science and TechnologyWuhan 430074China

This paper deals with numerical solutions for nonlinear first-order boundary value problems(BVPs) with time-variable delay. For solving this kind of delay BVPs, by combining Runge-Kutta methods with Lagrange interpolation, a class of adapted Runge-Kutta(ARK) methods are developed. Under the suitable conditions, it is proved that ARK methods are convergent of order min{p, μ+ν +1}, where p is the consistency order of ARK methods and μ, ν are two given parameters in Lagrange interpolation. Moreover, a global stability criterion is derived for ARK methods. With some numerical experiments, the computational accuracy and global stability of ARK methods are further testified.

关键词： delay boundary value problems adapted Runge-Kutta method Lagrange interpolation error analysis global stability

来源：评论

学校读者我要写书评

暂无评论

A Support Vector Machine(SVM)Model for Privacy Recommending Data Processing Model(PRDPM)in Internet of Vehicles

引用

Computers, Materials & Continua 2025年第1期82卷 389-406页

作者： Ali Alqarni Department of Computer Science and Artificial Intelligence College of Computing and Information TechnologyUniversity of BishaBisha61922Saudi Arabia

Open networks and heterogeneous services in the Internet of Vehicles(IoV)can lead to security and privacy *** key requirement for such systems is the preservation of user privacy,ensuring a seamless experience in driving,navigation,and *** privacy needs are influenced by various factors,such as data collected at different intervals,trip durations,and user *** address this,the paper proposes a Support Vector Machine(SVM)model designed to process large amounts of aggregated data and recommend privacy preserving *** model analyzes data based on user demands and interactions with service providers or neighboring *** aims to minimize privacy risks while ensuring service continuity and *** SVMmodel helps validate the system’s reliability by creating a hyperplane that distinguishes between maximum and minimum privacy *** results demonstrate the effectiveness of the proposed SVM model in enhancing both privacy and service performance.

关键词： Support vector machine big data IoV privacy-preserving

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：