检索结果-南通市图书馆

Communication network designing:Transmission capacity,cost and scalability

science china(Information sciences) 2012年第11期55卷 2454-2465页

作者： ZHANG GuoQiang1,2,3 & ZHANG GuoQing1 1Institute of Computing technology,Chinese Academy of sciences,Beijing 100190,china 2school of computer science and technology,nanjing normal university,nanjing 210046,china 3Provincial Key Laboratory for computer Information Processing technology,Soochow university,Suzhou 215000,china Institute of Computing technology Chinese Academy of Sciences Beijing China school of computer science and technology Nanjing Normal University Nanjing China Provincial Key Laboratory for computer Information Processing technology Soochow University Suzhou China

Despite the growing number of works centering around the traffic dynamics on complex networks,these researches still have some common shortcomings,e.g.,too simple traffic flow model and lack of considerations for the designing cost and scalability *** paper builds on a more realistic traffic flow model,and offers a holistic view on the network designing *** addition to the extensively studied transmission capacity,this paper takes designing cost and scalability as two other designing objectives,and presents a quantitative study of how different designing choices independently and collectively influence these objectives by the introduction of a cartesian coordinate *** is shown that different kinds of network topologies display different shapes of achievable solution spaces and exhibit different abilities to achieve cost-effective and scalable *** particular,we find the philosophy underlying empirical network designing and engineering today fails to meet the cost-effective and scalable designing requirements,and propose a cost-effective and scalable designing scheme for BA-like networks,i.e.,the efficient routing combined with effective betweenness based link bandwidth *** addition,when designing a thoroughly new network from the beginning,we find that ER network is a good candidate to achieve cost-effective and scalable designing in most settings.

关键词： cost-effective communication network designing network transmission efficiency network topology traffic dynamics next generation network scalable network designing

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

ENSO signals and their spatial-temporal variation characteristics recorded by the sea-level changes in the northwest Pacific margin during 1965-2005

引用

science china Earth sciences 2009年第5期52卷 869-882页

作者： YUAN LinWang,YU ZhaoYuan,XIE ZhiRen,SONG ZhiYao & Lü GuoNian school of Geographical science,nanjing normal university,nanjing 210046,china school of Geographical science Nanjing Normal University Nanjing China

Sea-level is closely linked to the Earth's climate and its change is important as a metric for global and regional climate change. Identifying, extracting, and revealing such information through detailed analysis is the prerequisite for understanding the mechanisms of sea-level change. The monthlyaverage tide-change records reported and examined in this paper are from 10 tide gauge stations distributed in the northwest margin of the Pacific Ocean, registered during the period 1965-2005. In particular, we have utilized the Second Order Blind Identification (SOBI) method to identify and the Empirical Mode Decomposition (EMD) method to extract the El Nio-Southern Oscillation (ENSO) signals imprinted in those tide gauge records; and subsequently, we have investigated the spa-tial-temporal characteristics of the extracted ENSO signals using wavelet analysis methods. The following results are obtained: (1) the ENSO events recorded by each tide gauge series are of different types and intensity, which show considerable temporal-spatial variation characteristics, with sea-level responses to ENSO signals remarkably stronger in low latitude areas than in medium-high latitude areas; (2) due to the influences of ocean currents, topographical conditions, and other factors, there exist variations in the type of relationship between the sea-level changes and the recorded ENSO events at different latitudes; (3) sea-level changes can also denote scale-variation characteristics of ENSO events, and particularly, since 1980s, all the tide gauges located south of Kanmen show intense responses to ENSO and the timescale of ENSO events extended gradually from around 4 years to 2-8 years, reflecting variations in the intensity and frequency of ENSO events; and (4) reverse changes of certain scale were noted before and after strong ENSO events recorded by sea-level changes, supporting the research findings about the interaction (mutual coupling and superimposition) between the probability of

关键词： sea level change ENSO SOBI cross wavelet spectrum wavelet coherence

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

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 school of computer and Software Nanjing University of Information Science & Technology Nanjing China school of Mathematics and Physics Nanjing University of Information Science & Technology Nanjing 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

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Characterizations of α-Bloch functions on the unit ball without use of derivative

引用

science china Mathematics 2008年第11期51卷 1965-1981页

作者： CHEN HuaiHui school of Mathematics and computer science, nanjing normal university, nanjing 210097, china school of Mathematics and computer science Nanjing Normal University Nanjing China

In this paper we establish characterizations of α-Bloch functions on the unit ball without use of derivative, which are stronger, more precise and general than those obtained by Nowak and Zhao.

关键词： α-Bloch function unit ball Bergman metric

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A relative local variational principle for topological pressure

引用

science china Mathematics 2010年第6期53卷 1491-1506页

作者： MA XianFeng1,CHEN ErCai2,3,& ZHANG AiHua2,4 1Department of Mathematics,East china university of science and technology,Shanghai 200237,china 2school of Mathematics and computer science,nanjing normal university,nanjing 210097,china 3Center of Nonlinear science,nanjing university,nanjing 210093,china 4College of Mathematics and Physics,nanjing university of Posts and Telecommunications,nanjing 210046,china Department of Mathematics East China University of Science and Technology Shanghai China school of Mathematics and computer science Nanjing Normal University Nanjing China Center of Nonlinear science Nanjing University Nanjing China College of Mathematics and Physics Nanjing University of Posts and Telecommunications Nanjing China

We define the relative local topological pressure for any given factor map and open cover,and prove the relative local variational principle of this *** precisely,for a given factor map π:(X,T)→(Y,S) between two topological dynamical systems,an open cover U of X,a continuous,real-valued function f on X and an S-invariant measure ν on Y,we show that the corresponding relative local pressure P(T,f,U,y) satisfies sup μ∈M(X,T){ hμ(T,U|Y)+∫X f(x)dμ(x) :πμ=ν}=∫Y P(T,f,U,y)dν(y),where M(X,T) denotes the family of all T-invariant measures on ***,the supremum can be attained by a T-invariant measure.

关键词： pressure conditional entropy relative local variational principle

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A new heuristic algorithm for the circular packing problem with equilibrium constraints

引用

science china(Information sciences) 2011年第8期54卷 1572-1584页

作者： LIU JingFa 1,2,LI Gang 3 & GENG HuanTong 1 1 school of computer and Software,nanjing university of Information science & technology,nanjing 210044,china 2 Network Information Center,nanjing university of Information science & technology, nanjing 210044,china 3 school of Mathematics and Physics,nanjing university of Information science & technology,nanjing 210044,china school of computer and Software Nanjing University of Information Science & Technology Nanjing China Network Information Center Nanjing University of Information Science & Technology Nanjing China school of Mathematics and Physics Nanjing University of Information Science & Technology Nanjing China

The circular packing problem with equilibrium constraints is an optimization problem about simplified satellite module layout design.A heuristic algorithm based on tabu search is put forward for solving this *** algorithm begins from a random initial configuration and applies the gradient method with an adaptive step length to search for the minimum energy *** jump out of the local minima and avoid the search doing repeated work,the algorithm adopts the strategy of tabu *** the process of tabu search,we improve the traditional neighboring solutions,tabu objects and the acceptance criteria of the current solution *** test two sets of benchmarks consisting of 11 representative instances from the current *** numerical results show that the proposed algorithm breaks the records in seven out of 11 instances,and obtains the optimal solutions for the other four instances.

关键词： equilibrium constraints packing problem heuristic algorithm tabu search layout optimization

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

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 school of computer science and Engineering Southeast University Nanjing China school of computer and Software Nanjing University of Information Science and Technology Nanjing 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

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

ON MAXIMAL MATCHINGS OF CONNECTED GRAPHS

引用

Acta Mathematica Scientia 2004年第4期24卷 603-607页

作者：许宝刚 school of Mathematics and computer science Nanjing Normal University Nanjing 210097 Chinaet I with |I| = k be a matching of a graph G (briefly I is called a k-matching). If I is not a proper subset of any other matching of G then I is a maximal k-matching and m(gk G) is used to denote the number of maximal k-matchings of G. Let gk be a k-matching of G if there exists a subset {e1 e2… ei} of E(G) \ gk i (?)1 such that (1) for any j ∈{1 2…i} gk + {ej} is a (k + l)-matching of G (2) for any f ∈E(G) \ (gk ∪{e1 e2…ei}) gk + {f} is not a matching of G then gk is called an i wings k-matching of G and mi(gkG) is used to denote the number of i wings k-matchings of G. In this paper it is proved that both mi(gkG) and m(gkG) are edge reconstructible for every connected graph G and as a corollary it is shown that the matching polynomial is edge reconstructible.

Let I with |I| = k be a matching of a graph G (briefly, I is called a k-matching). If I is not a proper subset of any other matching of G, then I is a maximal k-matching and m(gk, G) is used to denote the number of maximal k-matchings of G. Let gk be a k-matching of G, if there exists a subset {e1, e2,…, ei} of E(G) \ gk, i (?)1, such that (1) for any j ∈ {1, 2,…,i}, gk + {ej} is a (k + l)-matching of G; (2) for any f ∈ E(G) \ (gk ∪ {e1,e2,…,ei}), gk + {f} is not a matching of G; then gk, is called an i wings k-matching of G and mi(gk,G) is used to denote the number of i wings k-matchings of G. In this paper, it is proved that both mi(gk,G) and m(gk,G) are edge reconstructible for every connected graph G, and as a corollary, it is shown that the matching polynomial is edge reconstructible.

关键词： wings matching reconstruction

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Research on heart sound identification technology

引用

science china(Information sciences) 2012年第2期55卷 281-292页

作者： CHENG XieFeng1,3,MA Yong2,LIU Chen1,ZHANG XueJun1 & GUO YuFeng11school of Electronic science and Engineering,nanjing university of Posts and Telecommunications,nanjing 210003,china 2school of computer science and technology,nanjing university of science and technology,nanjing 210094,china 3Key Lab of Broudbard Wireless Communication and Sensor Network technology(nanjing university of Posts and Telecommunications),Ministry of Education,nanjing 210094,china school of Electronic science and Engineering Nanjing University of Posts and Telecommunications Nanjing China Ministry of Education Key Lab of Broudbard Wireless Communication and Sensor Network Technology (Nanjing University of Posts and Telecommunications) Nanjing China school of computer science and technology Nanjing University of Science and Technology Nanjing China

In this article,both the basic principles and the experimental methods of identity recognition technology based on heart sounds are ***,the characteristics of heart sounds and the feasibility of heart sounds as a biometric were analyzed.A synthetic model of heart sounds was then developed based on a family of wavelets;Finally,the characteristic parameters of heart sounds were extracted by using the heart sounds linear band frequency cepstra(HS-LBFC)with a specified configuration,and the similarity distance was adopted for heart sound *** highlight the difference in two heart sound signals between the time and frequency domains,a construction method of the heart sound wavelet,a calculation method of the parameters of a synthetic model,selection of the characteristic parameters of heart sounds and the corresponding data processing technology were *** experimental results showed that the proposed method exhibited excellent performance and practicability.

关键词： biometric wavelet family of heart sounds synthetic model of heart sounds heart sounds linear band frequency cepstra(HS-LBFC)

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Manifold contraction for semi-supervised classification

引用

science china(Information sciences) 2010年第6期53卷 1170-1187页

作者： HU EnLiang 1,2 , CHEN SongCan 1 & YIN XueSong 1 1 school of computer science & Engineering, nanjing university of Aeronautics & Astronautics, nanjing 210016, china 2 school of Mathematics, Yunnan normal university, Kunming 650092, china school of computer science & Engineering Nanjing University of Aeronautics & Astronautics Nanjing China school of Mathematics Yunnan Normal University Kunming China

The generalization ability of classification is often closely related to both the intra-class compactness and the inter-class *** to the fact that many current dimensionality reduction methods, regarded as a pre-processor, often lead to the poor classification performance on real-life data, in this paper, a new data preprocessing technique called manifold contraction(MC) is proposed for the classification-oriented learning *** main motivation behind MC lies in seeking a proper mapping of contracting the given multiple-manifold data such that the ratio of the intra-class to the inter-class scatters is ***, in order to properly control the contraction level in MC, an adaptive MC(AMC) criterion is developed in the semi-supervised *** to its generality, MC can be not only applied in original space and reproducing kernel Hilbert space(RKHS), but also easily incorporated with dimensionality reduction method for further improvement of classification *** final experimental results show that MC, as a data preprocessor, is effective and promising in the subsequent classification learning, especially in small-size labeled sample case.

关键词： manifold learning dimensionality reduction lower-dimensional embedding semi-supervised learning classification manifold contraction adaptive manifold contraction

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：