On the Twisted q-Euler numbers and polynomials associated with basic q-l-functions

One purpose of this paper is to construct twisted q-Euler numbers by using p-adic invariant integral on Zp in the sense of fermionic. Finally, we consider twisted Euler q-zeta function and q-l-series which interpolate twisted q-Euler numbers and polynomials.Comment: 8 page

Optimal circular flight of multiple UAVs for target tracking in urban areas

This work is an extension of our previous result in which a novel single-target tracking algorithm for fixed-wing UAVs (Unmanned Air Vehicles) was proposed. Our previous algorithm firstly finds the centre of a circular flight path, rc, over the interested ground target which maximises the total chance of keeping the target inside the camera field of view of UAVs, , while the UAVs fly along the circular path. All the UAVs keep their maximum allowed altitude and fly along the same circle centred at rc with the possible minimum turn radius of UAVs. As discussed in [1,4], these circular flights are highly recommended for various target tracking applications especially in urban areas, as for each UAV the maximum altitude flight ensures the maximum visibility and the minimum radius turn keeps the minimum distance to the target at the maximum altitude. Assuming a known probability distribution for the target location, one can quantify , which is incurred by the travel of a single UAV along an arbitrary circle, using line-of-sight vectors. From this observation, (the centre of) an optimal circle among numerous feasible ones can be obtained by a gradient-based search combined with random sampling, as suggested in [1]. This optimal circle is then used by the other UAVs jointly tracking the same target. As the introduction of multiple UAVs may minimise further, the optimal spacing between the UAVs can be naturally considered. In [1], a typical line search method is suggested for this optimal spacing problem. However, as one can easily expect, the computational complexity of this search method may undesirably increase as the number of UAVs increases. The present work suggests a remedy for this seemingly complex optimal spacing problem. Instead of depending on time-consuming search techniques, we develop the following algorithm, which is computationally much more efficient. Firstly, We calculate the distribution (x), where x is an element of , which is the chance of capturing the target by one camera along . Secondly, based on the distribution function, (x), find separation angles between UAVs such that the target can be always tracked by at least one UAV with a guaranteed probabilistic measure. Here, the guaranteed probabilistic measure is chosen by taking into account practical constraints, e.g. required tracking accuracy and UAVs' minimum and maximum speeds. Our proposed spacing scheme and its guaranteed performance are demonstrated via numerical simulations

Some identities on derangement and degenerate derangement polynomials

In combinatorics, a derangement is a permutation that has no fixed points. The number of derangements of an n-element set is called the n-th derangement number. In this paper, as natural companions to derangement numbers and degenerate versions of the companions we introduce derangement polynomials and degenerate derangement polynomials. We give some of their properties, recurrence relations and identities for those polynomials which are related to some special numbers and polynomials.Comment: 12 page