we give an algorithm, called t*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.first the nodes of the graph are labeled according to the topologicalordering. then for node i an ordered list of simple s − i paths iscreated. the length of the list is at most k and it is created by usingtournament trees. we prove the correctness of t* and ...

Abstract Urban parks are important public multifunctional space used for a wide range of activities. The usage levels of parks depend on the spatial characteristics of the spaces, where its forms and occupancies are referred as the usage-spatial relationship. Natural elements spatial complexity and park usability is of interest in this study. A photo - questionnaire was conducted among 296 of p...

Introduction: In this paper, a novel complexity measure is proposed to detect dynamical changes in nonlinear systems using ordinal pattern analysis of time series data taken from the system. Epilepsy is considered as a dynamical change in nonlinear and complex brain system. The ability of the proposed measure for characterizing the normal and epileptic EEG signals when the signal is short or is...

In the long-lived M-renaming problem, N processes repeatedly acquire and release names ranging over f0; :::;M?1g, where M < N. It is assumed that at most k processes concurrently request or hold names. EEcient solutions to the long-lived renaming problem can be used to improve the performance of applications in which processes repeatedly participate in a computation whose time complexity depend...

in this paper the problem of 3d scene and object classification from depth data is addressed. in contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. in order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. exploiting the algorithmic information theory, a new def...