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

An Effective Principal Curves Extraction Algorithm for Complex Distribution Dataset 1

5th International Conference on Rough Set and Knowledge Technology (RSKT)

作者： Zhang, Hongyun Miao, Duoqian Sun, Lijun Ye, Ying The Key Laboratory of Embedded System and Service Computing Ministry of Education China Tongji University Shanghai 201804 China School of Electronic and Information Engineering Tongji University Shanghai 201804 China

ISBN: (数字)9783642162480

ISBN: (纸本)9783642162473

This paper proposes a new method for finding principal curves from complex distribution dataset. Motivated by solving the problem, which is that existing methods did not perform well on finding principal curve in complex distribution dataset with high curvature, high dispersion and self-intersecting, such as spiral-shaped curves, Firstly, rudimentary principal graph of data set is created based on the thinning algorithm, and then the contiguous vertices are merged. Finally the fitting-and-smoothing step introduced by Kegl is improved to optimize the principal graph, and Kegl's restructuring step is used to rectify imperfections of principal graph. Experimental results indicate the effectiveness of the proposed method on finding principal curves in complex distribution dataset.

关键词： Principal curves Complex distribution dataset Thinning algorithm Fitting-smoothing step Image skeletonization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

l-SkyDiv query:Effectively improve the usefulness of skylines

引用

Science China(Information Sciences) 2010年第9期53卷 1785-1799页

作者： HUANG ZhenHua1,2*,XIANG Yang1 & LIN ZiYu3 1Department of Computer Science and Technology,Tongji University,Shanghai 201804,China 2The key laboratory of embedded system and service computing,ministry of education,Tongji University,Shanghai 200092,China 3Department of Computer Science and Technology,Peking University,Beijing 100871,China 1. Department of Computer Science and Technology Tongji University Shanghai 201804 China2. The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China3. Department of Computer Science and Technology Peking University Beijing 100871 China

Skyline query processing has recently received a lot of attention in database *** a set of multi-dimensional objects,the skyline query finds the objects that are not dominated by *** the best of our knowledge,the existing researches mainly focus on how to efficiently return the whole skyline ***,as the cardinality and dimensionality of input dataset increase,the number of skylines grows exponentially,and hence this "huge" skyline set is completely useless to *** by the above fact,in this paper,we present a novel type of l-SkyDiv query,which only returns l skylines having maximum diversity,to improve the usefulness of skyline ***,we prove that the l-SkyDiv query belongs to the NP-Hard problem theoretically,and propose three efficient heuristic algorithms whose time complexities are polynomial to fast implement the proposed ***,we present detailed theoretical analyses and extensive experiments,demonstrating that our algorithms are both efficient and effective.

关键词： skyline query diversity heuristic algorithm query optimization performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Evolutionary behavior verification to the trustworthy banking software

Evolutionary behavior verification to the trustworthy bankin...

引用

International Conference on Computer Engineering and Technology

作者： Jiang, Zuo-Wen Tang, Xian-Fei Ding, Zhi-Jun Jiang, Chang-Jun Electronics and Information Engineering School Tongji University 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University 200092 China College of Science and Technology NingBo University 315211 China

ISBN: (纸本)9781424463503

Oriented to the goal of high-quality banking softwares, trustworthiness is emerging to be important property. This paper studies how to apply formal methods into the trustworthy property preservation of evolutionary components, focusing on the safety property of the concurrent software behavior, this paper presents a new approach to curb the state explosion problem in the model checking based trustworthiness verification. By adopting the environment reduction paradigm, our method is able to reduce the global states of the system by hiding the internal actions of the environment that does not join in the interleaving composition. The method presented is proved and testified with a bank software case study. Experiment data shows that our method is able to improve the verification efficiency. © copy;2010 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Study and implementation of agent-based grid resource monitoring model

Study and implementation of agent-based grid resource monito...

引用

2nd International Conference on Information Science and Engineering, ICISE2010

作者： Ming, Liu Zhang, Junqi Wang, Yu Li, Jie Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

ISBN: (纸本)9781424480968

Grid is a promising infrastructure which enables scientists and engineers to access geographically distributed resources. Grid computing is a new technology which focuses on aggregating various kinds of resource (e.g., processor cycles, disk storage, and contents) into one computing platform. The realization of grid computing requires a resource agent to manage and monitor available resources. Based on study of past models, this paper presents a new agent-based resource monitoring model whose main feature is multi-layered monitoring architecture, which enhances the ability to monitor related resource efficiently. In the meantime, the new model has been implemented in the development of a resource monitoring module integrated within a academic grid project. © 2010 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Reliable Web services Selection Using a Heuristic Algorithm

Reliable Web Services Selection Using a Heuristic Algorithm

引用

The Ninth International Conference on Grid and Cloud computing(第九届网格与云计算国际学术会议 GCC 2010)

作者： Hongjie Shen Zhijun Ding Hongzhong Chen The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

Web services composition (WSC) is the key techniques in its application. Dynamically selecting reliable Web services (WSs) becomes crucial to users. In fact, most works regard a Web service (WS) as the basic unit and selection with end-to-end, and as more and more WSs become available, the WSs selection problem is a complex NP-hard optimization problem. So, in this paper, the WSs consist of the operations and the WSs selection problem is formalized as a finite state machine process and we proposed a backward algorithm to create the WSC tree (WSCT). Then, we proposed a heuristic algorithm to complete the selection of WSs based on the WSCT. The results of experiment show our proposed heuristic algorithm is effective.

关键词： Web services composition heuristic algorithm service selection reliability

来源：评论

学校读者我要写书评

暂无评论

Bayesian cognitive trust model based self-clustering algorithm for MANETs

引用

Science China(Information Sciences) 2010年第3期53卷 494-505页

作者： WANG Wei1,2,3 & ZENG GuoSun1,2,31Department of Computer Science & Technology, Tongji University, Shanghai 200092, China 2Tongji Branch, National Engineering & Technology Center of High Performance Computer, Shanghai 200092, China 3key Loboratory of embedded system and service computing, ministry of education, Shanghai 200092, China 1. Department of Computer Science & Technology Tongji University Shanghai 200092 China2. Tongji Branch National Engineering & Technology Center of High Performance Computer Shanghai 200092 China3. Key Loboratory of Embedded System and Service Computing Ministry of Education Shanghai 200092 China

With the introduction of mobile Ad hoc networks (MANETs), nodes are able to participate in a dynamic network which lacks an underlying infrastructure. Before two nodes agree to interact, they must trust that each will satisfy the security and privacy requirements of the other. In this paper, using the cognition inspired method from the brain informatics (BI), we present a novel approach to improving the search efficiency and scalability of MANETs by clustering nodes based on cognitive trust mechanism. The trust relationship is formed by evaluating the level of trust using Bayesian statistic analysis, and clusters can be formed and maintained autonomously by nodes with only partial knowledge. Simulation experiments show that each node can form and join proper clusters, which improve the interaction performance of the entire network. The essence of the underlying reason is analyzed through the theory of complex networks, revealing great scalability of this method.

关键词： trust model MANET self-clustering Bayesian method cognitive mobile

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：