检索结果-南通市图书馆

Data classification from the inverse nth power gravitation

在线全文

学校读者我要写书评

暂无评论

science china(information sciences) 2012年第1期55卷 184-190页

作者： XU HuaRong1,WANG XiaoDong1,ZENG ZhiQiang1&FANG Qiu2 1department of computer science and Technology,Xiamen university of Technology,Xiamen 361024,china 2department of Mechanical Engineering,Xiamen university of Technology,Xiamen 361024,china 1. department of computer science and Technology Xiamen University of Technology Xiamen 361024 China2. Department of Mechanical Engineering Xiamen University of Technology Xiamen 361024 China

By the inverse nth power gravitation in physics,a novel classifier for data classification,called the I-n-PG classifier,is *** the I-n-PG model,training samples from each class are regarded as a system of particles and an I-n-PG field is defined for each class.A test sample belongs to the class whose particle system has the maximum I-n-PG to this test *** on large numbers of real data show that the I-n-PG classifier can provide a good classification *** with the nearest neighbor classifier and SVM,performances of the I-n-PG classifier are always superior/close to the better one of them,and thus the I-n-PG classifier has also a wide range of adaptability to data sets.

关键词： data classification inverse nth power gravitation

SUPERCONVERGENCES OF THE ADINI'S ELEMENT FORSECOND ORDER EQUATION

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computational Mathematics 1999年第6期17卷 569-574页

作者： Ping Luo(department of computer science and Technology, Qinghua university, Beijing 100084,china)Qun Lin(Institute of Systems science, Academia Sinica, Beijing, 100080, china) Tsing Hua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Acad Sinica Inst Syst Sci Beijing 100080 Peoples R China

n this papers the asymptotic error expansions of Adini's element for the secondorder imhomogeneous Neumann problem are given and the superconvergence estimations are obtained. Moreover, a numerical example to support ... 详细信息

关键词： Adini's element Superconvergence estimation Asymptotic expansion.

Selection of unitary operations in quantum secret sharing without entanglement

在线全文

学校读者我要写书评

暂无评论

science china(information sciences) 2011年第9期54卷 1837-1842页

作者： XU Juan 1,CHEN HanWu 1,LIU WenJie 1,2 & LIU ZhiHao 1 1 School of computer science and Engineering,Southeast university,Nanjing 210096,china 2 School of computer and Software,Nanjing university of information science and Technology,Nanjing 210044,china 1. School of computer science and Engineering Southeast University Nanjing 210096 China2. School of Computer and Software Nanjing University of Information Science and Technology Nanjing 210044 China

We propose a substitute-Bell-state attack strategy for quantum secret sharing schemes without entanglement,as well as a definition of the minimum failure probability of such attack strategy.A quantitative analysis of security degrees corresponding to different unitary operations is also provided,when the secret sharing schemes without entanglement are stricken by substitute-Bell-state *** a result,the relation between the selection of unitary operations and the effect of substitute-Bell-state attack is shown,which can serve as an important guidance for the selection of unitary operations in designing and implementing quantum secret sharing schemes.

关键词： quantum secret sharing substitute-Bell-state attack unitary operation minimum failure probability

Approximation algorithms for indefinite complex quadratic maximization problems

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china Mathematics 2010年第10期53卷 2697-2708页

作者： HUANG Yongwei1,& ZHANG Shuzhong2 1department of Electronic and computer Engineering,The Hong Kong university of science and Technology,Kowloon,Hong Kong,china 2department of Systems Engineering and Engineering Management,The Chinese university of Hong Kong,Shatin,Hong Kong,china 1. department of Electronic and computer Engineering The Hong Kong University of Science and Technology Kowloon Hong Kong China2. Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Shatin Hong Kong China

In this paper,we consider the following indefinite complex quadratic maximization problem: maximize zHQz,subject to zk ∈ C and zkm = 1,k = 1,...,n,where Q is a Hermitian matrix with trQ = 0,z ∈ Cn is the decision vector,and m *** (1/log n) approximation algorithm is presented for such ***,we consider the above problem where the objective matrix Q is in bilinear form,in which case a 0.7118 cos mπ 2approximation algorithm can be *** the context of quadratic optimization,various extensions and connections of the model are discussed.

关键词： indefinite Hermitian matrix randomized algorithms approximation ratio semidefinite programming relaxation

(2,n)secret sharing scheme for gray and color images based on Boolean operation

在线全文

学校读者我要写书评

暂无评论

science china(information sciences) 2012年第5期55卷 1151-1161页

作者： DONG Lin 1,WANG DaoShun 1,LI ShunDong 2 & DAI YiQi 1 1 department of computer science and Technology,Tsinghua university,Beijing 100084,china 2 School of computer science,Shaanxi Normal university,Xi'an 710062,china 1. department of computer science and Technology Tsinghua University Beijing 100084 China2. School of Computer Science Shaanxi Normal University Xi’an 710062 China

Traditional secret sharing (SS) schemes can reconstruct the secret precisely,but have high com-putation *** secret sharing (VSS) schemes use human visual system to reconstruct the secret without cryptographic computation,but have pixel expansion and loss of *** et *** a (2,n)-SS scheme for binary images based on Boolean operation,which has low computation complexity,no pixel expansion and the contrast is 1/*** this paper,we first construct an r runs (2,n)-SS scheme to improve the contrast of Wang et al.'s binary (2,n)-SS *** we present two approaches to construct r runs (2,n)-SS schemes for grayscale image and color *** two approaches are both based on Boolean operation,while one approach uses halftone technology and the other uses bit level *** proposed schemes have low computation complexity and almost ideal contrast.

关键词： secret sharing scheme Boolean operation halftone contrast

An improved approach to the efficient construction of and search operations in motion graphs

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(information sciences) 2012年第5期55卷 1042-1051页

作者： GAO Yan 1,CHEN ZhiHua 2,CHEN MinGang 3 & SHEN Yang 3 1 Software Engineering Institute,East china Normal university,Shanghai 200062,china 2 department of computer science and Engineering,East china university of science and Technology,Shanghai 200237,china 3 department of computer science and Engineering,Shanghai Jiao Tong university,Shanghai 200240,china 1. Software Engineering Institute East China Normal University Shanghai 200062 China2. Department of Computer Science and Engineering East China University of Science and Technology Shanghai 200237 China3. Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China

Motion graphs have been widely used as an effective technique in the synthesis of human *** synthesize well-formed motions,motion graphs require smooth transitions and good ***,the time and costs grow quadratically as the graph size *** this paper,we present a method to set up a hierarchical structure,called a structure *** coarse level of this graph models different motion categories and their transitions,and the fine level mainly captures different motion *** interpolation space method is used to improve the graph connectivity at the fine *** structure guides the establishment of a faster and more realistic graphical *** the building process,this structure also helps with searching the motion graph,by performing a traverse search and placing the findings into a direct look-up table or local search ***,when there is no direct link between the different motions,a navigation map is introduced to conduct an appropriate search path via a series of transition motion *** experimental results indicate that our approach could lower the computation time in construction and searching,while simultaneously providing a richer variety of motion styles.

关键词： motion graph structure table registration curve motion interpolation

DMM:A dynamic memory mapping model for virtual machines

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(information sciences) 2010年第6期53卷 1097-1108页

作者： CHEN HaoGang1,WANG XiaoLin1,WANG ZhenLin2,ZHANG BinBin1,LUO YingWei1* & LI XiaoMing11department of computer science,Peking university,Beijing 100871,china 2department of computer science,Michigan Technological university,Houghton,MI 49931,USA 1. department of computer science Peking University Beijing 100871 China2. Department of Computer Science Michigan Technological University Houghton MI 49931 USA

Memory virtualization is an important part in the design of virtual machine monitors(VMM).In this paper,we proposed dynamic memory mapping(DMM) model,a mechanism that allows the VMM to change the mapping between a virtual machine's physical memory and the underlying hardware resource while the virtual machine is *** utilizing DMM,the VMM can implement many novel memory management policies,such as Demand Paging,Swapping,Ballooning,Memory Sharing and Copy-On-Write,while preserving compatibility with various *** modular and hierarchical property of the DMM model efficiently incorporates the high-level policies and the low-level implementations,leading to a feature-adjustable VMM *** presented the principle of the DMM model,and explained the procedures of various memory management policies under this ***,we implement the DMM model in KVM,an open source *** evaluation shows that the DMM model is efficient enough to provide the benefits of dynamic memory resource management with little performance impact.

关键词： virtual machine monitor Xen virtual machine memory virtualization dynamic memory mapping

FINITE ELEMENT APPROXIMATION OF EIGENVALUE PROBLEM FOR A COUPLED VIBRATION BETWEEN ACOUSTIC FIELD AND PLATE

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computational Mathematics 1997年第3期15卷 265-278页

作者： L. Deng T. Kako(department of computer science and information Mathematics, The university of Electro-Communications, Japan) UNIV ELECTROCOMMUN DEPT COMP SCI & INFORMAT MATHCHOFUTOKYO 182JAPAN

We formulate a coupled vibration between plate and acoustic field in mathematically rigorous fashion. It leads to a non-standard eigenvalue problem. A finite element approximation is considered in an abstract way, and the approximate eigenvalue problem is written in an operator form by means of some Ritz projections. The order of convergence is proved based on the result of Babugka and Osborn. Some numerical example is shown for the problem for which the exact analytical solutions are calculated. The results shows that the convergence order is consistent with the one by the numerical analysis.

关键词： FINITE ELEMENT APPROXIMATION OF EIGENVALUE PROBLEM FOR A COUPLED VIBRATION BETWEEN ACOUSTIC FIELD AND PLATE

Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints

在线全文

学校读者我要写书评

暂无评论

science china(information sciences) 2010年第5期53卷 885-895页

作者： LIU JingFa1& LI Gang2 1School of computer and Software, Nanjing university of information science & Technology, Nanjing 210044, china 2School of Mathematics and Physics, Nanjing university of information science & Technology, Nanjing 210044, china 1. School of computer and Software Nanjing University of Information Science & Technology Nanjing 210044 China2. School of Mathematics and Physics Nanjing University of Information Science & Technology Nanjing 210044 China

With the background of the satellite module layout design, the circular packing problem with equilibrium behavioral constraints is a layout optimization problem and NP-hard problem in math. For lack of a powerful optimization method, this problem is hard to solve. The energy landscape paving (ELP) method is a class of stochastic global optimization algorithms based on the Monte Carlo sampling. Based on the quasiphysical strategy and the penalty function method, the problem is converted into an unconstrained optimization problem. Here by combining the improved ELP method, the gradient method based on local search and the heuristic configuration update mechanism, a new global search algorithm, basin filling algorithm, is put forward. The numerical results show that the proposed algorithm is effective to solving the circular packing problem with equilibrium behavioral constraints, and is easy to be popularized to other layout optimization problems.

关键词： equilibrium behavioral constraints packing problem layout optimization