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

21st International Conference on Networking, Sensing and Control, ICNSC 2024

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

ISBN: (纸本)9798350365221

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. © 2024 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

Finite time anti-synchronization of complex-valued neural networks with bounded asynchronous time-varying delays

arXiv

引用

arXiv 2019年

作者： Liu, Xiwei Li, Zihan Department of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

In this paper, we studied the finite time anti-synchronization of master-slave coupled complex-valued neural networks (CVNNs) with bounded asynchronous time-varying delays. With the decomposing technique and the generalized {ξ, ∞}-norm, several criteria for ensuring the finite-time anti-synchronization are obtained. The whole anti-synchronization process can be divided into two parts: first, the norm of each error state component will change from initial values to 1 in finite time, then from 1 to 0 in fixed time. Therefore, the whole time is finite. Finally, one typical numerical example is presented to demonstrate the correctness of our obtained results. key words: Anti-synchronization, asynchronous, complex-valued neural network, finite time, time-varying delay Copyright © 2019, The Authors. All rights reserved.

关键词： Time varying control systems

来源：评论

学校读者我要写书评

暂无评论

Prescribed-Time Synchronization of Multiweighted and Directed Complex Networks

arXiv

引用

arXiv 2022年

作者： Xu, Linlong Liu, Xiwei Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

In this note, we study the prescribed-time (PT) synchronization of multiweighted and directed complex networks (MWDCNs) via pinning control. Unlike finite-time and fixed-time synchronization, the time for synchronization can be preset as needed, which is independent of initial values and parameters like coupling strength. First and foremost, we reveal the essence of PT stability by improper integral, L'Hospital rule and Taylor expansion theory. Many controllers established previously for PT stability can be included in our new model. Then, we apply this new result on MWDCNs as an application. The synchronization error at the prescribed time is discussed carefully, so, PT synchronization can be reached. The network topology can be directed and disconnected, which means that the outer coupling matrices (OCMs) can be asymmetric and not connected. The relationships between nodes are allowed to be cooperative or competitive, so elements in OCMs and inner coupling matrices (ICMs) can be positive or negative. We use the rearranging variables' order technique to combine ICMs and OCMs together to get the sum matrices, which can make a bridge between multiweighted and single-weighted networks. Finally, simulations are presented to illustrate the effectiveness of our theory. Copyright © 2022, The Authors. All rights reserved.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Global µ-stability and finite-time control of octonion-valued neural networks with unbounded delays✡

arXiv

引用

arXiv 2020年

作者： Wang, Jingzhu Liu, Xiwei Department of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

Octonion-valued neural networks (OVNNs) are a type of neural networks for which the states and weights are octonions. In this paper, the global µ-stability and finite-time stability problems for octonion-valued neural networks are considered under unbounded and asynchronous time-varying delays. To avoid the non-communicative and non-associative multiplication feature of the octonions, we firstly decompose the OVNNs into eight real-valued neural networks (RVNNs) equivalently. Through the use of generalized norm and the Cauchy convergence principle, we obtain the sufficient criteria which assure the existence, uniqueness of the equilibrium point and global µ-stability of OVNNs. By adding controllers, the criteria to ensure the finite-time stability for OVNNs are presented by dividing the analysis of finite-time stability process into two phases. Furthermore, we also prove the adaptive finite time stability theory of above networks. At last, the simulation results of specified examples is given to substantiate the effectiveness and correctness of the theoretical results. Copyright © 2020, The Authors. All rights reserved.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

An Accuracy-and-Diversity-based Ensemble Method for Concept Drift and Its application in Fraud Detection

An Accuracy-and-Diversity-based Ensemble Method for Concept ...

引用

IEEE International Conference on Data Mining Workshops (ICDM Workshops)

作者： Shujie Yin Guanjun Liu Zhenchuan Li Chungang Yan Changjun Jiang Key Laboratory of the Ministry of Education for Embedded System and Service Computing Shanghai Electronic Transactions and Information Service Collaborative Innovation Center Tongji University Shanghai China

ISBN: (数字)9781728190129

ISBN: (纸本)9781728190136

Concept Drift is one of the most challenging issues in various applications such as fraud detection, spam filtering and sensor networks, causing the performance degradation of learning algorithms which are dedicated to processing static data such as Naive Bayes, due to their poor adaptability to changes. Several techniques and algorithms have been proposed to address the concept drift problem, e.g. the ensemble methods that have already achieved great success. However, most of the ensemble methods consider either accuracy or diversity of a trained model when adapting to new concepts, and thus they can hardly deal with different types of drifts. This paper proposes a novel ensemble method that considers both accuracy and diversity. We linearly combine accuracy and diversity with different coefficients, and propose an entropy-based policy to compute these coefficients. Experiments on 10 synthetic datasets and 4 public datasets demonstrate that our method outperforms the state-of-the-art ones on dealing with different concept drifts. Our method is also applied to the electronic transaction fraud detection and achieves an excellent performance.

关键词： Degradation Adaptation models Filtering Design methodology Conferences Computational modeling Data mining

来源：评论

学校读者我要写书评

暂无评论

A Self-Learning Clustering Algorithm Based on Clustering Coefficient

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8786卷 79-94页

作者： Zhong, Mingjie Ding, Zhijun Sun, Haichun Wang, Pengwei The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai200092 China Department of Computer Science University of Pisa Pisa56127 Italy

This paper presents a novel clustering algorithm based on clustering coefficient. It includes two steps: First, k-nearest-neighbor method and correlation convergence are employed for a preliminary clustering. Then, the results are further split and merged according to intra-class and inter-class concentration degree based on clustering coefficient. The proposed method takes correlation between each other in a cluster into account, thereby improving the weakness existed in previous methods that consider only the correlation with center or core data element. Experiments show that our algorithm performs better in clustering compact data elements as well as forming some irregular shape clusters. It is more suitable for applications with little prior knowledge, e.g. hotspots discovery. © Springer International Publishing Switzerland 2014.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Image captioning with deep LSTM based on sequential residual

Image captioning with deep LSTM based on sequential residual

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Kaisheng Xu Hanli Wang Pengjie Tang Tongji University Shanghai Shanghai CN Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai CN Key Laboratory of Embedded System and Service Computing Tongji University Shanghai P. R. China Tongji University Shanghai P. R. China

ISBN: (纸本)9781509060689

Image captioning is a fundamental task which requires semantic understanding of images and the ability of generating description sentences with proper and correct structure. In consideration of the problem that language models are always shallow in modern image caption frameworks, a deep residual recurrent neural network is proposed in this work with the following two contributions. First, an easy-to-train deep stacked Long Short Term Memory (LSTM) language model is designed to learn the residual function of output distributions by adding identity mappings to multi-layer LSTMs. Second, in order to overcome the over-fitting problem caused by larger-scale parameters in deeper LSTM networks, a novel temporal Dropout method is proposed into LSTM. The experimental results on the benchmark MSCOCO and Flickr30K datasets demonstrate that the proposed model achieves the state-of-the-art performances with 101.1 in CIDEr on MSCOCO and 22.9 in B-4 on Flickr30K, respectively.

关键词： Computational modeling Feature extraction Semantics Training Logic gates Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

A parallel computing model for container terminal logistics

A parallel computing model for container terminal logistics

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Bin Li Weiming Shen School of Transportation Fujian University of Technology Fuzhou China The Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Existing planning and scheduling solutions for container terminal logistics systems (CTLS) are not sufficient today due to the highly complexity and uncertain environments. This paper reviews the advantages and shortcomings of the existing solutions and proposes a container terminal conceptual parallel computing model for scheduling and execution based on multi-processor systems. It is built on the computational architecture and fundamental principles of distributed, cooperative, parallel, heterogeneous, and reconfigurable computation in essence. The proposed approach is demonstrated and validated by investigating the stress testing, tailor-made processor affinity, load migration and load balancing of a typical container terminal logistics service case with comprehensive computational experiments.

关键词： Containers Computational modeling Processor scheduling Computer architecture Logistics Marine vehicles

来源：评论

学校读者我要写书评

暂无评论

An optimized Apriori algorithm based on sparse matrix for intrusion detection

引用

Open Cybernetics and systemics Journal 2014年第1期8卷 8-11页

作者： Zeng, Xiaohui Lv, Jingxiang Li, Jingzhong Luo, Wenlang Dept. of Computer Science and Technology Jinggangshan University Ji’an China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

The original Apriori algorithm is widely used in the intrusion detection field, but it may consume incredible computing resources in the process of handling network packets. We propose our optimized-Apriori algorithm which can greatly improves the algorithm efficiency by means of reducing the data storage space and the number of frequent item sets. We take full advantage of the characteristics of sparse matrix to save storage space and shorten the running time. The experimental results show that our optimized-Apriori algorithm can make a larger progress in saving the storage space of network data to be processed, even shortening nearly half of the data mining time in the process of intrusion detection. © Zeng et al.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets

Extracting all minimal siphons from maximal unmarked siphons...

引用

2011 7th IEEE International Conference on Automation Science and Engineering, CASE 2011

作者： Wang, ShouGuang Zhou, MengChu Wang, ChengYing College of Information and Electronic Engineering Zhejiang Gongshang University Hangzhou 310018 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102-1982 United States MoE Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 200092 China

ISBN: (纸本)9781457717307

Deadlock control is an important research issue in automated manufacturing systems that have a high degree of resource sharing and concurrency. Since minimal siphons are closely tied with deadlocks in Petri net models, their efficient extraction is fundamentally important. The existing methods can rapidly extract one minimal siphon given a maximal unmarked siphon that is obtained by using a mixed integer programming approach. This paper for the first time presents an extraction algorithm that can efficiently extract all minimal ones. The idea is based on the generation and use of a subnet tree structure given the places in a maximal unmarked siphon. Several Petri net models of automated manufacturing systems are used to illustrate the proposed concepts and methods. © 2011 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：