检索结果-内蒙古大学图书馆

Measuring web page complexity by analyzing TCP flows and HTTP headers

The Journal of China Universities of Posts and Telecommunications 2017年第6期24卷 1-13页

作者： Cheng Weiqing Hu Yangyang Yin Qiaofeng Chen Jiajia School of Computer Science Nanjing University of Posts and Telecommunications Key Laboratory of Computer Network and Information Integration Southeast University Jiangsu Education Information Center Jiangsu Provincial Department of Education

To understand website complexity deeply, a web page complexity measurement system is developed. The system measures the complexity of a web page at two levels： transport-level and content-level, using a packet trace-based approach rather than server or client logs. Packet traces surpass others in the amount of information contained. Quantitative analyses show that different categories of web pages have different complexity characteristics. Experimental results show that a news web page usually loads much more elements at more accessing levels from much more web servers within diverse administrative domains over much more concurrent transmission control protocol （TCP） flows. About more than half of education pages each only involve a few logical servers, where most of elements of a web page are fetched only from one or two logical servers. The number of content types for web game traffic after login is usually least. The system can help web page designers to design more efficient web pages, and help researchers or Internet users to know communication details.

关键词： hyper text transfer protocol concurrent TCP flows world wide web web page complexity

来源：评论

学校读者我要写书评

暂无评论

Deep octonion networks

arXiv

引用

arXiv 2019年

作者： Wu, Jiasong Xu, Ling Kong, Youyong Senhadji, Lotfi Shu, Huazhong Laboratory of Image Science and Technology Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing210096 China INSERM U1099 RennesF-35000 France Université de Rennes 1 LTSI RennesF-35042 France

Deep learning is a research hot topic in the field of machine learning. Real-value neural networks (Real NNs), especially deep real networks (DRNs), have been widely used in many research fields. In recent years, the deep complex networks (DCNs) and the deep quaternion networks (DQNs) have attracted more and more attentions. The octonion algebra, which is an extension of complex algebra and quaternion algebra, can provide more efficient and compact expression. This paper constructs a general framework of deep octonion networks (DONs) and provides the main building blocks of DONs such as octonion convolution, octonion batch normalization and octonion weight initialization;DONs are then used in image classification tasks for CIFAR-10 and CIFAR-100 data sets. Compared with the DRNs, the DCNs, and the DQNs, the proposed DONs have better convergence and higher classification accuracy. The success of DONs is also explained by multi-task learning. Copyright © 2019, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Question-answering aspect classification with hierarchical attention network 17th

Question-answering aspect classification with hierarchical a...

引用

17th China National Conference on Computational Linguistics, CCL 2018 and 6th International Symposium on Natural Language Processing Based on Naturally Annotated Big Data, NLP-NABD 2018

作者： Wu, Hanqian Liu, Mumu Wang, Jingjing Xie, Jue Shen, Chenlin School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration of Ministry of Education Southeast University Nanjing China NLP Lab School of Computer Science and Technology Soochow University Suzhou China Southeast University-Monash University Joint Graduate School Suzhou China

ISBN: (纸本)9783030017156

In e-commerce websites, user-generated question-answering text pairs generally contain rich aspect information of products. In this paper, we address a new task, namely Question-answering (QA) aspect classification, which aims to automatically classify the aspect category of a given QA text pair. In particular, we build a high-quality annotated corpus with specifically designed annotation guidelines for QA aspect classification. On this basis, we propose a hierarchical attention network to address the specific challenges in this new task in three stages. Specifically, we firstly segment both question text and answer text into sentences, and then construct (sentence, sentence) units for each QA text pair. Second, we leverage a QA matching attention layer to encode these (sentence, sentence) units in order to capture the aspect matching information between the sentence inside question text and the sentence inside answer text. Finally, we leverage a self-matching attention layer to capture different importance degrees of different (sentence, sentence) units in each QA text pair. Experimental results demonstrate that our proposed hierarchical attention network outperforms some strong baselines for QA aspect classification. © Springer Nature Switzerland AG 2018.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

A Semi-Supervised Deep network Embedding Approach Based on the Neighborhood Structure

A Semi-Supervised Deep Network Embedding Approach Based on t...

引用

第六届中国计算机学会大数据学术会议

作者： Wenmao Wu Zhizhou Yu Jieyue He School of Computer Science and Engineering and also with MOE Key Laboratory of Computer Network and Information IntegrationSoutheast UniversityNanjing 210096China

network embedding is a very important task to represent the high-dimensional network in a low-dimensional vector space,which aims to capture and preserve the network *** existing network embedding methods are based on shallow ***,the actual network structure is so complicated that the shallow model can not obtain the high-dimensional nonlinear features of the network *** recently proposed unsupervised deep learning model of network representation learning ignores the labels *** overcome these problems,in this paper,we propose an effective network embedding method of Structural Labeled Locally Deep Nonlinear Embedding(SLLDNE).SLLDNE is designed to obtain highly nonlinear features through utilizing deep neural network while preserving the label information of the nodes by using SVM classifier as a supervised component to improve the ability of ***,we exploit linear reconstruction of neighborhood nodes to enable the model to get more structural *** experimental results of vertex classification on two real-world network datasets demonstrate that SLLDNE outperforms the other state-of-the-art methods.

关键词： network embedding deep learning semi-supervised network analysis reconstruction

来源：评论

学校读者我要写书评

暂无评论

A Construction of Quantum Error-Locating Codes

引用

Communications in Theoretical Physics 2017年第1期67卷 37-40页

作者：樊继豪陈汉武 School of Computer Science and Engineering Southeast UniversityNanjing 211189China Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of EducationNanjing 211189China

We present the construction of quantum error-locating(QEL) codes based on classical error-locating(EL)codes. Similar to classical EL codes, QEL codes lie midway between quantum error-correcting codes and quantum errordetecting codes. Then QEL codes can locate qubit errors within one sub-block of the received qubit symbols but do not need to determine the exact locations of the erroneous qubits. We show that, an e-error-locating code derived from an arbitrary binary cyclic code with generator polynomial g(x), can lead to a QEL code with e error-locating abilities, only if g(x) does not contain the(1 + x)-factor.

关键词： quantum error-correcting code error-locating code cyclic code

来源：评论

学校读者我要写书评

暂无评论

A Joint Optimization on Cross-Layer for mmWave Wireless network

A Joint Optimization on Cross-Layer for mmWave Wireless Netw...

引用

International Conference on Mobile Ad-hoc and Sensor networks, MSN

作者： Pengshuo Ji Jie Jia Jian Chen Xingwei Wang School of Computer Science and Engineering Northeastern University Shenyang China Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing China

ISBN: (纸本)9781728105499;9781728105482

With the severe spectrum shortage in conventional cellular networks, millimeter-wave (mmWave) technology has been proposed and is expected to be used in small cells to meet the increase spectrum efficiency, especially for those small cells are deployed with high density and forming as a multi-hop backhaul structure different from conventional schemes with priori given routes, a cross-layer optimization model aiming at maximizing the energy efficiency while taking into account both route selection and resource allocation. This paper decomposes the original problem into two sub-problems: resource allocation sub-problem at the link-physical layer and route selection sub-problem at the network layer. To reflect the interplay property between these two problems, we further propose two joint optimization strategies. The first is using genetic algorithm (GA) for resource allocation with given routes and using linear programming for routes selection with given resource allocation. The second is using the linear programming to evaluate the fitness of each individual in the GA. The simulation results show our solution can efficiently scale with the energy and spectrum efficiency and properly route the traffic without overloading any one of the base stations.

关键词： Optimization Resource management Base stations Millimeter wave technology Interference Millimeter wave communication Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Automated Testing of Web Applications Using Combinatorial Strategies

引用

Journal of computer Science & Technology 2017年第1期32卷 199-210页

作者： Xiao-Fang Qi Zi-Yuan Wang Jun-Qiang Mao Peng Wang School of Computer Science and Engineering Southeast University Nanjing 211189 China Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing 211189 China School of Computer Science and Technology Nanjing University of Posts and Telecommunications Nanjing 210023 China

Recently, testing techniques based on dynamic exploration, which try to automatically exercise every possible user interface element, have been extensively used to facilitate fully testing web applications. Most of such testing tools are however not effective in reaching dynamic pages induced by form interactions due to their emphasis on handling client-side scripting. In this paper, we present a combinatorial strategy to achieve a full form test and build an automated test model. We propose an algorithm called pairwise testing with constraints （PTC） to iraplement the strategy. Our PTC algorithm uses pairwise coverage and handles the issues of semantic constraints and illegal values. We have implemented a prototype tool ComjaxTest and conducted an empirical study on five web applications. Experimental results indicate that our PTC algorithm generates less form test cases while achieving a higher coverage of dynamic pages than the general pairwise testing algorithm. Additionally, our ComjaxTest generates a relatively complete test model and then detects more faults in a reasonable amount of time, as compared with other existing tools based on dynamic exploration.

关键词： automated testing combinatorial testing web application

来源：评论

学校读者我要写书评

暂无评论

Dynamic community mining based on behavior prediction

引用

International Journal of Performability Engineering 2018年第7期14卷 1590-1599页

作者： Chen, Xiao Hu, Xinzhuan Pan, Xiao Guo, Jingfeng Network Technology Center Hebei Normal University of Science and Technology Qinhuangdao066004 China College of Economics and Management YanShan University Qinhuangdao066004 China College of Economic and Management Shijiazhuang Tiedao University Shijiazhuang050043 China College of Information Science and Engineering YanShan University Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao066004 China

Dynamic network research has been a new trend in recent years. Based on the influence of vertex behavior on community structure, this paper studies signed network dynamic community mining. Firstly, the set pair connection degree is introduced to describe the relation between vertices, and the edge prediction model of signed network is proposed by taking into account the variability of the relation between vertices. Secondly, based on the prediction model, a set pair signed networks dynamic model is proposed by adding time axis T to the signed network. Then, based on the dynamic model, the evolution of signed networks and community discovering are studied. Finally, network evolution law and community stability are analyzed by using the connection trend and connection entropy in set pair theory, and the accuracy and validity of the dynamic community mining algorithm are verified by experiments. © 2018 Totem Publishers Ltd. All rights reserved.

关键词： Dynamic models

来源：评论

学校读者我要写书评

暂无评论

A Metaheuristic for No-wait Flowshops with Variable Processing Times

A Metaheuristic for No-wait Flowshops with Variable Processi...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Yi Xu Xiaoping Li Chaomin Shi Mingyu Cui Xincheng Cao Yanyan Ge School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing China

No-wait flowshop scheduling problems are widespread in industries. Though processing times of jobs are traditionally assumed to be constant, they are variable because of learning and deteriorating effects in practical manufacturing processes which make the problems much more difficult. In this paper, we propose a metaheuristic, self-adaptive memetic algorithm (SAMA for short), for no-wait flowshops with variable processing times which have never been considered yet. The balance between intensification and diversification of the algorithm is adaptively controlled by evolutionary operators. Local search is performed on better individuals with higher probabilities to dynamically adjust diversification. Experimental results show that the proposed SAMA outperforms existing algorithms for similar problems.

关键词： Sociology Statistics Memetics Genetic algorithms Job shop scheduling Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Precise slicing of interprocedural concurrent programs

引用

Frontiers of computer Science 2017年第6期11卷 971-986页

作者： Xiaofang QI Zhenliang JIANG School of Computer Science and Engineering Southeast University Nanjing 211189 China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing 211189 China China Huawei Technologies Co. Ltd Nanjing 210012 China

Program slicing is an effective technique for an- alyzing concurrent programs. However, when a conventional closure-based slicing algorithm for sequential programs is ap- plied to a concurrent interprocedural program, the slice is usually imprecise owing to the intransitivity of interference dependence. Interference dependence arises when a state- ment uses a variable defined in another statement executed concurrently. In this study, we propose a global dependence analysis approach based on a program reachability graph, and construct a novel dependence graph called marking-statement dependence graph （MSDG）, in which each vertex is a 2-tuple of program state and statement. In contrast to the conven- tional program dependence graph where the vertex is a state- ment, the dependence relation in MSDG is transitive. When traversing MSDG, a precise slice will be obtained. To en- hance the slicing efficiency without loss of precision, our slic- ing algorithm adopts a hybrid strategy. The procedures con- taining interaction statements between threads are inlined and sliced by the slicing algorithm based on program reachability graphs while allowing other procedures to be sliced as se- quential programs. We have implemented our algorithm and three other representative slicing algorithms, and conducted an empirical study on concurrent Java programs. The exper- imental results show that our algorithm computes more pre- cise slices than the other algorithms. Using partial-order re- duction techniques, which are effective for reducing the size of a program reachability graph without loss of precision, ouralgorithm is optimized, thereby improving its performance to some extent.

关键词： program slicing concurrent programs reacha-bility analysis context sensitivity dependence analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：