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

IEEE International Conference on Web Services (ICWS)

作者： Wei Song Xiaoxing Ma S.C. Cheung Hao Hu Qiliang Yang Jian Jian Lü Institute of Computer Science Nanjing University of Science and Technology of PLA Nanjing China Institute of Computer Science Nanjing Universitv of Science and Technology Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computer Science and Engineering HKUST Hong Kong China

WS-BPEL processes can facilitate service discovery when the services have multiple interfaces in certain order. Current approaches derive the abstract WS-BPEL processes directly from the corresponding executable ones by hiding or omitting the internal activities. However, these simple approaches may prevent the services from being found by valuable potential partners at service discovery stage. To address this problem, we propose a novel approach to refactoring the executable and abstract WS-BPEL processes for service discovery. We show the application of our approach through a typical travel agency service.

关键词： Process control Publishing Business Concurrent computing Tin System recovery Flow graphs

来源：评论

学校读者我要写书评

暂无评论

Spectrum-Based Fault Localization: Testing Oracles are No Longer Mandatory

Spectrum-Based Fault Localization: Testing Oracles are No Lo...

引用

International Conference on Quality software

作者： Xiaoyuan Xie W. Eric Wong Tsong Yueh Chen Baowen Xu Centre of Software Analysis and Testing Swinburne University of Technology Hawthorn VIC Australia School of Computer Science and Engineering South-East University Nanjing China State Key Laboratory for Novel Software Technology & Department of Computer Science and Technology Nanjing University Nanjing China Department of Computer Science University of Texas Dallas Richardson TX USA

Spectrum-based Fault Localization (SBFL) is one of the most popular approaches for locating software faults, and has received much attention because of its simplicity and effectiveness. It utilizes the execution result of each test case (failure or pass) and the corresponding coverage information to evaluate the likelihood of each program entity (e.g., a statement or a predicate) being faulty. Different formulas for computing such likelihood have been proposed based on different intuitions. All existing SBFL techniques have assumed the existence of a testing oracle, that is, a mechanism which can determine whether the execution of a test case fails or passes. However, such an assumption does not always hold. Recently, metamorphic testing has been proposed to alleviate the oracle problem. Thus, it is a natural extension to investigate how it can help SBFL techniques to locate faults even without using a testing oracle. Based on the framework of metamorphic testing, we have developed a novel concept of mice as a counterpart of the slice used in the current SBFL techniques. More precisely, in the absence of a testing oracle, we can determine whether an expected characterization of the program is satisfied. The outcomes of dissatisfaction or satisfaction of an expected characterization are then regarded as the counterparts of failed or passed executions, respectively, when a testing oracle exists. Since our approach does not require the existence of a testing oracle, it significantly enhances the applicability of SBFL techniques. Case studies on three popular SBFL techniques (Tarantula, Ochiai and Jaccard) with 9 applications are reported to demonstrate the use of the proposed fault localization technique.

关键词： Mice software computer science Manuals software testing Schedules

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient local wake-up scheduling in wireless sensor networks

Energy-efficient local wake-up scheduling in wireless sensor...

引用

Congress on Evolutionary Computation

作者： Jing-hui Zhong Jun Zhang Department of Computer Science Key Laboratory of Digital Life Ministry of Education Key Laboratory of Software Technology Education Department of Guangdong Sun Yat-sen University China

Scheduling sensor activities is an effective way to prolong the lifetime of wireless sensor networks (WSNs). In this paper, we explore the problem of wake-up scheduling in WSNs where sensors have different lifetime. A novel local wake-up scheduling (LWS) strategy is proposed to prolong the network lifetime with full coverage constraint. In the LWS strategy, sensors are divided into a first layer set and a successor set. The first layer set which satisfies the coverage constraint is activated at the beginning. Once an active sensor runs out of energy, some sensors in the successor set will be activated to satisfy the coverage constraint. Based on the LWS strategy, this paper presents an ant colony optimization based method, namely mc-ACO, to maximize the network lifetime. The mc-ACO is validated by performing simulations on WSNs with different characteristics. A recently published genetic algorithm based wake-up scheduling method and a greedy based method are used for comparison. Simulation results reveal that mc-ACO yields better performance than the two algorithms.

关键词： Wireless sensor networks Monitoring Scheduling Upper bound Ant colony optimization Genetic algorithms Open systems

来源：评论

学校读者我要写书评

暂无评论

DHC: Distributed, hierarchical clustering in sensor networks

DHC: Distributed, hierarchical clustering in sensor networks

引用

作者： Ma, Xiu-Li Hu, Hai-Feng Li, Shuang-Feng Xiao, Hong-Mei Luo, Qiong Yang, Dong-Qing Tang, Shi-Wei School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Key Laboratory of Machine Perception Peking University Ministry of Education Beijing 100871 China Key Laboratory of High Confidence Software Technologies Peking University Ministry of Education Beijing 100871 China Department of Computer Science and Engineering Hong Kong University Science and Technology Clear Water Bay Kowloon Hong Kong Google China Beijing 100871 China

In many sensor network applications, it is essential to get the data distribution of the attribute value over the network. Such data distribution can be got through clustering, which partitions the network into contiguous regions, each of which contains sensor nodes of a range of similar readings. This paper proposes a method named Distributed, Hierarchical Clustering (DHC) for online data analysis and mining in senior networks. Different from the acquisition and aggregation of raw sensory data, DHC clusters sensor nodes based on their current data values as well as their geographical proximity, and computes a summary for each cluster. Furthermore, these clusters, together with their summaries, are produced in a distributed, bottom-up manner. The resulting hierarchy of clusters and their summaries facilitates interactive data exploration at multiple resolutions. It can also be used to improve the efficiency of data-centric routing and query processing in sensor networks. We also design and evaluate the maintenance mechanisms for DHC to make it be able to work on evolving data. Our simulation results on real world datasets as well as synthetic datasets show the effectiveness and efficiency of our approach. © 2011 Springer science+Business Media, LLC & science Press, China.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Leveraging Fragmental Semantic Data to Enhance Services Discovery

Leveraging Fragmental Semantic Data to Enhance Services Disc...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Jian Wang Jia Zhang Patrick C.K. Hung Zheng Li Jianxiao Liu Keqing He State Key Laboratory of Software Engineering Computer School Wuhan University China Department of Computer Science Northern Illinois University USA University of Ontario Institute of Technology Canada

As one foundational technology of cloud computing, services computing is playing a critical role to enable provisioning of software as a service (SaaS). However, how to effectively and efficiently discover proper available services from the cloud of resources remains a big challenge. This paper reports our continuous efforts on semantic services discovery. We extend the Support Vector Machine (SVM)-based text clustering technique in the context of service-oriented categorization in a service repository, and propose an iterative process to incrementally enrich domain ontology. A popular Web 2.0 mashup platform is used as a testbed; and preliminary evaluation results are reported.

关键词： Semantics Support vector machines Ontologies Frequency domain analysis Unified modeling language Equations Vectors

来源：评论

学校读者我要写书评

暂无评论

On multicast throughput scaling of hybrid wireless networks with general node density

引用

computer Networks 2011年第15期55卷 3548-3561页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Yunhao Liu Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education China Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States TNLIST School of Software Tsinghua University China

In this paper, we consider hybrid wireless networks with a general node density λ ∈ [1, n ], where n ad hoc nodes are uniformly distributed and m base stations (BSs) are regularly placed in a square region A ( n , A ) = 1 , A × 1 , A with A ∈ [1, n ]. We focus on multicast sessions in which each ad hoc node as a user chooses randomly d ad hoc nodes as its destinations. Specifically, when d = 1 (or d = n − 1), a multicast session is essentially a unicast (or broadcast) session. We study the asymptotic multicast throughput for such a hybrid wireless network according to different cases in terms of m ∈ [1, n ] and d ∈ [1, n ], as n → ∞. To be specific, we design two types of multicast schemes, called hybrid scheme and BS - based scheme , respectively. For the hybrid scheme, there are two alternative routing backbones : sparse backbones and dense backbones . Particularly, according to different regimes of the node density λ = n A , we derive the thresholds in terms of m and d . Depending on these thresholds, we determine which scheme is preferred for the better performance of network throughput.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Diagnosis of software Models with Multiple Levels of Abstraction Using Ontological Metamodeling

Diagnosis of Software Models with Multiple Levels of Abstrac...

引用

IEEE Annual International computer software and Applications Conference (COMPSAC)

作者： Nophadol Jekjantuk Jeff Z. Pan Yuzhong Qu Department of Computing Science University of Aberdeen UK State Key Laboratory for Novel Software Technology Nanjing University China

Ontology reasoning and reasoning-based search expansion are powerful tools for semantic applications. In this paper, we investigate how to apply ontology reasoning, with different ontology metamodeling approaches, to diagnose software models, in particular on models with multiple levels software models, in particular on models with multiple levels of abstraction.

关键词： OWL Ontologies Metamodeling Cognition Semantics Unified modeling language software

来源：评论

学校读者我要写书评

暂无评论

An algorithm application in intrusion forensics based on improved information gain

An algorithm application in intrusion forensics based on imp...

引用

2011 3rd Symposium on Web Society, SWS2011

作者： Jia, Xian Liu, Peiyu Gong, Wei Chi, Xuezhi School of Information Science and Engineering Shandong Normal University Ji'nan 250014 China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Ji'nan 250014 China Basic Education Department Shandong Police College Ji'nan 250014 China

ISBN: (纸本)9781457702112

As a kind of feature selection algorithm applied widely in intrusion forensics, information gain could solve the problem of high-dimension and magnanimous, but it neglects correlation between features, which could lead to the redundancy of features, and affect the speed and accuracy of intrusion forensics. So an improved information gain algorithm based on feature redundancy was proposed. In the improved algorithm, the irrelevant and redundant features were removed through adding the judgments of redundancy between features, which effectively simplified feature subset. The classical KDD CUP 99 dataset is used in the experiments and the results show that the new algorithm can effectively select features, ensure detection accuracy and improve processing speed. © 2011 IEEE.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Extending lifetime of sensor surveillance systems in data fusion model

Extending lifetime of sensor surveillance systems in data fu...

引用

IEEE Conference on Wireless Communications and Networking

作者： Xiang Cao Xiaohua Jia Guihai Chen State Key Laboratory of Novel Software Technology Nanjing University Nanjing China Department of Computer Science City University of Hong Kong Hong Kong China

A critical aspect of the sensor surveillance systems is the network lifetime. Sensors are often battery-powered and they have limited energy constraint. Therefore, it is crucial to extend the network lifetime. However, most existing schemes which extend the lifetime of sensor surveillance systems are based on simplistic sensing models (e.g., the disc model) which do not capture the signal attenuation and the collaboration among sensors. In practice, data fusion has been adopted in a number of sensor systems to improve sensing performance. In this paper, we investigate how to extend the lifetime of sensor surveillance systems in data fusion model. Given a set of sensors and a set of targets in a plane, each target needs to be monitored all the time. The problem of our concern is to schedule the sensors to monitor all the targets, such that the lifetime of this surveillance system is extended. The network lifetime is defined as the time duration when each target is monitored. Our work takes the fact that signal attenuates as the distance increases into consideration. We propose two heuristic algorithms to organize sensors into nondisjoint cover sets and activate them successively. Extensive simulations have been conducted to demonstrate the performance of the algorithms.

关键词： Sensors Linear programming Data models Heuristic algorithms Surveillance Collaboration

来源：评论

学校读者我要写书评

暂无评论

Web Service Discovery Based on User Requirements

Web Service Discovery Based on User Requirements

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Lei Xu Baowen Xu Lianjie Chen Hongji Yang Department of Computer Science and Technology State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Computer Science and Engineering Southeast University Nanjing China School of Computing De Montfort University Leicester UK

With the rapid development of Web services, Web service discovery becomes a significant challenge in the matching precision and efficiency. In this paper, we present a novel method in the view of users' requirements for Web Service discovery. We set up the requirement model firstly, so as to present users' requirements in details, then cluster the Web Services due to users' common requirements, and obtain corresponding Web services' QoS values. Thus, users can find their really needed Web services in an ordered list. The case study indicates the effect of our method, namely, in the view of users' requirements, we sort the candidate Services due to their functions and their QoS attributes in descending order.

关键词： Web services Quality of service Monitoring Time factors Availability Semantics Educational institutions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：