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

8th ACM SIGSAC Symposium on Information, computer and Communications Security, ASIA CCS 2013

作者： Zhongyang, Yibing Xin, Zhi Mao, Bing Xie, Li State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

ISBN: (纸本)9781450317672

Since smartphones have stored diverse sensitive privacy information, including credit card and so on, a great deal of malware are desired to tamper them. As one of the most prevalent platforms, Android contains sensitive resources that can only be accessed via corresponding APIs, and the APIs can be invoked only when user has authorized permissions in the Android permission model. However, a novel threat called privilege escalation attack may bypass this watchdog. It's presented as that an application with less permissions can access sensitive resources through public interfaces of a more privileged application, which is especially useful for malware to hide sensitive functions by dispersing them into multiple programs. We explore privilege-escalation malware evolution techniques on samples from Android Malware Genome Project. And they have showed great effectiveness against a set of powerful antivirus tools provided by VirusTotal. The detection ratios present different and distinguished reduction, compared to an average 61% detection ratio before transformation. In order to conquer this threat model, we have developed a tool called DroidAlarm to conduct a full-spectrum analysis for identifying potential capability leaks and present concrete capability leak paths by static analysis on Android applications. And we can still alarm all these cases by exposing capability leak paths in them. © 2013 ACM.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Planning with multi-valued landmarks

Planning with multi-valued landmarks

引用

27th AAAI Conference on Artificial Intelligence, AAAI 2013

作者： Zhang, Lei Wang, Chong-Jun Wu, Jun Liu, Meilin Xie, Jun-Yuan State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University 210023 China

ISBN: (纸本)9781577356158

Landmark heuristics are perhaps the most accurate current known admissible heuristics for optimal planning. A disjunctive action landmark can be seen a form of at-least-one constraint on the actions it contains. In many domains, some critical propositions have to be established for a number of times. Propositional landmarks are too weak to express this kind of constraints. In this paper, we propose to generalize landmarks to multi-valued landmarks to represent the more general cardinality constraints. We present a class of local multi-valued landmarks that can be efficiently extracted from propositional landmarks. By encoding multi-valued landmarks into CNF formulas, we can also use SAT solvers to systematically extract multi-valued landmarks. Experiment evaluations show that multivalued landmark based heuristics are more close to h * and compete favorably with the state-of-the-art of admissible landmark heuristics on benchmark domains. Copyright © 2013, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A layered filtering method based on multi-resolution geometric model

引用

Journal of Computational Information Systems 2013年第14期9卷 5651-5658页

作者： Zou, Zhiwen Wang, Zhenghui Chen, Jiming Pan, Jingui Li, Gen School of Computer Science and Telecommunications Engineering Jiangsu University Zhenjiang 212013 China State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China

In order to reduce network traffic in distributed virtual environment, combined LOD techniques with active interest management based on layered interest management, a layered filtering method based on multi-resolution geometric model is proposed in this paper. This method constructs multi-resolution geometric model using dynamic model simplification algorithm, then creates the mapping from matching degree to geometric resolution, and a layered filtering model is proposed based on dynamic mapping. Experimental results and analysis demonstrate that layered filtering technology based on multi-resolution geometric model can reduce the amount of network data transmission effectively. 1553-9105/Copyright © 2013 Binary Information Press.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Specifying and Detecting Behavioral Changes in Source Code Using Abstract Syntax Tree Differencing

Specifying and Detecting Behavioral Changes in Source Code U...

引用

International Conference on Trustworthy Computing and Services, ISCTCS 2012

作者： Li, Yuankui Wang, Linzhang State Key Lab. for Novel Software Technology Nanjing University Nanjing China Department of Computer Science and Technology Nanjing University Nanjing China

ISBN: (纸本)9783642357947

During the development of a software, its source code is continuously being modified. Even after the deployment, the maintenance work still involves changing the source code. Some of the modification performed on the source code is rather meaningless, while others might cause some critical behavioral changes. To help understand the modification, we can distinguish the behavioral changes and ease the tedious work. Our approach focuses on eliminating two kinds of changes: the unessential changes and the behavioral-unrelated changes, to achieve a better change detection result. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

MDE-Based Verification of SysML State Machine Diagram by UPPAAL

MDE-Based Verification of SysML State Machine Diagram by UPP...

引用

International Conference on Trustworthy Computing and Services, ISCTCS 2012

作者： Huang, Xiaopu Sun, Qingqing Li, Jiangwei Zhang, Tian State Key Lab. for Novel Software Technology Nanjing University Nanjing China Department of Computer Science and Technology Nanjing University Nanjing China

ISBN: (纸本)9783642357947

State Machine Diagram (SMD) is one of the SysML behavior diagrams, but it is a kind of semi-formal model language. As a consequence, models can not be verified conveniently and efficiently, especially in real-time embedded system (RTES) field as there are no descriptions of time and probability in SMD. To address these problems, we extend SMD with time and probability elements extracted from MARTE and propose a transformation algorithm based on MDE. With the algorithm, we transform the extended SMD to timed automata (TA) and then analyze and verify the transformation result using existing tools. So at the very beginning of system design, errors and deficiencies can be found. At last, we construct an instance to illustrate the validity of our approach. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

Timing Aspects Construction Using UML-MARTE Profile

Timing Aspects Construction Using UML-MARTE Profile

引用

International Conference on Trustworthy Computing and Services, ISCTCS 2012

作者： Sun, Qingqing Huang, Xiaopu Li, Jiangwei Zhang, Tian State Key Lab. for Novel Software Technology Nanjing University Nanjing China Department of Computer Science and Technology Nanjing University Nanjing China

ISBN: (纸本)9783642357947

Modern real time embedded systems are typically composed of multiple functional and nonfunctional concerns with nonfunctional concerns affect the former in many aspects. MARTE, an extension profile of UML2, aims to be the unified standard language for real time and embedded systems. Aspect-Oriented technology, as a complement to Object-Oriented technique, decomposes systems into distinct features by separating and modularizing crosscutting concerns. In this article, we illustrate how to use plenty of time modeling elements in MARTE profile to support comprehensive modeling of RTES. Similar to general crosscutting concerns, time concerns are often triggered at multiple concerns and tangled with other requirements. We try to deal with time as typically crosscutting concerns by AO technology. We practice these thoughts by means of examples and seek to explore an effective modeling mechanism using of both Aspect-Oriented methods and MARTE profile. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Dynamics of Interacting Diseases

引用

Physical Review X 2014年第4期4卷 041005-041005页

作者： Joaquín Sanz Cheng-Yi Xia Sandro Meloni Yamir Moreno Institute for Biocomputation and Physics of Complex Systems (BIFI) University of Zaragoza Zaragoza 50018 Spain Department of Theoretical Physics University of Zaragoza Zaragoza 50009 Spain Key Laboratory of Computer Vision and System (Ministry of Education) and Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin 300191 People’s Republic of China Complex Networks and Systems Lagrange Lab Institute for Scientific Interchange Turin 10126 Italy

Current modeling of infectious diseases allows for the study of complex and realistic scenarios that go from the population to the individual level of description. However, most epidemic models assume that the spreading process takes place on a single level (be it a single population, a metapopulation system, or a network of contacts). In particular, interdependent contagion phenomena can be addressed only if we go beyond the scheme-one pathogen-one network. In this paper, we propose a framework that allows us to describe the spreading dynamics of two concurrent diseases. Specifically, we characterize analytically the epidemic thresholds of the two diseases for different scenarios and compute the temporal evolution characterizing the unfolding dynamics. Results show that there are regions of the parameter space in which the onset of a disease’s outbreak is conditioned to the prevalence levels of the other disease. Moreover, we show, for the susceptible-infected-susceptible scheme, that under certain circumstances, finite and not vanishing epidemic thresholds are found even at the limit for scale-free networks. For the susceptible-infected-removed scenario, the phenomenology is richer and additional interdependencies show up. We also find that the secondary thresholds for the susceptible-infected-susceptible and susceptible-infected-removed models are different, which results directly from the interaction between both diseases. Our work thus solves an important problem and paves the way toward a more comprehensive description of the dynamics of interacting diseases.

关键词： Complex systems Interdisciplinary physics Statistical physics

来源：评论

学校读者我要写书评

暂无评论

Detecting community structure in bipartite networks based on matrix factorisation

引用

International Journal of Wireless and Mobile Computing 2013年第6期6卷 599-607页

作者： Chen, Bo-Lun Chen, Ling Zou, Sheng-Rong Xu, Xiu-Lian Department of Computer Science Nanjing University of Aeronautics and Astronautics Nanjing 210016 China Department of Computer Science Yangzhou University Yangzhou 225009 China State Key Lab. of Novel Software Technology Nanjing University Nanjing 210093 China College of Physics Science and Technology Yangzhou University Yangzhou 225009 China

Community detection in bipartite network is very important in the research on the theory and applications of complex network analysis. In this paper, an algorithm for detecting community structure in bipartite networks based on matrix factorisation is presented. The algorithm first partitions the network into two parts, each of which can reserve the community information as much as possible, and then the two parts are further recursively partitioned until the modularity cannot be further improved. While partitioning the network, we use the approach of matrix decomposition so that the row space of the associated matrix of the networks can be approximated as close as possible and the community information can be reserved as much as possible. Experimental results show that our algorithm can not only accurately identify the number of communities of a network, but also obtain higher quality of community partitioning without previously known parameters. Copyright © 2013 Inderscience Enterprises Ltd.

关键词： Factorization

来源：评论

学校读者我要写书评

暂无评论

Fast connection recovery against region failures with landmark-based source routing

Fast connection recovery against region failures with landma...

引用

2013 9th International Conference on the Design of Reliable Communication Networks, DRCN 2013

作者： Wang, Xiaoliang Jiang, Xiaohong Nguyen, Cam-Tu Zhang, Xiao Lu, Sanglu National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University 210093 Nanjing China Future University Hakodate Hokkaido Japan

ISBN: (纸本)9781479900497

Communication networks are vulnerable to the natural disasters or malicious attacks, which may cause a large area of corruptions and long term disconnection of network services. Such significant outage has become a serious problem today with regard to the stringent reliability requirement of the mission critical applications. In this paper, we focus on fast and effective failure recovery in face of region failures. Rather than rely on the time consuming failure localization, we introduce and evaluate a direct restoration mechanism upon detecting the path failure, which use the geographically distributed intermediate nodes, named 'landmarks', to reestablish the connection through a (near-)shortest detour path. The experimental analysis on randomly generated and realistic network topologies have shown that this approach can achieve high reliability and low stretch in case of region failures, and thus significantly reduce the impact of region failures on network based mission critical services. © 2013 Scientific Assoc for infocom.

关键词： Reliability analysis

来源：评论

学校读者我要写书评

暂无评论

Predicting employee relations in enterprises by bi-directional link mining

Predicting employee relations in enterprises by bi-direction...

引用

World Congress on Intelligent Control and Automation (WCICA)

作者： Wang Hong Sun Yanshen Institute of Information Science and Engineering Shandong Normal University Jinan Shandong Province China Computer Software Novel Technology Shandong Provincial Key Laboratory for Distributed Jinan Shandong Province China Department of Earth Sciences ZheJiang University Hangzhou Zhejiang Province China

By using link mining method, we can understand associations among persons in enterprises. In this paper, we propose a link mining model called a bi-directional link mining, which is capable of predicting edges that do not exist but may appear in the future in dynamic multi-dimensional networks. Firstly, we construct a dynamic multi-dimensional networks from an E-mail network and a telephone network, which makes us correctly describe a Group's staff relationship. Then we present some algorithms to build a reduction dimensional network and a dynamic network. After that, we give bi-directional link mining methods in a dynamic multi-dimensional weighted network and apply these methods in the enterprise's employee relational network. Experimental results show that these methods can effectively predict associations among persons in a large scale employee networks.

关键词： Electronic mail Heuristic algorithms Personnel Bidirectional control Prediction algorithms Data mining Social network services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：