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

Reliable and Energy Efficient Protocol for Wireless Sensor Network

Tsinghua Science and technology 2007年第S1期12卷 95-100页

作者：阚保强蔡理徐勇军 College of Science Air Force Engineering University Key Laboratory of Computer System and Architecture Institute of Computing TechnologyChinese Academy of Sciences

Low-power design is one of the most important issues in wireless sensor networks (WSNs) , while reliable information transmitting should be ensured as well. Transmitting power (TP) control is a simple method to make the power consumption down, but excessive interferences from potential adjacent operating links and communication reliability between nodes should be considered. In this paper, a reliable and energy efficient protocol is presented, which adopts adaptive rate control based on an optimal TP. A mathematical model considering average interference and network connectivity was used to predict the optimal TP. Then for the optimal TP, active nodes adaptively chose the data rate with the change of bit-error–rate(BER) performance. The efficiency of the new strategy was validated by mathematical analysis and simulations. Compared with 802.11 DCF which uses maximum unified TP and BASIC protocol, it is shown that the higher average throughput can achieve while the energy consumption per useful bit can be reduced according to the results.

关键词： wireless sensor networks reliable communication energy efficient optimal transmitting power adaptive link control

来源：评论

学校读者我要写书评

暂无评论

Methods for Reliability Assessment under Irregular Time-Varying-Stress Degradation Testing

引用

Journal of Donghua University(English Edition) 2014年第6期31卷 793-795页

作者：刘天宇孙权潘正强冯静 College of Information System and Management National University of Defense Technology State Key Laboratory of High Performance Computing National University of Defense Technology

Degradation tests are often used to assess the reliability of products with long failure-time or few test units. Much of the previous work on reliability assessment methods has focused on constant-stress degradation test( CSDT) and accelerated degradation test( ADT), mainly under the constant, step or progressive stresses. However,in actual testing environments,some stresses are difficult to control and vary with time irregularly,which are quite different from the three stresses mentioned above. In this paper a new approach was presented for reliability assessment with degradation data under irregular time-varying-stress( ITVS).Firstly,the conventional degradation path modeling method was improved by taking into account the influences of the variable stress on the degradation variable. Then,an example was conducted to show the effectiveness of our improved model.

关键词： reliability assessment irregular time-varying-stress(ITVS) degradation test degradation path modeling

来源：评论

学校读者我要写书评

暂无评论

STMGT: A Long-Term Traffic Forecasting Method Based on Spatial-Temporal Multi-View Graph Transformer 24

STMGT: A Long-Term Traffic Forecasting Method Based on Spati...

引用

5th International Conference on Artificial Intelligence and Computer Engineering, ICAICE 2024

作者： Zheng, Fengkai The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9798400718007

Accurate long-term traffic forecasting is crucial for urban traffic management and planning. Existing methods focus mainly on short-term predictions and struggle with long-term spatial-temporal dependencies due to computational complexities. We propose a Spatial-Temporal Multi-View Graph Transformer (STMGT) based on spatial-temporal sequence decomposition. STMGT enhances long-term forecasting by decomposing traffic sequences into temporal position embeddings, periodicity-trend features, and residual components. This approach captures long-term correlations while managing computational cost by dividing data into multiple time blocks. A multi-head graph attention mechanism is used to explore dynamic spatial correlations. Experimental results on real-world datasets show that STMGT significantly outperforms baseline models, proving it effective for long-term traffic prediction. © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： graph attention mechanism

来源：评论

学校读者我要写书评

暂无评论

Edge-weight-Based link prediction in heterogeneous graph 19

Edge-weight-Based link prediction in heterogeneous graph

引用

19th IEEE International Conference on Networking, Sensing and Control, ICNSC 2022

作者： Zong, Jie Ding, Zhijun The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9781665472432

Link prediction is to predict whether there is a link between two nodes in the graph, it is a very important application and plays a great role in various industries. In recent years, with the development of graph neural network technology, many algorithms make effort to study the expression of each node from the original graph data and use them to infer new links. However, most of the existing algorithms have a common problem when facing heterogeneous graphs, which is, they do not consider the weight of edges in graphs. Instead, they put all their energies into computing node features. Although a few algorithms such as RGCN are trying to take the influence of different link types into account while extracting node features, these implicit feature extractions do not start from the global information, but just calculate independently for each node. In other words, in these algorithms, even the same type of links will be abstracted into different features on different nodes. This is obviously inconsistent with reality. On the same map, the feature of the same link should be relatively fixed and should not be changed just because of different positions. In addition, when the current graph neural network algorithm is applied to link prediction, the link type to be predicted must be specified in advance, which makes the algorithm extremely inflexible. In order to solve these problems, we propose an edge weight calculation algorithm that extracts the edge feature from the whole graph. We also propose the edge-weight-based link prediction algorithm. By introducing edge weight into the MLP, there is no need to specify the target link type at the beginning of model training. It improves both the performance and efficiency of the link prediction model. Experiments on two datasets show that this edge-weight-based link prediction algorithm performs better than current algorithms and reaches SOTA. © 2022 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive Random Forest with Dynamic Detectors for Evolving Data Stream Classification 23

Adaptive Random Forest with Dynamic Detectors for Evolving D...

引用

9th International Conference on computing and Artificial Intelligence, ICCAI 2023

作者： Jin, Xuancheng Zhang, Yaying Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9781450399029

Evolving data streams containing concept drift breaks the assumption that data are independent and identically distributed (IID) in traditional machine learning models. A series of ensemble-based models have been adapted to data stream learning tasks due to the abilities of dynamic partially update and cooperate with drift detection methods. Adaptive Random Forests (ARF), one of the state-of-the-art in the stream setting, encounters high resource requirements in both efficiency and memory like all ensemble methods. We are committed to reducing running cost without compromising ARF’s performance. In this paper, we propose the Adaptive Random Forest with Dynamic Detectors (ARFDD) which utilizes diversity measurement to combine homogeneous detectors and split heterogeneous ones accordingly, leads to lower computing costs and thus speed up in applications. Experiments on all 8 synthetic and 4 real datasets show a great CPU-time thrift while avoiding performance degradation. © 2023 Copyright held by the owner/author(s).

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Feedback-based Coarse Time-Granularity POI Recommendation and Itinerary Planning

Feedback-based Coarse Time-Granularity POI Recommendation an...

引用

2021 China Automation Congress, CAC 2021

作者： Zong, Jie Ding, Zhijun The Key Laboratory of Embedded System and Service Computing Ministry of Education TONGJI University Shanghai China

ISBN: (纸本)9781665426473

For tourists, planning their own travel itinerary to a strange city is really challenging. Although there are many researches on Point of Interests (POIs) recommendation and itinerary planning, two problems occur in currently proposed recommendation algorithms. First, the time granularity of the algorithms is too fine. POI recommendation should be considered within a more coarse-grained time factor. For example, a visitor wouldn't like to visit a water park in winter, although he appears to love such places. However, seldom researches have taken this into consideration. Second, most of the algorithms build their models based on the tourists' trajectory, which means, they did not consider users' feedback. In fact, quite a number of tourists do not like their travel experience and give negative feedbacks after their visits. In this situation, we shouldn't recommend similar POIs to this user because he may not like such kind of scenic spots at all. To address these two problems, this paper proposes an algorithm called Feedback-based Coarse Time-Granularity POI Recommendation, which can extract information from comments and distinguish tourists' attitudes towards the POIs they have visited. At the same time, the coarse-grained time factor is considered while making recommendations. In addition, an itinerary planning algorithm is proposed. Experiments show that our algorithm can reach SOTA. © 2021 IEEE

关键词： Parks

来源：评论

学校读者我要写书评

暂无评论

Research on Behavior Element Decision of Cloud Edge Collaboration Capability Based on 5g Automatic Driving Scene 5

Research on Behavior Element Decision of Cloud Edge Collabor...

引用

5th IEEE Information technology, Networking, Electronic and Automation Control Conference, ITNEC 2021

作者： Yan, Chungang Sheng, Shuo Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9781665415989

In order to meet the cloud side requirements of various traffic business scenarios, the construction of traffic cloud side collaboration platform realizes the collaboration and unification of various business resources and data on both sides of the cloud side, and the cloud side integration realizes the real-time and efficient "vehicle road cloud side"collaboration of traffic. In order to quickly meet the needs of various scenarios and provide customized cloud edge capability services, by drawing on the experience and technology R D capabilities of Companies in the industry, it helps to shorten the overall development period of the platform, reduce costs and technical risks, and quickly form product capabilities. Based on the cloud edge collaboration capability, the super edge node collects structured and unstructured data in real time, uses the edge computing power to label, filter and design thresholds, so as to detect and filter the scene behavior elements in 5g + traffic scenarios, further clarify the actor's data, gather it to the cloud for research and judgment, and improve the global decision-making ability of the cloud, Improve the real-time flow of dynamic traffic element resources. © 2021 IEEE.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

SFedXL: Semi-Synchronous Federated Learning With Cross-Sharpness and Layer-Freezing

引用

IEEE Internet of Things Journal 2025年

作者： Zhao, Mingxiong Zhao, Shihao Feng, Chenyuan Yang, Howard H. Niyato, Dusit Quek, Tony Q. S. Yunnan University National Pilot School of Software Kunming650500 China Ministry of Education Engineering Research Center of Integration and Application of Digital Learning Technology Beijing100039 China Ministry of Education Engineering Research Center of Cyberspace Kunming650504 China Yunnan University of Finance and Economics Yunnan Key Laboratory of Service Computing Kunming650221 China EURECOM Sophia Antipolis06410 France Zhejiang University University of Illinois Urbana-Champaign Institute Zhejiang University Haining314400 China Nanyang Technological University School of Computer Science and Engineering 639798 Singapore Singapore University of Technology and Design Information Systems Technology and Design Pillar 487372 Singapore

Federated learning (FL) emerges as a potential solution for enabling multiple terminal devices to collaboratively accomplish computational tasks within an Unmanned Aerial Vehicle (UAV) swarm. However, traditional FL approaches, predicated on synchronous data aggregation, are not feasible for a UAV swarm owing to the inherently variable and dynamic nature of their communication networks compared with terrestrial systems. Furthermore, the data procured by UAVs is often highly heterogeneous, attributable to disparities in deployment environments and device attributes. Considering the distinct flight paths and unique operational conditions encountered by different UAVs, a considerable amount of data remains unlabeled. To tackle the challenges associated with asynchronous operations and the prevalence of unlabeled data, we introduce a novel framework termed Semi-synchronous FL with Cross-Sharpness and Layer-Freezing (SFedXL), tailored for a UAV swarm. In particular, we devise a cross-sharpness model training strategy aimed at optimizing the utilization of both labeled and unlabeled datasets. Additionally, we propose an innovative semi-synchronous model aggregation protocol, complemented by client-specific layer-freezing and client cluster scheduling, designed to expedite the training process. Our simulation results indicate that the proposed algorithm surpasses current FL methods in terms of object recognition accuracy and communication efficiency, albeit with a trade-off of increased local computation latency. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

智能隐蔽通信——最新进展与未来研究趋势（英文）

引用

Engineering 2025年第1期 101-111页

作者：李赞石嘉司江勃吕璐关磊郝本建铁壮壮王丹洋邢成文 Tony Q.S.Quek State Key Laboratory of Integrated Service Networks School of Telecommunications Engineering Xidian University School of Information and Electronics Beijing Institute of Technology Information System Technology and Design Pillar Singapore University of Technology and Design

With the future substantial increase in coverage and network heterogeneity, emerging networks will encounter unprecedented security threats. Covert communication is considered a potential enhanced security and privacy solution for safeguarding future wireless networks, as it can enable monitors to detect the transmitter's transmission behavior with a low probability, thereby ensuring the secure transmission of private information. Due to its favorable security, it is foreseeable that covert communication will be widely used in various wireless communication settings such as medical, financial, and military scenarios. However, existing covert communication methods still present many challenges toward practical applications. In particular, it is difficult to guarantee the effectiveness of covert schemes based on the randomness of eavesdropping environments, and it is challenging for legitimate users to detect weak covert signals. Considering that emerging artificial-intelligence-aided transmission technologies can open up entirely new opportunities to address the above challenges, we provide a comprehensive review of recent advances and potential research directions in the field of intelligent covert communications in this work. First, the basic concepts and performance metrics of covert communications are introduced. Then, existing effective covert communication techniques in the time, frequency, spatial, power, and modulation domains are reviewed. Finally, this paper discusses potential implementations and challenges for intelligent covert communications in future networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：