检索结果-南通市图书馆

Exact Solutions of Non-isospectral sine-Gordon Equation with Self-consistent Sources

在线全文

学校读者我要写书评

暂无评论

Communications in Theoretical Physics 2007年第12期48卷 971-978页

作者： BI Jin-Bo~1 The school of science,{2.,hangzhou 310018,chinaZHANG Da-Jun Department of Mathematics,Shanghai university,Shanghai 2.0444,china The school of science Hangzhou Dianzi University Hangzhou 310018 China Department of Mathematics Shanghai University Shanghai 200444 China

The non-isospectral sine-Gordon equation with self-consistent sources is *** solutions are obtainedby means of Hirota method and Wronskian technique,***-isospectral dynamics including one-solitoncharacteristics,two-so... 详细信息

关键词： soliton equations with self-consistent sources bilinear method exact solutions

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, {2., hangzhou 310081, china 2.Department of Mathematics, Zhejiang university, hangzhou 310018, china 3 Department of MEEM, City university of Hong Kong, Hong Kong, china school of Computer science Hangzhou Dianzi University Hangzhou China Department of MEEM City University of Hong Kong Hong Kong China Department of Mathematics Zhejiang University Hangzhou 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

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 31002.,{2. Department of Mathematics,hangzhou dianzi university,hangzhou 310018,{2.. Department of Mathematics Zhejiang University Hangzhou China Department of Mathematics Hangzhou Dianzi University Hangzhou 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

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,{2. 310018,china 2.State Key Laboratory of Industrial Control Technology,Zhejiang university,{2. 31002.,china school of Automation Hangzhou Dianzi University Hangzhou China State Key Laboratory of Industrial Control Technology Zhejiang University Hangzhou 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

Generative computer simulation for parallel layout of multi-story row house cluster

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Technological sciences) 2010年第7期53卷 1785-1791页

作者： DING XiYing1,2.1 Zhenjianguniversity, hangzhou 310058, {2. 2.Zhejiang university of science & Technology, hangzhou 310058, {2. Zhenjiang university Hangzhou China Zhejiang university of science & Technology Hangzhou China

This study has established the functions between the environmental conditions and the inhabitants’ preferences for multi-story row house cluster with parallel layout, based on the data from the questionnaires’ in Beijing. A program has been written with multi-agent system and generative computer simulation approaches. The emergence candidate layout plans can be referenced and chosen by architects.

关键词： multi-agent system bottom up generative computer simulation multistory row house cluster parallel layout

(s,t,d)-bi-Koszul algebras

在线全文

学校读者我要写书评

暂无评论

science china Mathematics 2009年第11期52卷 2419-2431页

作者： SI JunRu Department of Mathematics,hangzhou dianzi university,hangzhou 310018,{2. Department of Mathematics Hangzhou Dianzi University Hangzhou China

The paper focuses on the 1-generated positively graded algebras with non-pure resolutions and mainly discusses a new kind of algebras called(s,t,d)-bi-Koszul algebras as the generalization of bi-Koszul algebras. An(s,t,d)-bi-Koszul algebra can be obtained from two periodic algebras with pure resolutions. The generation of the Koszul dual of an(s,t,d)-bi-Koszul algebra is discussed. Based on it,the notion of strongly(s,t,d)-bi-Koszul algebras is raised and their homological properties are further discussed.

关键词： bi-Koszul algebra periodic algebra pure resolution 16E05 16E40 16S37 16W50

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, {2. 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.

Lipschitz continuity of best approximations and Chebyshev centers

在线全文

学校读者我要写书评

暂无评论

Chinese science Bulletin 1998年第3期43卷 185-188页

作者： LI Chong 1 and WANG Xinghua 2.1. Center for Mathematical sciences, Zhejiang university, {2. 31002., china 2. Department of Mathematics, {2. university, {2. 31002., china Center for Mathematical sciences Zhejiang University Hangzhou China Department of Mathematics Hangzhou University Hangzhou China

The Lipschitz continuity results are given for best approximations and Chebyshev centers. Consequently, the open problem presented by Septycki and Vleck is solved completely.

关键词： best approximation Chebyshev center uniform convexity.

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,{2. 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