Searcharxiv⌕ Search

arXiv subjects

Michele Rossi

Publications and source records attributed to Michele Rossi.

At least 91 records · Page 5Linked to original sources

IDNet: Smartphone-based Gait Recognition with Convolutional Neural Networks

Here, we present IDNet, a user authentication framework from smartphone-acquired motion signals. Its goal is to recognize a target user from their way of walking, using the accelerometer and gyroscope (inertial) signals provided by a commercial smartphone worn in the front pocket of the user's trousers. IDNet features several innovations including: i) a robust and smartphone-orientation-independent walking cycle extraction block, ii) a novel feature extractor based on convolutional neural networks, iii) a one-class support vector machine to classify walking cycles, and the coherent integration of these into iv) a multi-stage authentication technique. IDNet is the first system that exploits a deep learning approach as universal feature extractors for gait recognition, and that combines classification results from subsequent walking cycles into a multi-stage decision making framework. Experimental results show the superiority of our approach against state-of-the-art techniques, leading to misclassification rates (either false negatives or positives) smaller than 0.15% with fewer than five walking cycles. Design choices are discussed and motivated throughout, assessing their impact on the user authentication performance.

cs.CV↗

Z-linear Gale duality and poly weighted spaces (PWS)

The present paper is devoted to discussing Gale duality from the Z-linear algebraic point of view. This allows us to isolate the class of Q-factorial complete toric varieties whose class group is torsion free, here called poly weighted spaces (PWS), as an interesting generalization of weighted projective spaces (WPS).

math.AG↗

Deforming Geometric Transitions

After a quick review of the wild structure of the complex moduli space of Calabi-Yau threefolds and the role of geometric transitions in this context (the Calabi-Yau web) the concept of "deformation equivalence" for geometric transitions is introduced to understand the arrows of the Gross-Reid Calabi-Yau web as deformation-equivalence classes of geometric transitions. Then the focus will be on some results and suitable examples to understand under which conditions it is possible to get "simple" geometric transitions, which are almost the only well-understood geometric transitions both in mathematics and in physics.

math.AG↗

Staying Alive: System Design for Self-Sufficient Sensor Networks

Self-sustainability is a crucial step for modern sensor networks. Here, we offer an original and comprehensive framework for autonomous sensor networks powered by renewable energy sources. We decompose our design into two nested optimization steps: the inner step characterizes the optimal network operating point subject to an average energy consumption constraint, while the outer step provides online energy management policies making the system energetically self-sufficient in the presence of unpredictable and intermittent energy sources. Our framework sheds new light into the design of pragmatic schemes for the control of energy harvesting sensor networks} and permits to gauge the impact of key sensor network parameters, such as the battery capacity, the harvester size, the information transmission rate and the radio duty cycle. We analyze the robustness of the obtained energy management policies in the cases where the nodes have differing energy inflow statistics and where topology changes may occur, devising effective heuristics. Our energy management policies are finally evaluated considering real solar radiation traces, validating them against state of the art solutions and describing the impact of relevant design choices in terms of achievable network throughput and battery level dynamics.

cs.NI↗

On a remark by Y. Namikawa

The aim of the present paper is on the one hand to produce examples supporting the conclusion of Y. Namikawa in Remark 2.8 of \cite{N} and improving considerations of Example 1.11 of the same paper. On the other hand, it is intended to give a geometric interpretation of the rigidity properties of some trees of exceptional rational curves, as observed by Namikawa, which can be obtained by factorizing small resolutions through nodal threefolds.

math.AG↗

Analytic equivalence of geometric transitions

In this paper \emph{analytic equivalence} of geometric transition is defined in such a way that equivalence classes of geometric transitions turn out to be the \emph{arrows} of the \cy web. Then it seems natural and useful, both from the mathematical and physical point of view, look for privileged arrows' representatives, called \emph{canonical models}, laying the foundations of an \emph{analytic} classification of geometric transitions. At this purpose a numerical invariant, called \emph{bi--degree}, summarizing the topological, geometric and physical changing properties of a geometric transition, is defined for a large class of geometric transitions.

math.AG↗

A rigidity theorem for small resolutions

This paper presents a rigidity property of the exceptional locus of some kind of small birational contractions. An application in the context of geometric transitions and Calabi-Yau threefolds moduli space is then given, with some physical implication in studying the so-called Vacuum Degeneracy Problem.

math.AG↗

Distributed Power Loss Minimization in Residential Micro Grids: a Communications Perspective

The constantly increasing number of power generation devices based on renewables is calling for a transition from the centralized control of electrical distribution grids to a distributed control scenario. In this context, distributed generators (DGs) are exploited to achieve other objectives beyond supporting loads, such as the minimization of the power losses along the distribution lines. The aim of this work is that of designing a full-fledged system that extends existing state of the art algorithms for the distributed minimization of power losses. We take into account practical aspects such as the design of a communication and coordination protocol that is resilient to link failures and manages channel access, message delivery and DG coordination. Thus, we analyze the performance of the resulting optimization and communication scheme in terms of power loss reduction, reduction of aggregate power demand, convergence rate and resilience to communication link failures. After that, we discuss the results of a thorough simulation campaign, obtained using topologies generated through a statistical approach that has been validated in previous research, by also assessing the performance deviation with respect to localized schemes, where the DGs are operated independently. Our results reveal that the convergence and stability performance of the selected algorithms vary greatly. However, configurations exist for which convergence is possible within five to ten communication steps and, when just 30% of the nodes are DGs, the aggregate power demand is roughly halved. Also, some of the considered approaches are quite robust against link failures as they still provide gains with respect to the localized solutions for failure rates as high as 50%.

cs.OH↗

SolarStat: Modeling Photovoltaic Sources through Stochastic Markov Processes

In this paper, we present a methodology and a tool to derive simple but yet accurate stochastic Markov processes for the description of the energy scavenged by outdoor solar sources. In particular, we target photovoltaic panels with small form factors, as those exploited by embedded communication devices such as wireless sensor nodes or, concerning modern cellular system technology, by small-cells. Our models are especially useful for the theoretical investigation and the simulation of energetically self-sufficient communication systems including these devices. The Markov models that we derive in this paper are obtained from extensive solar radiation databases, that are widely available online. Basically, from hourly radiance patterns, we derive the corresponding amount of energy (current and voltage) that is accumulated over time, and we finally use it to represent the scavenged energy in terms of its relevant statistics. Toward this end, two clustering approaches for the raw radiance data are described and the resulting Markov models are compared against the empirical distributions. Our results indicate that Markov models with just two states provide a rough characterization of the real data traces. While these could be sufficiently accurate for certain applications, slightly increasing the number of states to, e.g., eight, allows the representation of the real energy inflow process with an excellent level of accuracy in terms of first and second order statistics. Our tool has been developed using Matlab(TM) and is available under the GPL license at[1].

cs.OH↗

Weighted Projective Spaces from the toric point of view with computational applications

The purpose of the present paper is threefold. First: giving a treatise on weighted projective spaces by the toric point of view. Second: providing characterizations of fans and polytopes giving weighted projective spaces, with particular focus on a kind of \emph{recognition process} of toric data like fans and polytopes. Third: building a mathematical framework for the algorithmic and computational approach to wps's realized in [23,24].

math.AG↗

To Compress or Not To Compress: Processing vs Transmission Tradeoffs for Energy Constrained Sensor Networking

In the past few years, lossy compression has been widely applied in the field of wireless sensor networks (WSN), where energy efficiency is a crucial concern due to the constrained nature of the transmission devices. Often, the common thinking among researchers and implementers is that compression is always a good choice, because the major source of energy consumption in a sensor node comes from the transmission of the data. Lossy compression is deemed a viable solution as the imperfect reconstruction of the signal is often acceptable in WSN. In this paper, we thoroughly review a number of lossy compression methods from the literature, and analyze their performance in terms of compression efficiency, computational complexity and energy consumption. We consider two different scenarios, namely, wireless and underwater communications, and show that signal compression may or may not help in the reduction of the overall energy consumption, depending on factors such as the compression algorithm, the signal statistics and the hardware characteristics, i.e., micro-controller and transmission technology. The lesson that we have learned, is that signal compression may in fact provide some energy savings. However, its usage should be carefully evaluated, as in quite a few cases processing and transmission costs are of the same order of magnitude, whereas, in some other cases, the former may even dominate the latter. In this paper, we show quantitative comparisons to assess these tradeoffs in the above mentioned scenarios. Finally, we provide formulas, obtained through numerical fittings, to gauge computational complexity, overall energy consumption and signal representation accuracy for the best performing algorithms as a function of the most relevant system parameters.

cs.NI↗

Dynamic Compression-Transmission for Energy-Harvesting Multihop Networks with Correlated Sources

Energy-harvesting wireless sensor networking is an emerging technology with applications to various fields such as environmental and structural health monitoring. A distinguishing feature of wireless sensors is the need to perform both source coding tasks, such as measurement and compression, and transmission tasks. It is known that the overall energy consumption for source coding is generally comparable to that of transmission, and that a joint design of the two classes of tasks can lead to relevant performance gains. Moreover, the efficiency of source coding in a sensor network can be potentially improved via distributed techniques by leveraging the fact that signals measured by different nodes are correlated. In this paper, a data gathering protocol for multihop wireless sensor networks with energy harvesting capabilities is studied whereby the sources measured by the sensors are correlated. Both the energy consumptions of source coding and transmission are modeled, and distributed source coding is assumed. The problem of dynamically and jointly optimizing the source coding and transmission strategies is formulated for time-varying channels and sources. The problem consists in the minimization of a cost function of the distortions in the source reconstructions at the sink under queue stability constraints. By adopting perturbation-based Lyapunov techniques, a close-to-optimal online scheme is proposed that has an explicit and controllable trade-off between optimality gap and queue sizes. The role of side information available at the sink is also discussed under the assumption that acquiring the side information entails an energy cost. It is shown that the presence of side information can improve the network performance both in terms of overall network cost function and queue sizes.

cs.IT↗

MAPLE subroutines for computing Milnor and Tyurina numbers of hypersurface singularities with application to Arnol'd adjacencies

In the present paper MAPLE subroutines computing Milnor and Tyurina numbers of an isolated algebraic hypersurface singularity are presented and described in detail. They represents examples, and perhaps the first ones, of a MAPLE implementation of local monomial ordering. As an application, the last section is devoted to writing down equations of algebraic stratifications of Kuranishi spaces of simple Arnol'd singularities: they geometrically represents, by means of inclusions of algebraic subsets, the partial ordering on classes of simple singularities induced by the adjacency relation.

math.AG↗

Computational procedures for weighted projective spaces

This is a pdf print of the homonymous Maple file, freely available at http://www.maplesoft.com/applications/view.aspx?SID=127621, providing procedures which are able to produce the toric data associated with a (polarized) weighted projective space i.e. fans, polytopes and their equivalences. More originally it provides procedures which are able to detect a weights vector Q starting from either a fan or a polytope: we will call this process the recognition of a (polarized) weighted projective space. Moreover it gives procedures connecting polytopes of a polarized weighted projective space with an associated fan and viceversa.

math.AG↗

Homological Type of Geometric Transitions

The present paper gives an account and quantifies the change in topology induced by small and type II geometric transitions, by introducing the notion of the \emph{homological type} of a geometric transition. The obtained results agree with, and go further than, most results and estimates, given to date by several authors, both in mathematical and physical literature.

math.AG↗

The cubic period-distance relation for the Kater reversible pendulum

We describe the correct cubic relation between the mass configuration of a Kater reversible pendulum and its period of oscillation. From an analysis of its solutions we conclude that there could be as many as three distinct mass configurations for which the periods of small oscillations about the two pivots of the pendulum have the same value. We also discuss a real compound Kater pendulum that realizes this property.

physics.class-ph↗

Geometric Transitions

The purpose of this paper is to give, on one hand, a mathematical exposition of the main topological and geometrical properties of geometric transitions, on the other hand, a quick outline of their principal applications, both in mathematics and in physics.

math.AG↗