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

2023 IEEE International Conference on systems, Man, and Cybernetics, SMC 2023

作者： Wu, Chengpei Lou, Yang Li, Junli College of Computer Science Sichuan Normal University Chengdu610066 China Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China National Yang Ming Chiao Tung University Department of Computer Science Hsinchu300 Taiwan Graduate School of Information Science and Technology Osaka University Osaka565-0871 Japan

ISBN: (纸本)9798350337020

Many natural and engineering systems can be modeled and represented in the forms of graph data, and then studied using graph theory and network analysis tools. Graph representation learning aims at generating lower-dimensional representations from higher-dimensional graph data, which is a crucial step that facilitates the follow-up tasks, such as node and graph classifications. In this paper, we present a simple but effective graph representation learning method, namely the pyramid pooling-based local profile (PPLP), which enables local nodal profiles to be transformed into a graph representation, with multi-scale features extracted. PPLP can be either embedded into a graph neural network as the readout layer, or perform independently as a graph embedding algorithm. The resultant representations of PPLP are for graph-level tasks. PPLP is experimentally tested by performing graph classification tasks on ten representative datasets, either as the readout layer of different graph neural networks, or as an independent graph embedding algorithm. Experimental results demonstrate that: 1) when embedded into graph neural networks, PPLP outperforms the widely-used global pooling-based readout methods;2) as an independent graph embedding algorithm, PPLP performs fairly good, especially on the social network datasets. The investigation confirms PPLP as a simple but promising method for graph-level tasks. © 2023 IEEE.

关键词： graph classification graph neural network Graph representation learning pyramid pooling

来源：评论

学校读者我要写书评

暂无评论

CrossSim: Towards Cross-system Trajectory Similarity Computation via Representation Learning

引用

IEEE Internet of Things Journal 2025年

作者： Cao, Zijian Zhao, Dong Dong, Xiyuan Wang, Qiyue Yuan, Haitao Gao, Yujia Ma, Huadong Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology School of Computer Science Beijing100876 China Nanyang Technological University College of Computing and Data Science 639798 Singapore Zhongguancun Laboratory Beijing100094 China

Trajectory similarity computation is essential for various downstream applications, such as anomaly route detection, order matching, and digital contact tracing. However, its effectiveness is confined within a single system due to privacy concerns associated with sharing raw trajectories across different systems. In this paper, we propose CrossSim, a novel framework designed to efficiently retrieve similar trajectories across all systems while preserving individual privacy. Our framework comprises three main components: i) a Trajectory Encoding Model that transforms trajectories into high-quality representations, where similarity relationships are reflected by their distances;ii) a two-stage optimization mechanism, including a Contrastive Similarity Learning stage and a Federated Similarity Learning stage, that alleviates the impact of heterogeneous similarity relationships across different systems on model training without aggregating raw trajectories;iii) a Similar Trajectory Retrieval procedure that obtains top-k similar trajectories from all systems without sharing raw trajectories. We conduct comprehensive experiments on three real-world datasets to evaluate the effectiveness of our proposed framework. The evaluation results demonstrate that CrossSim outperforms all existing schemees. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Seastar: A Cache-Efficient and Load-Balanced Key-Value Store on Disaggregated Memory

Seastar: A Cache-Efficient and Load-Balanced Key-Value Store...

引用

IEEE International Conference on Cluster computing

作者： Jingwen Du Fang Wang Dan Feng Dexin Zeng Sheng Yi Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China China School of Computer Science and Technology Huazhong University of Science and Technology China Shenzhen Huazhong University of Science and Technology Research Institute China

ISBN: (数字)9798350358711

ISBN: (纸本)9798350358728

In modern datacenters, memory disaggregation un-packs monolithic servers to build independent network-connected compute and memory pools, greatly improving resource uti-lization. Existing memory-disaggregated key-value stores adopt ownership sharing or ownership partitioning for request scheduling and they all show poor performance and scalability. The former generates multiple cache misses and multiple network round trips due to poor cache locality, while the latter fails to fully use resources on all Compute Nodes (CNs) due to load imbalance. In this paper, we propose Seastar, a fast and scalable key-value store that achieves high cache locality as well as load balancing. To enable high concurrency and ensure linearizability, Seastar exploits a self-verification version chain to provide out-of-place atomic updates and ensure consistent reads. To improve cache locality, Seastar leverages a pair-based ownership assigning scheme to assign the processing permission of requests corre-sponding to each key to a CN pair through two independent hash functions. To ensure load balancing among CNs, Seastar proposes a decentralized power-of-two-choices routing scheme to route the requests to the less-loaded CNs in CN pairs for handling. Experimental results demonstrate that Seastar improves the throughput by up to 6.7x and significantly reduces the latency compared with state-of-the-art memory-disaggregated key-value stores.

关键词： Concurrent computing Hash functions Protocols Processor scheduling Scalability Cluster computing Load management Throughput Routing Servers

来源：评论

学校读者我要写书评

暂无评论

Robust Dynamic Broadcasting for Multi-Hop Wireless Networks Under Time-Varying Connectivity and Dynamic SINR

引用

IEEE Transactions on Mobile computing 2025年

作者： Tian, Xiang Yu, Jiguo Luo, Chuanwen Yu, Dongxiao Wang, Guijuan Feng, Bin Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu610054 China Qilu University of Technology Big Data Institute Jinan250353 China Beijing Forestry University School of Information Science and Technology Beijing100083 China Shandong University School of Computer Science and Technology Shandong Qingdao266237 China Taishan University School of Information Science and Technology 271000 China

Throughput-optimal dynamic broadcasting is an essential cornerstone for the efficient operation of Multi-hop Wireless Networks (MWNs). Most existing algorithms for this problem were developed assuming static interference environments and network connectivity. However, wireless interference environments and network connectivity are inherently time-varying in real-world scenarios, primarily due to uncontrollable interference sources and unreliable links. Such time-varying characteristics make these existing algorithms less robust. In this paper, we study the robust throughput-optimal dynamic broadcasting for MWNs with multi-dimensional time-varying characteristics in terms of interference environments, network connectivity, and data arrival. We model the time-varying link existence states using a random process and characterize the time-varying interference environments through a dynamic variant of the classical Signal-to-Interference-plus-Noise-Ratio (SINR) model. In this variant, the SINR model parameters are dynamically adjusted over time by an adversary. Based on this, we first design a Robust Throughput-optimal Dynamic Broadcast (RTDB) algorithm which makes efficient slot-based max-weight link scheduling, power allocation, and data forwarding decisions in each time slot. We then prove its throughput-optimality in time-varying acyclic directed MWNs under the dynamic SINR model. The effectiveness of RTDB is validated via numerous simulations. © 2002-2012 IEEE.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Optimization for Task Offloading and Downloading in UAV-Assisted MEC systems with Aerial to Aerial Collaboration

Optimization for Task Offloading and Downloading in UAV-Assi...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Jiawei Jiang Xiang Tian Yubing Han Chunyu Hu Bin Feng Jiguo Yu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China School of Information Science and Technology Taishan University Taian China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Big Data Institute Qilu University of Technology Jinan China

ISBN: (数字)9798331513054

ISBN: (纸本)9798331513061

Owing to the easy deployment and mobile flexibility, Unmanned Aerial Vehicle (UAV) assisted Mobile Edge computing (MEC) has been deemed as one potential technology for handling the computation-intensive tasks at terminal devices (TDs). In this work, a MEC architecture assisted by UAVs is designed which achieves efficient offloading, computing, and downloading for tasks from multiple TDs via aerial to aerial collaboration of two UAVs. In this architecture, the task offloading process contains two parts, i.e., the offloading from TDs to a mobile UAV which flies around TDs, and the offloading from the mobile UAV to a hovering UAV which hovers in the air. The computing tasks from TDs will be divided into three parts allocated to the TDs themselves, and both two UAVs. Upon completion of computation, the computation results are downloaded to the TDs. The optimization objective is to seek for an optimal task division strategy to attain the weighted total energy consumption minimization for all devices. Since the formulated optimization problem is not convex, we develop a two-step iteration algorithm which jointly optimizes computing frequency, task allocation volume, as well as UAV's trajectory based on the method of block coordinate descent. Simulation results confirm the effectiveness and performance advantages of the designed algorithm.

关键词： Energy consumption Simulation Collaboration computer architecture Autonomous aerial vehicles Minimization Resource management Jamming Trajectory optimization Radio spectrum management

来源：评论

学校读者我要写书评

暂无评论

Source Camera Device Identification Combining Sensor Intrinsic Features and Tag

Source Camera Device Identification Combining Sensor Intrins...

引用

International Conference on Networking and Network Applications (NaNA)

作者： Hui Tian Haibao Chen Yuyan Zhao Pinchang Zhang Yan Xu Yangyang Liu School of Computer Science and Technology Anhui University Hefei China School of Computer and Information Engineering Chuzhou University Chuzhou China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China State Key Laboratory of Integrated Services Networks (Xidian University) Xi’an China School of Computer Science and Technology Xidian University Xi’an China

ISBN: (数字)9798350376777

ISBN: (纸本)9798350376784

Source camera identification method is crucial in digital image forensics for determining the authentic source of an image. In this paper, we propose a new source camera identification method by combining the intrinsic features of the camera with a carefully designed tag. Our method establishes a hybrid fingerprint model involving two parameters as the unique camera fingerprints of a digital image. Utilizing hypothesis testing theory, we develop a generalized likelihood ratio test (GLRT) to identify the source camera of digital images. Finally, we provide numerical results to validate the performance of the proposed method and demonstrate its effectiveness in identifying source camera devices.

关键词： Performance evaluation Digital images Forensics Fingerprint recognition Cameras Numerical models Object recognition

来源：评论

学校读者我要写书评

暂无评论

Photonic crystal-connected bidirectional micro-ring resonator array for duplex mode and wavelength channel(de)multiplexing

引用

Photonics Research 2024年第8期12卷 1802-1812页

作者： ZHIWEI GUAN CHAOFENG WANG CHUANGXIN XIE HAISHENG WU JUNMIN LIU HUAPENG YE DIANYUAN FAN JIANGNAN XIAO SHUQING CHEN International Collaborative Laboratory of 2D Materials for Optoelectronics Science and Technology Institute of Microscale OptoelectronicsShenzhen UniversityShenzhen 518060China College of Physics and Engineering Technology Minzu Normal University of XingyiXingyi 562400China College of New Materials and New Energies Shenzhen Technology UniversityShenzhen 518118China Guangdong Provincial Key Laboratory of Optical Information Materials and Technology and Institute of Electronic Paper Displays South China Academy of Advanced OptoelectronicsSouth China Normal UniversityGuangzhou 510006China Terahertz Technology Innovation Research Institute Shanghai Key Laboratory of Modern Optical SystemTerahertz Science Cooperative Innovation CenterSchool of Optical-Electrical Computer EngineeringUniversity of Shanghai for Science and TechnologyShanghai 200093China

The progress of on-chip optical communication relies on integrated multi-dimensional mode(de)multiplexers to enhance communication capacity and establish comprehensive ***,existing multi-dimensional(de)multiplexers,involving modes and wavelengths,face limitations due to their reliance on single-directional total internal reflection and multi-level mode conversion based on directional coupling *** constraints restrict their potential for full-duplex functionality and highly integrated *** solve these problems by introducing a photonic-like crystal-connected bidirectional micro-ring resonator array(PBMRA)and apply it to duplex mode-wavelength multiplexing *** directional independence of total internal reflection and the cumulative effect of the subwavelength-scale pillar within the single-level photonic crystal enable bidirectional mode and wavelength multiplexed signals to transmit among multi-pair nodes without interference,improving on-chip integration in single-level mode *** a proof of concept,we fabricated a nine-channel bidirectional multi-dimensional(de)multiplexer,featuring three wavelengths and three TE modes,compactly housed within a footprint of 80μm×80μm,which efficiently transmits QPSK-OFDM signals at a rate of 216 Gbit/s,achieving a bit error rate lower than 10^(-4).Leveraging the co-ring transmission characteristic and the orthogonality of the mode-wavelength channel,this(de)multiplexer also enables a doubling of communication capacity using two physical transmission channels.

关键词： resonator channel mode

来源：评论

学校读者我要写书评

暂无评论

MAML MOT: Multiple Object Tracking based on Meta-Learning

arXiv

引用

arXiv 2024年

作者： Chen, Jiayi Deng, Chunhua School of Computer Science and Technology Wuhan University of Science and Technology Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan430065 China

With the advancement of video analysis technology, the multi-object tracking (MOT) problem in complex scenes involving pedestrians is gaining increasing importance. This challenge primarily involves two key tasks: pedestrian detection and re-identification. While significant progress has been achieved in pedestrian detection tasks in recent years, enhancing the effectiveness of re-identification tasks remains a persistent challenge. This difficulty arises from the large total number of pedestrian samples in multi-object tracking datasets and the scarcity of individual instance samples. Motivated by recent rapid advancements in meta-learning techniques, we introduce MAML MOT, a meta-learning-based training approach for multi-object tracking. This approach leverages the rapid learning capability of meta-learning to tackle the issue of sample scarcity in pedestrian re-identification tasks, aiming to improve the model’s generalization performance and robustness. Experimental results demonstrate that the proposed method achieves high accuracy on mainstream datasets in the MOT Challenge. This offers new perspectives and solutions for research in the field of pedestrian multi-object tracking. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Mobility-Aware User Association and Computation Offloading in Ultra-Dense Networks

IEEE Transactions on Green Communications and Networking

引用

IEEE Transactions on Green Communications and Networking 2025年

作者： Qiu, Bin Feng, Ke Li, Xian Xiao, Hailin Zhang, Zhongshan Guilin University of Technology School of Computer Science and Engineering Guilin541004 China Guilin University of Technology Guangxi Key Laboratory of Embedded Technology and Intelligent System Guilin541004 China Guangxi Modern Polytechnic College Hechi530700 China Shenzhen University College of Electronics and Information Engineering Shenzhen518060 China Hubei University School of Computer Science and Information Engineering Wuhan430062 China Wuhan430062 China School of Cyberspace Science and Technology Guangdong519088 China

The integration of mobile edge computing (MEC) into ultra-dense network (UDN) has emerged as a promising solution for providing uninterrupted task offloading services to computation-demanding mobile devices (MDs), leveraging densely deployed MEC servers. However, the mobility of MDs can significantly affect the computation offloading decision and system performance in UDN-MEC. To address this issue, we develop a joint optimization algorithm for mobility-aware user association and computation offloading to minimizize the total system cost, including delay and energy consumption in UDN-MEC. Specifically, a polynomial fitting algorithm based on an extended Kalman filter (PFA-EKF) is designed to predict the nonlinear moving trajectories of the MDs. Furthermore, we present a mobility-aware user-association rule based on a breadth-first search (UAR-BFS) that can realize balanced matching offloading in the overlapping coverage area of densely deployed small base stations. Accordingly, we propose an improved deep deterministic policy gradient-based greedy algorithm (IDDPG-GA) to address the joint optimization problem of multiuser dynamic offloading and resource allocation, in which an intelligently adjusted bias factor is proposed to enhance collaborative behavior among MDs. Extensive numerical results and comparisons demonstrate the promising performance improvements of the proposed scheme compared with existing benchmark schemes in various scenarios. © 2025 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

Discrete Geometric Coded Data Layout for Large-scale Object Storage systems

Discrete Geometric Coded Data Layout for Large-scale Object ...

引用

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Yi Tian Guangping Xu Hongzhang Yang Yue Ni JiaXin Cao Lei Yang School of Computer Science and Engineering Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing Novel Software Technology Tianjin China Key Laboratory of Computer Vision and System Ministry of Education China Roycom (Tianjin) Information Technology Co. Ltd.

Regenerating codes are new network codes proposed to reduce the data required for fault repair, which can improve the recovery efficiency of faulty nodes in data storage systems. However, unlike Reed-Solomon code, which repairs at the granularity of bytes, regenerating codes require data stored in large chunks but leads to severe read amplification, which reads out excess data when degraded read objects and increases degraded read time. That reflects a mutual constraint between improving recovery efficiency and degraded read performance, as manifested in the amplification of data reads, a vital issue considered in this *** solve this problem, we propose a new type of data layout — discrete geometric, which splits the object into a series of geometric sequences of data blocks. They are placed discretely into corresponding containers on the disks at different nodes, with containers of the same size made into a strip for encoding. The discrete characteristic ensures lower repair costs for degraded reads. The geometric characteristic ensures the repair performance of regenerating codes by large blocks, and read amplification can be mitigated through small blocks. To reduce IOPS for discrete geometric, we propose Discrete Geometric-Locally Regenerating Codes (DG-LRCs), guaranteeing lower degraded read latency while improving recovery *** results show that the degraded read time of DG-LRCs compared to regenerating codes combined with geometric partitioning is 22.56% lower at 2Gbpsand 60.56% lower at 4Gbps, and the recovery performance is 7.04 times better than that of RS code.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：