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

A Biometric-Based User Authentication for Wireless Sensor Networks

Wuhan University Journal of Natural Sciences 2010年第3期15卷 272-276页

作者： YUAN Jianjun JIANG Changjun JIANG Zuowen School of Electronics and Information Engineering Tongji University / Key Laboratory of Embedded System and Service Computing of Ministry of Education Shanghai 201804 China

This paper proposes a biometric-based user authentication protocol for wireless sensor networks （WSN） when a user wants to access data from sensor nodes, since WSN are often deployed in an unattended environment. The protocol employs biometric keys and resists the threats of stolen verifier, of which many are logged-in users with the same login identity, guessing, replay, and impersonation. The protocol uses only Hash function and saves the computational cost, the communication cost, and the energy cost. In addition, the user＇s password can be changed freely using the proposed protocol.

关键词： authentication biometrics security wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Automatic Web services composition algorithm based on optimal matching

引用

Journal of Central South University 2011年第4期18卷 1169-1177页

作者：王俊丽丁志军侯玉兵 Engineering Research Center for Enterprise Digital Technology Ministry of EducationTongji University Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University Shanghai Branch China Information Technology Designing and Consulting Institute

A novel layered method was proposed to solve the problem of Web services *** this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the ***,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition *** effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also *** experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.

关键词： Web services services composition optimal matching hypergraph theory

来源：评论

学校读者我要写书评

暂无评论

On complementary effect of blended behavioral analysis for identity theft detection in mobile social networks 1

引用

13th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2017

作者： Wang, Cheng Luo, Jing Yang, Bo Jiang, Changjun Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Computer Science and Technology Tongji University Shanghai China

ISBN: (数字)9789811088902

ISBN: (纸本)9789811088896

User behavioral analysis is expected to act as a promising technique for identity theft detection in the Internet. The performance of this paradigm extremely depends on a good individual-level user behavioral model. Such a good model for a specific behavior is often hard to obtain due to the insufficiency of data for this behavior. The insufficiency of specific data is mainly led by the prevalent sparsity of users’ collectable behavioral footprints. This work aims to address whether it is feasible to effectively detect identify thefts by jointly using multiple unreliable behavioral models from sparse individual-level records. We focus on this issue in mobile social networks (MSNs) with multiple dimensions of collectable but sparse data of user behavior, i.e., making check-ins, posing tips and forming friendships. Based on these sparse data, we build user spatial distribution model, user post interest model and user social preference model, respectively. Here, as the arguments, we validate that there is indeed a complementary effect in multi-dimensional blended behavioral analysis for identity theft detection in MSNs. © Springer Nature Singapore Pte Ltd. 2018.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Learning how to avoiding obstacles for end-to-end driving with conditional imitation learning 2

Learning how to avoiding obstacles for end-to-end driving wi...

引用

2nd International Conference on Signal Processing and Machine Learning, SPML 2019

作者： Zhang, Enwei Zhou, Hongtu Ding, Yongchao Zhao, Junqiao Ye, Chen Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University School of Electronics and Information Engineering Shanghai China

ISBN: (纸本)9781450372213

Obstacle avoiding is one of the most complex tasks for autonomous driving systems, which was also ignored by many cutting-edge end-to-end learning-based methods. The difficulties stem from the integrated process of detection and interpretation of environment and obstacles and generation of proper behaviors. We make the use of CARLA, a simulator for autonomous driving research, and collect massive human drivers' reactions to obstacles on road subjecting to given driving commands, i.e. follow, go straight, turn left and turn right for about 6 hours. A behavior-Cloning neural network architecture is proposed with the modified loss that enlarge the effects of errors for steer, which indicates the benefit to high an accuracy. We found the data augmentation of the image is crucial to the training of the proposed network. And a reasonable limit allows avoiding unexpected stop. The experiments demonstrate 3 obstacle avoidance cases: for the same type as the training dataset, other automobile and two-wheeled vehicles. Finally, the CARLA benchmark is also tested. © 2019 Association for computing Machinery.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

Multi‐granularity re‐ranking for visible‐infrared person re‐identification

引用

CAAI Transactions on Intelligence Technology 2023年第3期8卷 770-779页

作者： Yadi Wang Hongyun Zhang Duoqian Miao Witold Pedrycz Department of Computer Science and Technology Tongji UniversityShanghaiChina Key Laboratory of Embedded System and Service Computing Ministry of EducationShanghaiChina Department of Electrical and Computer Engineering University of AlbertaEdmontonAlbertaCanada System Research Institute Polish Academy of SciencesWarsawPoland

Visible‐infrared person re‐identification(VI‐ReID)is a supplementary task of single‐modality re‐identification,which makes up for the defect of conventional re‐identification under insufficient *** is more challenging than single‐modality ReID because,in addition to difficulties in pedestrian posture,camera shoot-ing angle and background change,there are also difficulties in the cross‐modality *** works only involve coarse‐grained global features in the re‐ranking calculation,which cannot effectively use fine‐grained ***,fine‐grained features are particularly important due to the lack of information in cross‐modality re‐*** this end,the Q‐center Multi‐granularity K‐reciprocal Re‐ranking Algorithm(termed QCMR)is proposed,including a Q‐nearest neighbour centre encoder(termed QNC)and a Multi‐granularity K‐reciprocal Encoder(termed MGK)for a more comprehensive feature *** converts the probe‐corresponding modality features into gallery corresponding modality features through modality transfer to narrow the modality *** takes a coarse‐grained mutual nearest neighbour as the dominant and combines a fine‐grained nearest neighbour as a supplement for similarity *** experiments on two widely used VI‐ReID benchmarks,SYSU‐MM01 and RegDB have shown that our method achieves state‐of‐the‐art ***,the mAP of SYSU‐MM01 is increased by 5.9%in all‐search mode.

关键词： computer vision recognition

来源：评论

学校读者我要写书评

暂无评论

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

引用

Swarm and Evolutionary Computation 2025年 96卷

作者： Zhang, Chen Li, Haotian Li, Xiuxian Cheng, Jiujun Lei, Zhenyu Gao, Shangce 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. © 2025 Elsevier B.V.

关键词： Distribution functions

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Dynamic Graph Diffusion Convolutional Network for Traffic Flow Forecasting

Spatial-Temporal Dynamic Graph Diffusion Convolutional Netwo...

引用

2023 IEEE International Conference on Big Data, BigData 2023

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

ISBN: (纸本)9798350324457

Traffic forecasting plays a crucial role in intelligent transportation systems and finds application in various domains. Accurate traffic forecasting remains challenging due to the time-varying correlations within the data and the heterogeneous correlations between regions. Although various dynamic spatial-temporal graph models have been proposed to address these challenges in recent years, most of them are burdened by high computation costs and not intuitive to understand. In this paper, we propose a spatial-temporal graph model, Spatial-Temporal Dynamic Graph Diffusion Convolutional Network (SDGDN) that provides an effective and efficient approach to traffic forecasting. From the perspective of traffic flow transition probabilities, SDGDN learns dynamic graph structures to capture the time-varying traffic transition relationships. Besides dynamic graph structures, static node features are employed in diffusion convolution to better capture heterogeneous regional features. Furthermore, we utilize temporal encoding and also generate varying graphs in each stacked layer to enhance the forecasting performance. Experiments results on five real-world datasets demonstrate that SDGDN outperforms most baseline models in terms of both performance and computation efficiency. © 2023 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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.

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：