Ricci flow on Riemannian groupoids

We study the Ricci flow on Riemannian groupoids. We assume that these groupoids are closed and that the space of orbits is compact and connected. We prove the short time existence and uniqueness of the Ricci flow on these groupoids. We also define a F-functional and derive the corresponding results for steady breathers on these spaces.Comment: Corrected typo in title of the first version of paper. In the third version, the uniqueness theorem that we proved is extended to a more general case. Also, the chapter about the 2-dimensional groupoid case has been turned into an appendi

News From the CHA Secrétariat

SSHRC will probably grant the CHA funds to help defray some of the travel and accommodation costs of the 1990 conference

A Unifying Framework for Finite Wordlength Realizations.

A general framework for the analysis of the finite wordlength (FWL) effects of linear time-invariant digital filter implementations is proposed. By means of a special implicit system description, all realization forms can be described. An algebraic characterization of the equivalent classes is provided, which enables a search for realizations that minimize the FWL effects to be made. Two suitable FWL coefficient sensitivity measures are proposed for use within the framework, these being a transfer function sensitivity measure and a pole sensitivity measure. An illustrative example is presented

Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

A decade of solar Type III radio bursts observed by the Nancay Radioheliograph 1998-2008

We present a statistical survey of almost 10 000 radio Type III bursts observed by the Nancay Radioheliograph from 1998 to 2008, covering nearly a full solar cycle. In particular, sources sizes, positions, and fluxes were examined. We find an east-west asymmetry in source positions which could be attributed to a 6(+/-)1 degree eastward tilt of the magnetic field, that source FWHM sizes s roughly follow a solar-cycle averaged distribution dN/ds = 14 {\nu}^{-3.3} s^{-4} arcmin^{-1} day^{-1}, and that source fluxes closely follow a solar-cycle averaged dN/dS_{\nu} = 0.34 {\nu}^{-2.9} S_{\nu}^{-1.7} sfu^{-1} day^{-1} distribution (when {\nu} is in GHz, s in arcmin, and S_{\nu} in sfu). Fitting a barometric density profile yields a temperature of 0.6 MK, while a solar wind-like (\propto h^{-2}) density profile yields a density of 1.2x10^6 cm^{-3} at an altitude of 1 RS, assuming harmonic emission. Finally, we found that the solar-cycle averaged radiated Type III energy could be similar in magnitude to that radiated by nanoflares via non-thermal bremsstrahlung processes, and we hint at the possibility that escaping electron beams might carry as much energy away from the corona as is introduced into it by accelerated nanoflare electrons.Comment: 22 pages, 18 figure

A greedy heuristic approach for the project scheduling with labour allocation problem

Responding to the growing need of generating a robust project scheduling, in this article we present a greedy algorithm to generate the project baseline schedule. The robustness achieved by integrating two dimensions of the human resources flexibilities. The first is the operators’ polyvalence, i.e. each operator has one or more secondary skill(s) beside his principal one, his mastering level being characterized by a factor we call “efficiency”. The second refers to the working time modulation, i.e. the workers have a flexible time-table that may vary on a daily or weekly basis respecting annualized working strategy. Moreover, the activity processing time is a non-increasing function of the number of workforce allocated to create it, also of their heterogynous working efficiencies. This modelling approach has led to a nonlinear optimization model with mixed variables. We present: the problem under study, the greedy algorithm used to solve it, and then results in comparison with those of the genetic algorithms