Search results for " Computer"
showing 10 items of 6910 documents
Combined column-and-row-generation for the optimal communication spanning tree problem
2018
Abstract This paper considers the exact solution of the optimal communication spanning tree problem (OCSTP), which can be described as follows: Given an undirected graph with transportation costs on every edge and communication requirements for all pairs of vertices, the OCSTP seeks for a spanning tree that minimizes the sum of the communication costs between all pairs of vertices, where the communication cost of a pair of vertices is defined as their communication requirement multiplied by the transportation cost of the unique tree path that connects the two vertices. Two types of compact formulations for OCSTP were presented in the literature. The first one is a four-index model based on …
Learning automata-based solutions to the optimal web polling problem modelled as a nonlinear fractional knapsack problem
2011
We consider the problem of polling web pages as a strategy for monitoring the world wide web. The problem consists of repeatedly polling a selection of web pages so that changes that occur over time are detected. In particular, we consider the case where we are constrained to poll a maximum number of web pages per unit of time, and this constraint is typically dictated by the governing communication bandwidth, and by the speed limitations associated with the processing. Since only a fraction of the web pages can be polled within a given unit of time, the issue at stake is one of determining which web pages are to be polled, and we attempt to do it in a manner that maximizes the number of ch…
Heuristics for the min–max arc crossing problem in graphs
2018
Abstract In this paper, we study the visualization of complex structures in the context of automatic graph drawing. Constructing geometric representations of combinatorial structures, such as networks or graphs, is a difficult task that requires an expert system. The automatic generation of drawings of graphs finds many applications from software engineering to social media. The objective of graph drawing expert systems is to generate layouts that are easy to read and understand. This main objective is achieved by solving several optimization problems. In this paper we focus on the most important one: reducing the number of arc crossings in the graph. This hard optimization problem has been…
Variable neighborhood descent for the incremental graph drawing
2017
Abstract Graphs are used to represent reality in several areas of knowledge. Drawings of graphs have many applications, from project scheduling to software diagrams. The main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion for a good representation of a graph. In this paper we target the edge crossing reduction in the context of incremental graph drawing, in which we want to preserve the layout of a graph over successive drawings. We propose a hybrid method based on the GRASP (Greedy Randomized Adaptive Search Procedure) and VND (Variable Neighborhood Descent) methodologies and compare it with previous methods via simulation.
Secure and Privacy Preserving Pattern Matching in Distributed Cloud-based Data Storage
2019
Given two strings: pattern $p$ of length $m$ and text $t$ of length $n$ . The string matching problem is to find all (or some) occurrences of the pattern $p$ in the text $t$ . We introduce a new simple data structure, called index arrays, and design fast privacy-preserving matching algorithm for string matching. The motivation behind introducing index arrays is determined by the need for pattern matching on distributed cloud-based datasets with semi-trusted cloud providers. It is intended to use encrypted index arrays both to improve performance and protect confidentiality and privacy of user data.
The regression Tsetlin machine: a novel approach to interpretable nonlinear regression
2019
Relying simply on bitwise operators, the recently introduced Tsetlin machine (TM) has provided competitive pattern classification accuracy in several benchmarks, including text understanding. In this paper, we introduce the regression Tsetlin machine (RTM), a new class of TMs designed for continuous input and output, targeting nonlinear regression problems. In all brevity, we convert continuous input into a binary representation based on thresholding, and transform the propositional formula formed by the TM into an aggregated continuous output. Our empirical comparison of the RTM with state-of-the-art regression techniques reveals either superior or on par performance on five datasets. Thi…
Automatic Integration of Spatial Data into the Semantic Web
2017
International audience
Kick Detection and Influx Size Estimation during Offshore Drilling Operations using Deep Learning
2019
An uncontrolled or unobserved influx or kick during drilling has the potential to induce a well blowout, one of the most harmful incidences during drilling both in regards to economic and environmental cost. Since kicks during drilling are serious risks, it is important to improve kick and loss detection performance and capabilities and to develop automatic flux detection methodology. There are clear patterns during a influx incident. However, due to complex processes and sparse instrumentation it is difficult to predict the behaviour of kicks or losses based on sensor data combined with physical models alone. Emerging technologies within Deep Learning are however quite adapt at picking up …
Performance Estimation using the Fitness-Fatigue Model with Kalman Filter Feedback
2016
Abstract Tracking and predicting the performance of athletes is of great interest, not only in training science but also, increasingly, for serious hobbyists. The increasing availability and use of smart watches and fitness trackers means that abundant data is becoming available, and the interest to optimally use this data for performance tracking and training optimization is great. One competitive model in this domain is the 3-time-constant fitness-fatigue model by Busso based on the model by Banister and colleagues. In the following, we will show that this model can be written equivalently as a linear, time-variant state-space model. With this understanding, it becomes clear that all meth…
Formation-based modelling and simulation of success in soccer
2018
Abstract The players’ positions of tactical groups in soccer can be mapped to formation-patterns by means of artificial neural networks (Kohonen, 1995). This way, the hundreds of positional situations of one half of a match can be reduced to about 20 to 30 types of formations (Grunz, Perl & Memmert, 2012; Perl, 2015), the coincidences of which can be used for describing and simulating tactical processes of the teams (Memmert, Lemmink & Sampaio, 2017): Developing and changing formations in the interaction with the opponent activities can be understood as a tactical game in the success context of ball control, space control and finally generating dangerous situations. As such it can b…