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

Behavior-aware Trustworthiness Study of Networked Software

International Journal of Computational Intelligence systems 2010年第5期3卷 542-552页

作者： Fang, Xianwen Jiang, Changjun Fan, Xiaoqin Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Lab of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

The essence characteristics of software trustworthiness are software execution effect and behavior can be anticipated, which is an important index of software quality. Under the open and dynamic environments, some uncertainty factors cause the behavior of software to be uncontrolled, uncertainty and unpredictable. Behavior-aware networked software trustworthiness research methods are proposed in the paper. Firstly, we propose the analysis methods of the consistency between the inferred specification models with component specification model. Then, for analyzing the component interaction behavior, the behavior relativity analyzing method is presented based on Petri net. Finally, aimed to the outer factors, we analyze the behavioral congruence between theoretical composite models with dynamic behavior model based on running logs. Theoretical analysis and the example analysis indicated that this method is benefit to analyze the trustworthiness of networked software. © 2010, the authors.

关键词： consistency networked software Petri net software behavior trustworthiness

来源：评论

学校读者我要写书评

暂无评论

Finite-time and Fixed-time Stability and Synchronization 35

Finite-time and Fixed-time Stability and Synchronization

引用

第35届中国控制会议

作者： LIU Xiwei LU Wenlian CHEN Tianping Department of Computer Science and Technology Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education School of Mathematics Fudan University Centre for Computational System Biology Fudan University School of Computer Sciences Fudan University

ISBN: (纸本)9781509009107

Recently,finite-time and fixed-time stability has been a hot topic in the study of dynamical *** this paper,we will provide an insightful view on this issue and explore the intrinsic property by mathematical *** theorems and corollaries show how to find the settling ***,we apply the corresponding theory on the finite-time and fixed-time synchronization problem of nonlinearly coupled systems and a numerical simulation is also given to demonstrate its efficiency.

关键词： Finite-Time Fixed-Time Nonlinear Coupling Stability Synchronization

来源：评论

学校读者我要写书评

暂无评论

API Usage Pattern Search Based on Model Checking 7th

API Usage Pattern Search Based on Model Checking

引用

7th International Symposium on Dependable Software Engineering: Theories, Tools, and Applications, SETTA 2021

作者： Ding, Xue-er Niu, Jun Wang, Jia Faculty of Electrical Engineering and Computer Science Ningbo University Ningbo315211 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China

ISBN: (纸本)9783030912642

Reusing existing class libraries can improve the productivity of software development. API usage patterns are useful resources for programmers in reusing class libraries. Existing approaches often exploit API graphs to model semantic relations between API elements of class libraries, and traversal graphs to capture API usage patterns. However, those approaches cannot describe the number of parameters and the number of overload methods, and may not search for various API usage patterns. In this paper, we propose an automatic and complete approach to searching for API usage patterns by model checking technique. We introduce a novel kind of API transition system model to completely describe the relations between all API elements of existing class libraries. We obtain API usage constraints from queries, namely the numbers and types of input and output objects and class types transformed based on APIs replacement model, and give the logical characterizations of the constraints by suitable CTL* (computation tree logic) formulas. Then, we can obtain suitable API usage patterns by model checking the logical formulas in related API transition system models based on model checker NuSMV. The experiments indicate that, in contrast to existing approaches, our approach can automatically and effectively search for various API usage patterns. © 2021, Springer Nature Switzerland AG.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

An efficient gene selection algorithm based on tolerance rough set theory 1

引用

12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular computing, RSFDGrC 2009

作者： Jiao, Na Miao, Duoqian Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education of China Tongji University Shanghai 201804 China

ISBN: (数字)9783642106460

ISBN: (纸本)3642106455

Gene selection, a key procedure of the discriminant analysis of microarray data, is to select the most informative genes from the whole gene set. Rough set theory is a mathematical tool for further reducing redundancy. One limitation of rough set theory is the lack of effective methods for processing real-valued data. However, most of gene expression data sets are continuous. Discretization methods can result in information loss. This paper investigates an approach combining feature ranking together with feature selection based on tolerance rough set theory. Compared with gene selection algorithm based on rough set theory, the proposed method is more effective for selecting high discriminative genes in cancer classification task. © 2009 Springer-Verlag Berlin Heidelberg.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Progressive ranking and composition of web services with interaction relationship

Journal of Software

引用

Journal of Software 2010年第8期5卷 842-850页

作者： Yuan, Jianjun Jiang, Changjun Jiang, Zuowen The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

service-oriented computing is a new software development paradigm that allows application developers to select available services from the Internet and to form new web services. A main problem is how to efficiently determine the most appropriate web services that will be combined into an application based on their functionalities, licensing costs, and reliability. Bryce et al. make use of the group testing results, and then progressively select the best component WS to construct the composite service by using interaction testing. However, they consider only pair-wise (2-way) interaction among any two component WS. In really composite service, there are not always interactions among any component WS, and some component WS may need Nway (N >2) testing since there is a closer relationship among them. We extend the model of interaction testing for WS with interaction relationship and propose a greedy algorithm for constructing variable covering arrays with bias. Experimental results show that our approach can cover more important interactions among web services earlier. © 2010 ACADEMY PUBLISHER.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：