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

Integrating Neighborhood Geographic Distribution and Social Structure Influence for Social Media User Geolocation

Computer Modeling in engineering & Sciences 2024年第9期140卷 2513-2532页

作者： Meng Zhang Xiangyang Luo Ningbo Huang Key Laboratory of Cyberspace Situation Awareness of Henan Province Zhengzhou450001China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001China

Geolocating social media users aims to discover the real geographical locations of users from their publicly available data,which can support online location-based applications such as disaster alerts and local content *** relationship-based methods represent a classical approach for geolocating social ***,geographically proximate relationships are sparse and challenging to discern within social networks,thereby affecting the accuracy of user *** address this challenge,we propose user geolocation methods that integrate neighborhood geographical distribution and social structure influence(NGSI)to improve geolocation ***,we propose a method for evaluating the homophily of locations based on the k-order neighbor-hood geographic distribution(k-NGD)similarity among *** are notable differences in the distribution of k-NGD similarity between location-proximate and non-location-proximate *** this distinction,we filter out non-location-proximate social relationships to enhance location homophily in the social *** better utilize the location-proximate relationships in social networks,we propose a graph neural network algorithm based on the social structure *** algorithm enables us to perform a weighted aggregation of the information of users’multi-hop neighborhood,thereby mitigating the over-smoothing problem of user features and improving user geolocation *** results on real social media dataset demonstrate that the neighborhood geographical distribution similarity metric can effectively filter out non-location-proximate social ***,compared with 7 existing social relationship-based user positioning methods,our proposed method can achieve multi-granularity user geolocation and improve the accuracy by 4.84%to 13.28%.

关键词： User geolocation social media neighborhood geographic distribution structure influence

来源：评论

学校读者我要写书评

暂无评论

Optimal Bilinear Equalizer for Cell-Free Massive MIMO Systems over Correlated Rician Channels

引用

IEEE Transactions on Signal Processing 2025年

作者： Wang, Zhe Zhang, Jiayi Bjornson, Emil Niyato, Dusit Ai, Bo Beijing Jiaotong University State Key Laboratory of Advanced Rail Autonomous Operation Beijing100044 China Beijing Jiaotong University School of Electronics and Information Engineering Beijing100044 China KTH Royal Institute of Technology Department of Computer Science Stockholm114 28 Sweden Nanyang Technological University College of Computing & Data Science 639798 Singapore

In this paper, we explore the low-complexity optimal bilinear equalizer (OBE) combining scheme design for cell-free massive multiple-input multiple-output networks with spatially correlated Rician fading *** provide a spectral efficiency (SE) performance analysis framework for both the centralized and distributed processing schemes with bilinear equalizer (BE)-structure combining schemes applied. The BE-structured combining is a set of schemes that are constructed by the multiplications of channel statistics-based BE matrices and instantaneous channel estimates. Notably, we derive closed-form achievable SE expressions for centralized and distributed BE-structured combining schemes. We propose one centralized and two distributed OBE schemes: Centralized OBE (C-OBE), Distributed OBE based on Global channel statistics (DG-OBE), and Distributed OBE based on Local channel statistics (DL-OBE), which maximize their respective SE expressions. OBE matrices in these schemes are tailored based on varying levels of channel statistics. Notably, we obtain new and insightful closed-form results for the C-OBE, DG-OBE, and DL-OBE combining schemes. Numerical results demonstrate that the proposed OBE schemes can achieve excellent SE, even in scenarios with severe pilot contamination. © 2025 IEEE. All rights reserved.

关键词： Fading channels

来源：评论

学校读者我要写书评

暂无评论

Searching for similar binary code based on the influence of basic block vertex 3

Searching for similar binary code based on the influence of ...

引用

2021年第三届先进计算机技术、信息科学与通信国际会议(CTISC2021)

作者： Xiaodong Zhu Liehui Jiang Zeng Chen Lin Yan State key laboratory of mathematical engineering and advanced computing

ISBN: (纸本)9781665418683

Binary code similarity detection(BCSD) has many security applications and has attracted a lot of focus. But existing solutions for BCSD problems mainly focus on comparing the similarity between two binary functions and what need to be compared is not always a pair of equal-size binary *** solve the problem of searching similar binary code for a small size program in a large size program, in this manuscript,we propose a searching method based on the influence of basic block vertex. Firstly, we formalize the similar code searching problem as a subgraph matching problem and extract the attributed control flow graphs(ACFGs) of the binary ***, we propose a novel metrics to measure the influence of each basic block vertex in query ACFGs and choose the vertex with the largest influence value as the central node. Next, we take the matching nodes of the central node in target ACFG as seed nodes and extending each candidate sub-area from the seed nodes. At last, these candidate sub-areas are further filtered and similar subgraphs are verified in these *** results indicate that the proposed method can find similar binary code efficiently.

关键词： Measurement Matched filters Information science Binary codes Search problems Security Flow graphs

来源：评论

学校读者我要写书评

暂无评论

Research on Stream Cipher Model Based on Chaos Theory

Research on Stream Cipher Model Based on Chaos Theory

引用

第四届智能结构与振动控制国际会议

作者： Sun Wenjie State Key Laboratory of Mathematical Engineering and Advanced Computing

ISBN: (纸本)9783038350507

Chaos is a similar and random process which is very sensitive to initial value in deterministic *** is a performance of nonlinear dynamical system with built-in *** with the advantages and disadvantages of the present chaos encryption model,the paper proposes a chaotic stream cipher model based on chaos theory,which not only overcomes finite precision effect,but also improves the randomness of chaotic system and output *** Sequence cycle theory generated by the algorithm can reach more than 10600 at least,which completely satisfies the actual application requirements of stream cipher system.

关键词： Chaos Theory,Stream Cipher,Algorithm

来源：评论

学校读者我要写书评

暂无评论

Information diffusion network inferring and pathway tracking

引用

Science China(Information Sciences) 2015年第9期58卷 135-149页

作者： ZHOU DongHao HAN WenBao WANG YongJun YUAN BaoDi College of Computer National University of Defense Technology State Key Laboratory of Mathematical Engineering and Advanced Computing College of Computer Science and Technology Fudan University

Network diffusion, such as spread of ideas, rumors, contagious disease, or a new type of behaviors, is one of the fundamental processes within networks. Designing effective strategies for influence spread maximization, rumor spread minimization, or epidemic immunization has attracted considerable research attention. However, a key challenge is that many times we can only observe the trace of contagion spreading across network, but the underlying network structure is unknown and the transmission rates between node pairs are unclear to us. In this paper, given the observed information cascades, we aim to address two problems:diffusion network structure inferring and information diffusion pathways tracking. We propose a novel probabilistic model called Network Inferring from Multidimensional Features of Cascades(NIMFC) which takes into account heterogeneous features, including temporal and topological features of cascades, node attributes, and information content, to infer the latent network structure and transmission rates of edges. Also, based on the inferred network structure, we may track diffusion pathways of a cascade in social networks. We use blocked coordinate descent method to learn a sparse estimation of the latent network. Our proposed model NIMFC is evaluated both on large synthetic and real-world data sets, and experimental results show that our method significantly outperforms state-of-the-art models both in terms of recovering the latent network structure and information pathway tracking.

关键词： diffusion network network inferring information pathway tracking temporal feature node attributes topological feature informatio

来源：评论

学校读者我要写书评

暂无评论

Photonic axion insulator

引用

Science (New York, N.Y.) 2025年第6730期387卷 162-166页

作者： Liu, Gui-Geng Mandal, Subhaskar Xi, Xiang Wang, Qiang Devescovi, Chiara Morales-Pérez, Antonio Wang, Ziyao Yang, Linyun Banerjee, Rimi Long, Yang Meng, Yan Zhou, Peiheng Gao, Zhen Chong, Yidong García-Etxarri, Aitzol Vergniory, Maia G. Zhang, Baile Division of Physics and Applied Physics School of Physical and Mathematical Sciences Nanyang Technological University Singapore Research Center for Industries of the Future Department of Electronic and Information Engineering School of Engineering Westlake University Hangzhou China School of Electrical Engineering and Intelligentization Dongguan University of Technology Dongguan China National Laboratory of Solid State Microstructures School of Physics Collaborative Innovation Center of Advanced Microstructures Nanjing University Nanjing China Donostia International Physics Center Donostia-San Sebastian Spain Institute for Theoretical Physics ETH Zurich Zurich Switzerland Material and Applied Physics Department University of the Basque Country (UPV/EHU) Donostia-San Sebastián Spain Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen China National Engineering Research Center of Electromagnetic Radiation Control Materials Key Laboratory of Multi-spectral Absorbing Materials and Structures of Ministry of Education University of Electronic Science and Technology of China Chengdu China State Key Laboratory of Optical Fiber and Cable Manufacture Technology Department of Electronic and Electrical Engineering Guangdong Key Laboratory of Integrated Optoelectronics Intellisense Southern University of Science and Technology Shenzhen China Centre for Disruptive Photonic Technologies Photonics Institute Nanyang Technological University Singapore IKERBASQUE Basque Foundation for Science Bilbao Spain Max Planck Institute for Chemical Physics of Solids Dresden Germany Département de Physique et Institut Quantique Université de Sherbrooke Sherbrooke Canada

Axions, hypothetical elementary particles that remain undetectable in nature, can arise as quasiparticles in three-dimensional crystals known as axion insulators. Previous implementations of axion insulators have largely been limited to two-dimensional systems, leaving their topological properties in three dimensions unexplored in experiment. Here, we realize an axion insulator in a three-dimensional photonic crystal and probe its topological properties. Demonstrated features include half-quantized Chern numbers on each surface that resembles a fractional Chern insulator, unidirectional chiral hinge states forming topological transport in three dimensions, and arithmetic operations between fractional and integer Chern numbers. Our work experimentally establishes the axion insulator as a three-dimensional topological phase of matter and enables chiral states to form complex, unidirectional three-dimensional networks through braiding.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Static Backward Taint Data Analysis Method for Detecting Web Application Vulnerabilities 9

A Static Backward Taint Data Analysis Method for Detecting W...

引用

2017 9th IEEE International Conference on Communication Software and Networks (ICCSN 2017)

作者： Xuexiong Yan Hengtai Ma Qingxian Wang Institute of Software Chinese Academy of Sciences State Key Laboratory of Mathematical Engineering and Advanced Computing Institute of Software Chinese Academy of Sciences State Key Laboratory of Mathematical Engineering and Advanced Computing

ISBN: (纸本)9781509038237;9781509038220

This paper addresses detecting taint-style Thisvulnerabilities in PHP code. It extends classical taint-style model with an element called "cleans", which is used to specify sanitation routines. Based on the new model, a static backward taint data analysis method is proposed to detecting taint-style vulnerabilities. This method includes four key steps, first of which is collecting sinks and constructing contexts, the second is backward tracing variables during a basic block, the third is tracing variables between blocks, and the last is tracing variables crossing function call. A tool called POSE implements this method and testing results show that the method is valid for detecting taint-style web application vulnerabilities.

关键词： taint data analysis PHP web application vulnerabilities

来源：评论

学校读者我要写书评

暂无评论

G Bytes Data Hiding Method Based on Cluster Chain Structure

引用

Wuhan University Journal of Natural Sciences 2013年第5期18卷 443-448页

作者： NIU Xiaopeng LI Qingbao WANG Wei WANG Yulong State Key Laboratory of Mathematical Engineering and Advanced Computing PLA Information Engineering University

Protecting the security of sensitive information has become a matter of great concern to everyone. Data hiding technique solves the problem to some extent, but still, some shortcomings remain for researching. To improve the capability of hiding huge data file in disk with high efficiency. In this paper, we propose a novel approach called CryptFS, which is achieved by utilizing the file access mechanism and modifying the cluster chain structure to hide data. CryptFS can quickly hide data file with G bytes size in less than 0.1s. The time used for hiding and recovering data is irrelevant to the size of data file, and the reliability of the hidden file is high, which will not be overlaid by new created file and disk defragment.

关键词： data hiding file system cluster chain index entry efficiency robustness

来源：评论

学校读者我要写书评

暂无评论

Research on Fuzzing Technology for JavaScript Engines 21

Research on Fuzzing Technology for JavaScript Engines

引用

5th International Conference on Computer Science and Application engineering, CSAE 2021

作者： Tian, Ye Qin, Xiaojun Gan, Shuitao State Key Laboratory of Mathematical Engineering and Advanced Computing Zheng zhou Wuxi China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China

ISBN: (纸本)9781450389853

JavaScript engine is the core component of web browsers, whose security issues are one of the critical aspects of the overall Web Eco-Security. Fuzzing technology, as an efficient software testing approach, has been widely applied to detecting vulnerabilities in different JavaScript engines, which is a security research hotspot at present. Based on systematical dissection of existing fuzzing methods, this paper reviews the development and technical ideas of JavaScript Engine Fuzzing combined with taxonomy, proposes a general framework of JavaScript Engine Fuzzing and analyzes the key techniques involved. Finally, we discuss the core issues that restrict efficiency in current research and present an outlook on the future trends of JavaScript Engine Fuzzing.. © 2021 Association for computing Machinery. All rights reserved.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

APU-D* Lite: Attack Planning under Uncertainty Based on D* Lite

引用

Computers, Materials & Continua 2020年第11期65卷 1795-1807页

作者： Tairan Hu Tianyang Zhou Yichao Zang Qingxian Wang Hang Li State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001China School of Electrical Engineering and Telecommunications UNSW KensingtonNSW 2033Australia

With serious cybersecurity situations and frequent network attacks,the demands for automated pentests continue to increase,and the key issue lies in attack *** the limited viewpoint of the attacker,attack planning under uncertainty is more suitable and practical for pentesting than is the traditional planning approach,but it also poses some *** address the efficiency problem in uncertainty planning,we propose the APU-D*Lite algorithm in this ***,the pentest framework is mapped to the planning problem with the Planning Domain Definition Language(PDDL).Next,we develop the pentest information graph to organize network information and assess relevant exploitation actions,which helps to simplify the problem ***,the APU-D*Lite algorithm is introduced based on the idea of incremental heuristic *** method plans for both hosts and actions,which meets the requirements of *** the pentest information graph as the input,the output is an alternating host and action *** experiments,we use the attack success rate to represent the uncertainty level of the *** result shows that APU-D*Lite displays better reliability and efficiency than classical planning algorithms at different attack success rates.

关键词： Attack planning under uncertainty automated pentest APU-D*Lite algorithm incremental heuristic search

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：