In this report we introduce OKgraph, a software library for (open) Knowledge Graph extraction from free text. Named after a two-year project where we studied and developed unsupervised algorithms addressing tasks rela...
详细信息
Space-filling curves are well known for preserving pixel locality when they are used as paths to traverse 2D image data. Some prediction-based compression algorithms make use of these curves to ensure high pixel value...
详细信息
ISBN:
(纸本)9781728140698
Space-filling curves are well known for preserving pixel locality when they are used as paths to traverse 2D image data. Some prediction-based compression algorithms make use of these curves to ensure high pixel values correlation during 2D image data traversal. this work explores the distribution of pixel correlation induced by all possible space-filling curves on 2D image data and demonstrates that commonly used curves, such as the Hilbert or the Peano curves, do not provide the best possible pixel correlation for natural photographic images. Using experimental data collected on a large set of such images, we demonstrate that row-prime ordering is the best choice for preserving maximum pixel values correlation while reducing the dimensionality of 2D natural photographic image data.
the paper is devoted to issues of the network traffic analysis in conditions of uncertain network protocol specifications. We propose an approach to identify typical structures of network protocols and determine their...
详细信息
ISBN:
(纸本)9781728140698
the paper is devoted to issues of the network traffic analysis in conditions of uncertain network protocol specifications. We propose an approach to identify typical structures of network protocols and determine their lexical specifications based on text-inspired methods for the structural analysis of raw data. High heterogeneity, partial lexical uncertainty and use of new, proprietary or modified data transfer protocols in computer networks explain high relevance of the research topic. We present the technique of network traffic analysis and the results of experiments, that confirm the applicability of the proposed approach.
In this paper, we propose a method based on piecewise linear approximation (PLA) with segmented projection error (SPE) to reveal the underlying correlation structures and approximate multivariate time series. Based on...
详细信息
ISBN:
(纸本)9781728140698
In this paper, we propose a method based on piecewise linear approximation (PLA) with segmented projection error (SPE) to reveal the underlying correlation structures and approximate multivariate time series. Based on this method we elaborate an indicator called vector of segmented projection error (VSPE) to characterize the bearings degradation using standard time domain standard features extracted from the vibration signal. the indicator VSPE monitors the evolution of the entire degradation process efficiently and provides real-time information on bearings degradation. We show the effectiveness of this new indicator using benchmark data. the results reveal the sensitive and monotonic character of the indicator VSPE according to the bearings degradation, which is promising for monitoring bearings on their lifespan.
Transactional datastructures support threads executing a sequence of operations atomically. Dynamic transactions allow operands to be generated on the fly and allows threads to execute code in between the operations ...
详细信息
ISBN:
(纸本)9781450362900
Transactional datastructures support threads executing a sequence of operations atomically. Dynamic transactions allow operands to be generated on the fly and allows threads to execute code in between the operations of a transaction, in contrast to static transactions which need to know the operands in advance. A framework called Lock-free Transactional Transformation (LFTT) allows datastructures to run high-performance transactions, but it only supports static transactions. We extend LFTT to add support for dynamic transactions and wait-free progress while retaining its speed. the thread-helping scheme of LFTT presents a unique challenge to dynamic transactions. We overcome this challenge by changing the input of LFTT from a list of operations to a function, forcing helping threads to always start at the beginning of the transaction, and allowing threads to skip completed operations through the use of a list of return values. We thoroughly evaluate the performance impact of support for dynamic transactions and wait-free progress and find that these features do not hurt the performance of LFTT for our test cases.
the use of GPS for monitoring the deflections of large suspension bridges in the UK has been the subject of research at the University of Nottingham and Brunel University for over a decade. the following paper details...
详细信息
Image classification is one of the most important tasks in image analysis and computer vision. BP neural network is a successful classifier for the task. However, with regard to the low study efficiency and the slow c...
详细信息
ISBN:
(纸本)9781728140698
Image classification is one of the most important tasks in image analysis and computer vision. BP neural network is a successful classifier for the task. However, with regard to the low study efficiency and the slow convergence speed in BP algorithm, some optimization algorithms have been proposed for achieving better results. Among all these methods, BP neural network improved by particle swarm optimization (PSO) and genetic algorithm (GA) may be the most successful and classical ones. Nevertheless, both GA and PSO are easy to fall into the local optimal solution, which has a great impact on the precision of classification. As a result, a novel optimization algorithm called sine cosine algorithm (SCA) is presented to improve the classification performance. the experimental results manifest that the proposed method has good performances, and the classification accuracy is better than BP neural network optimized by GA, PSO or other algorithms.
the proceedings contain 33 papers. the topics discussed include: proving tree algorithms for succinct datastructures;data types as quotients of polynomial functors;primitive floats in Coq;a certificate-based approach ...
ISBN:
(纸本)9783959771221
the proceedings contain 33 papers. the topics discussed include: proving tree algorithms for succinct datastructures;data types as quotients of polynomial functors;primitive floats in Coq;a certificate-based approach to formally verified approximations;higher-order Tarski Grothendieck as a foundation for formal proof;generic authenticated datastructures, formally;a verified and compositional translation of LTL to deterministic Rabin automata;formalizing computability theory via partial recursive functions;formal proofs of Tarjan’s strongly connected components algorithm in Why3, Coq and Isabelle;and first-order guarded coinduction in Coq.
Requirements analysis is the first point of information system development, which has a significant impact on the development. For the requirements of natural language description, automated requirement checking model...
详细信息
ISBN:
(纸本)9781728109459
Requirements analysis is the first point of information system development, which has a significant impact on the development. For the requirements of natural language description, automated requirement checking model cannot feasible. To verify the consistency of information system requirements, the paper builds a semantic model with tree nodes of natural language clauses. the model divides clauses into a representation of keywords set with seven-tuple. the paper not only proposed a dependency tree model to solve the problem that the refined tree cannot characterize the relationship between syntactic structure and keywords, but also put forward a dependency tagging algorithm and an algorithm to construct and update dependency parsing tree. the paper further put forward a semantic similarity calculation method to determine similarity among sub clause syntactic structures.
Automated and semi-automated systems that derive actionable information from massive, heterogeneous datasets are essential for many applications. the reasoning of such systems must be as clear as possible in order to ...
详细信息
ISBN:
(纸本)9781728140698
Automated and semi-automated systems that derive actionable information from massive, heterogeneous datasets are essential for many applications. the reasoning of such systems must be as clear as possible in order to earn our trust. Lattices have begun to play a key role in computer science finding applications in distributed computing, programming languages, concurrency theory, and data mining, thereby justifying G. C. Rota's belief that lattice theory will play an important role in 21st Century mathematics [1]. In some instances, researchers must deal with posets that are not necessarily lattices and the question arises how these posets can be embedded in lattices. A classic way to answer this question is to construct the MacNeille completion of the lattice, which is the most compact way to embed a poset into a lattice. In 1973 G. Markowsky introduced the poset of irreducibles construction in his dissertation and demonstrated that this was a very compact way to represent a lattice. In addition, the poset of irreducibles has many of the properties of the poset of join-irreducibles of distributive lattices that was introduced by G. Birkhoff and described in his book [2]. In this paper, we show how to construct the poset of irreducibles for the MacNeille completion of a poset efficiently. We conclude with some applications of these ideas.
暂无评论