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

第35届中国控制会议

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

ISBN: (纸本)9789881563910

In this paper, we investigate the cluster synchronization problem with unbounded time-varying delays for complex networks by adding some external controllers. Previous related works mainly focused on bounded time-varying or constant time delays, which may not be consistent with the real world. Therefore, unbounded time-varying delays is considered in this paper,which can be regarded as the main difference between this paper and previous related works. We discuss the necessary condition for cluster synchronization with external controllers, which can be used to guide the design of external controllers. Then, by using the Lyapunov function method, we prove that cluster synchronization could be achieved under some sufficient ***, the effects of time delays for the convergence of cluster synchronization are also discussed, which are named as theμ-cluster synchronization. Finally, numerical simulations are presented to show the validity of the obtained criteria.

关键词： Cluster Synchronization Complex Networks Unbounded Delay

来源：评论

学校读者我要写书评

暂无评论

Finite-Time Synchronization of Nonlinearly Coupled systems With Delay 35

Finite-Time Synchronization of Nonlinearly Coupled Systems W...

引用

第35届中国控制会议

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

ISBN: (纸本)9789881563910

In this paper, we consider a general and practical complex network model, in which there exist couplings with and without time delays, and the coupled functions among nodes are also nonlinear. For this network model, we investigate its finite-time synchronization by designing some general static and adaptive controllers respectively. Using the finite-time stability theory, some useful finite-time synchronization criteria are derived. Finally, numerical simulations are given to demonstrate the correctness of our theoretical results.

关键词： Synchronization Finite-time Nonlinear Coupling Time Delay

来源：评论

学校读者我要写书评

暂无评论

Macro liveness graph and liveness of ω-independent unbounded nets

引用

Science China(Information Sciences) 2015年第3期58卷 132-141页

作者： WANG ShouGuang GAN MengDi ZHOU MengChu School of Information and Electronic Engineering Zhejiang Gongshang University Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University Department of Electrical and Computer Engineering New Jersey Institute of Technology

Liveness is a basic property of a system and the liveness issue of unbounded Petri nets remains one of the most difficult problems in this *** work proposes a novel method to decide the liveness of a class of unbounded generalized Petri nets calledω-independent unbounded nets,breaking the existing limits to one-place-unbounded *** algorithm to construct a macro liveness graph(MLG)is developed and a critical condition based on MLG deciding the liveness ofω-independent unbounded nets is *** are provided to demonstrate its effectiveness.

关键词： discrete event system(DES) Petri nets complex systems liveness property analysis

来源：评论

学校读者我要写书评

暂无评论

Synchronization of nonlinearly coupled complex networks under periodically intermittent pinning control

Synchronization of nonlinearly coupled complex networks unde...

引用

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

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

ISBN: (纸本)9781467355339

In this paper, we investigate the synchronization problem for nonlinearly coupled networks under periodically intermittent pinning control, where the coupling matrix denoting network topology is assumed to be symmetric. A sufficient condition to guarantee global synchronization is presented. Moreover, a centralized adaptive intermittent control is designed and its validity is rigorously proved. Finally, some numerical examples are presented to demonstrate the correctness of obtained theoretical results.

关键词： Synchronization, Consensus, Complex networks, Nonlinearly coupled, Periodically, Intermittent pinning, Adaptive control.

来源：评论

学校读者我要写书评

暂无评论

Cluster synchronization of nonlinearly coupled networks via periodically intermittent pinning control

Cluster synchronization of nonlinearly coupled networks via ...

引用

第三十二届中国控制会议

作者： LIU Xiwei CHENG Jiujun Department of Computer Science and Technology Tongji Universityand the Key Laboratory of Embedded System and Service ComputingMinistry of Education

ISBN: (纸本)9781479900305

In this paper,the cluster synchronization problem for nonlinearly coupled networks under periodically intermittent pinning control is *** first,a sufficient condition to guarantee cluster synchronization is ***,an adaptive intermittent control algorithm is designed to the control strength and its validity is rigorously ***,some numerical examples are presented to demonstrate the correctness of obtained theoretical results.

关键词： Cluster synchronization Adaptive Nonlinearly coupled Periodically Intermittent pinning.

来源：评论

学校读者我要写书评

暂无评论

Transactional and QoS-aware selection algorithm for reliable Web service composition

引用

Journal of Computational Information systems 2012年第11期8卷 4633-4640页

作者： Shen, Hongjie Ding, Zhijun Wang, Pengwei Chen, Hongzhong Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 China

At present, most of the work has focused on Web services composition from the QoS side, little work being done on investigating how to implement service selection based on transactional and QoS requirements. In complicated network environment, composite services need transactional support for correct and reliable execution. Therefore, How to design a composite service to ensure not only correct and reliable execution but also optimal QoS is a challenging issue. This paper addresses the problem of selecting services by aggregating the transactional and QoS requirements. First, we presented global optimization selection algorithms based on two selection models of composite service with transactional requirements. Then, a heuristic selection algorithm is presented to select an approximately optimal transactional composite service within a reasonable time. Lastly, experiments are conducted to analyze the performance of our proposed algorithms. © 2012 Binary Information Press.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

A transactional-behavior-based hierarchical gated network for credit card fraud detection

引用

IEEE/CAA Journal of Automatica Sinica 2025年

作者： Xie, Yu Zhou, MengChu Liu, Guanjun Wei, Lifei Zhu, Honghao De Meo, Pasquale College of Information Engineering Shanghai Maritime University Shanghai201306 China School of Information and Electronic Engineering Zhejiang Gongshang University Hangzhou310018 China Helen and John C. Hartmann Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102 United States Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Computer Science Tongji University Shanghai201804 China College of Computer Science and Information Engineering Bengbu University Bengbu233030 China Department of Ancient and Modern Civilizations University of Messina Messina98166 Italy

The task of detecting fraud in credit card transactions is crucial to ensure the security and stability of a financial system, as well as to enforce customer confidence in digital payment systems. Historically, credit card companies have used rule-based approaches to detect fraudulent transactions, but these have proven inadequate due to the complexity of fraud strategies and have been replaced by much more powerful solutions based on machine learning or deep learning algorithms. Despite significant progress, the current approaches to fraud detection suffer from a number of limitations: for example, it is unclear whether some transaction features are more effective than others in discriminating fraudulent transactions, and they often neglect possible correlations among transactions, even though they could reveal illicit behaviour. In this paper, we propose a novel credit card fraud detection (CCFD) method based on a transaction behaviour-based hierarchical gated network. First, we introduce a feature-oriented extraction module capable of identifying key features from original transactions, and such analysis is effective in revealing the behavioural characteristics of fraudsters. Second, we design a transaction-oriented extraction module capable of capturing the correlation between users' historical and current transactional behaviour. Such information is crucial for revealing users' sequential behaviour patterns. Our approach, called transactional-behaviour-based hierarchical gated network model (TbHGN), extracts two types of new transactional features, which are then combined in a feature interaction module to learn the final transactional representations used for CCFD. We have conducted extensive experiments on a real-world credit card transaction dataset with an increase in average F1 between 1.42% and 6.53% and an improvement in average AUC between 0.63% and 2.78% over the state of the art. © 2025 Institute of Electrical and Electronics Engineers Inc.. All right

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

CONSISTENT REPRESENTATION LEARNING ACROSS MODALITIES FOR ZERO-SHOT IMAGE RECOGNITION

CONSISTENT REPRESENTATION LEARNING ACROSS MODALITIES FOR ZER...

引用

2021 IEEE International Conference on Multimedia and Expo, ICME 2021

作者： Wang, Yu Zhao, Sev-Jue Key Laboratory of Embedded System and Service Computing Ministry of Education China HaiBa Technology China

ISBN: (纸本)9781665438643

Zero-shot learning (ZSL) recently has drawn widespread attention due to the demand for scalability of object recognition in real scenes. Existing approaches typically focus on directly learning various mapping functions from the visual space to the semantic space or vice versa. However, these methods fail to explicitly capture consistent representations reflecting the nature of different modalities of the same object, which results in the deterioration of the domain shift problem in the ZSL context during the testing stage. To this end, a consistent representation learning mechanism across visual modalities and the associated semantic modalities based on common subspace learning is proposed in this paper. We further impose an orthogonal constraint on the subspace for informative representations, as well as 21-norm regularization terms on projection matrices for automatic feature selection. Finally, an iterative process based on the ALM algorithm with an alternating direction strategy is displayed to resolve the proposed formulation. Extensive experimental results on four popular datasets demonstrate that our algorithm is promising. © 2021 IEEE

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：