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

Research on road topology based mobility prediction schemes

High Technology Letters 2007年第2期13卷 140-144页

作者：陈林 Chen Hongzhong Jiang Changjun Key Lab of Embedded System and Service Computing of the Ministry of Education Department of Computer Science and Technology Tongji University Shanghai 201804 P.R.China

Geographic routing has been introduced in mobile ad hoc networks and sensor networks. But its per-formance suffers greatly from mobility-induced location errors that can cause Lost Link （LLNK） and LOOP problems. Thus various mobility prediction algorithms have been proposed to mitigate the errors, but sometimes their prediction errors are substantial. A novel mobility prediction technique that incorpo-rates both mobile positioning information and road topology knowledge was presented. Furthermore, the performance of the scheme was evaluated via simulations, along with two other schemes, namely, Linear Velocity Prediction （LVP） and Weighted Velocity Prediction （WVP） for comparison purpose. The results of simulation under Manhattan mobility model show that the proposed scheme could track the movement of a node well and hence provide noticeable improvement over LVP and MVP.

关键词： geographic muting mobility prediction road topology shortest path Manhattan mo-bility model

来源：评论

学校读者我要写书评

暂无评论

A service selection method based on web service clusters

引用

Journal of Applied Sciences 2013年第24期13卷 5734-5738页

作者： Liu, Wei Du, Yu-Yue Yan, Chun College of Information Science and Engineering Shandong University of Science and Technology 266590 Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University 200092 Shanghai China

service selection is an essential issue in service discovery based on Web service clusters. The ratio of trust value to price is introduced to select the most suitable service in a cluster. The method of computing the initial trust, the direct trust and the recommendation trust are, respectively presented and the overall trust is derived based on them. The proposed method keeps the balance between the price and service quality. © 2013 Asian Network for Scientific Information.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Adaptive social network construction using Gaussian mixture model

引用

Information Technology Journal 2011年第12期10卷 2252-2259页

作者： Guo, Xin Xiang, Yang Chen, Qian Wei, Wei Department of Computer Science and Technology School of Electronic and Information Engineering Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

A Social network graph shows social interactions and relationships between individuals in a specific social environment, which is very helpful for analyzing social relationships, activities, structures, etc. The author quantized the strengths of social objects' relationships in social environment using an improved vector space model. Gaussian mixture model was employed to set the threshold for identifying social relationships adaptively and divide social subgroups automatically. According to the threshold, social network graph would be constructed based on performance measures. It is concluded that hidden social relationships can be discovered effectively by using this approach which is very flexible and adaptive for dynamic information feedback mechanism. © 2011 Asian Network for Scientific Information.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Flow Holistic Interaction Graph Convolution Network for Bidirectional Traffic Flow Forecasting

Spatial-Temporal Flow Holistic Interaction Graph Convolution...

引用

2023 IEEE International Conference on Big Data, BigData 2023

作者： Zhang, Canyang Zheng, Qi Zhang, Yaying Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Shanghai Artificial Intelligence Laboratory Shanghai China

ISBN: (纸本)9798350324457

Traffic flow forecasting is indispensable in modern urban life. Considering the complexity, variability and strong timeliness of traffic flow, traffic flow forecasting is a worth exploring but challenging research field. To achieve better traffic flow forecasting effect, we focus on two critical aspects that assume noteworthy importance: i) the features inside the traffic outflows and inflows. ii) the supplementary information regarding exterior region which is the area outside the grid division regions. To address these challenges, we propose a novel deep learning model Spatial-Temporal Flow Holistic Interaction Graph Convolution Network (STHGCN). In STHGCN, graph convolution based modules are applied through multi-step simulation. An exterior region feature estimation module is designed to estimate the influence of the special exterior region through the characteristics of complete trajectories, which enables a more comprehensive reasoning for traffic flow forecasting in grid division regions. Furthermore, a flow feature fusion integrator and stackable convolution modules are proposed to aggregate the intermediate features extracted from various perspectives, which simulate the constantly-updating and interlinked states of traffic flows through the process of multi-layer feature separation and fusion. We conduct extensive experiments on real-world traffic datasets and our proposed model outperforms all baselines. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Probabilistic bootstrap-based evolutionary algorithm for three-objective wind farm turbine position optimization

引用

Swarm and Evolutionary Computation 2025年 96卷

作者： Chen Zhang Haotian Li Xiuxian Li Jiujun Cheng Zhenyu Lei Shangce Gao Faculty of Engineering University of Toyama Toyama-shi 930-8555 Japan College of Electronics and Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China Ministry of Education Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Amid the worsening energy crisis, wind farm layout optimization (WFLO) to increase power generation, reduce costs, and mitigate potential environmental impacts is of great significance. This paper formulates three-objective wind farm layout optimization (TWFLO) which is rarely considered, aiming to effectively utilize existing information to optimize power output, land usage, and costs. We propose a new algorithm (MOEA/D-P) based on probability distributions to guide turbine placement and improve the performance of a Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D). This algorithm addresses the issue of neglecting valuable information during layout optimization. Additionally, we make improvements to the traditional land-use function to avoid situations where non-convex layouts result in an area calculation of zero. The MOEA/D-P is tested on six different initial layouts and compared with five algorithms under two wind conditions. Results are evaluated using inverted generational distance, hypervolume, and scatter plot distributions. The impact of initial probability distribution on algorithm performance is discussed under four simple wind conditions. The results show that MOEA/D-P outperforms the other five algorithms in terms of performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Novel Mutual Information based Ant Colony Classifier 5

A Novel Mutual Information based Ant Colony Classifier

引用

2017 International Conference on Progress in Informatics and computing(PIC)

作者： Hang Yu Xiaoxiao Qian Yang Yu Jiujun Cheng Ying Yu Shangce Gao College of Computer Science and Technology Taizhou University Faculty of Engineering University of Toyama Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University

ISBN: (纸本)9781538619797;9781538619780

By constructing a list of IF-THEN rules, the traditional ant colony optimization(ACO) has been successfully applied on data classification with not only a promising accuracy but also a user comprehensibility. However, as the collected data to be classified usually contain large volumes and redundant features, it is challenging to further improve the classification accuracy and meanwhile reduce the computational time for *** paper proposes a novel hybrid mutual information based ant colony algorithm(mrAM+) for classification. First, a maximum relevance minimum redundancy feature selection method is used to select the most informative and discriminative attributes in a dataset. Then, we use the enhanced ACO classifier(i.e., AM+)to perform the classification. Experimental results show that the proposed mrAM+ outperforms other seven state-of-art related classification algorithms in terms of accuracy and the size of model.

关键词： ant colony optimization mutual information classification data mining feature selection

来源：评论

学校读者我要写书评

暂无评论

Performance analysis for large scale parallel microscopic traffic simulation system

Performance analysis for large scale parallel microscopic tr...

引用

International Symposium on Advances in Computer and Sensor Networks and systems, 2008

作者： Fei, Yin Dongliang, Zhang Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai 201804 China

ISBN: (纸本)9781427629807

In this paper, we present the parallel implementation of the traffic microsimulation PMTS (Parallel Microscopic Traffic Simulation) focusing on the performance issues. The parallelization of PMTS is domain decomposition, which means that each processor of the PC cluster is responsible for a different geographical area of the simulation region. We describe the transportation network graph partition and information exchange between domains. We demonstrate the time cost mathematics models for PMTS: the vehicle generation, vehicle position calculation, and vehicle information exchange between domains. The workload balance is obtained by adjusting the boundary lines according to the relative load of adjacent subnetworks. All these works have been proved to be effective when PMTS put into use and the experiment results are also provided which match our analysis.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Upper Bounds on Lifetime of Three Dimensional Extended UWB Sensor Networks

引用

电子学报(英文版) 2010年第2期19卷 307-312页

作者： XU Juan JIANG Changjun GUO Aihuang HONG Yongfa LI Shu WANG Cheng 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 THIR UWB sensor networks aren't prone to be employed in large-scale network.

关键词：无线传感器网络三维扩展寿命延长超宽带上界静态网络生存时间移动节点

来源：评论

学校读者我要写书评

暂无评论

Non-intrusive load disaggregation using semi-supervised learning method

Non-intrusive load disaggregation using semi-supervised lear...

引用

2019 International Conference on Security, Pattern Analysis, and Cybernetics, SPAC 2019

作者： Miao, Nan Zhao, Shengjie Shi, Qingjiang Zhang, Rongqing Tongji University Key Laboratory of Embedded System and Service Computing of Ministry of Education Shanghai China Tongji University Sch. of Software Eng. the Key Lab. of Embedded System and Service Computing of Ministry of Education Shanghai China Tongji University School of Software Engineering Shanghai China

ISBN: (纸本)9781728159287

With the emerging of smart metering around the world, there is a growing demand to analyse the residential energy usage. In this paper, we propose a Deep Neural Network (DNN)-based approach for non-intrusive load monitoring (NILM), which can achieve effective and efficient estimation of individual appliance usage according to a single main meter reading in a non-intrusive manner. Considering practical situations, two training methods are provided. The first training approach is fully supervised learning, which requires a ground truth of label, indicating the state of the appliance (ON/OFF), to build a prediction model. The second training approach is semi-supervised learning, leading to better performance by F-Measure metric while only requiring some more unlabelled training data. Experimental results on the low-sample rate REDD dataset demonstrate the superior performance of our proposed DNN-based method compared with Hidden Markov Model (HMM)based and Graph Signal Processing (GSP)-based approaches. © 2019 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Extended and improved slicing technologies for Petri nets

引用

High Technology Letters 2013年第1期19卷 98-104页

作者： Yu, Wangyang Yan, Chungang Ding, Zhijun Fang, Xianwen Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Lab. of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

Petri net is an important tool to model and analyze concurrent systems, but Petri net models are frequently large and complex, and difficult to understand and modify. Slicing is a technique to remove unnecessary parts with respect to a criterion for analyzing programs, and has been widely used in specification level for model reduction, but researches on slicing of Petri nets are still limited. According to the idea of program slicing, this paper extends slicing technologies of Petri nets to four kinds of slices, including backward static slice, backward dynamic slice, forward static slice and forward dynamic slice. Based on the structure properties, the algorithms of obtaining two kinds of static slice are constructed. Then, a new method of slicing backward dynamic slice is proposed based on local reachability graph which can locally reflect the dynamic properties of Petri nets. At last, forward dynamic slice can be obtained through the reachability marking graph under a special marking. The algorithms can be used to reduce the size of Petri net, which can provide the basic technical support for simplifying the complexity of formal verification and analysis. © by HIGH TECHNOLOGY LETTERS PRESS.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：