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

Formalising openCypher graph queries in relational algebra

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Marton, József Szárnyas, Gábor Varró, Dániel Budapest University of Technology and Economics Database Laboratory Budapest University of Technology and Economics Fault Tolerant Systems Research Group MTA-BME Lendület Research Group on Cyber-Physical Systems McGill University Department of Electrical and Computer Engineering

Graph database systems are increasingly adapted for storing and processing heterogeneous network-like datasets. However, due to the novelty of such systems, no standard data model or query language has yet emerged. Consequently, migrating datasets or applications even between related technologies often requires a large amount of manual work or ad-hoc solutions, thus subjecting the users to the possibility of vendor lock-in. To avoid this threat, vendors are working on supporting existing standard languages (e.g. SQL) or standardising languages. In this paper, we present a formal specifcation for openCypher, a highlevel declarative graph query language with an ongoing standardisation efort. We introduce relational graph algebra, which extends relational operators by adapting graph-specifc operators and defne a mapping from core openCypher constructs to this algebra. We propose an algorithm that allows systematic compilation of openCypher queries. Copyright © 2017, The Authors. All rights reserved.

关键词： Algebra

A novel vulnerability analysis approach to generate fuzzing test case in industrial control systems

学校读者我要写书评

暂无评论

A novel vulnerability analysis approach to generate fuzzing ...

2016 IEEE Information technology,Networking,Electronic and Automation Control Conference(ITNEC 2016)

作者： SungJin Kim WooYeon Jo Taeshik Shon Department of Computer Engineering Ajou University Department of Cyber Security Ajou University

ISBN: (纸本)9781467391955

A smart grid is nationwide industrial control system that combine IT and traditional electric system. The main hindrance to smart grid is security. To solve this problem we propose a novel approach for vulnerability analysis of smart grid protocols using fuzzing test. The fuzzing test is widely used for vulnerability analysis, however, these studies do not consider the cross-protocol test and are not suitable to smart grid network. Therefore, we propose a novel test case generation method for fuzzing test. Before creating test cases, we classify the protocol fields into three categories by its characteristics. Based on the classification, we can easily create test case based on the categories without considering each fields. So, it helps to generate cross-field and cross-layer test case. To verify our approach, we examine the common used protocol library using the test case generated by proposed method and successfully find unknown abnormality.

关键词： fuzzing test vulnerability analysis industrial control system security smart grid security

Design and implementation of mobile app and web-based software for management and monitoring of bicycle routes 13

学校读者我要写书评

暂无评论

Design and implementation of mobile app and web-based softwa...

13th European, Mediterranean and Middle Eastern Conference on Information Systems, EMCIS 2016

作者： Khodambashi, Soudabeh Sanders, Richard Liodden Gulla, Jon Atle Abrahamsson, Pekka Department of Computer and Information Science Norwegian University of Sceicne and Technology Trondheim Norway Department of Software Engineering Safety and Security Sintef Trondheim Norway

ISBN: (纸本)9789606897092

Currently there are only limited data available on the habits and behaviour of pedestrians and cyclists towards private motor vehicles and public transport. The only data on cyclists' behaviour originates from sparsely distributed counting points throughout Trondheim city in Norway. Current counting devices are few, unreliable and expensive to manufacture. An application that tracks cyclists, enables them to report on road-related issues, and uploads these data to a road administration database could provide a basis for road infrastructure planning. In this paper we present two software applications which address such needs in Norway. The first is an Android application for cyclists which tracks their location and allows them to report road faults when they are travelling. The second was designed for web browsers and provides an interface which city planners can use to analyse data. These data include route and road faults and visualisations of most and least popular lane, in addition to the possibility of adding surveys to specific areas of the city to mobile app users. Use of these applications could be used to plan improvements to bike paths in areas suffering cycle congestion, as well as providing information about issues with existing road infrastructure, and information relevant to future investment in bike lanes infrastructure. © Proceedings of the 13th European, Mediterranean and Middle Eastern Conference on Information Systems, EMCIS 2016. All rights reserved.

关键词： Investments

Combinatorial algorithms for control of biological regulatory networks

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Clark, Andrew Lee, Phillip Alomair, Basel Bushnell, Linda Poovendran, Radha Department of Electrical and Computer Engineering Worcester Polytechnic Institute WorcesterMA01609 United States Network Security Lab Department of Electrical Engineering University of Washington SeattleMA98195 United States National Center for Cybersecurity Technology King Abdulaziz City for Science and Technology Riyadh Saudi Arabia

Biological processes, including cell differentiation, organism development, and disease progression, can be interpreted as attractors (fixed points or limit cycles) of an underlying networked dynamical system. In this paper, we study the problem of computing a minimum-size subset of control nodes that can be used to steer a given biological network towards a desired attractor, when the networked system has Boolean dynamics. We first prove that this problem cannot be approximated to any nontrivial factor unless P=NP. We then formulate a sufficient condition and prove that the sufficient condition is equivalent to a target set selection problem, which can be solved using integer linear programming. Furthermore, we show that structural properties of biological networks can be exploited to reduce the computational complexity. We prove that when the network nodes have threshold dynamics and certain topological structures, such as block cactus topology and hierarchical organization, the input selection problem can be solved or approximated in polynomial time. For networks with nested canalyzing dynamics, we propose polynomial-time algorithms that are within a polylogarithmic bound of the global optimum. We validate our approach through numerical study on real-world gene regulatory networks. Copyright © 2017, The Authors. All rights reserved.

关键词： Dynamical systems

SMoNt: An ontology for crime solving through social media

学校读者我要写书评

暂无评论

International Journal of Metadata, Semantics and Ontologies 2017年第2-3期12卷 71-81页

作者： Kalemi, Edlira Yildirim-Yayilgan, Sule Domnori, Elton Elezaj, Ogerta Process and Information Systems Engineering Research Centre University of Surrey Guildford SurreyGU2 7XH United Kingdom Department of Information Security and Communication Technology Norwegian University of Science and Technology Gjøvik2815 Norway Department of Computer Engineering Epoka University Tirana1039 Albania Department of Mathematics Statistics and Applied Informatics University of Tirana Tirana1000 Albania

There are numerous social networks such as Facebook, LinkedIn, Google Plus and Twitter whose data sources are becoming larger every day holding an abundance of valuable information. Among these data, digital crime evidence can be collected from online social networks (OSNs) for crime detection and further analysis. This paper describes the SMONT ontology which has been developed to give support to the process of crime investigation and prevention. The SMONT ontology covers specific data about the crime, digital evidence obtained from OSNs, information archived from police entities, and also details related to people or events which may bring the authorities closer to crime case solving. It is possible to benefit from the ontology in different ways like: intelligence gathering;reasoning over the data;smarter searches and comparisons;open data publication purposes;and for the overall management of the crime solving and prevention process. Copyright © 2017 Inderscience Enterprises Ltd.

关键词： Ontology

Credit card fraud detection through parenclitic network analysis

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Zanin, Massimiliano Romance, Miguel Moral, Santiago Criado, Regino Department of Computer Science Faculty of Science and Technology Universidade Nova de Lisboa Lisboa Portugal Department of Applied Mathematics Universidad Rey Juan Carlos Mostoles Madrid28933 Spain Center for Biomedical Technology Universidad Politecnica de Madrid Pozuelo de Alarcon Madrid28223 Spain Cyber Security and Digital Trust BBVA Group Madrid28050 Spain

The detection of frauds in credit card transactions is a major topic in financial research, of profound economic implications. While this has hitherto been tackled through data analysis techniques, the resemblances between this and other problems, like the design of recommendation systems and of diagnostic/prognostic medical tools, suggest that a complex network approach may yield important benefits. In this contribution we present a first hybrid data mining/complex network classification algorithm, able to detect illegal instances in a real card transaction data set. It is based on a recently proposed network reconstruction algorithm that allows creating representations of the deviation of one instance from a reference group. We show how the inclusion of features extracted from the network data representation improves the score obtained by a standard, neural network-based classification algorithm;and additionally how this combined approach can outperform a commercial fraud detection system in specific operation niches. Beyond these specific results, this contribution represents a new example on how complex networks and data mining can be integrated as complementary tools, with the former providing a view to data beyond the capabilities of the latter. Copyright © 2017, The Authors. All rights reserved.

关键词： Complex networks

Predicting aesthetic score distribution through cumulative jensen-shannon divergence

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Jin, Xin Wu, Le Li, Xiaodong Chen, Siyu Peng, Siwei Chi, Jingying Ge, Shiming Song, Chenggen Zhao, Geng Department of Computer Science and Technology Beijing Electronic Science and Technology Institute Beijing100070 China Department of Information Security Beijing Electronic Science and Technology Institute Beijing100070 China College of Information Science and Technology Beijing University of Chemical Technology Beijing100029 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China

Aesthetic quality prediction is a challenging task in the computer vision community because of the complex interplay with semantic contents and photographic technologies. Recent studies on the powerful deep learning based aesthetic quality assessment usually use a binary high-low label or a numerical score to represent the aesthetic quality. However the scalar representation cannot describe well the underlying varieties of the human perception of aesthetics. In this work, we propose to predict the aesthetic score distribution (i.e., a score distribution vector of the ordinal basic human ratings) using Deep Convolutional Neural Network (DCNN). Conventional DCNNs which aim to minimize the difference between the predicted scalar numbers or vectors and the ground truth cannot be directly used for the ordinal basic rating distribution. Thus, a novel CNN based on the Cumulative distribution with Jensen-Shannon divergence (CJS-CNN) is presented to predict the aesthetic score distribution of human ratings, with a new reliability-sensitive learning method based on the kurtosis of the score distribution, which eliminates the requirement of the original full data of human ratings (without normalization). Experimental results on large scale aesthetic dataset demonstrate the effectiveness of our introduced CJS-CNN in this task. Copyright © 2017, The Authors. All rights reserved.

关键词： Forecasting

Energy efficient genetic inspired scheduling for data aggregation

学校读者我要写书评

暂无评论

International Journal of Control and Automation

International Journal of Control and Automation 2016年第3期9卷 227-234页

作者： Madhavi, S. Kim, Tai Honn Department of Computer Science and Engineering P.V.P. Siddhartha Institute of Technology Andhra Pradesh India Department of Convergence Security Sungshin Women's University 249-1 Dongseon-dong 3 - ga Seoul Korea Republic of

Energy efficient Data Aggregation Scheduling is essential in Ubiquitous sensor networks. Optimal communication distances between the nodes and the base station improves the network lifetime. Clustering improves the efficiency of the data aggregation problem. Many clustering techniques exist to find the optimal number of clusters in the network. The computation complexity of the methods to obtain optimal number of clusters is fair when genetic approaches are employed instead of the classical approaches. Since nodes in USN are dynamic, finding data aggregation schedules is difficult in a USN. Concurrent transmissions improve the throughput of the network, but the SINR perceived at the receiver should be greater than or equal to a certain threshold value for a successful transmission. Also the cluster heads and the member nodes dissipate energy. This power dissipation is more when there are more number of cluster heads. The noise and the power dissipation play a major role in decreasing the network life time. Hence in this paper we designed an efficient energy dissipation algorithm for data aggregation scheduling using the principles of Genetic algorithm and SINR. Since the battery power and bandwidth are the limited resources for the nodes in the USN our data aggregation scheduling algorithm gives equal priority for all of the following while electing a node as a cluster head. They are (a) Total power dissipation from all cluster heads in the USN, (b) The total power dissipation from the nodes at each cluster heads, (c) The SINR perceived at the cluster head should be more than a threshold value at each cluster head for the transmission to be successful, (d) The optimal schedule for the nodes in the USN so that all the nodes transmits their data finally to the base station quickly. With the application of the genetic methods our algorithm proved to be efficient when compared with the existing algorithms in obtaining maximum network life time with minimum number of clu

关键词： Base stations

A consequence of invertibility on the normal form of a MIMO nonlinear systems

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2016年第18期49卷 856-861页

作者： Wang, Lei Isidori, Alberto Marconi, Lorenzo Su, Hongye State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou China CASY - DEI University of Bologna Italy Department of Computer Control and Management Engineering University of Rome "La Sapienza" Rome Italy

In this paper, a relevant consequence of invertibility on the normal form of MIMO nonlinear systems is presented. Making full use of the definition of uniform invertibility in the sense of Singh, the multipliers δi+1(x)’s in the normal form are shown to possess a special property, that is to be triangularly dependent on the x2,i’s. As a matter of fact, this property turns out to be necessary and sufficient for uniform invertibility in the case of a two-input two-output systems having normal form. Moreover, we also show that invertibility, or this special property of the multipliers, is a sufficient condition of uniform complete observability. © 2016

关键词： Nonlinear systems MIMO systems Observability Delta I Invertibility MIMO nonlinear systems Multi input multi output nonlinear systems Normal form Special properties Two input two output systems Uniform complete observability