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

Upper Bounds on Lifetime of Three Dimensional Extended UWB Sensor Networks*

Chinese Journal of Electronics 2023年第2期19卷 307-312页

作者： Juan Xu Changjun Jiang Aihuang Guo Yongfa Hong Shu Li Cheng Wang School of Electronics and Information Engineering Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing of the Ministry of Education Tongji University Shanghai China College of Information Science and Engineering Shandong University of Science and Technology Qingdao China

The upper bounds on lifetime of three dimensional extended Time hopping impulse radio Ultrawide band (TH-IR UWB) sensor networks are derived using percolation theory arguments. The TH-IR UWB sensor network consists of $n$ sensor nodes distributed in a cube of edge length $n^{1/3}$ according to a Poisson point process of unit intensity. It is shown that for such a static three dimensional extended TH-IR UWB sensor network, the upper bound on the lifetime is of order $O(n^{-1})$ , while in the ideal case, the upper bound on the lifetime is longer than that of a static network by a factor of $n^{2/3}$ . Therefore sensor nodes moving randomly in the deployment area can improve the upper bound on network lifetime. The results also reveal that the upper bounds on network lifetime decrease with the number of nodes $n$ , thus extended TH-IR UWB sensor networks aren't prone to be employed in large-scale network.

关键词： Wireless communication Wireless sensor networks Upper bound Protocols

来源：评论

学校读者我要写书评

暂无评论

VCFGAN: A Two-stage Collaborative Filtering Framework based on Variational Autoencoders and Generative Adversarial Networks

VCFGAN: A Two-stage Collaborative Filtering Framework based ...

引用

Information systems and Computing Technology (ISCTech), International Conference on

作者： Zhiqiang Huang Jinzhong Li Xueyu Huang Junqi Liu School of Software Engineering Jiangxi University of Science and Technology Nanchang China College of Electronics and Information Engineering Jinggangshan University Ji’an China Ministry of Education Key Laboratory of Embedded System and Service Computing (Tongji University) Shanghai China

ISBN: (数字)9798350379860

ISBN: (纸本)9798350379877

Deep generative models, such as Generative Adversarial Networks (GAN) and Variational Autoencoders (VAE), are widely used in collaborative filtering. They usually learn users’ preferences for items directly from a highly sparse user rating matrix (URM), and then recommend the top-N items to users. Due to the high sparsity of URM, GAN has limited ability to handle sparse data, while VAE’s encoder can extract features. Therefore, we propose a two-stage collaborative filtering framework based on variational autoencoders and generative adversarial networks, named VCFGAN. It first uses two VAEs to extract features from URM and side information (SI), and then uses the extracted latent vectors to train the GAN network. To evaluate the performance of our proposed VCFGAN model, some experiments are conducted on two real datasets, and the experimental results show that our model outperforms other representative models.

关键词： Training Collaborative filtering Autoencoders Generative adversarial networks Feature extraction Vectors Data mining Sparse matrices Recommender systems Information systems

来源：评论

学校读者我要写书评

暂无评论

E2DAS: An Efficient Equivariant Dynamic Aggregation Saliency Model for Omnidirectional Images 27th

E2DAS: An Efficient Equivariant Dynamic Aggregation Saliency...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Zhang, Nana Liu, Qian Zhu, Dandan Zhu, Kun Zhai, Guangtao Yang, Xiaokang School of Computer Science and Technology Donghua University No.2999 Renmin North Road Songjiang District Shanghai201620 China Institute of AI Education Shanghai East China Normal University No.3663 Zhongshan North Road Putuo District Shanghai200333 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University No.4800 Cao’an Highway Jiading District Shanghai201804 China Institute of Image Communication and Network Engineering Shanghai Jiao Tong University No. 800 Dongchuan Road Minhang District Shanghai200240 China

ISBN: (纸本)9783031781216

Recent years have witnessed rapid progress of convolutional neural networks (CNNs) and their successful application in the task of saliency prediction for omnidirectional images (ODIs). Albeit achieving tremendous performance improvements, these CNNs-based saliency models are plagued by two major shortcomings: spatial content-agnostic and computationally intensive. Inspired by the effectiveness of equivariant network in the majority of computer vision tasks, we propose a novel efficient equivariant dynamic aggregation saliency (E2DAS) model to efficiently tackle the issue of human fixation prediction in ODIs. To be specific, our proposed model consists of an efficient equivariant module, a dynamic convolutional aggregation module, and an optimization computation module. Different from existing saliency models for ODIs, we are the first attempt to introduce an efficient equivariant dynamic convolutional aggregation operation into the saliency prediction task, which can fundamentally alleviate the projection distortion problem and can effectively learn spatial content-adaptive features. Moreover, we clearly observe a considerable decrease in the number of parameters resulting from the replacement of standard convolution with dynamic convolution aggregation. Extensive experiments on several benchmark datasets show the proposed model’s superiority over other state-of-the-art methods in terms of performance. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Equivariant dynamic aggregation light-weight model omnidirectional images saliency prediction spatial content-adaptive

来源：评论

学校读者我要写书评

暂无评论

Heuristic Elastic Scaling for Kubernetes Heterogeneous Microservices

Heuristic Elastic Scaling for Kubernetes Heterogeneous Micro...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Song Wang Sheng He Yishuang Ning Xiang Gao Zhijun Ding Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Tongji University Shanghai China Kingdee Research Kingdee International Software Group Co. Ltd Shenzhen China Intelligent Computing Facility Innovation Center ZhejiangLab Hangzhou China

ISBN: (数字)9798350365221

ISBN: (纸本)9798350365238

Kubernetes has become the basic platform for building cloud native applications. However, existing horizontal scaling methods based on Kubernetes have problems with resource redundancy. Furthermore, the combined horizontal and vertical scaling based on Kubernetes takes a long time. Regarding the issue above, first, we describe the execution processes of three scaling techniques and compare them in different dimensions; second, we construct a formal elastic scaling model for expansion scenarios, with the goal of minimizing the total cost; and third, we introduce a heuristic expansion algorithm after balancing resource redundancy and execution time as the heuristic information. The experiment results show that the elastic scaling algorithm proposed in this paper achieves better performance than other algorithms.

关键词： Costs Heuristic algorithms Redundancy Buildings Microservice architectures Sensors

来源：评论

学校读者我要写书评

暂无评论

FedDDB: Clustered Federated Learning based on Data Distribution Difference 22

FedDDB: Clustered Federated Learning based on Data Distribut...

引用

Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence

作者： Chengyu You Zihao Lu Junli Wang Chungang Yan Key Laboratory of Embedded System and Service Computing (Tongji University) Ministry of Education China and National (Province-Ministry Joint) Collaborative Innovation Center for Financial Network Security Tongji University China

ISBN: (纸本)9781450398336

Clustered federated learning is a federated learning method based on multi-task learning. It groups similar clients into the same clusters and shares model parameters to solve the problem that the joint model is trapped in local optima on Non-IID data. Most of the existing clustered federated learning methods are based on the difference of model parameters for clients clustering. During the client model training process, the model parameters are biased and the clustering result is affected due to insufficient samples and missing eigenvalues in the dataset. In this paper, we develop a clustered federated learning method based on data distribution difference (FedDDB) in the dataset level. The method in this paper focuses on the distribution of label probability and eigenvalues, analyzes the difference of data distribution difference between clients and measures the distance between datasets which is used for client clustering. Every cluster will be trained independently and in parallel on the cluster center model. At the beginning of each round of training, the client clustering process needs to be repeated. We conduct relevant experiments and demonstrate the effectiveness of our method.

关键词： Clustering method

来源：评论

学校读者我要写书评

暂无评论

Reply to Comments on 'Direct-Splitting-Based CN-FDTD for Modeling 2D Material Nanostructure Problems'

IEEE Open Journal of Antennas and Propagation

引用

IEEE Open Journal of Antennas and Propagation 2021年 2卷 676-678页

作者： Feng, Naixing Zhang, Yuxian Zeng, Qingsheng Tong, Mei Song Joines, William T. Wang, Guo Ping Institute of Microscale Optoelectronics Shenzhen University Shenzhen China College of Astronautics Nanjing University of Aeronautics and Astronautics Nanjing China Key Laboratory of Embedded System and Service Computing of the Ministry of Education College of Electronics and Information Engineering Tongji University Shanghai China Department of Electrical and Computer Engineering Duke University DurhamNC United States

In this response letter, we focus on addressing Yu Hang Yang's comments so that the correctness and validity of the proposed auxiliary-differential-equation-based (ADE) Crank-Nicolson finite-difference time-domain method with direct-splitting technique (CNDS-FDTD) are demonstrated. Moreover, related applications in modeling 2D material nanostructure problems are shown. © 2020 IEEE.

关键词： Finite difference time domain method

来源：评论

学校读者我要写书评

暂无评论

Optimal Linear Crossover for Mitigating Negative Transfer in Evolutionary Multitasking

引用

IEEE Transactions on Evolutionary Computation 2024年

作者： Liu, Zhaobo Yuan, Jianhua Zhang, Haili Zeng, Tao Zhu, Zexuan Shenzhen University Institute for Advanced Study Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Shenzhen Polytechnic University School of Undergraduate Education Shenzhen518055 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University Shenzhen City Key Laboratory of Embedded System Design Shenzhen518060 China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education of China Chongqing400044 China

Evolutionary multitasking algorithms use information exchange among individuals in a population to solve multiple optimization problems simultaneously. Negative transfer is a critical factor that affects the performance of evolutionary multitasking algorithms. In this study, we propose an innovative approach to mitigate negative transfer in evolutionary multitasking algorithms. The proposed approach is grounded in rigorous theoretical analysis, which provides valuable theoretical insights into the design of an optimal linear crossover operator for mitigating negative transfer. By identifying interpretable conditions, we establish a solid theoretical foundation to prevent negative transfer in diverse scenarios. Building upon these findings, we theoretically derive a closed-form expression for the optimal crossover operator and propose practical design methods based on approximations. Furthermore, we integrate the proposed optimal crossover operator into a fundamental evolutionary multitasking algorithm framework. The resultant algorithm is comparable or superior to other state-of-the-art methods. Empirical validation through comprehensive experiments confirms the effectiveness of our theoretical findings. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

FedWNS: Data Distribution-Wise Node Selection in Federated Learning via Reinforcement Learning

FedWNS: Data Distribution-Wise Node Selection in Federated L...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Chengwu Tu Shengjie Zhao Hao Deng School of Software Engineering Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Shanghai China Engineering Research Center of Key Software Technologies for Smart City Perception and Planning Ministry of Education Shanghai China

To deal with the discrepancy between global and local objectives in the federated learning invoked by the non-independent, identically distributed (non-IID) data and mitigate the impact of catastrophic forgetting in the training phase, we propose a federated learning framework with data distribution-wise reinforcement learning to perform node selection to accelerate the convergence process and alleviate the accuracy degradation. In this framework, the agent on the central server observes the number of samples every node owns, the derived distribution information of every dataset, and the current local and global accuracy. Then infer the selected node-set to participate in the current federated learning round through policy network in reinforcement learning. Finally, we conduct simulations with publicly data sets. Simulation results indicate that our FedWNS outperforms the existing FedAvg and CSFedAvg on the testing accuracy and the communication rounds to reach target accuracy under different settings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HeavyTracker: An Efficient Algorithm for Heavy-Hitter Detection in High-Speed Networks

HeavyTracker: An Efficient Algorithm for Heavy-Hitter Detect...

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Jiakun Yu Yu-E Sun He Huang Yang Du Guoju Gao Hongli Xu Shigang Chen School of Computer Science and Technology Soochow University Suzhou China School of Rail Transportation Soochow University Suzhou China Ministry of Education Key Laboratory of Embedded System and Service Computing (Tongji University) Shanghai China School of Computer Science and Technology University of Science and Technology of China Hefei China

Detecting heavy hitters that constitute the majority of network traffic is a critical task in network measurement. However, the highly skewed network traffic and the size-limited on-chip memory pose great challenges for heavy-hitter detection. The prior arts either use sketches to track all flows or maintain a fix-sized tracking list for recording elephant flows, resulting in limited detection precision or time-consuming tracking list exchanges. This paper presents HeavyTracker, an efficient algorithm that detects heavy hitters based on a count-with-threshold strategy. A two-dimensional tracker unit array is employed in our design to capture the heavy hitters, where each flow is randomly mapped to one unit in all rows. The tracker unit is designed to accept many flows and precisely report the largest two with frequencies that reach a predefined threshold. This design eliminates the frequent and time-consuming exchanges for maintaining the tracking list, allowing us to use a hash table to track the reported elephant flows. Experimental results based on real Internet traces show that HeavyTracker achieves a high $\mathbf{F}_{\beta}$-Score of threshold-t detection (0.97) and over 99% precision of top-k detection under a tight memory size. Besides, it reduces the frequency estimation error by 97.4% compared to the state-of-the-art.

关键词： Art High-speed networks Measurement uncertainty Telecommunication traffic Size measurement Frequency estimation Internet

来源：评论

学校读者我要写书评

暂无评论

Finite time cluster consensus of fractional-order multi-agent systems with directed topology

Finite time cluster consensus of fractional-order multi-agen...

引用

第33届中国控制与决策会议

作者： Weijin Liu Xiwei Liu Department of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education

In this paper,the finite time cluster consensus(FnTCC) of fractional-order multi-agent systems(FOMAS)with directed topology is *** fractional-order system is converted into an integer-order system by defining a neighborhood-based error variable,and suitable control rules are designed for the obtained first-order multi-agent *** to the exponential finite-time stability theorem,suitable Lyapunov functions are ***,the settling time function is *** simulation results prove the feasibility and validity of our theory.

关键词： Fractional-order Cluster consensus Exponential finite time Multi-agent systems Directed topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：