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

Automatic Web service composition based on Horn clauses and Petri nets

Expert systems with Applications 2011年第10期38卷 13024-13031页

作者： Tang, Xianfei Jiang, Changjun Zhou, Mengchu Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States

This paper introduces an automatic Web service composition method based on logical inference of Horn clauses and Petri nets. The Web service composition problem is transformed into the logical inference problem of Horn clauses by exploring the dependency relations among services. An algorithm is presented, to determine whether the composite service exists in time that is linear in the size of the knowledge base. It can also return the rule set necessary for the composition. Petri nets are chosen to model the rule set and its structural analysis techniques are used to obtain the composite service. © 2010 Elsevier Ltd. All rights reserved.

关键词： Automatic reasoning Knowledge base Petri nets service composition Web service

来源：评论

学校读者我要写书评

暂无评论

Reader activation scheduling in multi-reader RFID systems: A study of general case

Reader activation scheduling in multi-reader RFID systems: A...

引用

25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011

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

ISBN: (纸本)9780769543857

Radio frequency identification (RFID) is a technology where a reader device can "sense" the presence of a close by object by reading a tag device attached to the object. To guarantee the coverage quality, multiple RFID readers can be deployed in the given region. In this paper, we consider the problem of activation schedule for readers in a multi-reader environment. In particular, we try to design a schedule for readers to maximize the number of served tags per time-slot while avoiding various interferences. We first develop a centralized algorithm under the assumption that different readers may have different interference and interrogation radius. Next, we propose a novel algorithm which does not need any location information of the readers. Finally, we extend the previous algorithm in distributed manner in order to suit the case where no central entity exists. We conduct extensive simulations to study the performances of our proposed algorithm. And our evaluation results corroborate our theoretical analysis. © 2011 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Neurological rehabilitation of stroke patients via motor imaginary-based brain-computer interface technology

引用

Neural Regeneration Research 2011年第28期6卷 2198-2202页

作者： Hongyu Sun Yang Xiang Mingdao Yang Department of Computer Science and Technology Tongji University Shanghai 201804 China College of Information and Electrical Engineering Shandong University of Science and Technology China Key Laboratory of Embedded System and Service Computing Ministry of Education of the People＇s Republic of China Tongji University Shanghai 201804 China Qingdao Economic ＆ Technical Development Area First People＇s Hospital Qingdao 266555 Shangdong Province China

The present study utilized motor imaginary-based brain-computer interface technology combined with rehabilitation training in 20 stroke patients. Results from the Berg Balance Scale and the Holden Walking Classification were significantly greater at 4 weeks after treatment （P 〈 0.01）, which suggested that motor imaginary-based brain-computer interface technology improved balance and walking in stroke patients.

关键词： brain-computer interface motor cortex neuronal plasticity rehabilitation stroke neural regeneration

来源：评论

学校读者我要写书评

暂无评论

A three-stage method to find refining schedules of crude oil operations in refinery

A three-stage method to find refining schedules of crude oil...

引用

2011 IEEE International Conference on service Operations, Logistics and Informatics, SOLI 2011

作者： Wu, Naiqi Bai, Liping Zhou, Mengchu School of Mechatronics Engineering Guangdong University of Technology Guangzhou 510090 China MoE Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 200092 China ECE NJIT Newark NJ 07 102 United States

ISBN: (纸本)9781457705731

A short-term scheduling problem for crude oil operations is highly challenging. There lack efficient techniques and software tools for its solution. Our prior research shows that it may be solved in a hierarchical way. At the upper level, we find a realizable refining schedule to optimize concerned objectives. At the lower level, a detailed schedule is obtained to realize it. This work attempts to present a three-stage method to solve the the upper level problem from a control perspective. The first stage solves a linear programming problem to determine the maximal production rate. The second one solves a transportation problem to optimally assign crude oil types and volume to the distillers. The last one adjusts and sequences oil parcels. Consequently, the proposed method is computationally efficient. An industrial case study is presented to show the result. © 2011 IEEE.

关键词： Crude oil

来源：评论

学校读者我要写书评

暂无评论

Automatic power-aware reconfiguration of processor resource in virtualized clusters

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2011年第7期48卷 1123-1133页

作者： Jin, Hai Deng, Li Wu, Song Shi, Xuanhua Zhou, Like Key Laboratory of Services Computing Technology and System Huazhong University of Science and Technology Ministry of Education Wuhan 430074 China Key Laboratory of Cluster and Grid Computing of Hubei Province Huazhong University of Science and Technology Wuhan 430074 China

Virtualization provides significant benefits of system maintenance, load balancing, fault tolerance, and power-saving in clusters or data centers. It also enables dynamic reconfiguration of computing resource for application environment. However, current dynamic resource control approaches mainly focus on how to satisfy the application-level quality of service (QoS) when application workloads vary with time. They are driven by application performance, which is often specific to certain class of applications and also weakens the response capability of control systems. In this paper, a resource-use-status-driven resource reconfiguration scheme (RUSiC) is presented to automatically adapt to dynamic workload changes to meet the demands of application performance. According to the new characteristics introduced by system virtualization, the scheme is designed to be a two-layer resource reconfiguration model to exactly grasp the demands of applications. Based on real resource use status, the scheme adjusts proper resource configuration for applications in time. Furthermore, the scheme introduces power-saving into resource reconfiguration process and avoids considerable unnecessary power and cooling consumption by reducing the number of active physical nodes in a new resource configuration. Experiments demonstrate that the scheme can quickly detect and respond to shifting resource demands as application workloads change over time.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Virtual machine VCPU scheduling in the multi-core environment: Issues and challenges

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2011年第7期48卷 1216-1224页

作者： Jin, Hai Zhong, Alin Wu, Song Shi, Xuanhua Key Laboratory of Services Computing Technology and System Huazhong University of Science and Technology Ministry of Education Wuhan 430074 China Key Laboratory of Cluster and Grid Computing of Hubei Province Huazhong University of Science and Technology Wuhan 430074 China

The policies and mechanisms of VCPU (virtual CPU) scheduling in a virtual machine system are key factors to determine the system performance. Because the architecture of the software stack in the virtual machine system is different from the traditional computer systems, when scheduling the VCPUs in virtual machines, simply adopting scheduling strategies and algorithms of existing operating systems without any modifications can lead to drastic degradation of the system performance. Moreover, with the multi-core technology being employed for physical processors, the complexity of the VCPU scheduling is increased. Firstly, the architecture of the virtual machine system and its two-stage scheduling framework are depicted and analyzed in detail in this paper. Because the deterministic mapping relationship between application threads and physical cores is difficult to establish in the two-stage framework, and part functions of operating systems move down to virtual machine monitor, VCPU scheduling will confront many problems and challenges that mainly embody four aspects: the semantic gap between guest operating systems and a virtual machine monitor, the synchronization mechanisms in a multiprocessor operating system, the structure of shared cache in multi-core processors and emerging asymmetric multi-core structure. And then advantages and limitations of the existing solutions for these problems are discussed and analyzed deeply, and suggestions for further researches are presented.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Reliable web services selection based on finite state machine model

引用

Information technology Journal 2011年第9期10卷 1662-1672页

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

Dynamically selecting suitable Web services (WSs) is crucial to users in Web services Composition (WSC). Generally, most works regard a Web service (WS) as the basic unit and compose the composite WS (CWS) end to end. However, a WS may comprise multiple operations that are invoked in sequence and the selection of WSs according to the model still is a NP problem. In this study, the WSs consist of some operations and then WSs selection problem is formalized as a Finite State Machine (FSM) process. This study proposed an algorithm to create the WSC Tree (WSCT), in which each path from root to leaf node is a feasible WSC execution path. Then, a heuristic algorithm is proposed to realize the selection of WSs based on the WSCT. The advantage of heuristic algorithm is that it can address the selection problem without traversing the whole WSCT but it still spends much time in the construction of the WSCT. So, in order to further decrease the time of selection, a backtracking algorithm is presented to select a feasible execution path without generating WSCT. At last, experiments show that heuristic algorithm is more effective than exhaustive method and the backtracking algorithm spend the less time than heuristic algorithm, the reliability of WSC execution path selected by backtracking algorithm can satisfy the requirement of users. So, this study proposed an algorithm to select a feasible WSC execution path within a reasonable time. © 2011 Asian Network for Scientific Information.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An efficient and flexible task management for many cores

An efficient and flexible task management for many cores

引用

作者： Yuan, Nan Yu, Lei Fan, Dong-Rui Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University of Chinese Academy of Sciences Beijing 100039 China

ISBN: (纸本)9783642245671

This paper presents the design and implementation of a runtime system (named "GodRunner") on Godson-T many-core processor to support task-level parallelism efficiently and flexibly. GodRunner abstracts underlying hardware resource, providing ease-of-use programming interface. A two-grade task management mechanism is proposed to support both coarse-grained and fine-grained multithreading efficiently. Two load-balanced scheduling policies are combined flexibly in GodRunner. The software-controlled task management makes GodRunner more configurable and extensible than hard-wired ones. The experiment shows that the tasking overhead in GodRunner is as small as hundreds of cycles, which is about the hundreds of times faster than the conventional Pthread based multithreading on a SMP machine. Furthermore, our approach scales well and supports fine-grained tasks as small as 20k cycles optimally. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

MUSIZ: A generic framework for music resizing with stretching and cropping 11

MUSIZ: A generic framework for music resizing with stretchin...

引用

19th ACM International Conference on Multimedia ACM Multimedia 2011, MM'11

作者： Zhang, Liu Wang, Chaokun Ba, Yiyuan Wang, Hao Wang, Jianmin Department of Computer Science and Technology Tsinghua University China School of Software Tsinghua University Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology China Key Laboratory for Information System Security Ministry of Education China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS China

ISBN: (纸本)9781450306164

Content-aware music adaption, i.e. music resizing, in temporal constraints starts drawing attention from multimedia communities because of the need of real-world scenarios, e.g. animation production and radio advertisement production. The goal of music resizing is to change the length of a music track to a user preferred length using a series of basic operations, e.g. compression, prolonging, cropping and repeating. The only existing music resizing approach so far, called LyDAR, suffers from some limitations. For example, it cannot support prolonging a music track and cannot compress music pieces with very small stretch rates. In this paper, we propose MUSIZ, a generic framework for MUsic reSIZing. Observing the diversity of quality degradation for different segments, we propose the concept of stretch-resistance to measure the degree of quality degradation after a segment is stretched. MUSIZ stretches high stretch-resistance segments intensively and relieves low stretch-resistance segments to reduce the negative impact on the stretched music piece. For short length resizing requests, we develop a contiguity-preservative cropping algorithm to remove segments before stretching, while smoothing the abrupt change at the joint between two segments. Comprehensive experimental results show that MUSIZ is superior to the existing approaches. © 2011 ACM.

关键词： stretch-resistance music retargeting music resizing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：