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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Local-directed network coding in vehicular ad-hoc networks

Local-directed network coding in vehicular ad-hoc networks

引用

IEEE International Symposium on Intelligent Signal Processing and Communication systems (ISPACS)

作者： Haojie Luo Dongdong Zhang Chen Ye The Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

In this paper, we proposed a novel network coding method called local-directed network coding to improve the throughput of the vehicular ad-hoc network. Different from other vehicular network coding methods, we consider the direction of packet transmission. In detail, the intermediate node selects one main packet and some sub-packets from forwards and backwards sending queues, and then encodes these packets into one packet to broadcast. Simulation results show that our approach can efficiently improve the throughput of application layer in vehicular networks.

关键词： Encoding Buffer storage Accidents Vehicles Streaming media Artificial neural networks Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Vehicle to Vehicle and Roadside Sensor Communication for Intelligent Navigation

Vehicle to Vehicle and Roadside Sensor Communication for Int...

引用

International Conference on Wireless Communications, Networking and Mobile computing (WiCom)

作者： Rongyan Xia Chen Ye Dongdong Zhang Key Laboratory of Embedded System and Service Computing University of Tongji Shanghai China

Hybrid sensor network technology is a key component of future ITS applications. In this paper, we propose a hybrid architecture that combined VANETs and roadside WSNs for intelligent navigation. Different from traditional ITS application, Sensors in WSNs and VANETs are used to perceive and exchange roadside and vehicular information to support the intelligent navigating decision process. We firstly give the system and protocol architecture, and then we discuss the scenarios and use cases of our system in intelligent navigation. After that, we describe the software and hardware implementation of our prototype, conduct a simulation on the discussed scenarios, and present a detailed data communication experimental result to prove the feasibility of our prototype.

关键词： Vehicles Wireless sensor networks Navigation Data communication Roads Prototypes Path planning

来源：评论

学校读者我要写书评

暂无评论

An Improved Foreground Object Detection Method Based on Gaussian Mixture Models

An Improved Foreground Object Detection Method Based on Gaus...

引用

International Conference on Multimedia Communications (Mediacom)

作者： Xiayi Zhang Fuqiang Liu Zhipeng Li Key Laboratory of Embedded System and Service Computing University of Tongji Shanghai China

Statistical background subtraction has proved to be a robust and effective approach for segmenting and extracting objects without any prior information of the foreground objects. This paper presents two contributions on this topic. The first contribution of this paper proposes a novel approach which introduces the motion mask into the Gaussian Mixture Models to reduce the errors of classical GMMs, which always classifies the moving objects as background incorrectly, and affects the accuracy of the steps followed by, when the objects are still in long periods. The second contribution regards the connected component labeling based on the contour tracking algorithm. Experimental results validate the effectiveness of the proposed approach.

关键词： Pixel Labeling Proposals Noise Adaptation model Video sequences Real time systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

KNOB particle swarm optimizer 1

引用

1st International Conference on Advances in Swarm Intelligence, ICSI 2010

作者： Zhang, Junqi Liu, Kun Tan, Ying Key Laboratory of Embedded System and Service Computing Department of Computer Science and Technology Tongji University Shanghai 200092 China Department of Machine Intelligence School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

ISBN: (数字)9783642134951

ISBN: (纸本)3642134947

It is not trivial to tune the swarm behavior just by parameter setting because of the randomness, complexity and dynamic involved in particle swarm optimizer (PSO). Hundreds of variants in the literature of last decade, brought various mechanism or ideas, sometimes also from outside of the traditional metaheuristics field, to tune the swarm behavior. While, in the same time, additional parameters have to be afforded. This paper proposes a new mechanism, named KNOB, to directly tune the swarm behavior through parameter setting of PSO. KNOB is defined as the first principal component of the statistical probability sequence of exploration and exploitation allocation along the search process. The using of the KNOB to tune PSO by parameter setting is realized through a statistical mapping, between the parameter set and the KNOB, learned by a radial basis function neural network (RBFNN) simulation model. In this way, KNOB provides an easy way to tune PSO directly by its parameter setting. A simple application of KNOB to promote is presented to verify the mechanism of KNOB. © 2010 Springer-Verlag.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：