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

Structural transition in interdependent networks with regular interconnections

Physical Review E 2019年第1期99卷 012311-012311页

作者： Xiangrong Wang Robert E. Kooij Yamir Moreno Piet Van Mieghem Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft The Netherlands iTrust Centre for Research in Cyber Security Singapore University of Technology and Design Singapore Institute for Biocomputation and Physics of Complex Systems (BIFI) University of Zaragoza Zaragoza 50009 Spain Department of Theoretical Physics University of Zaragoza Zaragoza 50009 Spain ISI Foundation Turin Italy

Networks are often made up of several layers that exhibit diverse degrees of interdependencies. An interdependent network consists of a set of graphs G that are interconnected through a weighted interconnection matrix B, where the weight of each intergraph link is a non-negative real number p. Various dynamical processes, such as synchronization, cascading failures in power grids, and diffusion processes, are described by the Laplacian matrix Q characterizing the whole system. For the case in which the multilayer graph is a multiplex, where the number of nodes in each layer is the same and the interconnection matrix B=pI, I being the identity matrix, it has been shown that there exists a structural transition at some critical coupling p*. This transition is such that dynamical processes are separated into two regimes: if p>p*, the network acts as a whole; whereas when p

关键词： Collective behavior in networks Dynamics of networks Network phase transitions Topological phase transition

来源：评论

学校读者我要写书评

暂无评论

Automated verification of noninterference property 20th

Automated verification of noninterference property

引用

20th International Conference on Information and Communications security, ICICS 2018

作者： Zhang, Fan Zhang, Cong Xu, Mingdi Liu, Xiaoli Hu, Fangning Chao, HanChieh Mathematics and Computer Science School Wuhan Polytechnic University Wuhan China School of Computer Science and Electrical Engineering Jacobs University Bremen Bremen Germany Wuhan Digital and Engineering Institute Wuhan China College of Information Science and Technology/College of Cyber Security Jinan University Guangzhou510632 China Department of Electrical Engineering National Dong Hwa University Hualien Taiwan Department of Computer Science and Information Engineering National Ilan University Ilan Taiwan

ISBN: (纸本)9783030019495

Noninterference is an important information flow model that is widely applied in building secure information systems. Although the noninterference model itself has been thoroughly investigated, verifying the noninterference property in an efficient and automated manner remains an open problem. In this study, we explore the noninterference verification problem from the perspective of the state-equivalence relations between two automata running synchronously. Our results are as follows. (1) To the best of our knowledge, we are the first to propose a recursive form of the necessary and sufficient condition of noninterference. We also for the first time disclose the fact that Rushby’s definition of noninterference model can also be formalized as a bi-simulation (over two automata) (2) We present an automated noninterference verification algorithm. The algorithm can finish the verification within O(|S|2 * |D|), where |D| is the number of security domains and |S| is the number of states. The time-complexity of our algorithm is the best among other existing studies. © Springer Nature Switzerland AG 2018.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

An adaptive system for detecting malicious queries in web attacks

引用

Science China(Information Sciences) 2018年第3期61卷 175-190页

作者： Ying DONG Yuqing ZHANG Hua MA Qianru WU Qixu LIU Kai WANG Wenjie WANG National Computer Network Intrusion Protection Center University of Chinese Academy of Sciences State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of Sciences School of Mathematics and Statistics Xidian University Security Department Alibaba Group Zhanlu Laboratory Tencent Incorporation

Web request query strings(queries), which pass parameters to a referenced resource, are always manipulated by attackers to retrieve sensitive data and even take full control of victim web servers and web applications. However, existing malicious query detection approaches in the literature cannot cope with changing web attacks. In this paper, we introduce a novel adaptive system(AMOD) that can adaptively detect web-based code injection attacks, which are the majority of web attacks, by analyzing queries. We also present a new adaptive learning strategy, called SVM HYBRID, leveraged by our system to minimize manual work. In the evaluation, an up-to-date detection model is trained on a ten-day query dataset collected from an academic institute's web server logs. The evaluation shows our approach overwhelms existing approaches in two respects. Firstly, AMOD outperforms existing web attack detection methods with an F-value of 99.50%and FP rate of 0.001%. Secondly, the total number of malicious queries obtained by SVM HYBRID is3.07 times that by the popular support vector machine adaptive learning(SVM AL) method. The malicious queries obtained can be used to update the web application firewall(WAF) signature library.

关键词： web attacks adaptive learning intrusion detection anomaly detection SVM

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to "Generation of a local lung respiratory motion model using a weighted sparse algorithm and motion prior-based registration" [Comput. Biol. Med. 123 (2020) 103913]

引用

computers in biology and medicine 2021年 140卷 104271页

作者： Dong Chen Hongzhi Xie Lixu Gu Jing Liu Liang Tian College of Computer and Cyber Security Hebei Normal University Shijiazhuang China Hebei Provincial Engineering Research Center for Supply Chain Big Data Analytics and Data Security Hebei Normal University Shijiazhuang China Key Laboratory of Augmented Reality College of Mathematics and Information Science Hebei Normal University Shijiazhuang China. Department of Cardiothoracic Surgery Peking Union Medical College Hospital Beijing China. School of Biomedical Engineering Shanghai Jiao Tong University Shanghai China. Key Laboratory of Augmented Reality College of Mathematics and Information Science Hebei Normal University Shijiazhuang China. Electronic address: liujing01@***. Key Laboratory of Augmented Reality College of Mathematics and Information Science Hebei Normal University Shijiazhuang China. Electronic address: tianliang@***.

来源：评论

学校读者我要写书评

暂无评论

On a parametric mulholland-type inequality and applications

Abstract and Applied Analysis

引用

Abstract and Applied Analysis 2019年第none期2019卷 8-8页

作者： Yang, Bicheng Huang, Meifa Zhong, Yanru Department of Mathematics Guangdong University of Education Guangzhou Guangdong 510303 China School of Mechanical Science and Electrical Engineering Guilin University of Electronic Technology Guilin Guangxi 541004 China School of Computer Science and Information Security Guilin University of Electronic Technology Guilin Guangxi 541004 China

In this paper, by the use of the weight functions, and the idea of introducing parameters, a discrete Mulholland-type inequality with the general homogeneous kernel and the equivalent form are given. The equivalent statements of the best possible constant factor related to a few parameters are provided. As applications, the operator expressions and a few particular examples are considered. © 2019 Bicheng Yang et al.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Impossible meet-in-the-middle fault analysis on the LED lightweight cipher in VANETs

引用

Science China(Information Sciences) 2018年第3期61卷 118-130页

作者： Wei LI Vincent RIJMEN Zhi TAO Qingju WANG Hua CHEN Yunwen LIU Chaoyun LI Ya LIU School of Computer Science and Technology Donghua University imec-COSIC KU Leuven Shanghai Key Laboratory of Integrate Administration Technologies for Information Security Department of Computer Science and Engineering Shanghai Jiao Tong University Department of Applied Mathematics and Computer Science Technical University of Denmark Trusted Computing and Information Assurance Laboratory Institute of SoftwareChinese Academy of Sciences College of Science National University of Defense Technology Department of Computer Science and Engineering University of Shanghai for Science and Technology

With the expansion of wireless technology, vehicular ad-hoc networks(VANETs) are emerging as a promising approach for realizing smart cities and addressing many serious traffic problems, such as road safety, convenience, and efficiency. To avoid any possible rancorous attacks, employing lightweight ciphers is most effective for implementing encryption/decryption, message authentication, and digital signatures for the security of the VANETs. Light encryption device(LED) is a lightweight block cipher with two basic keysize variants: LED-64 and LED-128. Since its inception, many fault analysis techniques have focused on provoking faults in the last four rounds to derive the 64-bit and 128-bit secret keys. It is vital to investigate whether injecting faults into a prior round enables breakage of the LED. This study presents a novel impossible meet-in-the-middle fault analysis on a prior round. A detailed analysis of the expected number of faults is used to uniquely determine the secret key. It is based on the propagation of truncated differentials and is surprisingly reminiscent of the computation of the complexity of a rectangle attack. It shows that the impossible meet-in-the-middle fault analysis could successfully break the LED by fault injections.

关键词： VANETs LED lightweight cipher impossible meet-in-the-middle fault analysis

来源：评论

学校读者我要写书评

暂无评论

Fast stochastic ordinal embedding with variance reduction and adaptive step size

arXiv

引用

arXiv 2019年

作者： Ma, Ke Zeng, Jinshan Xiong, Jiechao Xu, Qianqian Cao, Xiaochun Liu, Wei Yao, Yuan School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China School of Computer Information Engineering Jiangxi Normal University NanchangJiangxi330022 China Tencent AI Lab Shenzhen Guangdong China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Cyberspace Security Research Center Peng Cheng Laboratory Shenzhen518055 China School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China Department of Mathematics and by courtesy Department of Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong

—Learning representation from relative similarity comparisons, often called ordinal embedding, gains rising attention in recent years. Most of the existing methods are based on semi-definite programming (SDP), which is generally time-consuming and degrades the scalability, especially confronting large-scale data. To overcome this challenge, we propose a stochastic algorithm called SVRG-SBB, which has the following features: i) achieving good scalability via dropping positive semi-definite (PSD) constraints as serving a fast algorithm, i.e., stochastic variance reduced gradient (SVRG) method, and ii) adaptive learning via introducing a new, adaptive step size called the stabilized Barzilai-Borwein (SBB) step size. Theoretically, under some natural assumptions, we show the O(T1 ) rate of convergence to a stationary point of the proposed algorithm, where T is the number of total iterations. Under the further Polyak-Lojasiewicz assumption, we can show the global linear convergence (i.e., exponentially fast converging to a global optimum) of the proposed algorithm. Numerous simulations and real-world data experiments are conducted to show the effectiveness of the proposed algorithm by comparing with the state-of-the-art methods, notably, much lower computational cost with good prediction performance. Copyright © 2019, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

iSplit LBI: Individualized partial ranking with ties via split LBI

arXiv

引用

arXiv 2019年

作者： Xu, Qianqian Sun, Xinwei Yang, Zhiyong Cao, Xiaochun Huang, Qingming Yao, Yuan Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS Microsoft Research Asia State Key Laboratory of Information Security Institute of Information Engineering CAS School of Cyber Security University of Chinese Academy of Sciences School of Computer Science and Tech. University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management CAS Peng Cheng Laboratory Department of Mathematics Hong Kong University of Science and Technology Hong Kong

Due to the inherent uncertainty of data, the problem of predicting partial ranking from pairwise comparison data with ties has attracted increasing interest in recent years. However, in real-world scenarios, different individuals often hold distinct preferences. It might be misleading to merely look at a global partial ranking while ignoring personal diversity. In this paper, instead of learning a global ranking which is agreed with the consensus, we pursue the tie-aware partial ranking from an individualized perspective. Particularly, we formulate a unified framework which not only can be used for individualized partial ranking prediction, but also be helpful for abnormal user selection. This is realized by a variable splitting-based algorithm called iSplitLBI. Specifically, our algorithm generates a sequence of estimations with a regularization path, where both the hyperparameters and model parameters are updated. At each step of the path, the parameters can be decomposed into three orthogonal parts, namely, abnormal signals, personalized signals and random noise. The abnormal signals can serve the purpose of abnormal user selection, while the abnormal signals and personalized signals together are mainly responsible for individual partial ranking prediction. Extensive experiments on simulated and real-world datasets demonstrate that our new approach significantly outperforms state-of-the-art alternatives. The code is now availiable at https://***/qianqianxu010/ NeurIPS2019-iSplitLBI. Copyright © 2019, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A chaotic artificial bee colony algorithm based on lévy search

A chaotic artificial bee colony algorithm based on lévy sea...

引用

作者： Lin, Shijie Dong, Chen Wang, Zhiqiang Guo, Wenzhong Chen, Zhenyi Ye, Yin College of Mathematics and Computer Science Fuzhou University Fuzhou350116 China Key Laboratory of Information Security of Network Systems Fuzhou350116 China Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China Department of Electrical Engineering University of South Florida TampaFL33620 United States

A Lévy search strategy based chaotic artificial bee colony algorithm (LABC) is proposed in this paper. The chaotic sequence, global optimal mechanism and Lévy flight mechanism were introduced respectively into the initialization, the employed bee search and the onlooker bee search. The experiments show that the proposed algorithm performed better in convergence speed, global search ability and optimization accuracy than other improved ABC. Copyright © 2018 The Institute of Electronics, Information and Communication Engineers.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Finding global optima in nonconvex stochastic semide finite optimization with variance reduction

arXiv

引用

arXiv 2018年

作者： Zeng, Jinshan Ma, Ke Yao, Yuan School of Computer Information Engineering Jiangxi Normal University Department of Mathematics Hong Kong University of Science and Technology State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences School of Cyber Security University of Chinese Academy of Sciences

There is a recent surge of interest in nonconvex reformulations via low-rank factorization for stochastic convex semide finite optimization problem in the purpose of efficiency and scalability. Compared with the original convex formulations, the nonconvex ones typically involve much fewer variables, allowing them to scale to scenarios with millions of variables. However, it opens a new challenge that under what conditions the nonconvex stochastic algorithms may find the global optima effectively despite their empirical success in applications. In this paper, we provide an answer that a stochastic gradient descent method with variance reduction, can be adapted to solve the nonconvex reformulation of the original convex problem, with a global linear convergence, i.e., converging to a global optimum exponentially fast, at a proper initial choice in the restricted strongly convex case. Experimental studies on both simulation and real-world applications on ordinal embedding are provided to show the effectiveness of the proposed algorithms. Copyright © 2018, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：