检索结果-南通市图书馆

Analysis of moment invariants under general linear transformation

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information sciences) 2010年第7期53卷 1305-1311页

作者： DIAO LuHong1, LI Hua2, ZHANG Sen1 & LIU Lei1 1College of Applied sciences, beijing University of technology, beijing 100124, china 2National Center of intelligent computing, institute of computing technology, chinese academy of Science, beijing 100080, china College of Applied sciences Beijing University of Technology National Center of intelligent computing Institute of Computing Technology Chinese Academy of Science

This paper presents the necessary and sufficient condition of moment invariants under general linear transformation. Based on this condition, arbitrary order and dimensional moment invariant sets can be constructed. D... 详细信息

关键词： moment invariants independence linear transformation

A Restarted Conjugate Gradient Method for Ill-posed Problems

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2003年第1期19卷 31-40页

作者： Yan-fei Wanglaboratory of Remote Sensing information sciences, {3. of Remote Sensing Applications, chinese academy of sciences, P.O. Box 9718, beijing 100101, chinaState key laboratory of Scientific and Engineering computing, {3. of Computational Mathematics and Scientific/Engineering computing, chinese academy of sciences, P.O. Box 2719,{13., china laboratory of Remote Sensing information sciences Institute of Remote Sensing Applications Chinese Academy of Sciences Beijing China State key laboratory of Scientific and Engineering computing Institute of Computational Mathematics and Scientific/Engineering computing Chinese Academy of Sciences Beijing China

Abstract This paper presents a restarted conjugate gradient iterative algorithm for solving ill-posed problems. The damped Morozov's discrepancy principle is used as a stopping rule. Numerical experiments are given to... 详细信息

关键词： keywords Ill-posed problems restarted CG damped discrepancy principle.

Strict constraints on 2D primitive pairs for engineering symbol recognition:Theory and application

在线全文

学校读者我要写书评

暂无评论

Science china(information sciences) 2012年第5期55卷 1032-1041页

作者： LI Ting 1,2,QIU XianJie 1,HUANG He 1 & WANG ZhaoQi 1 1 Virtual Reality laboratory,institute of computing {3. chinese academy of sciences,beijing 100190,china 2 Graduate University of chinese academy of sciences,beijing 100049,china Virtual Reality laboratory Institute of Computing Technology Chinese Academy of Sciences Graduate University of chinese academy of sciences

Geometric constraints on the line-line pair,line-arc pair and arcarc pair are *** con-straints are able to encode the geometric relations between lines,arcs and circles.A geometric proof is presented to demonstrate that the constraints are stable under translation,rotation,uniform scaling or reflection of the primitive *** on the constraints,an algorithm for recognizing symbols in drawings is ***-perimental results show that,compared with three other methods,our method can distinguish more primitive pairs and has higher accuracy in engineering symbol recognition.

关键词： coordinated multi-point transmission multicell cooperation capacity analysis MIMO-OFDM power allocation frequency selective MIMO channel

Paillier's trapdoor function hides Θ(n) bits

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information sciences) 2011年第9期54卷 1827-1836页

作者： SU Dong & Lü KeWei State key laboratory of information Security,Graduate University of{3.,beijing 100049,china State key laboratory of information Security Graduate University of Chinese Academy of Sciences Beijing China

In this paper,we re-examine the bit security of Paillier’s trapdoor *** show that given a random w=gcyN mod N2 ∈ZN2* the most significant bit of its class c is a hard-core predicate,under a standard assumption that is computing composite residuosity class is *** the simultaneous security,we prove that n number of the class c’s bits are simultaneously hard-core under the standard assumption,where n is the length of c.

关键词： Paillier’s trapdoor function hard-core predicate hard-core function simultaneous security most significant bit

Human knowledge acquisition from 3. interaction in virtual environments

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(information sciences) 2012年第7期55卷 1528-1540页

作者： CHENG Cheng,JIANG Ru & DONG XueMei beijing laboratory of intelligent {3. technology,School of Computer Science,beijing institute of technology,beijing 100081,china beijing laboratory of intelligent {3. technology School of Computer Science Beijing Institute of Technology Beijing China

Recently,virtual environment (VE) based design and planning,which is a kind of interaction intensive computing,has shown great *** users of such systems are specialists or technicians and their 3. interactions with the system embed a great deal of knowledge and ***,how to integrate human knowledge and skills into VE is a great challenge to researchers in the human computer interaction *** paper proposes a method for acquiring user knowledge from *** main ideas and work include,abstracting the interactive process and formalizing the interactive semantics,as well as providing a semantic model of an interactive information repository,from which user interactive processes can be retrieved and all kinds of application logics can be established.A virtual assembly planning system is introduced as an example of a practical application of this *** show that the related models can well capture user knowledge and retrieve the interaction process.

关键词： human computer interaction interactive semantics virtual environment temporal logic virtual manufacturing virtual assembly

The Constrained Solutions of Two Matrix Equations

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2002年第4期18卷 671-678页

作者： An Ping LIAO Zhong Zhi BAI Department of Mathematics. Hunan University. Changshu, 410082. P. R. china Department of Mathematics and information Science, Changsha University, Changsha 410003. P. R. china {3. of Mathematics and System. sciences. chinese academy of sciences. beijing 100080. P. R. china State key laboratory of Scientific/Engineering computing. chinese academy of sciences. institute of Computational Mathematics and Scientific/Engineering computing. {3. of Mathematics and System sciences. chinese academy of sciences. P. O. Box 2719. beijing 100080. P. R. china Department of Mathematics Hunan University Changsha P. R. China Department of Mathematics and information sciences Changsha University Changsha P. R. China academy of Mathematics and System sciences Chinese Academy of Sciences Beijing P. R. China State key laboratory of Scientific/Engineering computing Chinese Academy of Sciences Institue of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and System Sciences Chinese Academy of Sciences Beijing P. R. China

We study the symmetric positive semidefinite solution of the matrix equation AX_1A^T + BX_2B^T=C. where A is a given real m×n matrix. B is a given real m×p matrix, and C is a given real m×m matrix, with m, n, p positive integers: and the bisymmetric positive semidefinite solution of the matrix equation D^T XD=C, where D is a given real n×m matrix. C is a given real m×m matrix, with m. n positive integers. By making use of the generalized singular value decomposition, we derive general analytic formulae, and present necessary and sufficient conditions for guaranteeing the existence of these solutions.

关键词： Matrix equation Symmetric positive semidefinite matrix Bisymmetric positive semidefinite matrix

A NEW FAMILY OF TRUST REGION ALGORITHMS FOR UNCONSTRAINED OPTIMIZATION

在线全文

学校读者我要写书评

暂无评论

Journal of Computational Mathematics 2003年第2期21卷 221-228页

作者： Yuhong Dai Dachuan Xu(State key laboratory of Scientific/Engineering computing, {3. of Computational Mathematicsand Scientific/Engineering computing, academy of Mathematics and System sciences, chineseacademy of sciences, P.O. Box 2719, beijing 100080, china) institute of Computational Mathematics and Scientific/Engineering computing Academy of Mathematics and System Sciences Chinese Academy of Sciences State Key Laboratory of Scientific/Engineering Computing 北京 100080

Trust region (TR) algorithms are a class of recently developed algorithms for nonlinear optimization. A new family of TR algorithms for unconstrained optimization, which is the extension of the usual TR method, is presented in this paper. When the objective function is bounded below and continuously, differentiable, and the norm of the Hesse approximations increases at most linearly with the iteration number, we prove the global convergence of the algorithms. Limited numerical results are reported, which indicate that our new TR algorithm is competitive.

关键词： trust region method global convergence quasi-Newton method unconstrained optimization nonlinear programming.

Mechanical decision for a class of integral inequalities

在线全文

学校读者我要写书评

暂无评论

Science china(information sciences) 2010年第9期53卷 1800-1815页

作者： YANG Lu1,3.YU WenSheng1,2* & YUAN RuYi2 1Shanghai key laboratory of Trustworthy computing,Software Engineering {3.,East china Normal University,Shanghai 200062,china 2The key laboratory of Complex Systems and Intelligence Science,{3. of Automation,chinese academy of sciences,beijing 100190,china 3.1} for Automated Reasoning and Programming,Chengdu {3. of Computer Applications,chinese academy of sciences,Chengdu 610041,china Shanghai key laboratory of Trustworthy computing Software Engineering Institute East China Normal University The key laboratory of Complex Systems and Intelligence Science Institute of Automation Chinese Academy of Sciences laboratory for Automated

A class of integral inequalities is transformed into homogeneous symmetric polynomial inequalities beyond Tarski model,where the number of elements of the polynomial,say n,is also a variable and the coefficients are functions of *** is closely associated with some open problems formulated recently by Yang et *** Timofte's dimension-decreasing method for symmetric polynomial inequalities,combined with the inequality-proving package BOTTEMA and a program of implementing the method known as successive difference substitution,we provide a procedure for deciding the nonnegativity of the corresponding polynomial inequality such that the original integral inequality is mechanically decidable;otherwise,a counterexample will be *** effectiveness of the algorithm is illustrated by some more examples.

关键词： integral inequality symmetric polynomial inequality Timofte’s dimension-decreasing method successive difference substitution mechanical decision inequality-proving package BOTTEMA

Cascade recursion models of computing the temperatures of underground layers

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science china(Technological sciences) 2006年第Z2期49卷 30-38页

作者： HAN Liqun, BI Siwen & SONG Shixin School of information Engineering, beijing technology and Business University, beijing 10003., china State key laboratory of Remote Sensing Science, institute of Remote Sensing Applications, chinese academy of sciences, beijing 100101, china beijing Technol & Business Univ Sch Informat Engn Beijing 100037 Peoples R China chinese Acad Sci Inst Remote Sensing Applicat State Key Lab Remote Sensing Sci Beijing 100101 Peoples R China

An RBF neural network was used to construct computational models of the underground temperatures of different layers, using ground-surface parameters and the temperatures of various underground layers. Because series recursion models also enable researchers to use above-ground surface parameters to compute the temperatures of different underground layers, this method provides a new way of using thermal infrared remote sensing to monitor the suture zones of large areas of blocks and to research thermal anomalies in geologic structures.

关键词： RBF network, underground temperature, modeling, cascade, recursion.