检索结果-南通市图书馆

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 3.rovincial key laboratory for computer information Processing technology,{12.,suzhou 2.5000,china 1. Institute of Computing technology Chinese Academy of Sciences Beijing 100190 China2. School of Computer Science and Technology Nanjing Normal University Nanjing 210046 China3. Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou 215000 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

A multicast routing algorithm with multiple trees

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2005年第2期16卷 426-432页

作者： Cui Xunxue 1,2 , Gao Wei3 & Fang Hongyu41. New Star Research Institute of Applied technology, Hefei 230031, P. R. china 2. Jiangsu key laboratory of computer information Processing technology,soochow university, suzhou 215006, P. R. china 3. Department of Electronic Engineering and information Science,university of Science and technology of china, Hefei 230027, P. R. china 4. School of Electronic Science and technology, Anhui university, Hefei 230039, P. R. china New Star Research Institute of Applied technology Hefei 230031 P. R. China 2. Jiangsu key laboratory of computer information Processing technology Soochow University Suzhou 215006 P. R. China Department of Electronic Engineering and information Science University of Science and Technology of China Hefei 230027 P. R. China School of Electronic Science and technology Anhui University Hefei 230039 P. R. China

Quality of service (QoS) multicast routing has continued to be a very important research topic in the Internet. A method of multicast routing is proposed to simultaneously optimize several parameters based on multiobjective genetic algorithm, after the related work is reviewed. The contribution lies on that the selection process of such routing is treated with multiobjective optimization. Different quality criterions in IP network are taken into account for multicast communications. A set of routing trees is generated to approximate the Pareto front of multicast problem. Multiple trees can be selected from the final set of nondominated solutions, and applied to obtain a good overall link cost and balance traffic distribution according to some simulation results.

关键词： multicast routing quality of service multiobjective optimization genetic algorithms.

Restoration method of characters on Jiagu rubbings based on Poisson distribution and fractal geometry

在线全文

学校读者我要写书评

暂无评论

Science china(information Sciences) 2010年第7期53卷 1296-1304页

作者： GU ShaoTong1,2,3, FENG GeFei1,2,3, MA XiaoHu1,2,4 & YANG YiMing1,2,3 1Institute of Linguistics, Xuzhou Normal university, Xuzhou 221009, china 2Jiangsu College key Lab of Linguistic Sciences and Neuro-cognition Engineering, Xuzhou Normal university, Xuzhou 221009, china 3Linguistic Science College, Xuzhou Normal university, Xuzhou 221009, china 4School of computer Science and technology, soochow university, suzhou 215006, china 1. Institute of Linguistics Xuzhou Normal University Xuzhou 221009 China2. Jiangsu College Key Lab of Linguistic Sciences and Neuro-cognition Engineering Xuzhou Normal University Xuzhou 221009 China3. Linguistic Science College Xuzhou Normal University Xuzhou 221009 China4. School of Computer Science and Technology Soochow University Suzhou 215006 China

A scheme for character restoration of Jiagu rubbings based on Poisson distribution and fractal geometry is proposed in this paper. The distribution characteristics of the connected regions on Jiagu rubbings is analyzed, and all the connected regions are recognized according to differences between these and their mathematical expectations. Regions are recognized as noise regions and filled if the differences are negative, while stroke regions are reserved. The attributes of the character image edges on Jiagu rubbings are also analyzed. The fractal dimensions of the character edge of Jiagu rubbings are calculated by means of statistics. The feature points are obtained using the cosine of the angle between the two vectors of the point and the consecutive two points. Different compression transformations with weighted coordinates are performed on different strokes and segments of the characters so as to smoothen the character edge of Jiagu rubbings images. Experimental results show that our scheme could successfully clear noise regions and polish the character edge of Jiagu rubbings.

关键词： Jiagu rubbings Poisson distribution fractal geometry fractal dimension compression transformation character restoration

A Dynamic Fuzzy Description Logic

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Wuhan university Journal of Natural Sciences 2008年第4期13卷 417-420页

作者： FANG Wei XIAN Xuefeng ZHAO Pengpeng CUI Zhiming Jiangsu Provincial key laboratory of computer informationProcessing technology Soochow University Suzhou 215006Jiangsu China

Fuzzy description logics are considered as the logical infrastructure of fuzzy knowledge representation on the semantic Web. To deal with fuzzy and dynamic knowledge on the semantic Web and its applications, a new fuzzy extension of Attribute Language with Complement based on dynamic fuzzy logic called the dynamic fuzzy description logic （DFALC） is presented. The syntax and semantics of DFALC are formally defined, and the forms of axioms and assertions are specified. The DFALC provides more reasonable logic foundation for the semantic Web, and overcomes the insufficiency of using fuzzy description logic FALC to act as logical foundation for the semantic Web. The extended DFALC is more expressive than the existing fuzzy description logics and present more fuzzy information on the semantic Web.

关键词： dynamic fuzzy logic description logic dynamic fuzzy description logic semantic Web

Parallel Resource Mining From Bilingual Web Pages

在线全文

学校读者我要写书评

暂无评论

Parallel Resource Mining From Bilingual Web Pages

Face Video key-Frame Extraction Algorithm Based on Color Histogram

第五届全国信息检索学术会议

作者： Yan Zhen-Xiang,Feng Yan-Hui,Hong Yu,Yao Jian-Min~* Provincial key laboratory of computer information Processing technology soochow university,suzhou,china,215006

A new way is reported to extract parallel linguistic resources from bilingual web pages,which differs from previous works from parallel web pages,The candidate bilingual resources are extracted from web pages by heuristic information of the HTML structures and hint *** pair resources are verified by a maximum entropy classifier combining length,word-overlap,alignment and text location *** shows satisfactory parallel resource mining *** study enriches parallel text mining methods from various web pages.

关键词： Parallel resource Bilingual web pages Web mining

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Face Video Key-Frame Extraction Algorithm Based on Color His...

Image Hiding Algorithm in Discrete Cosine Transform Domain Based on Grey Prediction and Grey Relational Analysis

2011 4th IEEE International Conference on computer Science and information technology(ICCSIT 2011)

作者： Xintao Li School of computer Science & technology soochow university suzhou Jiangsu 215006 china Tiongrong Xu School of computer Science & technology soochow university suzhou Jiangsu 215006 china

Video-based face recognition has been widely studied in recently *** common method of video face recognition is to recognize of every face frames that *** method not only cause large computing complexity,but also when face gesture and illumination change greatly,the face images collected contain very little information that can be used,these samples may have a negative effect to the results of recognition and even cause the recognition ***,this paper proposes a method for facial video key frame extraction based on color histogram,the purpose is to remove the redundant frames,reduce the computational complexity and improve recognition efficiency.

关键词： video face recognition key-frame extraction color histogram

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

china Communications 2013年第7期10卷 57-70页

作者：黄海平黄世超陈九天王汝传 College of computer Nanjing University of Posts and Telecommunications Jiangsu High technology Research key laboratory for Wireless Sensor Networks key laboratory of Broadband Wireless Communication and Sensor Network technology of Ministry of Education Nanjing University of Posts and Telecommunications Jiangsu Provincial key laboratory for computer information Processing technology Soochow University

Traditional information hiding algorithms cannot maintain a good balance of capacity,invisibility and *** this paper,a novel blind colour image information hiding algorithm based on grey prediction and grey relational analysis in the Discrete Cosine Transform(DCT) domain is ***,this algorithm compresses the secret image losslessly based on the improved grey prediction GM(1,1)(IGM) *** then chooses the blocks of rich texture in the cover image as the embedding regions using Double-dimension Grey Relational Analysis(DGRA).Finally,it adaptively embeds the compressed secret bits stream into the DCT domain mid-frequency coefficients,which are decided by those blocks' Double-Dimension Grey Correlation Degree(DGCD) and Human Visual System(HVS).This method can ensure an adequate balance between invisibility,capacity and *** results show that the proposed algorithm is robust against JPEG compression(46.724 6 dB when the compression quality factor is 90%),Gaussian noise(45.531 3 dB when the parameter is(0,0.000 5)) etc.,and it is a blind information hiding algorithm that can be extracted without an original carrier.

关键词： image information hiding IGM DGRA blind information hiding DCT

在线全文

学校读者我要写书评

暂无评论

基于最短划分距离的网络流量决策树分类方法

通信学报 2012年第3期33卷 90-102页

作者：杨哲李领治纪其进朱艳琴苏州大学计算机科学与技术学院江苏苏州215006 江苏省计算机信息处理技术重点实验室江苏苏州215006

对不同类别的应用数据流,根据其在最初若干分组中进行握手和参数协商的差异性,通过通信模式、载荷长度以及信息熵等特征,采用基于最短划分距离的方法构建决策树模型,对其进行流量分类。经过在4个不同类型的真实网络数据集上的离线分类实... 详细信息

对不同类别的应用数据流,根据其在最初若干分组中进行握手和参数协商的差异性,通过通信模式、载荷长度以及信息熵等特征,采用基于最短划分距离的方法构建决策树模型,对其进行流量分类。经过在4个不同类型的真实网络数据集上的离线分类实验,以及在校园网环境中的在线流量分类实验。结果表明该模型对8种常见协议的网络流量,分析其前4到6个分组的特征,能够在分类准确性和系统开销上取得较好的效果。与其他机器学习算法相比,该模型构建的决策树规模较小,分类时间较短,适合于实时流量分类问题。

关键词：流量分类双向流最短划分距离决策树

A Visible Watermarking Algorithm Holding image Content

在线全文

学校读者我要写书评

暂无评论

A Visible Watermarking Algorithm Holding image Content