Z-complementary sequence sets (ZCSSs) can be applied to multi-carrier code division multiple access (MC-CDMA) systems as user address codes eliminate multi-path interference and multi-access interference. In this paper, two constructions of ZCSSs are investigated. First all, flexible diverse seed employed generate a large number optimal ZCSSs, which is generalization an existing construction. N...

An important issue when planning the tasks that a mobile robot has to reach is the path that it has to follow. In that sense, classical path planning algorithms focus on minimizing the total distance, generally assuming a flat terrain. Newer approaches also include traversability cost maps to define the terrain characteristics. However, this approach may generate unsafe paths in realistic envir...

This paper investigates, in the context of discrete-time switched systems, problem comparison for path-complete stability certificates. We introduce and study abstract operations on graphs, called lifts, which allow us to recover previous results a general framework. Moreover, this approach highlights existing relations between analytical properties chosen set candidate Lyapunov functions (the ...

The present article introduces the outdoor activity tour suggestion problem (OATSP). This problem involves finding a closed path of maximal attractiveness in a transportation network graph, given a target path length and tolerance. Total path attractiveness is evaluated as the sum of the average arc attractiveness and the sum of the vertex prizes in the path. This problem definition takes its r...

There is a recognized need for automated path planning for unmanned air vehicles (UAVs) and guided munitions. Evolutionary programming approaches provide an alternative to classical functional optimization methods with the capability of incorporating a variety of optimization goals, while tolerating vehicle constraints. In this work, we introduce an evolutionary flight path planning algorithm c...

BiDaS is a web-application that can generate massive Monte Carlo simulated sequence or numerical feature data sets (e.g. dinucleotide content, composition, transition, distribution properties) based on small user-provided data sets. BiDaS server enables users to analyze their data and generate large amounts of: (i) Simulated DNA/RNA and aminoacid (AA) sequences following practically identical s...

In this paper we propose an ontology pattern that represents paths in a geo-representation model to be used in an aerial path planning processes. This pattern provides semantics related to constraints (i.e., flight forbidden zones) in a path planning problem in order to generate collision free paths. Our proposed approach has been applied on an ontology containing geo-regions extracted from sat...

The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured data. At the core of many advanced network operations lies a common and critical graph query primitive: how to search graph structures efficiently within a large network? Unfortunately, the graph query is hard due to the ...