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

Quantized robust H-two filtering for Markovian jump linear systems over networks with nonaccessible mode information

引用

控制理论与应用（英文版） 2011年第4期9卷 505-512页

作者： Tao LIU Qijun CHEN Hao ZHANG Iko MIYAZAWA Department of Electronics and Information Engineering Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai 201804 China Department of Machine Control Technology Kanagawa Industrial Technology Center Kanagawa 243-0435 Japan

This paper is concerned with the problems of H-two filtering for discrete-time Markovian jump linear systems subject to logarithmic quantization. We assume that only the output of the system is available, and therefore the mode information is nonaccessible. In this paper, a mode-independent quantized H-two filter is designed such that filter error system is stochastically stable. To this end, sufficient conditions for the existence of an upper bound of H-two norm are presented in terms of linear matrix inequalities. Considering uncertainty of system matrices, a robust H-two filter is designed. The proposed method is also applicable to cover the case where the transition probability matrix is not exactly known but belongs to a given polytope. Finally, numerical examples are provided to demonstrate the effectiveness of the proposed approach.

关键词： Markovian jump linear systems Quantized robust H-two filter Mode independent Sector bound approach Linear matrix inequalities

来源：评论

学校读者我要写书评

暂无评论

Task allocation for maximizing reliability of distributed computing systems using honeybee mating optimization

引用

Journal of systems and Software 2010年第11期83卷 2165-2174页

作者： Kang, Qin-Ma He, Hong Song, Hui-Min Deng, Rong Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China School of Information Engineering Shandong University at Weihai 180 Wenhua Xilu Weihai 264209 China School of Mathematics and Statistics Shandong University at Weihai Weihai 264209 China

This paper deals with the problem of task allocation (i.e,;to which processor should each task of an application be assigned) in heterogeneous distributed computing systems with the goal of maximizing the system reliability. The problem of finding an optimal task allocation is known to be NP-hard in the strong sense. We propose a new swarm intelligence technique based on the honeybee mating optimization (HBMO) algorithm for this problem. The HBMO based approach combines the power of simulated annealing, genetic algorithms with a fast problem specific local search heuristic to find the best possible solution within a reasonable computation time. We study the performance of the algorithm over a wide range of parameters such as the number of tasks, the number of processors, the ratio of average communication time to average computation time, and task interaction density of applications. The effectiveness and efficiency of our algorithm are demonstrated by comparing it with recently proposed task allocation algorithms for maximizing system reliability available in the literature. © 2010 Elsevier Inc. All rights reserved.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

Synchronization of Multi-Weighted and Directed Network Under Pinning Impulsive Control

Synchronization of Multi-Weighted and Directed Network Under...

引用

2021 China Automation Congress, CAC 2021

作者： Hu, Xiaohan Liu, Xiwei Department of Computer Science and Technology Tongji University Shanghai201804 China Department of Computer Science and Technology Key Laboratory of Embedded System Service Computing Tongji University Shanghai201804 China

ISBN: (纸本)9781665426473

In this paper, multi-weighted and directed complex dynamic networks (MWDCDNs) under the control of hybrid impulses are analyzed. Two cases are considered. In the first case, impulses can be only applied on one fixed node. In the other case, impulses are applied on different nodes according to whether they are synchronized or de-synchronized in MWDCDNs with unbounded time delay. By limiting impulsive interval and Chebyshev distance between the normalized left eigenvectors (NLEVec) of multiple coupling matrices corresponding to the zero eigenvalue, we obtain some criteria for the synchronization of MWDCNs. Some numerical simulation are also given. © 2021 IEEE

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Use the core clusters for the initialization of the clustering based on one-class support vector machine

Use the core clusters for the initialization of the clusteri...

引用

4th International Conference on Advances in Swarm Intelligence, ICSI 2013

作者： Gu, Lei Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China School of Computer Science and Technology Nanjing University of Posts and Telecommunications Nanjing 210023 China

ISBN: (纸本)9783642387142

The clustering method based on one-class support vector machine has been presented recently. Although this approach can improve the clustering accuracies, it often gains the unstable clustering results because some random datasets are employed for its initialization. In this paper, a novel initialization method based on the core clusters is used for the clustering algorithm based one-class support vector machine. The core clusters are gained by constructing the neighborhood graph and they are regarded as the initial datasets of the clustering algorithm based one-class support vector machine. To investigate the effectiveness of the proposed approach, several experiments are done on four datasets. Experimental results show that the new presented method can improve the clustering performance compared to the previous clustering algorithm based on one-class support vector machine and k-means approach. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Correct after Answer: Enhancing Multi-Span Question Answering with Post-Processing Method

Correct after Answer: Enhancing Multi-Span Question Answerin...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Lin, Jiayi Zhang, Chenyang Tong, Haibo Zhang, Dongyu Hong, Qingqing Hou, Bingxuan Wang, Junli Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai201804 China Collaborative Innovation Center for Financial Network Security Tongji University Shanghai201804 China

ISBN: (纸本)9798891761681

Multi-Span Question Answering (MSQA) requires models to extract one or multiple answer spans from a given context to answer a question. Prior work mainly focuses on designing specific methods or applying heuristic strategies to encourage models to predict more correct predictions. However, these models are trained on gold answers and fail to consider the incorrect predictions. Through a statistical analysis, we observe that models with stronger abilities do not predict less incorrect predictions compared with other models. In this work, we propose Answering-Classifying-Correcting (ACC) framework, which employs a post-processing strategy to handle incorrect predictions. Specifically, the ACC framework first introduces a classifier to classify the predictions into three types and exclude "wrong predictions", then introduces a corrector to modify "partially correct predictions". Experiments on several MSQA datasets show that ACC framework significantly improves the Exact Match (EM) scores, and further analysis demostrates that ACC framework efficiently reduces the number of incorrect predictions, improving the quality of predictions. © 2024 Association for Computational Linguistics.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

A remote debugging system for OpenMP parallel program

A remote debugging system for OpenMP parallel program

引用

2011 International Conference on Transportation, Mechanical, and Electrical Engineering, TMEE 2011

作者： Chai, Hua Shi, Qinqin Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai 201418 China

ISBN: (纸本)9781457717017

A remote debugging system for OpenMP parallel program is presented in this paper. The system consists of two parts, namely, an integrated debugging environment running on the clent-side and a background daemon running on the server-side. Information exchange between the two sides is accomplished through the socket-based network communication technology. The remote debugging function is realized by the automatic instrumentation technology at code level based on syntax tree. Instance tests show that the system can provide remote users with correctness checking, performance analysis and other debugging functions for OpenMP parallel programs. The user interface is simple and very easy to use. © 2011 IEEE.

关键词： User interfaces

来源：评论

学校读者我要写书评

暂无评论

An evolutionary semi-supervised subtractive clustering method by seeding

An evolutionary semi-supervised subtractive clustering metho...

引用

2012 International Conference on Information Technology and Software Engineering, ITSE 2012

ISBN: (纸本)9783642345210

A semi-supervised subtractive clustering has been proposed recently. However, it performance depends greatly on the choice of the parameters of the mountain function and only proper parameters enable the clustering method to produce a better effect. In this paper, an evolutionary semi-supervised subtractive clustering method by seeding is presented. The novel approach uses the genetic algorithms for tuning the relative parameters of the subtractive clustering by minimizing the Davies Bouldin clustering validity index regarded as the fitness function. To investigate the effectiveness of our approach, several experiments are done three real datasets. Experimental results show that our proposed method can improve the clustering performance significantly compared to other two traditional semi-supervised clustering algorithms. © 2013 Springer-Verlag.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Exploiting robustness in Petri net-based closed-loop systems to accommodate control specification changes

Exploiting robustness in Petri net-based closed-loop systems...

引用

2013 IEEE International Conference on Automation Science and Engineering, CASE 2013

作者： Li, Jun Zhou, Mengchu Dai, Xianzhong Key Laboratory of Measurement and Control of Complex Systems of Engineering China Ministry of Education Automation School of Southeast University Nanjing 210096 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

ISBN: (纸本)9781479915156

Supervisory control reconfiguration has been paid more attention due to its capacity of handling the uncertainties including resource failures, capability degradation, and task changes in discrete event systems. However, the robustness of closed-loop systems in response to some specification changes was not addressed in the prior studies. This paper presents a reconfiguration method based on Petri nets and integer programming for supervisory control of resource allocation systems with changeable resource allocation relationships (control specifications). First, we propose a reconfiguration mechanism. It updates the P-invariant-based supervisor and evolves the state of the closed-loop system. The latter adapts to the certain changes in specifications by the self-regulation of the closed-loop system's state. It utilizes fully the robustness in a closed-loop system and avoids unnecessary modification of a supervisor. Then, a reconfiguration model with robustness analysis is proposed based on integer programming. By using it, a firing sequence of transitions as a serial of reconfiguration actions can be found. The execution of the sequence implements the state evolution of a closed-loop system. There is no need for making additional efforts to analyze state reachability of the system, since the firability condition of transitions is incorporated into the model. Finally, the method is illustrated through an example of a hospital emergency service system. © 2013 IEEE.

关键词： Closed loop systems

来源：评论

学校读者我要写书评

暂无评论

ADHD Discrimination Based on Social Network

ADHD Discrimination Based on Social Network

引用

International Conference on Cloud computing and Big Data (CCBD)

作者： Xiaojiao Guo Lianghua He The key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

ISBN: (纸本)9781479966226

Attention Deficit Hyperactivity Disorder (ADHD) is one of the common diseases of brain and has brought the growth of teenagers and even the adult indelible damage. It is very different to classify the ADHD symptoms and normal by the existing research. In this paper, the contributions are as two aspects: one is that the attributes of brain network of the resting state fMRI data have been calculated to discriminate three categories ADHD from the controls. And the average accuracies of various categories are 42.49% and 63.46% on the ADHD-200 datasets of NYU and KKI respectively, which is better than the average best imaging-based diagnostic performance of 35.19% and 61.90% achieved in the ADHD-200 global competition. The other one is that we put forward a new method named G-algorithm to construct the whole brain network, which based on certain rules. The same or even better classification results have been achieved by this method, which also verifies its feasibility and effectiveness.

关键词： Social network services Accuracy Support vector machines Correlation Synchronization Diseases Organizations

来源：评论

学校读者我要写书评

暂无评论

Entropy-based Traffic Congestion Propagation Pattern Mining with GPS Data

Entropy-based Traffic Congestion Propagation Pattern Mining ...

引用

IEEE International Conference on Big Data Analysis (ICBDA)

作者： Xinyuan Sui Yaying Zhang Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Traffic congestion in urban areas has become a critical issue in the world. As the limits of road topology and the influence of residents' commuting periodic patterns, the same part of the road network usually gets congested, and there are similar propagation paths when congestion occurs in an area. This paper aims to model the congestion propagation phenomenon and further discover the congestion propagation paths that frequently appeared. To this end, we propose an algorithm which analyzes the correlations between congestions on different road segments and constructs a congestion propagation graph to reflect the dynamic process of congestions. The traffic flow entropy is novelty considered to identify the potential essential road segment in traffic congestions. We adopt the Jaccard correlation to estimate the parameters employed. The experiments with the road network in Beijing, China and real-world GPS trajectory data indicate that our approach can reveal congestion propagation patterns and the dynamic process of congestion propagation.

关键词： Correlation Network topology Roads Heuristic algorithms Urban areas Trajectory Topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：