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

MetaCity: data-driven sustainable development of complex cities

The Innovation 2025年第2期6卷 88-103,87页

作者： Yunke Zhang Yuming Lin Guanjie Zheng Yu Liu Nicholas Sukiennik Fengli Xu Yongjun Xu Feng Lu Qi Wang Yuan Lai Li Tian Nan Li Dongping Fang Fei Wang Tao Zhou Yong Li Yu Zheng Zhiqiang Wu Huadong Guo Department of Electronic Engineering Beijing National Research Center for Information Science and Technology(BNRist)Tsinghua UniversityBeijing 100084China John Hopcroft Center for Computer Science Shanghai Jiao Tong UniversityShanghai 200240China University of Chinese Academy of Sciences Beijing 100049China Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China Institute of Geographic Sciences and Natural Resources Research Chinese Academy of SciencesBeijing 100101China Department of Civil and Environmental Engineering Northeastern UniversityBostonMA 02115USA School of Architecture Tsinghua UniversityBeijing 100084China School of Civil Engineering Tsinghua UniversityBeijing 100084China Big Data Research Center University of Electronic Science and Technology of ChinaChengdu 611731China JD iCity JD Technology&JD Intelligent Cities ResearchBeijing 100176China College of Architecture and Urban Planning Tongji UniversityShanghai 200292China International Research Center of Big Data for Sustainable Development Goals Beijing 100094China Aerospace Information Research Institute Chinese Academy of SciencesBeijing 100094China These authors contributed equally

Cities are complex systems that develop under complicated interactions among their human and environmental *** generates substantial outcomes and opportunities while raising challenges including congestion,air pollution,inequality,etc.,calling for efficient and reasonable solutions to sustainable ***,booming technologies generate large-scale data of complex cities,providing a chance to propose data-driven solutions for sustainable urban *** paper provides a comprehensive overview of data-driven urban sustainability *** this review article,we conceptualize MetaCity,a general framework for optimizing resource usage and allocation problems in complex cities with data-driven *** this framework,we decompose specific urban sustainable goals,e.g.,efficiency and resilience,review practical urban problems under these goals,and explore the probability of using data-driven technologies as potential solutions to the challenge of *** the basis of extensive urban data,we integrate urban problem discovery,operation of urban systems simulation,and complex decision-making problem solving into an entire cohesive framework to achieve sustainable development goals by optimizing resource allocation problems in complex cities.

关键词： resource usage sustainable development urbanization resilience data driven urban systems simulation complex cities complexity

来源：评论

学校读者我要写书评

暂无评论

A Cost-Efficient Anonymous Authenticated and Key Agreement Scheme for V2I-Based Vehicular Ad-Hoc Networks

引用

IEEE Transactions on Intelligent Transportation Systems 2024年第9期25卷 12621-12630页

作者： Saleem, Muhammad Asad Li, Xiong Mahmood, Khalid Shamshad, Salman Alenazi, Mohammed J. F. Das, Ashok Kumar University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China Shenzhen Institute for Advanced Study University of Electronic Science and Technology of China Shenzhen518000 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan The University of Lahore Department of Software Engineering Lahore54590 Pakistan King Saud University College of Computer and Information Sciences Department of Computer Engineering Riyadh11451 Saudi Arabia International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500032 India

The rise of smart cities is directly connected to the increasing use of vehicles. The growing vehicle utilization has driven the emergence of Vehicular Ad-hoc Networks (VANETs), facilitating instant information exchange among vehicles. The system provides essential information regarding road conditions, traffic patterns, and more relevant data. VANETs encompass two fundamental categories of communication exchanges, namely Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I). V2I technology facilitates the integration of cars and transportation infrastructure, enabling effective communication between vehicles and infrastructure. Nevertheless, the potential of V2I communication has various security concerns arising from prevalent security threats. Current authentication techniques encounter challenges regarding complexity, security, and privacy considerations. We designed a hash-based lightweight and anonymous authentication scheme to address the aforementioned restrictions and enhance the effectiveness of authentication in V2I architecture. This scheme effectively combines identity, password, and bio-metric to enhance resistance against impersonation, denial of service, and privileged insider attacks. The devised scheme distinguishes itself by a comparative analysis and security proofs, highlighting its superior capability in guaranteeing secure authentication in V2I communication. The comprehensive security analysis conducted formally and informally showcases the robustness of the proposed solution against several threats. The performance evaluation results show that our scheme demonstrates a decrease in the computational cost of 51.40% approximately and a reduction in communication overhead of around 22.57%. These results establish the efficiency and scalability of the proposed scheme as a viable solution for V2I architecture. © 2000-2011 IEEE.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Unlearnable 3D point clouds: class-wise transformation is all you need 24

Unlearnable 3D point clouds: class-wise transformation is al...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Xianlong Wang Minghui Li Wei Liu Hangtao Zhang Shengshan Hu Yechao Zhang Ziqi Zhou Hai Jin National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Hubei Engineering Research Center on Big Data Security and Hubei Key Laboratory of Distributed System Security and School of Cyber Science and Engineering Huazhong University of Science and Technology School of Software Engineering Huazhong University of Science and Technology Hubei Engineering Research Center on Big Data Security and Hubei Key Laboratory of Distributed System Security and School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Cluster and Grid Computing Lab and School of Computer Science and Technology Huazhong University of Science and Technology

ISBN: (纸本)9798331314385

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples; (ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

EDSep: An Effective Diffusion-Based Method for Speech Source Separation

EDSep: An Effective Diffusion-Based Method for Speech Source...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Dong, Jinwei Wang, Xinsheng Mao, Qirong School of Computer Science and Communication Engineering Jiangsu University China Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications China Provincial Key Laboratory of Computational Intelligence and New Technologies in Low-Altitude Digital Agriculture Zhenjiang China Audio Speech and Language Processing Group School of Computer Science Northwestern Polytechnical University Xi'an China

ISBN: (纸本)9798350368741

Generative models have attracted considerable attention for speech separation tasks, and among these, diffusion-based methods are being explored. Despite the notable success of diffusion techniques in generation tasks, their adaptation to speech separation has encountered challenges, notably slow convergence and suboptimal separation outcomes. To address these issues and enhance the efficacy of diffusion-based speech separation, we introduce EDSep, a novel single-channel method grounded in score matching via stochastic differential equation (SDE). This method enhances generative modeling for speech source separation by optimizing training and sampling efficiency. Specifically, a novel denoiser function is proposed to approximate data distributions, which obtains ideal denoiser outputs. Additionally, a stochastic sampler is carefully designed to resolve the reverse SDE during the sampling process, gradually separating speech from mixtures. Extensive experiments on databases such as WSJ0-2mix, LRS2-2mix, and VoxCeleb2-2mix demonstrate our proposed method's superior performance over existing diffusion and discriminative models, validating its efficacy. © 2025 IEEE.

关键词： diffusion score matching speech separation stochastic differential equation

来源：评论

学校读者我要写书评

暂无评论

Modular Extremely Large-Scale Array Communication:Near-Field Modelling and Performance Analysis

引用

China Communications 2023年第4期20卷 132-152页

作者： Xinrui Li Haiquan Lu Yong Zeng Shi Jin Rui Zhang National Mobile Communications Research Laboratory Frontiers Science Center for Mobile Information Communication and SecuritySoutheast UniversityNanjing 210096China Purple Mountain Laboratories Nanjing 211111China The Chinese University of Hong Kong Shenzhen Research Institute of Big DataShenzhen 518172China Department of Electrical and Computer Engineering National University of SingaporeSingapore 117583Singapore

This paper investigates the wireless communication with a novel architecture of antenna arrays,termed modular extremely large-scale array(XLarray),where array elements of an extremely large number/size are regularly mounted on a shared platform with both horizontally and vertically interlaced *** module consists of a moderate/flexible number of array elements with the inter-element distance typically in the order of the signal wavelength,while different modules are separated by the relatively large inter-module distance for convenience of practical *** accurately modelling the signal amplitudes and phases,as well as projected apertures across all modular elements,we analyse the near-field signal-to-noise ratio(SNR)performance for modular XL-array *** on the non-uniform spherical wave(NUSW)modelling,the closed-form SNR expression is derived in terms of key system parameters,such as the overall modular array size,distances of adjacent modules along all dimensions,and the user's three-dimensional(3D)*** addition,with the number of modules in different dimensions increasing infinitely,the asymptotic SNR scaling laws are ***,we show that our proposed near-field modelling and performance analysis include the results for existing array architectures/modelling as special cases,e.g.,the collocated XL-array architecture,the uniform plane wave(UPW)based far-field modelling,and the modular extremely large-scale uniform linear array(XL-ULA)of *** simulation results are presented to validate our findings.

关键词： modular extremely large-scale array practical deployment projected apertures non-uniform spherical wave near-field modelling

来源：评论

学校读者我要写书评

暂无评论

Sequence-to-Sequence Multi-Hop Knowledge Reasoning Based on Retentive Network 7

Sequence-to-Sequence Multi-Hop Knowledge Reasoning Based on ...

引用

7th International Conference on computer Information science and Application Technology, CISAT 2024

作者： Su, Ruilin Zhang, Wanshan Yu, Dunhui Hubei University Wuhan China Wuhan430062 China Hubei University School of Computer Science and Information Engineering Wuhan430062 China Hubei University Hubei Key Laboratory of Big Data Intelligent Analysis and Application Wuhan430062 China Engineering and Technical Research Center of Hubei Province in Software Engineering Wuhan430062 China

ISBN: (纸本)9798350375107

Multi-hop Knowledge Reasoning is a task that involves generating an answer given a query and a knowledge graph. Existing sequence-to-sequence reasoning models use the Transformer to encode and decode sequences, but these models have some flaws, such as the inability to effectively handle long-sequence reasoning and susceptibility to exposure bias. To address these issues, we provides a sequence-to-sequence reasoning model named STSR, which is based on Retentive Network. Aiming at improving training efficiency through parallel training, this model leverages the advantages in Retentive Network, reduce time overhead, and enhance reasoning efficiency through iterative reasoning. It effectively mitigates the problems of high spatial overhead and low efficiency in long-sequence reasoning faced by the Transformer. Moreover, it retains and updates historical information during the encoding and decoding process, enhancing the model's memory and generalization capabilities. Additionally, the Scheduled Sampling method is adopted to alleviate the exposure bias introduced during reasoning, which involves using the model's own output as the input for the next moment with a certain probability during training, instead of using the true label. We conduct the experiment on six public datasets, with the results showing that the proposed model outperforms existing baseline models in terms of precision and generation quality. This paper provides a new solution for the task of sequence-to-sequence multihop knowledge reasoning and also demonstrates the potential application of the Retentive Network in natural language processing. © 2024 IEEE.

关键词： Iterative decoding

来源：评论

学校读者我要写书评

暂无评论

Ethereum Phishing Scams Detection Based on Graph Contrastive Learning with Augmentations

Ethereum Phishing Scams Detection Based on Graph Contrastive...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Yongxin Chen Wenhan Hou Xin Zhang Ru Li School of Computer Science Inner Mongolia University Hohhot China Engineering Research Center of Ecological Big Data Ministry of Education China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Cryptocurrency crime incidents in Ethereum are continuously rising, with phishing scams accounting for 50% of all criminal activities. The severe data imbalance significantly impacts the performance of Ethereum phishing detection models. The current solution may introduce redundant information or lead to the loss of important data. In this paper, we propose an Ethereum phishing detection method based on Graph Contrastive Learning with augmentations. This approach addresses the issue of insufficient learning of phishing node features, thus alleviating the influence of data imbalance on the model’s detection performance without disrupting the original data distribution. To enhance the representation of structural features, we employ two data augmentation methods: feature masking and edge perturbation. We conducted extensive experiments on a real Ethereum phishing dataset to evaluate the performance of our method. Compared to alternative methods, our approach not only significantly improves Precision, ranging from 12% to 30%, but also achieves noticeable enhancements in Recall, Auc, and F1-score. The experimental results provide ample evidence of the effectiveness of the proposed method.

关键词： Phishing Perturbation methods Image edge detection Smart contracts Contrastive learning data augmentation data models

来源：评论

学校读者我要写书评

暂无评论

PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programming 41

PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Li...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Li, Bingheng Yang, Linxin Chen, Yupeng Wang, Senmiao Mao, Haitao Chen, Qian Ma, Yao Wang, Akang Ding, Tian Tang, Jiliang Sun, Ruoyu Michigan State University United States School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen International Center For Industrial and Applied Mathematics Shenzhen Research Institute of Big Data China School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Rensselaer Polytechnic Institute United States

Solving large-scale linear programming (LP) problems is an important task in various areas such as communication networks, power systems, finance, and logistics. Recently, two distinct approaches have emerged to expedite LP solving: (i) First-order methods (FOMs);(ii) Learning to optimize (L2O). In this work, we propose a FOM-unrolled neural network (NN) called PDHG-Net, and propose a two-stage L2O method to solve large-scale LP problems. The new architecture PDHG-Net is designed by unrolling the recently emerged PDHG method into a neural network, combined with channel-expansion techniques borrowed from graph neural networks. We prove that the proposed PDHG-Net can recover PDHG algorithm, thus can approximate optimal solutions of LP instances with a polynomial number of neurons. We propose a two-stage inference approach: first use PDHG-Net to generate an approximate solution, and then apply the PDHG algorithm to further improve the solution. Experiments show that our approach can significantly accelerate LP solving, achieving up to a 3× speedup compared to FOMs for large-scale LP problems. Copyright 2024 by the author(s)

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

SC-GNN: A Communication-Efficient Semantic Compression for Distributed Training of GNNs 24

SC-GNN: A Communication-Efficient Semantic Compression for D...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Wang, Jihe Wu, Ying Wang, Danghui School of Computer Science Northwestern Polytechnical University Xi'an China Engineering Research Center of Embedded System Integration Ministry of Education Northwestern Polytechnical University Xi'an China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Northwestern Polytechnical University Xi'an China

ISBN: (纸本)9798400706011

Training big graph neural networks (GNNs) in distributed systems is quite time-consuming mainly because of the ubiquitous aggregate operations that involve a large amount of cross-partition communication for collecting embeddings/gradients during the forward and backward propagation. To reduce the volume of the communication, some recent approaches focused on decaying each of connections via sampling, quantifying, or delaying until satisfactory trade-off are obtained between volume and accuracy. However, when applied to popular GNNs, those approaches are found to be bounded by a common volume/accuracy Pareto frontier which shows that the decaying for individual connection cannot further accelerate the aggregate of training. In this work, SC-GNN, a semantic compression of the cross-partition communication, is proposed to concentrate a group of connections as a high-level semantics and transmit to a target partition. Since carrying the overall intent of a group, the semantics can keep transferring the interactions, i.e., embeddings/gradients, between a pair of remote partitions until GNN models converge. In addition, a connection-pattern based differential optimization is proposed to further prune those weak connections, while guaranteeing the training accuracy. The results show that, for multi-field datasets, the compression rate of SC-GNN is 40.8 × higher than SOTA methods and the epoch time is reduced to 31.8% on average. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Efficient Relaxed Functional Dependency Discovery with Minimal Set Cover

Efficient Relaxed Functional Dependency Discovery with Minim...

引用

International Conference on data engineering

作者： Xiaoou Ding Yida Liu Hongzhi Wang Chen Wang Yichen Song Donghua Yang Jianmin Wang School of Computer Science and Technology Harbin Institute of Technology National Engineering Research Center for Big Data Software EIRI Tsinghua University

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Assessing data quality through Functional Depen-dencies (FDs) is a crucial aspect of data governance. However, with the diverse range of data sources and the exponential growth in data volume, exact FDs can sometimes be impractical for real-world applications. In contrast, relaxed functional dependencies (RFDs), which allows for some flexibility in attribute value comparisons, demonstrates greater adaptability and flexibility for big data scenarios. To address the efficient discovery of RFDs, this paper proposes a novel mining method to supplement the current research gaps. By establishing a difference table for tuples, we transform the problem into a specialized minimal set covering problem. Additionally, we introduce two optimization strategies: reducing the time complexity of enumerating the left-hand side of the base RFDs to 0 (1) and decreasing the search complexity for feasible LHS attributes and threshold candidates from O(2 m-l ) to O(1.5 m-1 ). We rigorously proof that our mining approach guarantees the identification of validity and minimal RFDs. Experiments on nine real-world datasets reveal that our method significantly improves efficiency compared to existing techniques. Furthermore, it uncovers more concise and higher-quality RFDs. Importantly, the RFDs extracted through our methodology exhibit better performance in downstream cleaning tasks.

关键词： data integrity Soft sensors Transforms data engineering Cleaning data governance data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：