检索结果-南通市图书馆

Mean size formula of wavelet subdivision tree on Heisenberg group

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 2008年第3期23卷 303-312页

作者： WANG Guo-mao Department of Mathematics,Zhejiang university,hangzhou 310027,China Department of Mathematics,hangzhou dianzi university,hangzhou 310018,China. Department of Mathematics Zhejiang University Hangzhou 310027 China Department of Mathematics Hangzhou Dianzi University Hangzhou 310018 China

The purpose of this paper is to investigate the mean size formula of wavelet packets （wavelet subdivision tree） on Heisenberg group. The formula is given in terms of the p-norm joint spectral radius. The vector refinement equations on Heisenberg group and the subdivision tree on the Heisenberg group are discussed. The mean size formula of wavelet packets can be used to describe the asymptotic behavior of norm of the subdivision tree.

关键词： Heisenberg group wavelet packets subdivision tree joint spectral radius stability

Effective generalized equations of secure hyperelliptic curve digital signature algorithms

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2010年第2期17卷 100-108,115页

作者： YOU Lin ,SANG Yong-xuan College of Communication Engineering,hangzhou dianzi university,hangzhou 310018,China [a] College of Communication Engineering Hangzhou Dianzi University Hangzhou 310018 China

A hyperelliptic curve digital signature algorithm （HECDSA） can be viewed as the hyperelliptic curve analogue of the standard digital signature algorithm （DSA）. This article discusses divisor evaluations, the basic HECDSA, variants, two HECDSA equations and a 4-tuple HECDSA scheme, and puts forward a generalized equation for HECDSA. From this generalized equation, seven general HECDSA types are derived based on the efficiency requirements. Meanwhile, the securities of these general HECDSA types are analyzed in detail.

关键词： hyperelliptic curve digital signature algorithm generalized equation hyperelliptic curve discrete logarithm problem

Control problems of an age-dependentpredator-prey system

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 2009年第3期24卷 253-262页

作者： HE Ze-rong WANG Hai-tao Institute of Operational Research and Cybernetics,hangzhou dianzi university,hangzhou 310018,China Institute of Operational Research and Cybernetics Hangzhou Dianzi University Hangzhou 310018 China

This paper is concerned with optimal harvesting problems for a system consisting oftwo populations with age-structure and interaction of predator-prey. Existence and uniquenessof non-negative solutions to the system and the continuous dependence of solutions on controlvariables are investigated. Existence of optimal policy is discussed, optimality conditions arederived by means of normal cone and adjoint system techniques.

关键词： predator-prey optimal control species age-structure maximum principle

On optimal binary signed digit representations of integers

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 2010年第3期25卷 331-340页

作者： WU Ting ZHANG Min DU Huan-qiang WANG Rong-bo College of Computer Science, hangzhou dianzi university, hangzhou 310018, China College of Computer Science Hangzhou Dianzi University Hangzhou China

Binary signed digit representation （BSD-R） of an integer is widely used in computer arithmetic, cryptography and digital signal processing. This paper studies what the exact number of optimal BSD-R of an integer is ... 详细信息

关键词： Optimal binary signed digit representation non-oxljacent form Fibonacci numbers.

Networked Kalman filtering with combined constraints of bandwidth and random delay

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2012年第10期55卷 2343-2357页

作者： GE QuanBo 1,2,WEN ChengLin 1 & XU TingLiang 1 1 School of Automation,hangzhou dianzi university,hangzhou 310018,China 2 State Key Laboratory of Industrial Control Technology,Zhejiang university,hangzhou 310027,China 1. School of Automation Hangzhou Dianzi University Hangzhou 310018 China2. State Key Laboratory of Industrial Control Technology Zhejiang University Hangzhou 310027 China

Kalman filter is a powerful tool in target tracking and self-localization across wireless sensor networks with many *** paper considers the filters design for networked systems with combined constraints of bandwidth and random delay,and proposes a kind of universal networked Kalman estimator for given linear time invariant(LTI) or determinate parameters(DP) systems,which are also called linear and determinate parameters(LDP) systems ***,two modeling ways to treat bit quantization error vector are given and the corresponding LDP systems taken after bit quantization are ***,we introduce an equivalent weighted summation form of the conventional linear Kalman filter,which fully uses two essential characteristics,namely offline computation property from the LDP systems and linear weighted summation property from the linear minimum mean square error ***,by adopting the replacement and innovation compensation operations,a kind of integrated networked estimator,involving two estimation algorithms with different modeling ways to bit quantization error actually,is presented based on the weighted summation filter for random delay *** proposed universal networked estimation algorithms have some outstanding advantages such as extensive application,concise algorithm structure,high estimate accuracy,and good running *** examples are demonstrated to validate the proposed networked estimation algorithms.

关键词： Kalman filter LDP systems LMMSE limited bandwidth random delay

Interpolating triangular meshes by Loop subdivision scheme

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2010年第9期53卷 1765-1773页

作者： DENG ChongYang1* & WANG GuoZhao2 1Institute of Applied Mathematics and Engineering Computations,hangzhou dianzi university,hangzhou 310018,China 2Department of Mathematics,Zhejiang university,hangzhou 310027,China 1. Institute of Applied Mathematics and Engineering Computations Hangzhou Dianzi University Hangzhou 310018 China2. Department of Mathematics Zhejiang University Hangzhou 310027 China

Using the limit point formula of the Loop subdivision scheme,we propose a very simple and efficient method for constructing interpolation surface of triangular meshes by Loop subdivision *** excellent properties of the method are:(1) Locality:the perturbation of a given vertex only influences the surface shape near this vertex.(2) Efficiency:the locations of new points can be computed with explicit formulae.(3) Easiness in implementation:only the geometric rule of the first step should be modified.(4) Freedom:for each edge,there is one degree of freedom to adjust the shape of the interpolation surface.(5) Easiness in generalization:it is easy to generalize our method to other approximation subdivision schemes with explicit formulae to compute limit point.

关键词： computer aided geometric design subdivision surface approximating subdivision scheme Loop surface surface interpolating

Conditional Entropy of Partitions on Quantum Logic

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Communications in Theoretical Physics 2007年第7期48卷 11-13页

作者： ZHAO Yue-Xu Institute of Applied Mathematics and Engineering Computation,hangzhou dianzi university,hangzhou 310018,ChinaMA Zhi-Hao Department of Mathematics,Shanghai Jiao Tong university,Shanghai 200240,China Institute of Applied Mathematics and Engineering Computation Hangzhou Dianzi University Hangzhou 310018 China

A construction of conditional entropy of partitions on quantum logic is given,and the properties ofconditional entropy are investigated.

关键词： state density operator projector conditional entropy quantum logic lattice

METHOD FOR QUICKLY INFERRING THE MECHANISMS OF LARGE-SCALE COMPLEX NETWORKS BASED ON THE CENSUS OF SUBGRAPH CONCENTRATIONS

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2009年第2期22卷 252-259页

作者： Bo YANG Xiaorong CHEN Management School Hangzhou Dianzi University Hangzhou 310018 China. Antai College of Economies and Management Shanghai Jiaotong University Shanghai 200030 China.

A Mechanism-Inferring method of networks exploited from machine learning theory caneffectively evaluate the predicting performance of a network *** existing method for inferringnetwork mechanisms based on a census of subgraph numbers has some drawbacks,especially the needfor a runtime increasing strongly with network size and network *** this paper,an improvedmethod has been proposed by introducing a census algorithm of subgraph *** can be quickly inferred by the new method even though the network has large scale andhigh ***,the application perspective of mechanism-inferring method has been extendedinto the wider fields of large-scale complex *** applying the new method to a case of proteininteraction network,the authors obtain the same inferring result as the existing method,which approvesthe effectiveness of the method.

关键词： Large-scale complex networks mechanism-inferring model evaluation subgraph census.

N-way blending problem of circular quadrics

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2010年第8期53卷 1546-1554页

作者： FANG MeiE 1,3 , Wang GuoZhao 2 & MA WeiYin 3 1 School of Computer Science, hangzhou dianzi university, hangzhou 310081, China 2 Department of Mathematics, Zhejiang university, hangzhou 310018, China 3 Department of MEEM, City university of Hong Kong, Hong Kong, China 1. School of Computer Science Hangzhou Dianzi University Hangzhou 310081 China3. Department of MEEM City University of Hong Kong Hong Kong China2. Department of Mathematics Zhejiang University Hangzhou 310018 China

A method of blending circular quadrics with parametric patches is proposed in this paper. It needs n rational bi-cubic B′ezier patches and two S-patches to blend n (n > 2) quadrics. Bi-cubic rational B′ezier patches are used to G 1 -continuously blend each pair of adjacent base surfaces. These patches enclose two n-sided holes. And an S-patch is used to fill each hole, which keeps nearly G 1-continuity. Explicit formulas of control points for both B′ezier patches and S-patches are derived from their constraint conditions, which make modeling by blending quadrics very simple and convenient. In addition, the shapes of the blending surfaces can be intuitively adjusted by free parameters.

关键词： circular quadrics blending n-way S-patch