Search results for "Abstract"

Feasibility of finite and infinite paths in data dependent programs

2005

This paper considers the feasibility of finite and infinite paths in programs in two simple programming languages. The language LBASE allows to express the dependencies of real time systems on integer data, the language LTIM can model quantitative timing constraints in r.t.s. specifications. It is proven that the problem of whether a given LBASE or LTIM program has an infinite feasible path (i.e. whether it can exhibit an infinite behaviour) is decidable. The possibilities to characterise the sets of all feasible finite and infinite paths in LBASE and LTIM programs are also discussed. The infinite feasible path existence problem is proven decidable also for the language LTIBA which has both…

The branch set of a quasiregular mapping between metric manifolds

2016

Abstract In this note, we announce some new results on quantitative countable porosity of the branch set of a quasiregular mapping in very general metric spaces. As applications, we solve a recent conjecture of Fassler et al., an open problem of Heinonen–Rickman, and an open question of Heinonen–Semmes.

Graphical models for estimating network determinants of multi-destination trips in Sicily

2017

Abstract This paper proposes a two-step approach for analysing the main determinants of multi-destination trip behaviour. It is based on a combination of graphical models and of a multinomial logistic regression model; the aim is to analyse direct and indirect effects of a wide set of tourist- and trip-related characteristics on multi-destination trip behaviour. Empirical data have been derived from a frontier survey of approximately 4000 incoming tourists in Sicily (Italy) at the end of their trip. Results suggest that multi-destination trips depend directly on the length of stay, the number of previous visits and motivation for the trip, and only indirectly on the interview month, travel …

Binary jumbled string matching for highly run-length compressible texts

2012

The Binary Jumbled String Matching problem is defined as: Given a string $s$ over $\{a,b\}$ of length $n$ and a query $(x,y)$, with $x,y$ non-negative integers, decide whether $s$ has a substring $t$ with exactly $x$ $a$'s and $y$ $b$'s. Previous solutions created an index of size O(n) in a pre-processing step, which was then used to answer queries in constant time. The fastest algorithms for construction of this index have running time $O(n^2/\log n)$ [Burcsi et al., FUN 2010; Moosa and Rahman, IPL 2010], or $O(n^2/\log^2 n)$ in the word-RAM model [Moosa and Rahman, JDA 2012]. We propose an index constructed directly from the run-length encoding of $s$. The construction time of our index i…

A spiking network for body size learning inspired by the fruit fly

2013

The concept of peripersonal space is an interesting research topics for psychologists, neurobiologists and for robotic applications. A living being can learn the representation of its own body to take the correct behavioral decision when interacting with the world. To transfer these important learning mechanisms on bio-robots, simple and efficient solutions can be found in the insect world. In this paper a neural-based model for body-size learning is proposed taking into account the results obtained in experiments with fruit flies. Simulations and experimental results on a roving platform are reported and compared with the biological counterpart.

Constrained Role Mining

2013

Role Based Access Control (RBAC) is a very popular access control model, for long time investigated and widely deployed in the security architecture of different enterprises. To implement RBAC, roles have to be firstly identified within the considered organization. Usually the process of (automatically) defining the roles in a bottom up way, starting from the permissions assigned to each user, is called {\it role mining}. In literature, the role mining problem has been formally analyzed and several techniques have been proposed in order to obtain a set of valid roles. Recently, the problem of defining different kind of constraints on the number and the size of the roles included in the resu…

Accelerometry - Simple, but challenging

2017

Attempt to calculation of delayed neutron emission probabilities using simple statistical model considerations

1977

Delayed neutron emission probabilities,P n , have been calculated using usual nuclear statistical model considerations. The influence of the incident parameters on the calculatedP n -values is discussed. The observed systematic deviation from the experimental neutron emission probabilities may be explained by the persistence of nuclear structure effects not contained in a simple statistical model.

M-bornologies on L-valued Sets

2017

We develop an approach to the concept of bornology in the framework of many-valued mathematical structures. It is based on the introduced concept of an M-bornology on an L-valued set (X, E), or an LM-bornology for short; here L is an iccl-monoid, M is a completely distributive lattice and \(E: X\times X \rightarrow L\) is an L-valued equality on the set X. We develop the basics of the theory of LM-bornological spaces and initiate the study of the category of LM-bornological spaces and appropriately defined bounded “mappings” of such spaces.

Fast Algorithms for Pseudoarboricity

2015

The densest subgraph problem, which asks for a subgraph with the maximum edges-to-vertices ratio d∗, is solvable in polynomial time. We discuss algorithms for this problem and the computation of a graph orientation with the lowest maximum indegree, which is equal to ⌈d∗⌉. This value also equals the pseudoarboricity of the graph. We show that it can be computed in O(|E| √ log log d∗) time, and that better estimates can be given for graph classes where d∗ satisfies certain asymptotic bounds. These runtimes are achieved by accelerating a binary search with an approximation scheme, and a runtime analysis of Dinitz’s algorithm on flow networks where all arcs, except the source and sink arcs, hav…