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

Multi-symplectic method for the coupled Schr(o)dinger-KdV equations

中国物理B（英文版） 2014年第8期23卷 226-232页

作者： Zhang Hong Song Song-He Zhou Wei-En Chen Xu-Dong Department of Mathematics and System Science College of Science National University of Defense Technology Changsha 410073 China Department of Mathematics and System Science College of Science National University of Defense Technology Changsha 410073 China State Key Laboratory of High Performance Computing National University of Defense Technology Changsha 410073 China

In this paper, we present a multi-symplectic Hamiltonian formulation of the coupled Schr?dinger-KdV equations (CSKE) with periodic boundary conditions. Then we develop a novel multi-symplectic Fourier pseudospectral (MSFP) scheme for the CSKE. In numerical experiments, we compare the MSFP method with the Crank–Nicholson (CN) method. Our results show high accuracy, effectiveness, and good ability of conserving the invariants of the MSFP method.

关键词： coupled Schr(o)dinger-KdV equations multi-symplectic Fourier pseudospectral method

来源：评论

学校读者我要写书评

暂无评论

Average vector field methods for the coupled Schr(o)dinger-KdV equations

引用

中国物理B（英文版） 2014年第7期23卷 242-250页

作者： Zhang Hong Song Song-He Chen Xu-Dong Zhou Wei-En Department of Mathematics and System Science College of Science National University of Defense Technology Changsha 410073 China Department of Mathematics and System Science College of Science National University of Defense Technology Changsha 410073 China State Key Laboratory of High Performance Computing National University of Defense Technology Changsha 410073 China

The energy preserving average vector field (AVF) method is applied to the coupled Schr?dinger–KdV equations. Two energy preserving schemes are constructed by using Fourier pseudospectral method in space direction discretization. In order to accelerate our simulation, the split-step technique is used. The numerical experiments show that the non-splitting scheme and splitting scheme are both effective, and have excellent long time numerical behavior. The comparisons show thatthesplittingschemeisfasterthanthenon-splittingscheme, butitisnotasgoodasthenon-splittingschemeinpreserving the invariants.

关键词： coupled Schr(o)dinger-KdV equations average vector field method splitting method Fourier pseudospectral method

来源：评论

学校读者我要写书评

暂无评论

Convolution-based means of gradient for fast eye center localization

Convolution-based means of gradient for fast eye center loca...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Hai-Bin Cai Hui Yu Chun-Yan Yao Shen-Yong Chen Hong-Hai Liu School of Computing University of of Portsmouth UK College of Computer Science Zhejiang University of Technology China College of Mechanical Engineering Zhejiang University of Technology China State Key Laboratory of Mechanical System and Vibration Shanghai Jiao Tong University China

ISBN: (纸本)9781467372220

Localizing eye center is primary challenge for application-s involving gaze estimation, face recognition and human machine interaction. The challenge is caused by significant variability of eye appearance in illumination, shape, color, viewing angle and dynamics, and computation related issues. In this paper, we propose a convolution-based means of gradient method to efficiently and accurately locate the eye center in low resolution images. Priority of enhancing its computation is achieved by the use of FFT transform and fewer identified pixels of circular boundary of potential eye centres. The proposed algorithm is validated in the research database platform of BioID face database. The experimental results confirm that the proposed outperforms the-state-of-art methods and its potential in real-time eye gaze tracking related applications.

关键词： Convolution Eye center location Gradients Iris center location Convolution Eye Gradient mean gradient Human machine interaction

来源：评论

学校读者我要写书评

暂无评论

Explicit Multi-Symplectic Splitting Methods for the Nonlinear Dirac Equation

引用

Advances in Applied Mathematics and Mechanics 2014年第4期6卷 494-514页

作者： Yaming Chen Songhe Song Huajun Zhu Department of Mathematics and System Science and State Key Laboratory of High Performance Computing National University of Defense TechnologyChangsha 410073China State Key Laboratory of Aerodynamics China Aerodynamics Research and Development CenterMianyang 621000China

In this paper,we propose two new explicit multi-symplectic splitting methods for the nonlinear Dirac(NLD)*** on its multi-symplectic formulation,the NLD equation is split into one linear multi-symplectic system and one nonlinear infinite Hamiltonian *** multi-symplectic Fourier pseudospectral method and multi-symplectic Preissmann scheme are employed to discretize the linear subproblem,*** the nonlinear subsystem is solved by a symplectic ***,a composition method is applied to obtain the final schemes for the NLD *** find that the two proposed schemes preserve the total symplecticity and can be solved *** experiments are presented to show the effectiveness of the proposed methods.

关键词： Nonlinear Dirac equation multi-symplectic method splitting method explicit method

来源：评论

学校读者我要写书评

暂无评论

Construction algorithms for index model based on Web page classification

引用

Journal of Computational Information systems 2014年第2期10卷 655-664页

作者： Zhang, Yangjie Yan, Chungang Wang, Pengwei Sun, Haichun Department of Computer Science and Technology Tongji University Shanghai 201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

Web pages on the Internet are massive, diverse, heterogeneous and redundant. How to organize and manage them effectively is an urgent problem. In this paper, we propose a method to index web pages and build an index model based on web page classification and hyperlink analysis. First, an initialization algorithm is given to construct an index model for an initial set of web pages. Then, considering the dynamics of web pages on the Internet, we propose an incremental updating algorithm which can update an index model incrementally. Through theoretical analysis, the complexity of proposed algorithms shows linear relationships with the scale of web pages and their growth. The experimental results show that initialization algorithm can construct an index model for a fixed number of web pages relatively fast, while the incremental updating algorithm can satisfy the update speed of web pages on the Internet. Thus, the proposed algorithms are feasible and effective. The constructed index model can provide supports for diversified information service systems to enable them to make better use of web resources and provide more valuable services to users. Copyright © 2014 Binary Information Press.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

An Interrupt Scheduling Mechanism of Virtual Network Interface Card for Xen-Based system

An Interrupt Scheduling Mechanism of Virtual Network Interfa...

引用

2015 5th International Conference on Computer Sciences and Automation Engineering(ICCSAE 2015)

作者： Liuzheng Lu Runze Wan Jinrong He School of Computer Hubei University of Education Co-Innovation Centre of Elementary Education Information Technology Services of Hubei Science Computing and Intelligent Information Processing of Guangxi Higher Education Key Laboratory Guangxi Teachers Education University

As one of typical paravirtualization hypervisors, Xen has received widespread attentions especially its scaling capability under some kinds of workload. In this paper, we focus on the problem that the most CPU resources are occupied by frequent interrupt from the NIC（Network Interface Card） and it will cause bottleneck of the system for Xen. To alleviate this problem, this paper proposes an adaptive interrupt latency scheduling mechanism based on XEN, which use the polling or interrupt method in accordance with the queue length of virtual buffer without supplementing any additional processing unit. Also, the method can guarantee different quality of service to some extent by means of the definition of the two types of priority virtual buffers. Simulation results show that the mechanism can reduce CPU overhead significantly and improve system performance effectively.

关键词： virtualization interrupt latency virtual buffer

来源：评论

学校读者我要写书评

暂无评论

A method to calculate recommendation trust of web services

Journal of Software Engineering

引用

Journal of Software Engineering 2014年第2期8卷 108-115页

作者： Liu, Wei Du, Yu-Yue Yan, Chun Sha, Jing College of Information Science and Engineering Shandong University of Science and Technology Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

Web services are widely accepted and used in the e-commerce. Trust plays an important role in selecting one Web service for application among many services satisfying the demand of requesters and trust for Web services is a hot topic in research fields. This study proposes a method to calculate recommendation trust of Web services and the weight of every recommender is confirmed by norm grey correlation analysis method. The detailed process of the given method is revealed by a specific instance. The method avoids the vicious recommendation and improves the reliability of selected services. © 2014 Academic Journals Inc.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

An optimized Apriori algorithm based on sparse matrix for intrusion detection

引用

Open Cybernetics and systemics Journal 2014年第1期8卷 8-11页

作者： Zeng, Xiaohui Lv, Jingxiang Li, Jingzhong Luo, Wenlang Dept. of Computer Science and Technology Jinggangshan University Ji’an China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

The original Apriori algorithm is widely used in the intrusion detection field, but it may consume incredible computing resources in the process of handling network packets. We propose our optimized-Apriori algorithm which can greatly improves the algorithm efficiency by means of reducing the data storage space and the number of frequent item sets. We take full advantage of the characteristics of sparse matrix to save storage space and shorten the running time. The experimental results show that our optimized-Apriori algorithm can make a larger progress in saving the storage space of network data to be processed, even shortening nearly half of the data mining time in the process of intrusion detection. © Zeng et al.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Autonomic Performance and Power Control on Virtualized Servers:Survey, Practices, and Trends

引用

Journal of Computer Science & technology 2014年第4期29卷 631-645页

作者：周笑波蒋昌俊 IEEE ACM Department of Computer Science University of Colorado Colorado Springs U.S.A. The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University CCF Department of Computer Science and Technology Tongji University

Modern datacenter servers hosting popular Internet services face significant and multi-facet challenges in performance and power control. The user-perceived performance is the result of a complex interaction of complex workloads in a very complex underlying system. Highly dynamic and bursty workloads of Internet services fluctuate over multiple time scales, which has a significant impact on processing and power demands of datacenter servers. High-density servers apply virtualization technology for capacity planning and system manageability. Such virtuMized computer systems are increasingly large and complex. This paper surveys representative approaches to autonomic performance and power control on virtualized servers, which control the quality of service provided by virtualized resources, improve the energy efficiency of the underlying system, and reduce the burden of complex system management from human operators. It then presents three designed self-adaptive resource management techniques based on machine learning and control for percentile-based response time assurance, non-intrusive energy-efficient performance isolation, and joint performance and power guarantee on virtualized servers. The techniques were implemented and evaluated in a testbed of virtualized servers hosting benchmark applications. Finally, two research trends are identified and discussed for sustainable cloud computing in green datacenters.

关键词： autonomic computing joint performance and power control virtualized server Internet application sustainable computing

来源：评论

学校读者我要写书评

暂无评论

Visual Pop-can detection method based on adaboost

Visual Pop-can detection method based on adaboost

引用

3rd International Conference on Manufacturing Engineering and Process, ICMEP 2014

作者： Lin, Xin Yi Xue, Yan Bing Guo, Bao Hong Key Laboratory of Computer Vision and System Ministry of Education University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China

ISBN: (纸本)9783038350842

This paper puts forward a visual method of detecting pop-cans based on AdaBoost Algorithm. This method, is basing on the idea of AdaBoost Algorithm, and we use Haar Feature and LBP Feature to extract pop-can characteristics respectively. Finally we compare the differences of the training processes and the experiment results between these two detectors. It shows that these pop-can detectors that are trained by this visual method have high detection rate and speed. © (2014) Trans Tech Publications, Switzerland.

关键词： Adaptive boosting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：