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

第三十四届中国控制会议

作者： XU Xiaoli YAN Huaicheng ZHANG Hao SHI Hongbo Key Laboratory of Advanced Control and Optimization for Chemical Process of Ministry of Education School of information Science and Engineering East China University of Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education

ISBN: (纸本)9781467374439

This paper investigates the problem of H∞ filter design for a class of nonlinear networked system based on T-S fuzzy model. Multiple stochastic time-varying delays and some incomplete information are considered simultaneously. Incomplete information includes randomly occurring sensor saturation and packet dropouts. Stochastic time-varying delays are depicted as a sequence of stochastic and independent variables, which take values on 0 and 1. Two sets of Bernoulli distributed white noises are introduced to describe randomly occurring sensor saturation and packet dropouts. system conservatism is reduced due to introduce an approach of piecewise quadratic Lyapunov function. By solving a set of linear matrix inequalities(LMIs), the filter parameters are obtained. Finally, a simulation example is provided to illustrate the effectiveness of the proposed filter design approach.

关键词： H ∞ filtering,multiple time-varying delays,randomly occurring sensor saturation,packet dropouts,piecewise quadratic Lyapunov function

来源：评论

学校读者我要写书评

暂无评论

Consensus in Second-Order Discrete-Time MAS With Distinct and Multiple Coupling Matrices 10

Consensus in Second-Order Discrete-Time MAS With Distinct an...

引用

10th International Conference on systems and Informatics, ICSAI 2024

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

ISBN: (纸本)9798331510138

In this paper, we explore and establish several necessary and sufficient conditions that are instrumental in achieving consensus within second-order discrete-time multi-agent systems (SDMAS). Different with previous research, this study addresses the more intricate scenario where the velocity coupling matrix is distinct from the position coupling matrix. We introduce a novel eigenvector condition tailored to this challenge. Furthermore, in response to the burgeoning interest in multiweighted networks, this study is extended to SDMAS with multiple weights. We employ a technique, that rearranges the order of variables, to effectively simplify the analysis of multiweighted networks by transforming them into single-weighted equivalents. The efficacy of our method is substantiated through three numerical examples, which illustrate the practical value in elucidating consensus dynamics within SDMAS featuring diverse coupling matrices. © 2024 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Improving image retrieval by local feature reselection with query expansion 1

引用

17th Pacific-Rim Conference on Multimedia, PCM 2016

作者： Wang, Hanli Sun, Tianyao Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (数字)9783319488905

ISBN: (纸本)9783319488899

A novel approach related to query expansion is proposed to improve image retrieval performance. The proposed approach investigates the problem that not all of the visual features extracted from images are appropriate to be employed for similarity matching. To address this issue, we distinguish image features as effective features from noisy features. The former is benefit for image retrieval while the latter causes deterioration, since the matching of noisy features may rise the similarity score of irrelevant images. In this work, a detailed illustration of effective and noisy features is given and the aforementioned problem is solved by selecting effective features to enhance query feature set while removing noisy features via spatial verification. Experimental results demonstrate that the proposed approach outperforms a number of state-of-the-art query expansion approaches. © Springer International Publishing AG 2016.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

Robust Learning to Rank Based on Portfolio Theory and AMOSA Algorithm

引用

IEEE Transactions on systems, Man, and Cybernetics: systems 2017年第6期47卷 1007-1018页

作者： Li, Jinzhong Liu, Guanjun Yan, Chungang Jiang, Changjun Key Laboratory of the Ministry of Education for Embedded System and Service Computing Department of Computer Science and Technology Tongji University Shanghai201804 China Key Laboratory of Watershed Ecology and Geographical Environment Monitoring NASG Department of Computer Science and Technology Jinggangshan University Ji'an343009 China

Effectiveness is the most important factor considered in the ranking models yielded by algorithms of learning to rank (LTR). Most of the related ranking models only focus on improving the average effectiveness but ignore robustness. When a ranking model ignores robustness, the effectiveness for many queries is possibly very poor although the average effectiveness for all queries is relatively high. Therefore, Wang et al. first consider robustness in their ranking models. However, the robustness formula defined by Wang et al. cannot characterize those queries whose effectiveness are hurt seriously in comparison with the baseline model. In order to overcome this shortcoming, we propose a novel formula of characterizing robustness based on portfolio theory, and construct a multiobjective optimization model of the robust LTR in which the formula is used. Based on this model, we propose an approach of risk-sensitive and robust LTR, named as R2Rank, which is based on the framework of archived multiobjective simulated annealing algorithm and the idea of preference ranking organization method for enrichment evaluation. The experimental results show that the ranking models produced by our proposed R2Rank approach are better in both effectiveness and robustness than those produced by three state-of-the-art LTR approaches. © 2016 IEEE.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Multi-Perspective Data Fusion Framework Based on Hierarchical BERT: Provide Visual Predictions of Business Processes

引用

Computers, Materials & Continua 2024年第1期78卷 1227-1252页

作者： Yongwang Yuan Xiangwei Liu Ke Lu School of Mathematics and Big Data Anhui University of Science and TechnologyHuainan232001China School of Economics and Management Anhui University of Science and TechnologyHuainan232001China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji UniversityShanghai201804China

Predictive Business Process Monitoring(PBPM)is a significant research area in Business Process Management(BPM)aimed at accurately forecasting future behavioral *** present,deep learning methods are widely cited in PBPM research,but no method has been effective in fusing data information into the control flow for multi-perspective process ***,this paper proposes a process prediction method based on the hierarchical BERT and multi-perspective data ***,the first layer BERT network learns the correlations between different category attribute ***,the attribute data is integrated into a weighted event-level feature vector and input into the second layer BERT network to learn the impact and priority relationship of each event on future predicted ***,the multi-head attention mechanism within the framework is visualized for analysis,helping to understand the decision-making logic of the framework and providing visual ***,experimental results show that the predictive accuracy of the framework surpasses the current state-of-the-art research methods and significantly enhances the predictive performance of BPM.

关键词： Business process prediction monitoring deep learning attention mechanism BERT multi-perspective

来源：评论

学校读者我要写书评

暂无评论

DAG-Aware Joint Task Scheduling and Cache Management in Spark Clusters

DAG-Aware Joint Task Scheduling and Cache Management in Spar...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Yinggen Xu Liu Liu Zhijun Ding The Key Lab of Embedded System and Service Computing Tongji University Shanghai China

ISBN: (数字)9781728168760

ISBN: (纸本)9781728168777

Data dependency, often presented as directed acyclic graph (DAG), is a crucial application semantics for the performance of data analytic platforms such as Spark. Spark comes with two built-in schedulers, namely FIFO and Fair scheduler, which do not take advantage of data dependency structures. Recently proposed DAG-aware task scheduling approaches, notably GRAPHENE, have achieved significant performance improvements but paid little attention to cache management. The resulted data access patterns interact poorly with the built-in LRU caching, leading to significant cache misses and performance degradation. On the other hand, DAG-aware caching schemes, such as Most Reference Distance (MRD), are designed for FIFO scheduler instead of DAG-aware task *** this paper, we propose and develop a middleware Dagon, which leverages the complexity and heterogeneity of DAGs to jointly execute task scheduling and cache management. Dagon relies on three key mechanisms: DAG-aware task assignment that considers dependency structure and heterogeneous resource demands to reduce potential resource fragmentation, sensitivity-aware delay scheduling that prevents executors from long waiting for tasks insensitive to locality, and priority-aware caching that makes the cache eviction and prefetching decisions based on the stage priority determined by DAG-aware task assignment. We have implemented Dagon in Apache Spark. Evaluation on a testbed shows that Dagon improves the job completion time by up to 42% and CPU utilization by up to 46% respectively, compared to GRAPHENE plus MRD.

关键词： Task analysis Delays Sparks Data analysis Graphene Complexity theory Sensitivity

来源：评论

学校读者我要写书评

暂无评论

Utilizing adaptive techniques to supress noise in high frequency ground wave radar

Utilizing adaptive techniques to supress noise in high frequ...

引用

4th Microwave and Radar Week MRW-2010 - 11th International Radar Symposium, IRS 2010

作者： Gui, Renzhou Key Laboratory of Embedded System and Service Computing Ministry of Education College of Electronics and Information Engineering Tongji University Shanghai 200092 China State Key Laboratory of Millimeter Waves China

ISBN: (纸本)9789955690184

Reducing noise disturbances in the frequency segment of high frequency (HF) ground wave radar and restraining the sidelobes of strong targets that interfere with the detection of weak targets are the interesting Topic. A new method based on an adaptive techniques that solves these problems is proposed. By changing the working time of the frequency spectrum monitor (FSM), we have shown not only that radar can run in the frequency segments with lower noise disturbances, but also that the noise data produced by FSM can be exploited effectively. There is no correlation between the noise and the useful echo signal, though the correlation between noises over very short time periods is strong,. Exploiting the phenomena, we can adjust system parameters in real-time by adaptive methods to solve the two problems,namely sidelobe disturbance of strong targets and noise distrubance in the frequency segment.

关键词： Bandpass filters

来源：评论

学校读者我要写书评

暂无评论

An Event Timeline Extraction Method Based on News Corpus 2

An Event Timeline Extraction Method Based on News Corpus

引用

2017 IEEE 2nd International Conference on Big Data Analysis（ICBDA 2017）

作者： Yaguang Wu Haichun Sun Chungang Yan Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Tongji University College of Police Information Engineering People's Public Security University of China

ISBN: (纸本)9781509036202

Event extraction is an important research point in information extraction area, and news event extraction has a greater practical significance. The existing methods of extracting news event, which starts from the time element, is to identify the date sentences hold by Natural Language Processing and extract the event on the date by Text Clustering. However, they only process the news that holds a time-tag and gives up the news that has no accurate date, which easily leads an extraction deviation of significant events and reduces the accuracy of ordering the significant events. In this paper, improvement for this defect is to calculate the similarities between sentences to put part of the non-time-tag sentences into the right date container, thereby the accuracy of ordering the significant event is *** experiments and compared with the existing methods,the accuracy of ordering the significant events in this paper is improved by 14.6%.

关键词： event extraction text information mining sentence similarity timeline

来源：评论

学校读者我要写书评

暂无评论

Attribute recursive algorithms based on knowledge rough representation

Attribute recursive algorithms based on knowledge rough repr...

引用

International Conference on Information and Business Intelligence, IBI 2011

作者： Li, Dao-Guo Fan, Zhuo-Bin Chen, Yang School of Management Hangzhou Dianzi University Hangzhou 310018 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

ISBN: (纸本)9783642290862

Existing representative research achievement of the relevant literatures focused on two *** is how to improve the efficiency of attribute reduction algorithms in all attributes including the added properties. Such as the recursive algorithm to change conjunctive normal form into disjunctive normal form based on the boolean matrix and the algorithm based on radix sorting for computing core and reductions of a given information system, etc. On the other hand focus on the objects recursive algorithms. The drawback is that these methods have not fully use the knowledge gained when some attributes was added to a discussion on the domain. Therefore, the regularity of the core and reduction's changes under adding new attributes into a given information system were discussed. Moreover, the incremental reduction algorithms from a information system was proposed. The experiments show that these algorithms can quickly and exactly calculate new core and reduction of the new information system by taking advantage of the knowledge of the original information system. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

Reconstruction of table-manipulation method with constraints based on algebra-shape-computer thought

Reconstruction of table-manipulation method with constraints...

引用

International Conference on Mechanical Science and Engineering, ICMSE 2012

作者： Li, Dao Guo Fu, Bin Zhou, Zhong Yuan Yang, Chen School of Management Hangzhou Dianzi University Hangzhou 310018 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

ISBN: (纸本)9783037854723

The table-manipulation method plays a important role in optimizing resource scheduling, scientifically location chosen, task assignment, investment distribution and so on. Most literatures introduction the table-manipulation method used to single thought pattern, for example, the algebra thought model, the shape thought model, or Computer software method, which cruse it is difficult to understand and apply. Therefore, a novel table-manipulation integration approach is proposed by combining the thought of algebra-shape-computer. This builds convenient access among the abstraction, modeling, solving on the practical optimizing problems discussed above. © (2012) Trans Tech Publications, Switzerland.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：