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

Massively parallel algorithms for fully dynamic all-pairs shortest paths

Frontiers of computer science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：评论

学校读者我要写书评

暂无评论

Organization-Driven Business Process Configurable Modeling for Spatial Variability

引用

China Communications 2021年第11期18卷 229-242页

作者： Guosheng Kang Liqing Yang Liang Zhang Jianxun Liu Yiping Wen Hunan Provincial Key Lab.for Services Computing and Novel Software Technology Hunan University of Science and TechnologyXiangtan 411201China School of Computer Science and Engineering Hunan University of Science and TechnologyXiangtan 411201China School of Computer Science Fudan UniversityShanghai 201203China

Nowadays,enterprises need to continually adjust their business processes to adapt to the changes of business environments,especially when one business needs to be deployed in different application scenarios,which is called spatial variability in this *** the field of BPM(Business Process Management),configurable business process models have demonstrated their effectiveness in aspects of process modeling and model ***,we found that the existing techniques lead to complex configurable models,and are inadequate for model reuse especially for the spatial variability issue because they neglect the root impact of organizations on control flow.S-BPM(Subject-oriented Business Process Management)models provide a solid foundation for dealing with complex applications and help to bridge the gap between business and IT for process *** this paper,we propose an organization-driven business process configurable modeling approach for spatial variability by integrating both restriction and extension operations based on the S-BPM paradigm,in which business objects are also *** approach is validated with a general business process developed for the Real Estate Administration(REA)in a certain province of *** resulting configurable modeling framework can express the heterogeneous activity sequences for one business and has the potential to generate process models for uncertain environments in a new organization structure.

关键词： S-BPM configurable modeling organization-driven spatial variability business objects services

来源：评论

学校读者我要写书评

暂无评论

Constraints on Extensions of a Default Theory

引用

Journal of computer science & technology 2001年第4期16卷 329-340页

作者：苏开乐 Department of Computer Science Zhongshan University Guangzhou P.R. China State Key Laboratory for Novel Software Technology Nanjing University Nanjing P.R. China

In this paper, the representability of a family of theories as the set of extensions of a default theory is studied. First, a new necessary condition is given for the representability by means of general default theories; then a sufficient one is presented. The families of theories represented by default theories are also fully characterized. Finally, the paper gives an example of denumerable families of mutually inconsistent theories that are represented by a default theory but not by normal ones.

关键词： default logic extension representability

来源：评论

学校读者我要写书评

暂无评论

Statically-guided fork-based symbolic execution for vulnerability detection 27

Statically-guided fork-based symbolic execution for vulnerab...

引用

27th International Conference on software Engineering and Knowledge Engineering, SEKE 2015

作者： Wang, Yue Sun, Hao Zeng, Qingkai State Key Lab for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing210023 China

ISBN: (纸本)1891706373

Fork-based symbolic execution would waste large amounts of computing time and resource on invulnerable paths when applied to vulnerability detection. In this paper, we propose a statically-guided fork-based symbolic execution technique for vulnerability detection to mitigate this problem. In static analysis, we collect all valid jumps along vulnerable paths, and define the priority for each program branch based on the ratio of vulnerable paths over total paths in its subsequent program. In fork-based symbolic execution, path exploration can be restricted to vulnerable paths, and code segments with higher proportion of vulnerable paths can be analyzed in advance by utilizing the result of static analysis. We implement a prototype named SAF-SE and evaluate it with ten benchmarks from GNU Coreutils version 6.11. Experimental results show that SAF-SE outperforms KLEE in the efficiency and accuracy of vulnerability detection.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Checking Temporal Duration Properties of Timed Automata

引用

Journal of computer science & technology 2002年第6期17卷 689-698页

作者：李勇 Dang Van Hung State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing 210093 P.R. China International Institute for Software Technology The United Nations University P.O. Box 3058 Macao SAR P.R. China

In this paper, the problem of checking a timed automaton for a Duration Cal-culus formula of the form Temporal Duration Property is addressed. It is shown that TemporalDuration Properties are in the class of discretisable real-time properties of Timed Automata,and an algorithm is given to solve the problem based on linear programming techniques andthe depth-first search method in the integral region graph of the automaton. The complexityof the algorithm is in the same class as that of the solution of the reachability problem of timedautomata.

关键词： model checking duration calculus timed automata

来源：评论

学校读者我要写书评

暂无评论

Selecting queries from sample to crawl deep web data sources

引用

Web Intelligence and Agent Systems 2012年第1期10卷 75-88页

作者： Wang, Yan Lu, Jianguo Liang, Jie Chen, Jessica Liu, Jiming School of Computer Science University of Windsor Windsor ON Canada Department of Computer Science Hong Kong Baptist University Hong Kong State Key Lab for Novel Software Technology Nanjing University Nanjing China

This paper studies the problem of selecting queries to efficiently crawl a deep web data source using a set of sample documents. Crawling deep web is the process of collecting data from search interfaces by issuing queries. One of the major challenges in crawling deep web is the selection of the queries so that most of the data can be retrieved at a low cost. We propose to learn a set of queries from a sample of the data source. To verify that the queries selected from a sample also produce a good result for the entire data source, we carried out a set of experiments on large corpora including Gov2, newsgroups, wikipedia and Reuters. We show that our sampling-based method is effective by empirically proving that 1) The queries selected from samples can harvest most of the data in the original database;2) The queries with low overlapping rate in samples will also result in a low overlapping rate in the original database;and 3) The size of the sample and the size of the terms from where to select the queries do not need to be very large. Compared with other query selection methods, our method obtains the queries by analyzing a small set of sample documents, instead of learning the next best query incrementally from all the documents matched with previous queries. © 2012-IOS Press and the authors. All rights reserved.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Predicted Robustness as QoS for Deep Neural Network Models

引用

Journal of computer science & technology 2020年第5期35卷 999-1015页

作者： Yue-Huan Wang Ze-Nan Li Jing-Wei Xu Ping Yu Taolue Chen Xiao-Xing Ma State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China Department of Computer Science University of SurreyGuilfordGU27XHU.K.

The adoption of deep neural network(DNN)model as the integral part of real-world software systems necessitates explicit consideration of their quality-of-service(QoS).It is well-known that DNN models are prone to adversarial attacks,and thus it is vitally important to be aware of how robust a modeFs prediction is for a given input instance.A fragile prediction,even with high confidence,is not trustworthy in light of the possibility of adversarial *** propose that DNN models should produce a robustness value as an additional QoS indicator,along with the confidence value,for each prediction they *** approaches for robustness computation are based on adversarial searching,which are usually too expensive to be excised in real *** this paper,we propose to predict,rather than to compute,the robustness measure for each input ***,our approach inspects the output of the neurons of the target model and trains another DNN model to predict the *** focus on convolutional neural network(CNN)models in the current *** show that our approach is accurate,with only 10%-34%additional errors compared with the offline heavy-weight robustness *** also significantly outperforms some alternative *** further validate the effectiveness of the approach when it is applied to detect adversarial attacks and out-of-distribution *** approach demonstrates a better performance than,or at least is comparable to,the state-of-the-art techniques.

关键词： deep neural network quality of service robustness prediction

来源：评论

学校读者我要写书评

暂无评论

Timing analysis of MSC specifications with asynchronous concatenation

引用

International Journal on software Tools for technology Transfer 2012年第6期14卷 639-651页

作者： Pan, Minxue Li, Xuandong State Key Laboratory for Novel Software Technology Nanjing University Nanjing Jiangsu 210093 China Department of Computer Science and Technology Nanjing University Nanjing Jiangsu 210093 China

Message Sequence Chart (MSC) is a graphical and textual language for describing the interactions between system components, and MSC specifications (MSSs) are a combination of a set of basic MSCs (bMSCs) and a High-level MSC that describes potentially iterating and branching system behavior by specifying the compositions of basic MSCs, which offer an intuitive and visual way of specifying design requirements. With concurrent, timing, and asynchronous properties, MSSs are amenable to errors, and their analysis is important and difficult. This paper deals with timing analysis of MSC specifications with asynchronous concatenation. For an MSC specification, we require that for any loop, its first node be flexible in execution time and its any associated external timing constraint be enforced on the entire loop. Such an MSC specification is called a flexible loop-closed MSC specification (FLMSS). We show that for FLMSSs, the reachability analysis and bounded delay analysis problems can be solved efficiently by linear programming. The solutions have been implemented into our tool TASS and evaluated by experiments. © 2012 Springer-Verlag.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Reasoning about inheritance and cloning behaviors of software agents 31

Reasoning about inheritance and cloning behaviors of softwar...

引用

31st International Conference on technology of Object-Oriented Languages and Systems, TOOLS 1999

作者： Fan, Xiaocong Xu, Dianxiang Zheng, Guoliang National Key Laboratory for Novel Software Technology Department of Computer Science Nanjing University Nanjing210093 China

ISBN: (纸本)0769503934

Agents being a kind of restricted intelligent objects, it is a natuml way to research the inheritance feature of software agents and integmte inheritance mechanisms into AOP. Based on BDI model of agents, this paper addresses the semantics of static inheritance and dynamic inheritance of agents. For static inheritance, the semantics are discussed from two angles: Single inheritance and multiple inheritance. For dynamic inheritance, we identify and formally classify dynamic cloning behaviors of agent instances into four types: Function split, logic split, preference split and retrogress split. © 1999 IEEE.

关键词： Cloning

来源：评论

学校读者我要写书评

暂无评论

TextLogger: Inferring longer inputs on touch screen using motion sensors 15

TextLogger: Inferring longer inputs on touch screen using mo...

引用

8th ACM Conference on Security and Privacy in Wireless and Mobile Networks, WiSec 2015

作者： Ping, Dan Sun, Xin Mao, Bing State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China

ISBN: (纸本)9781450336239

Today's smartphones are equipped with precise motion sensors like accelerometer and gyroscope, which can measure tiny motion and rotation of devices. While they make mobile applications more functional, they also bring risks of leaking users' privacy. Researchers have found that tap locations on screen can be roughly inferred from motion data of the device. They mostly utilized this side-channel for inferring short input like PIN numbers and passwords, with repeated attempts to boost accuracy. In this work, we study further for longer input inference, such as chat record and email content, anything a user ever typed on a soft keyboard. Since people increasingly rely on smartphones for daily activities, their inputs directly or indirectly expose privacy about them. Thus, it is a serious threat if their input text is leaked. To make our attack practical, we utilize the shared memory side-channel for detecting window events and tap events of a soft keyboard. The up or down state of the keyboard helps triggering our Trojan service for collecting accelerometer and gyroscope data. Machine learning algorithms are used to roughly predict the input text from the raw data and language models are used to further correct the wrong predictions. We performed experiments on two real-life scenarios, which were writing emails and posting Twitter messages, both through mobile clients. Based on the experiments, we show the feasibility of inferring long user inputs to readable sentences from motion sensor data. By applying text mining technology on the inferred text, more sensitive information about the device owners can be exposed. Copyright 2015 ACM.

关键词： side-channel attacks edit distance model shared memory side-channel machine learning language model smartphone security keystroke inference using motion sensors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：