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

2011 7th International Conference on Next Generation Web Services Practices, NWeSP 2011

作者： Wang, Ke Ou, Wei-Jie Zeng, Cheng Li, De-Yi Peng, Zhi-Yong National Science Library Chinese Academy of Sciences Beijing 100190 China State Key Lab of Software Engineering Wuhan University Wuhan 430072 China China Institute of Electronic System Engineering Beijing 100840 China School of Computer Wuhan University Wuhan 430072 China

ISBN: (纸本)9781457711268

Web service schema matching is the preliminary phase of service composition and service Mashup. With the entry of large numbers of services on the Internet, it will be difficult to find and suggest the most relevant service candidates for new composition and Mashup. Furthermore, the composition and Mashup candidates must be confirmed by manual work which is very inefficient and even inefficacious. In this work, we present an approach for web service schema matching based on service invocation instance duplicates. This approach predicts the schema relationship between web service parameters based on duplicates among invocation data sets and is very different from the syntactical-based and semantic-based matching approaches. It can be used for predicting and verifying service composition and Mashup candidates. © 2011 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Web service schema matching based on characteristic vector

Web service schema matching based on characteristic vector

引用

IEEE International Conference on software engineering and Service Sciences (ICSESS)

作者： Wang, Ke Ou, Wei-Jie Zeng, Cheng Li, De-Yi Peng, Zhi-Yong National Science Library Chinese Academy of Sciences Beijing 100190 China State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China China Institute of Electronic System Engineering Beijing 100840 China School of Computer Wuhan University Wuhan 430072 China

ISBN: (纸本)9781424496969

Web service schema matching is the preliminary treatment phase of service composition and service mashup. With the entry and exit of large numbers of services on the Internet, it will be difficult to find and suggest the most relevant service candidates for new composition and mashup. In this work, we present an approach for web service schema matching based on characteristic vector consisted of multi-type service parameter information element. This schema matching approach is different form the main syntactical-based and semantic-based matching approaches, and will predict schema relationship more effectively and adaptable for web service. An experiment on real data shows the effectiveness of this approach. © 2011 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Energy and thermal aware mapping for mesh-based NoC architectures using multi-objective ant colony algorithm

Energy and thermal aware mapping for mesh-based NoC architec...

引用

IEEE International Conference on Computer Research and Development

作者： Liu, Yanhua Ruan, Ying Lai, Zongsheng Jing, Weiping Dept. of Electronic Computer and Software Systems Institute of Microelectronics Circuit and System East China Normal University Shanghai China Dept. of Electronic Engineering Jiangsu Provincial Key Lab. of ASIC Design Nantong University Nantong China

ISBN: (纸本)9781612848372

Where IP cores to be mapped must be carefully solved for any given application in order to optimize different performance metrics in Network-on-Chip (NoC) design flow. The optimization of different performance metrics simultaneously may cause a negative effect on each other because of the strong correlation between these performance metrics. In this paper, we propose a multi-objective ant colony algorithm (MOACA) that maps IP cores onto mesh-based NoC architectures. This algorithm is an efficient way to find the pareto-optimal front which optimizes energy consumption and hotspot temperature of NoC. The algorithm has been implemented and evaluated for synthetic generated benchmarks. Experimental results confirm the efficiency, accuracy and scalability of the algorithm. © 2011 IEEE.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Spike sorting based on radial basis function network with overlap decomposition

Spike sorting based on radial basis function network with ov...

引用

作者： Dai, Min Hu, Su-Rui Qi, Jia Tianjin Key Lab of Intelligent Computing and Novel Software Technology School of Computer and Communication Engineering Tianjin University of Technology Tianjin 300191 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin 300191 China

Spike sorting is the essential step in analyzing recording spike signals for studying information processing mechanisms within the nervous system. Overlapping is one of the most serious problems in the spike sorting for multi-channel recordings. In this paper, a modified radial basis function (RBF) network is proposed to decompose the overlapping signals and separate spikes within the same RBF network. A modified radial basis function based on the Gaussian function is employed in the method to improve the accuracy of overlap decomposition. In addition, the improved constructing algorithm reduces the calculation cost by taking advantage of the symmetry of the RBF network. The performance of the presented method is tested at various signal-to-noise ratio levels based on simulated data coming from the University of Leicester and Wave-clus software. Experiment results show that our method successfully solves the fully overlapping problem and has higher accuracy comparing with the Gaussian function. © 2011 Elsevier Ltd. All rights reserved.

关键词： Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Set of Complexity Metrics for Large-Scale Object-Oriented software systems

引用

Journal of Computer Science & Technology 2010年第6期25卷 1184-1201页

作者：马于涛何克清李兵刘婧周晓燕 State Key Lab of Software Engineering Wuhan University Complex Networks Research Center Wuhan University Institute of Electronic System Engineering

Large-scale object-oriented（OO） software systems have recently been found to share global network characteristics such as small world and scale free,which go beyond the scope of traditional software measurement and assessment *** measure the complexity at various levels of granularity,namely graph,class（and object） and source code,we propose a hierarchical set of metrics in terms of coupling and cohesion-the most important characteristics of software,and analyze a sample of 12 open-source OO software systems to empirically validate the *** results of the correlations between cross-level metrics indicate that the graph measures of our set complement traditional software metrics well from the viewpoint of network thinking,and provide more effective information about fault-prone classes in practice.

关键词： complexity metrics quality analysis and evaluation object-oriented programming reverse engineering complex networks

来源：评论

学校读者我要写书评

暂无评论

ISM: Intent-perceptible service migration model for IP network survivability

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2011年第12期39卷 2768-2775页

作者： Zhao, Er-Hu Yang, Xiao-Long Xu, Jie Long, Ke-Ping Zhang, Dan Research Centre for Optical Internet and Mobile Information Networks University of Electronic Science and Technology of China Chengdu Sichuan 611731 China National Key Lab. of Integrated Information System Tech. Institute of Software Chinese Acad. of Sci. Beijing 100190 China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing 100083 China 706 Institute The Second Academy of China Aerospace Beijing 100854 China

The existing service migration methods bring the server cluster heavy burden, and their time spending is so high that seriously affects the service continuity. In order to enhance the survivability of IP network services, the paper puts forward an intent-perceptible service migration model (ISM). In this model, we design a novel trigger mechanism and object selecting method for service migration, and make the service migration intention perceptible for the client with the cooperation of the server. The evaluation results show that ISM model can not only ensure the service invulnerability by maintaining a high randomness of service migration, but also improve the service continuity by reducing the service gap time spending on service migration to the maximum extent. Therefore, ISM model can enhance IP network survivability efficiently.

关键词： Internet protocols

来源：评论

学校读者我要写书评

暂无评论

Transform dual transition timed Petri Net into timed automaton for model checking with UPPAAL

Transform dual transition timed Petri Net into timed automat...

引用

International Conference on Computational Intelligence and software engineering

作者： Luo, Yigui Embedded System Lab. Software Engineering School Tongji University Shanghai China

ISBN: (纸本)9781424453924

This paper presents the transformation of dual transition timed Petri Net (DTTPN) into timed automaton for model checking embedded system described in DTTPN which can model real-time embedded system in both control and data domain on different design phases[9]. This paper proposes to transform a DTTPN model subnet into automaton, and then combine these concurrent subnets into whole one. For each DTTPN subnet, a time transition system is defined as active set net, which is bisimulated with this DTTPN subnet. Again by bisimulating this active set net, active set timed automaton is defined. Based on this active set timed automaton, model checking with UPPAAL can be carried out on events collision, resource constraints and so on. This paper gives the details of the transformation method, and model checking examples. ©2010 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

How multiple-dependency structure of classes affects their functions: A statistical perspective

How multiple-dependency structure of classes affects their f...

引用

2010 2nd International Conference on software Technology and engineering, ICSTE 2010

作者： Ma, Yutao He, Keqing Li, Bing Zhou, Xiaoyan State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China Postdoctoral Workstation Institute of Electronic System Engineering Beijing 100141 China

ISBN: (纸本)9781424486656

Networks have been considered an effective tool to describe the topological structure of software. Recently, many object-oriented software systems were found to share global network features such as scale free and small world. In this paper, we defined a special structural feature of individual class to investigate the relationship between external structure and internal function. The metric (m) takes in-degree and reachable set of nodes in class-level dependency graphs derived from source code into consideration. Experimental results show that (1) the distribution of frequency-of-occurrence of m roughly follows a power-law distribution, and (2) there is a weak but distinct positive correlation between m and either WMC or LCOM, and classes with complex multiple-dependency structure have on average more complicated functions (and less cohesion) than other classes within specific groups classified by m. Thus, the metric could be a useful complementary measure for traditional OO metrics to analyze the complexity, stability and maintainability of classes. © 2010 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Enhance Information Flow Tracking with Function Recognition

引用

China Communications 2010年第6期7卷 24-29页

作者： Zhou Kan Huang Shiqiu Huang Shan Qi Zhengwei Gu Jian Guan Haibing School of software Shanghai Jliao Tong University Shanghai 200240 P. R. China Key Lab of Information Network Security Ministry of Public Security Department of Computer Science ＆ Engineering Shanghai Jiao Tong University Shanghai 200240 P. R China Shanghai Key Laboratory of Scalable Computing ＆ System Shanghai P. R. China

With the spread use of the computers, a new crime space and method are presented for criminals. Thus computer evidence plays a key part in criminal cases. Traditional computer evidence searches require that the computer specialists know what is stored in the given computer. Binary-based information flow tracking which concerns the changes of control flow is an effective way to analyze the behavior of a program. The existing systems ignore the modifications of the data flow, which may be also a malicious behavior. Thus the function recognition is introduced to improve the information flow tracking. Function recognition is a helpful technique recognizing the function body from the software binary to analyze the binary code. And that no false positive and no false negative in our experiments strongly proves that our approach is effective.

关键词： function recognition information flow tracking program behavior e-evidence.

来源：评论

学校读者我要写书评

暂无评论

pService: Towards similarity search on peer-to-peer web services discovery

pService: Towards similarity search on peer-to-peer web serv...

引用

1st International Conference on Advances in P2P systems, AP2PS 2009

作者： Zhou, Gang Yu, Jianjun National Digital Switching System Engineering and Technological Research Center 450002 France State Key Lab. of Software Development Environment Beihang University 100191 China Computer Network Information Center Chinese Academy of Sciences 100190 China

ISBN: (纸本)9780769538310

We present the design of pService system for P2P Web services discovery supporting similarity earch with its locality-preserving feature based on modified Skip Graph. In pService, the most important property (e.g. service name) of a service is viewed as the indexing key of a peer node. The other properties are extracted as multiattributes which would be mapped into one-dimensional indices using HSFC (Hilbert Space Filling Curve), and assigned to membership vector of the peer node. These two features help to support similarity search in two aspects: peer nodes with similar indexing keys would be distributed neighborly, peer nodes with similar indices will connect to each other through routing table. Our evaluation showed that the pService performs considerable Web services discovery efficiency. © 2009 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：