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

IEEE International Conference on Automated Software Engineering (ASE)

作者： Shuhao Li Ji Wang Zhi-ChangQi National Laboratory for Parallel and Distributed Processing Changsha P.R. China National Lab. for Parallel & Distributed Process. Changsha China

ISBN: (纸本)0769521312

UML Statecharts is an important modeling formalism with hierarchy, concurrency, broadcast-communication mechanisms and data variables. These facilities help the developers to describe the complex behaviors of an object along its lifecycle naturally. However, the ease of modeling is at the expense of testing: the system developed from Statecharts usually has numerous behaviors and is therefore extremely difficult to receive comprehensive and in-depth testing. This work presents an approach to deriving targeted test sequences from UML Statecharts according to tester-specified temporal logic properties. Using this approach, testing efforts can be focused on specific properties of the system and usually only a small portion of the total behaviors will be tested. This method suits well the occasions when the testers are interested in just some specific properties of the system or when they have to focus on its critical properties in case that limited budget is available.

关键词： Unified modeling language Automatic testing Software testing Software engineering

来源：评论

学校读者我要写书评

暂无评论

High-performance Network Traffic Classification Based on Graph Neural Network 6

High-performance Network Traffic Classification Based on Gra...

引用

6th IEEE Information Technology, Networking, Electronic and Automation Control Conference, ITNEC 2023

作者： Pang, Bo Fu, Yongquan Ren, Siyuan Jia, Yan Harbin Institute of Technology College of Computer Science and Technology Shenzhen China National University of Defense Technology National Key Laboratory for Parallel and Distributed Processing College of Computer Changsha China Peng Cheng Laboratory Shen Zhen China

ISBN: (纸本)9781665460033

Network traffic classification is crucial for network security and network management and is one of the most important network tasks. Current state-of-the-art traffic classifiers are based on deep learning models to automatically extract features from packet streams. Unfortunately, current approaches fail to effectively combine the structural information of traffic packets with the content features of the packets, resulting in limited classification accuracy. In this paper, we propose a graph neural network model for network traffic classification, which can well perceive the interaction feature of packets in traffic. Firstly, we design a graph structure for packets' flows to hold the interaction information between packets, which embeds both packet contents and sequence relationships into a unified graph. Secondly, we propose a graph neural network framework for graph classification to automatically learn the structural features of the packets' flows together with the packets' features. Extensive evaluation results on real-world traffic data show that the proposed model improves the prediction accuracy of improves the prediction accuracy by 2% to 37% for malicious traffic classification. © 2023 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A mobile recommendation system based on Logistic Regression and Gradient Boosting Decision Trees

A mobile recommendation system based on Logistic Regression ...

引用

International Joint Conference on Neural Networks

作者： Yaozheng WANG Dawei FENG Dongsheng LI Xinyuan CHEN Yunxiang ZHAO Xin NIU National Lab for Parallel and Distributed Processing School of Computer Science National University of Defense Technology

ISBN: (纸本)9781509006212

Real-life behaviors shown by the mobile users typically exhibit plenty noises, making it hard to construct an effective recommendation engine. In this paper, we present a fused model based on the LR algorithm and the GBDT algorithm to recommend vertical industry commodities in a mobile setting. A set of specifically designed methods are proposed to deal with the data preprocessing and feature extraction problem for the mobile recommendation scenario. The proposed method is evaluated on a large scale real-world dataset provided by the Alibaba mobile shopping department. Result on the F1 score has seen an improvement of 2%-36% compared with the baseline.

关键词： Mobile communication Feature extraction Predictive models Prediction algorithms Logistics Data models Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Security issues and solutions in cloud computing

Security issues and solutions in cloud computing

引用

32nd IEEE International Conference on distributed Computing Systems Workshops, ICDCSW 2012

作者： You, Pengfei Peng, Yuxing Liu, Weidong Xue, Shoufu National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China Jiangsu Automation Research Institute Jiangsu China Air Defense Forces Academy CPLA Zhengzhou Henan China

ISBN: (纸本)9781467314237

Recently, Cloud computing, as one of the hottest words in IT world, has drawn great attention. Many IT companies such as IBM, Google, Amazon, Microsoft, Yahoo and others vigorously develop cloud computing systems and related products to customers. However, there are still some difficulties for customers to adopt cloud computing, in which many security issues exist, because data for a customer is stored and processed in cloud, not in a local machine. This paper briefly introduces cloud computing and its key concepts. In particularly, we intend to discuss security requirements and security issues involving data, application and virtualization in cloud computing, as well as current solutions to these issues. © 2012 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

iRank: Supporting Proximity Ranking for Peer-to-Peer Applications

iRank: Supporting Proximity Ranking for Peer-to-Peer Applica...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Yongquan Fu Yijie Wang National Key Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology China

Proximity ranking according to end-to-end network distances (e.g., Round-Trip Time, RTT) can reveal detailed proximity information, which is important in network management and performance diagnosis in distributed systems. However, to the best of our knowledge, there has been no similar work on this subject in the P2P computing field. We present a distributed rating method iRank, that enables proximity rankings by providing discrete ratings in a distributed manner. It formulates the proximity ranking as a rating problem that faithfully captures the proximity based on noisy distance measurements scalably and practically. The primary challenge in inferring proximity rankings is enforcing distributed ratings with complex rating policies. Our solution is based on reconstructing ratings by decomposing a centralized rating method Maximum Margin Matrix Factorization (MMMF) into independent sub-problems, that can be efficiently solved in a decentralized manner. By relaxing the dependence on infrastructure nodes that are a single point of failure and limit scalability, iRank can gracefully handle network churns. Through real network latency data sets, we demonstrate that iRank can predict ratings with low distortion, which are smaller than 20 percentage worse than the centralized method, in the context of synthetic complex rating policies.

关键词： Peer to peer computing distributed computing Computer networks Network servers Application software laboratories distributed processing Concurrent computing Computer network management Conference management

来源：评论

学校读者我要写书评

暂无评论

AUModel:A Conceptual model for Adaptive Software

AUModel:A Conceptual model for Adaptive Software

引用

2014 IEEE 5th International Conference on Software Engineering and Service Science

作者： Hui Liu Bo Ding Dianxi Shi Huaimin Wang National Key Laboratory for Parallel and Distributed Processing College of Computer ScienceNational University of Defense Technology

Pervasive software should be able to adapt itself to the changing environments and user ***,it will bring great challenges to the software engineering *** paper proposes AUModel,a conceptual model for adaptive software,which takes adaptability as an inherent feature and can act as the foundation of the engineering *** introducing AUModel,the reuse of software adaptation infrastructure as well as the separation of adaptation concerns are enabled,which can facilitate both the development and maintenance of adaptive *** paper also presents our initial attempts to realize this model,including a middleware prototype to support this model and an application to validate its effectiveness.

关键词： pervasive computing adaptive software middleware

来源：评论

学校读者我要写书评

暂无评论

Linking stack overflow to issue tracker for issue resolution 2014

Linking stack overflow to issue tracker for issue resolution

引用

6th Asia-Pacific Symposium on Internetware, Internetware 2014

作者： Wang, Tao Yin, Gang Wang, Huaimin Yang, Cheng Zou, Peng Key Lab. of Parallel and Distributed Computing Colledge of Computer National University of Defence Technology ChangSha Hunan China Academy of Equipment Command and Technology Beijing100000 China

ISBN: (纸本)9781450334013

Issue resolution is a central task for software development. The efficiency of issue fixing largely relies on the issue report quality. Stack Overflow, which hosts rich and real-Time posts about programming-specific problems, is a valuable external source of knowledge for issue resolution. In this paper, we present CrossLink, an analysis framework that automatically introduce related posts in Stack Overflow to issues in Android Issue Tracker. This helps developers to leverage the abundant and professional knowledge from massive programmers in Stack Overflow for issue resolution. CrossLink explores the semantic similarities as well as the temporal associations between the two types of repositories to recommend Stack Overflow posts to Android issues. The internal links in Stack Overflow are also employed to improve the linking accuracy. The experiments prove the effectiveness of CrossLink with precision of 62.51% for top-10 recommendations, which is significantly higher than the state-of-Art method. © 2014 ACM.

关键词： Android (operating system)

来源：评论

学校读者我要写书评

暂无评论

IWFR:Exploiting Full-duplex in Wireless Relay Networks

IWFR:Exploiting Full-duplex in Wireless Relay Networks

引用

2014 4th IEEE International Conference on Information Science and Technology

作者： Yong Lu Shaohe Lv Xiaodong Wang Xingming Zhou National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology

Traditional wireless relay networks have large endto-end time delay and low throughput because of the limit that it can't receive and forward at the same *** this paper,we proposed IWFR:Immediate Wireless Full-Duplex Relay which exploits the advantages of full-duplex to shorten the end-to-end time delay and improve the *** the same time,we designed a new implicit acknowledgement mechanism,which can eliminate the ACK overheads and evidently improve the throughput of the *** implement IWFR,we also modified the full-duplex node architecture to make it support for immediate *** shows that IWFR shortens the end-to-end time delay by 60%on average and improves the throughput to 240%of the original relay.

关键词： Relay IWFR:Exploiting Full-duplex in Wireless Relay Networks

来源：评论

学校读者我要写书评

暂无评论

HyperSpring: Accurate and Stable Latency Estimation in the Hyperbolic Space

HyperSpring: Accurate and Stable Latency Estimation in the H...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Yongquan Fu Yijie Wang National Key Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology China

Predicting network latencies between Internet hosts can efficiently support large-scale Internet applications, e.g., file sharing service and the overlay construction. Several study use the hyperbolic space to model the Internet dense-core and many-tendril structure. However, existing hyperbolic space based embedding approaches are not designed for accurate latency estimation in the distributed context. We present HyperSpring, which estimates latency by modelling a mass spring system in the hyperbolic similar with Vivaldi. HyperSpring adopts coordinate initialization to speed up the convergence of coordinate computation, uses multiple-round symmetric updates to escape from bad local minima, and stabilizes coordinates by compensating RTT measurements to reduce the coordinate drifts. Evaluation results based on a network trace of 226 Planetlab nodes indicate that, compared to Euclidean-space based Vivaldi, hyperspring provides performance improvements for most nodes, and incurs slightly higher distortions for a small number of nodes.

关键词： Delay IP networks Web and internet services Large-scale systems Peer to peer computing Springs Convergence Coordinate measuring machines Distortion measurement Extraterrestrial measurements

来源：评论

学校读者我要写书评

暂无评论

Algorithm for distributed Constraint Optimization Problems with low constraint density

引用

Ruan Jian Xue Bao/Journal of Software 2011年第4期22卷 625-639页

作者： Ding, Bo Wang, Huai-Min Shi, Dian-Xi Tang, Yang-Bin School of Computer National University of Defense Technology Changsha 410073 China National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

Many challenges in multi-agent coordination can be modeled as distributed Constraint Optimization Problems (DCOPs). Aiming at DCOPs with low constraint density, this paper proposes a distributed algorithm based on the idea of greed and backjumping. In this algorithm, each agent makes decisions according to the greedy principle that the most assignment combinations in the problems with low constraint density occur at a zero cost, and the backjumping mechanism among the agents ensures the success of this algorithm, even when this greedy principle leads to a local optimum. In contrast with the existing mainstream DCOP algorithms, this algorithm can solve problems with low constraint density with fewer messages while keeping the polynomial message length and space complexity. The correctness of the key mechanisms in this algorithm has been proved, and those advantages in performance have been verified by experiments. © 2011 ISCAS.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：