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

Verifying Contextual Refinement with Ownership Transfer

Journal of computer science & technology 2021年第6期36卷 1342-1366页

作者： Zhao-Hui Li Xin-Yu Feng School of Computer Science and Technology University of Science and Technology of ChinaHefei 230026China Department of Computer Science and Technology Nanjing UniversityNanjing 210023China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

Contextual refinement is a compositional approach to compositional verification of concurrent *** has been much work designing program logics to prove the contextual refinement between the object implementation and its abstract ***,these program logics for contextual refinement verification cannot support objects with resource ownership transfer,which is a common pattern in many concurrent objects,such as the memory management module in OS kernels,which transfers the allocated memory block between the object and *** this paper,we propose a new approach to give abstract and implementation independent specifications to concurrent objects with ownership *** also design a program logic to verify contextual refinement of concurrent objects *** abstract *** have successfully applied our logic to verifying an implementation of the memory management module,where the implementation is an appropriately simplified version of the original version from a real-world preemptive OS kernel.

关键词： contextual refinement program logic concurrent object ownership transfer verification

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Privacy Protection Scheme for Efficient Edge Computation Offloading in IoV

引用

Chinese Journal of Electronics 2024年第4期33卷 910-919页

作者： Liang YAO Xiaolong XU Wanchun DOU Muhammad Bilal School of Software Nanjing University of Information Science and Technology State Key Laboratory for Novel Software Technology Nanjing University Department of Computer and Electronics Systems Engineering Hankuk University of Foreign Studies

As a pivotal enabler of intelligent transportation system(ITS), Internet of vehicles(Io V) has aroused extensive attention from academia and industry. The exponential growth of computation-intensive, latency-sensitive,and privacy-aware vehicular applications in Io V result in the transformation from cloud computing to edge computing,which enables tasks to be offloaded to edge nodes(ENs) closer to vehicles for efficient execution. In ITS environment,however, due to dynamic and stochastic computation offloading requests, it is challenging to efficiently orchestrate offloading decisions for application requirements. How to accomplish complex computation offloading of vehicles while ensuring data privacy remains challenging. In this paper, we propose an intelligent computation offloading with privacy protection scheme, named COPP. In particular, an Advanced Encryption Standard-based encryption method is utilized to implement privacy protection. Furthermore, an online offloading scheme is proposed to find optimal offloading policies. Finally, experimental results demonstrate that COPP significantly outperforms benchmark schemes in the performance of both delay and energy consumption.

关键词： Industries Privacy Energy consumption Transportation Computational efficiency Encryption Protection

来源：评论

学校读者我要写书评

暂无评论

Detecting overlapping communities in networks via dominant label propagation

引用

Chinese Physics B 2015年第1期24卷 551-559页

作者：孙鹤立黄健斌田勇强宋擒豹刘怀亮 Department of Computer Science and Technology Xi’an Jiaotong University State Key Laboratory for Novel Software Technology Nanjing University School of Software Xidian University School of Economics and Management Xidian University

Community detection is an important methodology for understanding the intrinsic structure and function of a realworld network. In this paper, we propose an effective and efficient algorithm, called Dominant label Propagation Algorithm（Abbreviated as DLPA）, to detect communities in complex networks. The algorithm simulates a special voting process to detect overlapping and non-overlapping community structure in complex networks simultaneously. Our algorithm is very efficient, since its computational complexity is almost linear to the number of edges in the network. Experimental results on both real-world and synthetic networks show that our algorithm also possesses high accuracies on detecting community structure in networks.

关键词： overlapping community detection dominant label propagation complex network

来源：评论

学校读者我要写书评

暂无评论

Identifying extract class refactoring opportunities for internetware

引用

science China(Information sciences) 2014年第7期57卷 37-54页

作者： CHEN Lin QIAN Ju ZHOU YuMing WANG Peng XU BaoWen State Key Laboratory for Novel Software Technology Nanjing University Department of Computer Science and Technology Nanjing University College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics School of Computer Science and Engineering Southeast University

The quality of internetware software is significantly associated with class *** software evolves,changes often introduce many unrelated responsibilities to the same classes or distribute tightly-related methods in different *** changes make the classes difficult to understand and *** class refactoring is an effective technique to improve the quality of software structure by decomposing unrelated methods in one class to create new classes or extracting tightly-related methods from different *** this paper,we propose a novel approach for class extraction from internetware source *** approach leverages a community structure detection technique to partition software into clusters and extracts classes from the resulting *** experimental results,which investigate the public well-known internetware PKUAS,indicate that:(1)the proposed approach is much faster than existing search-based clustering approaches(Hillclimbing and Genetic algorithm)and is thus applicable for large-scale internetware;(2)the proposed approach can identify meaningful class extractions for internetware;and(3)Extract Class refactoring candidates identified by the proposed approach significantly improve class cohesion of internetware.

关键词： refactoring extract class community structure software modularity internetware

来源：评论

学校读者我要写书评

暂无评论

A Spin-Glass Model based Local Community Detection Method in Social Networks

A Spin-Glass Model based Local Community Detection Method in...

引用

25th International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Pan, Lei Wang, Chongjun Xie, Junyuan National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

ISBN: (纸本)9781479929719

Mining community structures has become a general problem which exists in many fields including: computer-science, Mathematics, Physics, Biology, Sociology and so on. It has developed rapidly and been used widely in many applications: web data mining, social network analysis, criminal network mining, protein interaction network analysis, metabolic network analysis, genetic network analysis, customers relationship mining and user online behavior analysis, etc. Most community detection algorithms try to obtain the global information of the network, but increasing large scale of the current network makes it computationally expensive. In the meanwhile, the different influence and different behavior of nodes in the network are ignored. In fact, if we know the local information of the network or the interested node, we can easily detect the local community. This paper proposes a multi-resolution local community detection algorithm named MRCDA which uses local structural information in the network to optimize the multi-resolution modularity based on the Potts spin-glass model. A local community can be detected through continuous optimization of the function by expanding from an initial influential node computed by a modified Page Rank sorting algorithm. The proposed MRCDA has been tested on both synthetic and real world networks and tested against other algorithms. The experiments demonstrate its efficiency and accuracy.

关键词： social network analysis community detection overlapping community local community multi-resolution

来源：评论

学校读者我要写书评

暂无评论

JAPS: an automatic parallelizing system based on JAVA

引用

science China(Technological sciences) 1999年第4期42卷 396-406页

作者：杜建成陈道蓄谢立 1. State Key Laboratory of Novel Software Technology Department of Computer Science Nanjing University 210093 Nanjing China

JAPS is an automatic parallelizing system based on JAVA running on NOW. It implements the automatic process from dependence analysis to parallel execution. The current version of JAPS can exploit functional parallelism and the detection of data parallelism will be incorporated in the new version, which is underway. The framework and key techniques of JAPS are presented. Specific topics discussed are task partitioning, summary information collection, data dependence analysis, pre-scheduling and dynamic scheduling, etc.

关键词： data parallelism functional parallelism dependence analysis scheduling.

来源：评论

学校读者我要写书评

暂无评论

Extracting Semantic Subgraphs to Capture the Real Meanings of Ontology Elements

引用

Tsinghua science and technology 2010年第6期15卷 724-733页

作者：汪鹏徐宝文周毓明 School of Computer Science and Engineering Southeast University State Key Laboratory for Novel Software Technology Nanjing University Department of Computer Science and Technology Nanjing University

An element may have heterogeneous semantic interpretations in different ontologies. Therefore, understanding the real local meanings of elements is very useful for ontology operations such as querying and reasoning, which are the foundations for many applications including semantic searching, ontology matching, and linked data analysis. However, since different ontologies have different preferences to describe their elements, obtaining the semantic context of an element is an open problem. A semantic subgraph was proposed to capture the real meanings of ontology elements. To extract the semantic subgraphs, a hybrid ontology graph is used to represent the semantic relations between elements. An extracting algorithm based on an electrical circuit model is then used with new conductivity calculation rules to improve the quality of the semantic subgraphs. The evaluation results show that the semantic subgraphs properly capture the local meanings of elements. Ontology matching based on semantic subgraphs also demonstrates that the semantic subgraph is a promising technique for ontology applications.

关键词： ontology ontology graph semantic subgraph ontology matching

来源：评论

学校读者我要写书评

暂无评论

Golden age:on multi-source software update propagation in pervasive networking environments

引用

science China(Information sciences) 2013年第8期56卷 104-118页

作者： LI WenZhong FU XiaoMing CHAN Edward LU SangLu CHEN DaoXu State Key Laboratory for Novel Software Technology Nanjing University Institute of Computer Science University of Goettingen Department of Computer Science City University of Hong Kong

With the development of Internet technology,a large portion of computer softwares appear to run in a network-oriented,distributed-deployed,and self-evolving *** emerging wireless communication technologies broaden the usage of software in mobile platforms,enabling the pervasive computing paradigm,where people can access information/service anytime and anywhere with portable *** the pervasive networking environment where mobile devices operate on the ad hoc mode and communicate with each other opportunistically without wireless infrastructures,distributing the evolving software updates to a set of mobile terminals is a challenging *** this paper,we address the problem of distributing multiple software updates in pervasive networks with storage and bandwidth constraints,and propose age-based solutions to tackle this *** basic idea is to introduce different age-based priority mechanisms for propagation decision making in order to resolve the contention of wireless bandwidth and storage *** investigate a number of update propagation strategies including random spread,youngest age,and golden *** models are derived to analyse the performance of the proposed *** is shown that the golden age strategy has the burst effect,which could be used to enhance the efficiency of software update *** principles for choosing golden age values are proposed aiming to optimize different utility *** simulations under various network parameters show that the golden age strategy outperforms other strategies for multi-source software updates propagation.

关键词： pervasive computing software update propagation mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Simulation-based security of function-hiding inner product encryption

引用

science China(Information sciences) 2018年第4期61卷 215-225页

作者： Qingsong ZHAO Qingkai ZENG Ximeng LIU Huanliang XU State Key Laboratory for Novel Software Technology Nanjing University Department of Computer Science and Technology Nanjing University College of Information Science and Technology Nanjing Agricultural University School of Information Systems Singapore Management University

Functional encryption(FE)[1,2]is a modern type of encryption scheme that extends several previous notions and allows tremendous flexibility in controlling and computing on encrypted *** enables an authority to derive ... 详细信息

关键词： PP IPE MSK Simulation-based security of function-hiding inner product encryption

来源：评论

学校读者我要写书评

暂无评论

Bootstrapping Object Coreferencing on the Semantic Web

引用

Journal of computer science & technology 2011年第4期26卷 663-675页

作者：胡伟瞿裕忠孙行智 State Key Laboratory for Novel Software Technology Nanjing University Department of Computer Science and Technology Nanjing University IBM Research-China

An object on the Semantic Web is likely to be denoted with several URIs by different parties. Object core-ferencing is a process to identify ＂equivalent＂ URIs of objects for achieving a better Data Web. In this paper, we propose a bootstrapping approach for object coreferencing on the Semantic Web. For an object URI, we firstly establish a kernel that consists of semantically equivalent URIs from the same-as, （inverse） functional properties and （max-）cardinalities, and then extend the kernel with respect to the textual descriptions （e.g., labels and local names） of URIs. We also propose a trustworthiness-based method to rank the coreferent URIs in the kernel as well as a similarity-based method for ranking the URIs in the extension of the kernel. We implement the proposed approach, called ObjectCoref, on a large-scale dataset that contains 76 million URIs collected by the Falcons search engine until 2008. The evaluation on precision, relative recall and response time demonstrates the feasibility of our approach. Additionally, we apply the proposed approach to investigate the popularity of the URI alias phenomenon on the current Semantic Web.

关键词： object coreference entity identification URI alias data fusion Semantic Web

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：