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

Verification of web service protocols by logic of knowledge

Journal of Information and Computational science 2011年第6期8卷 921-932页

作者： Chen, Qingliang Su, Kaile Cao, Ying Liu, Chanjuan School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Department of Computer Science Jinan University Guangzhou 510632 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200000 China Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia

Web services is a popular distributed systems technology and its effectiveness and efficiency rely badly on the underlying protocols. And web service protocols are designed in XML formats so the message structures within are quite different from the conventional ones. Therefore, the well-established formal verification techniques for conventional protocols, which have gained substantial achievements in practice, cannot be applied directly to them because of the inherently different syntax. In this paper, we propose a justification-oriented and automatic formal approach to verify, in the standard Dolev-Yao model, concerned security properties expressed as epistemic notions, i. e., logic of knowledge, for web service protocols, based on a fault-preserving mapping tool called SuD (SOAP under Dolev-Yao). Our approach is significant because, instead of finding flaws in finite number of protocol sessions, the specifications we are to verify can hold in arbitrary number of sessions. © 2011 Binary Information Press.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Polynomial-time hierarchy of computable reals

引用

Journal of Computational Information systems 2011年第4期7卷 1108-1115页

作者： Chen, Qingliang Su, Kaile Wu, Lijun Department of Computer Science Jinan University Guangzhou 510632 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Key Laboratory of High Confidence Software Technologies Ministry of Education Peking University Beijing China Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia School of Computer Science and Engineering University of Electronic Science and Technology Chengdu 610054 China

In mathematics, various representations of real numbers have been investigated and all these representations are proved to be mathematically equivalent. Furthermore, it is known that all effective versions of these representations lead to the same class of "computable real numbers". However, when subrecursive (such as primitive recursive) is taken into account, these representations can lead to different notions of "computable real numbers". This paper will look into the polynomial-time version of the problem for computable real numbers under different representations. We will summarize the known results to exhibit the comprehensive hierarchy they form. Our goal is to clarify systematically how the polynomial-time computability depends on the representations of the real numbers. Copyright © 2011 Binary Information Press.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Construction-and-extraction based index for images retrieval

IEEJ Transactions on Electronics, Information and Systems

引用

IEEJ Transactions on Electronics, Information and systems 2011年第7期131卷 1377-1383页

作者： Zhang, Junqi Ni, Lina Tian, Chunqi Gao, Shangce Tang, Zheng Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 200092 China College of Info Sci and Engi Shandong University of Science and Technology Qingdao 266510 China Department of Intellectual Information Systems Engineering University of Toyama Toyama-shi 930-8555 Japan

The past recent years have witnessed more and more applications on image retrieval. As searching a large image database is often costly, to improve the efficiency, high dimensional indexes may help. This paper proposes an adaptive hybrid index (AHI) supported by a construction-and-extraction technique to support image retrieval. First, the image clusters are further partitioned into sub-clusters to reduce the overlap between clusters and indexed into an iDistance index. Then, the query sampling statistically extracts some sub-cluster from the iDistance index into a sequential file. Finally, the users' queries are accurately returned by searching both the iDistance index and the sequential file. It's proved that the proposed AHI never performs worse than the sequential scan. Particularly, the experimental results demonstrate that the proposed index AHI is beneficial and achieves better performance than some exiting methods. It is about 2 times faster than iDistance, almost three times than Omni-sequential, more than four times faster than sequential file and more than 10 times faster than M-tree on the benchmark images set. The effect of the proposed AHI is also investigated by our implemented content based images retrieval system. © 2011 The Institute of Electrical Engineers of Japan.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Estimate-Piloted Regularization and Fast ALS Algorithm for Collaborative Filtering

Estimate-Piloted Regularization and Fast ALS Algorithm for C...

引用

International Conference on Future computer science and Education (ICFCSE)

作者： Zhenyue Zhang Keke Zhao Hongyuan Zha Guirong Xue Department of Mathematics State Key Laboratory of CAD&CG Zhejiang University China College of Computing Georgia Institute of Technology Atlanta GA USA Department of Computer Science Shanghai Jiao Tong University Shanghai China

Regularized Low-rank approximation with missing data is an effective approach for Collaborative Filtering since it generates high quality rating predictions for recommender systems. Alternative LS (ALS) method is one of the commonly used algorithms for the CF problem. However, ALS did not work very well in some applications, due to the over-fitting to observations. This paper proposes a novel estimate-piloted regularization that uses a pre-estimate of the unobserved entries and uses the approximation errors to the pre-estimates as a regularize term. This new regularization can reduce the risk of over-fitting and improve the approximation accuracy of ALS. We also proposed a fast implementation of the modified ALS method, which is also very suitable for parallel computing. The proposed algorithm PALS has higher accuracy than ALS for original model in three real-world data sets.

关键词： Testing Accuracy Training Least squares approximation Collaboration Estimation

来源：评论

学校读者我要写书评

暂无评论

Aggregation capacity of wireless sensor networks: Extended network case

Aggregation capacity of wireless sensor networks: Extended n...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Cheng Wang Changjun Jiang Yunhao Liu Xiang-Yang Li Shaojie Tang Huadong Ma Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China TNLIST School of Software Tsinghua University China Department of Computer Science Illinois Institute of Technology Chicago IL USA Department of Computer Science Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781424499199

A critical function of wireless sensor networks (WSNs) is data gathering. While, one is often only interested in collecting a relevant function of the sensor measurements at a sink node, rather than downloading all the data from all the sensors. This paper studies the capacity of computing and transporting the specific functions of sensor measurements to the sink node, called aggregation capacity, for WSNs. It focuses on random WSNs that can be classified into two types: random extended WSN and random dense WSN. All existing results about aggregation capacity are studied for dense WSNs, including random cases and arbitrary cases, under the protocol model (ProM) or physical model (PhyM). In this paper, we propose the first aggregation capacity scaling laws for random extended WSNs. We point out that unlike random dense WSNs, for random extended WSNs, the assumption made in ProM and PhyM that each successful transmission can sustain a constant rate is over-optimistic and unpractical due to transmit power *** derive the first result on aggregation capacity for random extended WSNs under the generalized physical model. Particularly, we prove that, for the type-sensitive perfectly compressible functions and type-threshold perfectly compressible functions, the aggregation capacities for random extended WSNs with n nodes are of order Θ ((log n) -β/2-1 ) and Θ (((log n) -β/2 )/(log log n)), respectively, where β >; 2 denotes the power attenuation exponent in the generalized physical model.

关键词： Wireless sensor networks Signal to noise ratio Interference Throughput Lattices Routing PROM

来源：评论

学校读者我要写书评

暂无评论

A translation framework for virtual execution environment on CPU/GPU architecture

A translation framework for virtual execution environment on...

引用

International Symposium on Parallel Architectures, Algorithms, and Programming

作者： Dong, Guoxing Chen, Kai Zhu, Erzhou Zhang, Yichao Qi, Zhengwei Guan, Haibing School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai 200240 China School of Information Security Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai 200240 China Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai 200240 China

ISBN: (纸本)9780769543123

GPUs are many-core processors with tremendous computational power. However, as automatic parallelization has not been realized yet, developing high-performance parallel code for GPUs is still very challenging. The paper presents a novel translation framework designed for virtual execution environment based on CPU/GPU architecture. It addresses two major challenges of taking advantage of general purpose computation on graphics processing units (GPGPU) to improve performance: no rewriting the existing source code and resolving binary compatibility issues between different GPUs. The translation framework uses semi-automatic parallelization technology to port existing code to explicitly parallel programming models. It not only offers a mapping strategy from X86 platform to CUDA programming model, but also synchronizes the execution between the CPU and the GPUs. The input to our translation framework is parallelizable part of the program within binary code. With an additional information related to the parallelizable part, the translation framework transforms the sequential code into PTX code and execute it on GPUs. Experimental results on several programs from CUDA SDK Code Samples and Parboil Benchmark Suite show that our translation framework could achieve very high performance, even up to several tens of times speedup over the X86 native version. © 2010 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

General capacity scaling of wireless networks

General capacity scaling of wireless networks

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Shaojie Tang Panlong Yang Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA TNLIST School of Software Tsinghua University China People''s Liberation Army University of Science and Technology China

We study the general scaling laws of the capacity for random wireless networks under the generalized physical model. The generality of this work is embodied in three dimensions denoted by (λ ∈ [1, n], n d ∈ [1, n], n s ∈ (1, n]). It means that: (1) We study the random network of a general node density λ ∈ [1, n], rather than only study either random dense network (RDN, λ = n) or random extended network (REN, λ = 1) as in the literature. (2) We focus on the multicast capacity to unify unicast and broadcast capacities by setting the number of destinations for each session as a general value n d ∈ [1, n]. (3)We allow the number of sessions changing in the range n s ∈ (1, n], rather than assume that n s = Θ(n) as in the *** derive the general lower bounds on the capacity for the arbitrary case of (λ, n d , n s ). Particularly, we show that for the special cases (λ = 1, n d ∈ [1, n], n s = n) and (λ = n, n d ∈ [1, n], n s = n), our schemes achieve the highest multicast throughputs proposed in the existing works.

关键词： Roads Routing Throughput Lattices Schedules Mathematical model

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

AMT-PSO: An adaptive magnification transformation based particle swarm optimizer

引用

IEICE Transactions on Information and systems 2011年第4期E94-D卷 786-797页

作者： Zhang, Junqi Ni, Lina Xie, Chen Tan, Ying Tang, Zheng Department of Computer Science and Technology Tongji University Ministry of Education Shanghai 200092 China College of Info Sci and Engi Shandong University of Science and Technology Qingdao China Key Laboratory of Machine Perception Department of Machine Intelligence School of Electronics Engineering and Computer Science Beijing 100871 China Department of Intellectual Information Systems Engineering University of Toyama Toyama-shi 930-8555 Japan

This paper presents an adaptive magnification transformation based particle swarm optimizer (AMT-PSO) that provides an adaptive search strategy for each particle along the search process. Magnification transformation is a simple but very powerful mechanism, which is inspired by using a convex lens to see things much clearer. The essence of this transformation is to set a magnifier around an area we are interested in, so that we could inspect the area of interest more carefully and precisely. An evolutionary factor, which utilizes the information of population distribution in particle swarm, is used as an index to adaptively tune the magnification scale factor for each particle in each dimension. Furthermore, a perturbation-based elitist learning strategy is utilized to help the swarm's best particle to escape the local optimum and explore the potential better space. The AMT-PSO is evaluated on 15 unimodal and multimodal benchmark functions. The effects of the adaptive magnification transformation mechanism and the elitist learning strategy in AMT-PSO are studied. Results show that the adaptive magnification transformation mechanism provides the main contribution to the proposed AMT-PSO in terms of convergence speed and solution accuracy on four categories of benchmark test functions. © 2011 The Institute of Electronics, Information and Communication Engineers.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Analytic Approximations for Soliton Solutions of Short-Wave Models for Camassa-Holm and Degasperis-Procesi Equations

引用

Communications in Theoretical Physics 2010年第6期53卷 1027-1034页

作者：杨沛陈勇李志斌 Department of Computer Science East China Normal University Shanghai Key Laboratory of Trustworthy Computing East China Normal University

In this paper, the short-wave model equations are investigated, which are associated with the Camassa- Holm （CH） and Degasperis Procesi （DP） shallow-water wave equations. Firstly, by means of the transformation of the independent variables and the travelling wave transformation, the partial differential equation is reduced to an ordinary differential equation. Secondly, the equation is solved by homotopy analysis method. Lastly, by the transformatioas back to the original independent variables, the solution of the original partial differential equation is obtained. The two types of solutions of the short-wave models are obtained in parametric form, one is one-cusp soliton for the CH equation while the other one is one-loop soliton for the DP equation. The approximate analytic solutions expressed by a series of exponential functions agree well with the exact solutions. It demonstrates the validity and great potential of homotopy analysis method for complicated nonlinear solitary wave problems.

关键词： Homotopy analysis method Camassa Holm equation Degasperis-Procesi equation soliton

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：