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

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

来源：评论

学校读者我要写书评

暂无评论

A Memory-efficient Simulation Method of Grover’s Search Algorithm

引用

computers, Materials & Continua 2018年第11期57卷 307-319页

作者： Xuwei Tang Juan Xu Bojia Duan College of Computer Science and Technology Nanjing University of Aeronautics and AstronauticsNanjingChina Institute for Quantum Computing University of WaterlooCanada Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of EducationChina

Grover’s search algorithm is one of the most significant quantum algorithms,which can obtain quadratic speedup of the extensive search *** Grover's search algorithm cannot be implemented on a real quantum computer at present,its quantum simulation is regarded as an effective method to study the search *** simulating the Grover's algorithm,the storage space required is exponential,which makes it difficult to simulate the high-qubit Grover’s *** this end,we deeply study the storage problem of probability amplitude,which is the core of the Grover simulation *** propose a novel memory-efficient method via amplitudes compression,and validate the effectiveness of the method by theoretical analysis and simulation *** results demonstrate that our compressed simulation search algorithm can help to save nearly 87.5%of the storage space than the uncompressed *** under the same hardware conditions,our method can dramatically reduce the required computing nodes,and at the same time,it can simulate at least 3 qubits more than the uncompressed ***,our memory-efficient simulation method can also be used to simulate other quantum algorithms to effectively reduce the storage costs required in simulation.

关键词： Grover’s search algorithm probability amplitude quantum simulation memory compression

来源：评论

学校读者我要写书评

暂无评论

Non-blocking message total ordering protocol

引用

Science in China(Series F) 2008年第12期51卷 1919-1934页

作者： WANG Yun & WANG JunLing School of computer Science & Engineering, southeast university key Lab of computer network & information integration, MOE, Nanjing 210096, China 1. School of Computer Science & Engineering Southeast University Key Lab of Computer Network & Information Integration MOE Nanjing 210096 China

Message total ordering is a critical part in active replication in order to maintain consistency among members in a fault tolerant group. The paper proposes a non-blocking message total ordering protocol （NBTOP） for distributed systems. Non-blocking property refers to that the members in a fault tolerant group keep on running independently without waiting for installing the same group view when a fault tolerant group evolves even when decision messages collide. NBTOP takes advantage of token ring as its logical control way. Members adopt re-requesting mechanism （RR） to obtain their lost decisions. Forward acknowledgement mechanism （FA） is put forth to solve decision collisions. The paper further proves that NBTOP satisfies the properties of total order, agreement, and termination. NBTOP is implemented, and its performance test is done. Comparing with the performance of Totem, the results show that NBTOP has a better total ordering delay. It manifests that non-blocking property helps to improve protocol efficiency.

关键词： total ordering protocol non-blocking active replication fault tolerance token ring

来源：评论

学校读者我要写书评

暂无评论

Length matters:Scalable fast encrypted internet traffic service classification based on multiple protocol data unit length sequence with composite deep learning

引用

Digital Communications and networks 2022年第3期8卷 289-302页

作者： Zihan Chen Guang Cheng Ziheng Xu Shuyi Guo Yuyang Zhou Yuyu Zhao School of Cyber Science and Engineering Southeast UniversityNanjing211189China Key Laboratory of Computer Network and Information Integration Ministry of EducationNanjing211189China Purple Mountain Laboratories Nanjing211111China

As an essential function of encrypted Internet traffic analysis,encrypted traffic service classification can support both coarse-grained network service traffic management and security ***,the traditional plaintext-based Deep Packet Inspection(DPI)method cannot be applied to such a ***,machine learning-based existing methods encounter two problems during feature selection:complex feature overcost processing and Transport Layer Security(TLS)version *** this paper,we consider differences between encryption network protocol stacks and propose a composite deep learning-based method in multiprotocol environments using a sliding multiple Protocol Data Unit(multiPDU)length sequence as features by fully utilizing the Markov property in a multiPDU length sequence and maintaining suitability with a TLS-1.3 *** experiments show that both Length-Sensitive(LS)composite deep learning model using a capsule neural network and LS-long short time memory achieve satisfactory effectiveness in F1-score and *** to faster feature extraction,our method is suitable for actual network environments and superior to state-of-the-art methods.

关键词： Encrypted internet traffic Encrypted traffic service classification Multi PDU length sequence Length sensitive composite deep learning TLS-1.3

来源：评论

学校读者我要写书评

暂无评论

Anonymous authentication-oriented vehicular privacy protection technology research in VANET

Anonymous authentication-oriented vehicular privacy protecti...

引用

2nd Annual Conference on Electrical and Control Engineering, ICECE 2011

作者： Zhang, Shuai Tao, Jun Yuan, Yijia Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing China

ISBN: (纸本)9781424481637

Vehicular Ad hoc networks (VANET) consists of several vehicular nodes and uses 802.11p protocol for communication. Because of its unique characteristics, such as fast speed, serious Doppler effect, large node number etc, VANET is vulnerable to be affected by a variety of security threats. In this paper, we firstly introduce the system architecture, applications and categories of attacks in VANET. Then we summarize several types of anonymous authentication techniques which aim at protecting the privacy of vehicular nodes, then discuss and compare the typical anonymous authentication schemes of each type. Finally, we present the problems which should be considered in the next step of research. © 2011 IEEE.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

DP-GenFL: a local differentially private federated learning system through generative data

引用

Science China(information Sciences) 2023年第8期66卷 275-276页

作者： Jun LI Kang WEI Chuan MA Feng SHU School of Electronic and Optical Engineering Nanjing University of Science and Technology Zhejiang Lab Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education School of Information and Communication Engineering Hainan University

With the rapid development of the Internet of Things(Io T),the amount of data from intelligent devices is propagating at unprecedented scales. Meanwhile, machine learning(ML),which relies heavily on such data, is revolutionizing many aspects of our lives [1]. However, conventional centralized ML offers little scalability for efficiently processing this huge amount of data.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

SQLS:A Storm-Based Query Language System for Real-Time Stream Data Analysis

引用

Chinese Journal of Electronics 2016年第6期25卷 1025-1033页

作者： JI Yimu ZHANG Dianchao SUN Yanfei ZHAO Chuanxin HE Jing WANG Ruchuan CHEN Guoliang Computer of Science Nanjing University of Posts and Telecommunications Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Key Laboratory of Computer Network and Information Integration Southeast University Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Nanjing University of Science and Technology Computer of Telecommunications Nanjing University of Posts and Telecommunications Department of Computer Anhui Normal University Engineering and Science Victoria University

In this work, a Storm-based query language System(SQLS) is proposed for real-time data stream analysis. The system is compatible with Continuous query language(CQL) specification. It supports both continuous queries and one-time queries over streaming data, and meets the requirements of user experience(traditional SQL queries) and Qo S(such as real-time and throughput). In order to better meet the requirement of throughput and enhance the processing efficiency, the load shedding algorithm and cache optimization are employed during the implementation of SQL-like operators. Finally, performance testing of the proposed SQLS has been conducted on standalone Storm platform and Storm clusters. Experimental results show that our system can not only meet the needs of users, but also extend the function of real-time streaming queries processing.

关键词： Continuous query Ad hoc query Storm CQL Real-time query processing

来源：评论

学校读者我要写书评

暂无评论

Faster Zero-shot Multi-modal Entity Linking via Visual-Linguistic Representation

引用

Data Intelligence 2022年第3期4卷 493-508页

作者： Qiushuo Zheng Hao Wen Meng Wang Guilin Qi Chaoyu Bai School of Cyber Science and Engineering Southeast UniversityNanjing 211189China School of Computer Science and Engineering Southeast UniversityNanjing 211189China Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of EducationNanjing 211189China

Multi-modal entity linking plays a crucial role in a wide range of knowledge-based modal-fusion tasks, i.e., multi-modal retrieval and multi-modal event extraction. We introduce the new ZEro-shot Multi-modal Entity Linking(ZEMEL) task, the format is similar to multi-modal entity linking, but multi-modal mentions are linked to unseen entities in the knowledge graph, and the purpose of zero-shot setting is to realize robust linking in highly specialized domains. Simultaneously, the inference efficiency of existing models is low when there are many candidate entities. On this account, we propose a novel model that leverages visuallinguistic representation through the co-attentional mechanism to deal with the ZEMEL task, considering the trade-off between performance and efficiency of the model. We also build a dataset named ZEMELD for the new task, which contains multi-modal data resources collected from Wikipedia, and we annotate the entities as ground truth. Extensive experimental results on the dataset show that our proposed model is effective as it significantly improves the precision from 68.93% to 82.62% comparing with baselines in the ZEMEL task.

关键词： Knowledge Graph Multi-modal Learning Poly Encoders

来源：评论

学校读者我要写书评

暂无评论

Visual Entity Linking via Multi-modal Learning

引用

Data Intelligence 2022年第1期4卷 1-19页

作者： Qiushuo Zheng Hao Wen Meng Wang Guilin Qi School of Cyber Science and Engineering Southeast UniversityNanjing 211189China School of Computer Science and Engineering Southeast UniversityNanjing 211189China Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of EducationNanjing 211189China

Existing visual scene understanding methods mainly focus on identifying coarse-grained concepts about the visual objects and their relationships,largely neglecting fine-grained scene *** fact,many data-driven applications on the Web(e.g.,news-reading and e-shopping)require accurate recognition of much less coarse concepts as entities and proper linking them to a knowledge graph(KG),which can take their performance to the next *** light of this,in this paper,we identify a new research task:visual entity linking for fine-grained scene *** accomplish the task,we first extract features of candidate entities from different modalities,i.e.,visual features,textual features,and KG ***,we design a deep modal-attention neural network-based learning-to-rank method which aggregates all features and maps visual objects to the entities in *** experimental results on the newly constructed dataset show that our proposed method is effective as it significantly improves the accuracy performance from 66.46%to 83.16%compared with baselines.

关键词： Knowledge graph Multi-modal learning Entity linking Learning to rank Knowledge graph representation

来源：评论

学校读者我要写书评

暂无评论

Traffic classification based on port connection pattern

Traffic classification based on port connection pattern

引用

2011 International Conference on computer Science and Service System, CSSS 2011

作者： Cheng, Guang Wang, Song Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing 210096 China

ISBN: (纸本)9781424497638

While the traditional Web, Email and other Internet applications are still used large-scale, Internet applications, such as typical P2P resource sharing, streaming, games, instant messaging and other new applications emerging, is generating the rapid growth traffic. Connection pattern approach is to observe and identify connection patterns of host behavior at the transport layer. This method has no access to packet payload, no knowledge of port numbers and no additional information other than what current flow collectors provide. But traffic classification method based on host connection pattern can't distinguish some similar applications provided by one server. This paper analyzes the connection pattern between servers for SMTP, POP3, Web, BT traffic, and the distribution of simultaneous connections for each server port, and then propose a new traffic classified approach based on port connection pattern and the simultaneous connection number. The classified method can distinguish WEB, SMTP, POP3, and BT traffic each port in a server without any knowledge of port. The experimental result shows that this method is effective. © 2011 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：