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

2012 International Conference on Emerging Technologies for Information systems, computing, and Management, ICM 2012

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

ISBN: (纸本)9781461470090

In the initialization of the traditional semi-supervised k-means, the mean of some labeled data belonging to one same class was regarded as one initial center and the number of the initial centers is equal to the number of clusters. However, this initialization method using a small amount of labeled data also called seeds which are not appropriate for the semi-supervised k-harmonic means clustering insensitive to the initial centers. In this paper, a novel semi-supervised k-harmonic means clustering is proposed. Some seeds with one same class are divided into several groups and the mean of all data is viewed as one initial center in every group. Therefore, the number of the initial centers is more than the number of clusters in the new method. To investigate the effectiveness of the approach, several experiments are done on three datasets. Experimental results show that the presented method can improve the clustering performance compared to other traditional semi-supervised clustering algorithms. © 2013 Springer Science+Business Media New York.

关键词： Harmonic analysis

来源：评论

学校读者我要写书评

暂无评论

Toward the First SDN Programming Capacity Theorem on Realizing High-Level Programs on Low-Level Datapaths

Toward the First SDN Programming Capacity Theorem on Realizi...

引用

2018 IEEE Conference on Computer Communications, INFOCOM 2018

作者： Leet, Christopher Wang, Xin Richard Yang, Y. Aspnes, James Department of Computer Science Yale University United States Department of Computer Science Tongji University China Key Laboratory of Embedded System and Service Computing Ministry of Education China

ISBN: (纸本)9781538641286

High-Ievel programming and programmable data paths are two key capabilities of software-defined networking (SDN). A fundamental problem linking these two capabilities is whether a given high-level SDN program can be realized onto a given low-level SDN datapath structure. Considering all high-level programs that can be realized onto a given datapath as the programming capacity of the datapath, we refer to this problem as the SDN data path programming capacity problem. In this paper, we conduct the first study on the SDN datapath programming capacity problem, in the general setting of high-level, datapath oblivious, algorithmic SDN programs and state-of-art multi-table SDN data path pipelines. In particular, considering datapath-oblivious SDN programs as computations and datapath pipelines as computation capabilities, we introduce a novel framework called SDN characterization junctions, to map both SDN programs and datapaths into a unifying space, deriving the first rigorous result on SDN datapath programming capacity. We not only prove our results but also conduct realistic evaluations to demonstrate the tightness of our analysis. © 2018 IEEE.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

Gene selection and cancer classification: A rough sets based approach

Gene selection and cancer classification: A rough sets based...

引用

Rough Set and Knowledge Technology Conference, RSKT 2008

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

ISBN: (纸本)3642144667

Indentification of informative gene subsets responsible for discerning between available samples of gene expression data is an important task in bioinformatics. Reducts, from rough sets theory, corresponding to a minimal set of essential genes for discerning samples, is an efficient tool for gene selection. Due to the compuational complexty of the existing reduct algoritms, feature ranking is usually used to narrow down gene space as the first step and top ranked genes are selected . In this paper,we define a novel certierion based on the expression level difference btween classes and contribution to classification of the gene for scoring genes and present a algorithm for generating all possible reduct from informative *** algorithm takes the whole attribute sets into account and find short reduct with a significant reduction in computational complexity. An exploration of this approach on benchmark gene expression data sets demonstrates that this approach is successful for selecting high discriminative genes and the classification accuracy is impressive. © 2010 Springer-Verlag.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

Fast adaptive interpolation filter algorithm for bi-predicted frame in video coding

Fast adaptive interpolation filter algorithm for bi-predicte...

引用

2nd International Conference on Multimedia Technology, ICMT 2011

作者： Gao, Huichao Cen, Feng Xu, Weisheng Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 20092 China College of Electronics and Information Engineering Tongji University Shanghai 20092 China

ISBN: (纸本)9781612847740

This paper proposes a novel adaptive interpolation filter (AIF) to reduce computational complexity and bit-rate of video coding. In the proposed AIF, the filter coefficients of B frames, which are predicted from those of adjacent P frames with a novel parabolic model, are unnecessary to transmit. Experimental results show that the coding complexity is reduced by 40.22% with no penalty on coding efficiency and 1.59% bitrate reduction is achieved at low bit-rate against conventional AIF. © 2011 IEEE.

关键词： Image coding

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：