Personal monitoring devices such as cyclist helmet cameras to record accidents or dash cams to catch collisions have proliferated, with more companies producing smaller and compact recording gadgets. As these devices are becoming a part of citizens e
veryday arsenal, concerns over the residents privacy are progressing. Therefore, this paper presents SASSL, a secure aerial surveillance drone using split learning to classify whether there is a presence of a fire on the streets. This innovative split learning method transfers CCTV footage captured with a drone to a nearby server to run a deep neural network to detect a fires presence in real-time without exposing the original data. We devise a scenario where surveillance UAVs roam around the suburb, recording any unnatural behavior. The UAV can process the recordings through its on-mobile deep neural network system or transfer the information to a server. Due to the resource limitations of mobile UAVs, the UAV does not have the capacity to run an entire deep neural network on its own. This is where the split learning method comes in handy. The UAV runs the deep neural network only up to the first hidden layer and sends only the feature map to the cloud server, where the rest of the deep neural network is processed. By ensuring that the learning process is divided between the UAV and the server, the privacy of raw data is secured while the UAV does not overexert its minimal resources.
In this paper, we review well-known handovers algorithms in satellite environment. The modern research trends and contributions are proposed and summarized in order to overcome their considering problems in satellite-air-ground integrated network env
ironment caused by the fast movement of Low Earth Orbit (LEO) satellite and related frequent handover occurrences.
In modern networks, the use of drones as mobile base stations (MBSs) has been discussed for coverage flexibility. However, the realization of drone-based networks raises several issues. One of the critical issues is drones are extremely power-hungry.
To overcome this, we need to characterize a new type of drones, so-called charging drones, which can deliver energy to MBS drones. Motivated by the fact that the charging drones also need to be charged, we deploy ground-mounted charging towers for delivering energy to the charging drones. We introduce a new energy-efficiency maximization problem, which is partitioned into two independently separable tasks. More specifically, as our first optimization task, two-stage charging matching is proposed due to the inherent nature of our network model, where the first matching aims to schedule between charging towers and charging drones while the second matching solves the scheduling between charging drones and MBS drones. We analyze how to convert the formulation containing non-convex terms to another one only with convex terms. As our second optimization task, each MBS drone conducts energy-aware time-average transmit power allocation minimization subject to stability via Lyapunov optimization. Our solutions enable the MBS drones to extend their lifetimes; in turn, network coverage-time can be extended.
We study the probability that an $(n - m)$-dimensional linear subspace in $mathbb{P}^n$ or a collection of points spanning such a linear subspace is contained in an $m$-dimensional variety $Y subset mathbb{P}^n$. This involves a strategy used by Galk
in--Shinder to connect properties of a cubic hypersurface to its Fano variety of lines via cut and paste relations in the Grothendieck ring of varieties. Generalizing this idea to varieties of higher codimension and degree, we can measure growth rates of weighted probabilities of $k$-planes contained in a sequence of varieties with varying initial parameters over a finite field. In the course of doing this, we move an identity motivated by rationality problems involving cubic hypersurfaces to a motivic statistics setting associated with cohomological stability.
In this paper, we propose a novel deep Q-network (DQN)-based edge selection algorithm designed specifically for real-time surveillance in unmanned aerial vehicle (UAV) networks. The proposed algorithm is designed under the consideration of delay, ene
rgy, and overflow as optimizations to ensure real-time properties while striking a balance for other environment-related parameters. The merit of the proposed algorithm is verified via simulation-based performance evaluation.
We use methods for computing Picard numbers of reductions of K3 surfaces in order to study the decomposability of Jacobians over number fields and the variance of Mordell-Weil ranks of families of Jacobians over different ground fields. For example,
we give examples of surfaces whose Picard numbers jump in rank at all primes of good reduction using Mordell-Weil groups of Jacobians and show that the genus of curves over number fields whose Jacobians are isomorphic to a product of elliptic curves satisfying certain reduction conditions is bounded. The isomorphism result addresses the number field analogue of some questions of Ekedahl and Serre on decomposability of Jacobians of curves into elliptic curves.
The generalized Fibonacci sequences are sequences ${f_n}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t in mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent paper, Amdeberhan,
Chen, Moll, and Sagan considered some arithmetic properites of the generalized Fibonacci sequence. Specifically, they considered the behavior of analogues of the $p$-adic valuation and the Riemann zeta function. In this paper, we resolve some conjectures which they raised relating to these topics. We also consider the rank modulo $n$ in more depth and find an interpretation of the rank in terms of the order of an element in the multiplicative group of a finite field when $n$ is an odd prime. Finally, we study the distribution of the rank over different values of $s$ when $t = -1$ and suggest directions for further study involving the rank modulo prime powers of generalized Fibonacci sequences.
It is well known that for any prime $pequiv 3$ (mod $4$), the class numbers of the quadratic fields $mathbb{Q}(sqrt{p})$ and $mathbb{Q}(sqrt{-p})$, $h(p)$ and $h(-p)$ respectively, are odd. It is natural to ask whether there is a formula for $h(p)/h(
-p)$ modulo powers of $2$. We show the formula $h(p) equiv h(-p) m(p)$ (mod $16$), where $m(p)$ is an integer defined using the negative continued fraction expansion of $sqrt{p}$. Our result solves a conjecture of Richard Guy.
We use Maynards methods to show that there are bounded gaps between primes in the sequence ${lfloor nalpharfloor}$, where $alpha$ is an irrational number of finite type. In addition, given a superlinear function $f$ satisfying some properties describ
ed by Leitmann, we show that for all $m$ there are infinitely many bounded intervals containing $m$ primes and at least one integer of the form $lfloor f(q)rfloor$ with $q$ a positive integer.
