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

GCIS, WRI Global Congress on Intelligent systems

作者： Zhao, Lei Zhao, Mingqing Shandong University of Science and Technology Qingdao China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9780769543048

This essay introduces the concepts of knowledge granularity and information system. On this basis, we propose two new more general knowledge granularities: the combination granularity and polynomial granularity, which include the current common knowledge granularity. And discuss the use of their combination. The results for the establishment of granular computing in the incomplete information system have some theoretical significance and practical values. © 2010 IEEE.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A generalized model with spatial resources labels

A generalized model with spatial resources labels

引用

2010 International Conference on Biomedical Engineering and Computer Science, ICBECS 2010

作者： Jun, Niu Zeng, Guosun Department of Computer Science and Technology Tongji University Shanghai China College of Information Engineering Zhejiang Business Technology Institute Ningbo China Embedded System and Service Computing Key Lab. Ministry of Education Shanghai China

ISBN: (纸本)9781424453153

This paper proposes a generalized model by extending Markov chain with spatial resources labels, which can describe the functional and performance properties and some basic characteristics such as nondeterminacy and randomicity. The syntax and semantics of the new model are shown based on the existing temporal logics such as CSRL and pathCSRL. The model checking procedure is discussed and thus the practicability of the new model is intuitive. Based on the existing models, the proposed model includes spatial resources labels only by adding the spatial information to the existing labels of states, so the treatment of the state explosion problem is similar to that in the existing models. ©2010 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Reduction criteria for probabilistic models with spatial restrictions on states

Reduction criteria for probabilistic models with spatial res...

引用

2nd International Conference on Networks Security, Wireless Communications and Trusted computing, NSWCTC 2010

ISBN: (纸本)9780769540115

Partial order reduction techniques have been used to combat the state explosion problem in model checking procedures for concurrent systems with probabilistic behaviors. There are some results that give criteria on applying partial order reduction for verifying quantitative time properties and reward-based properties on actions. However, there are many situations that reward-based properties are expressed on states rather than on actions because actions are triggered in no time and the quantities can not be obtained easily. This paper presents reduction criteria for a probabilistic temporal logic that allows specification of restrictions on quantitative measures given by spatial resources function for the states of the considered system and provides the proof of the correctness. © 2010 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：