Recursive decomposition tree of a Moore co-family and closure algorithm

A collection of sets on a ground set U _n (U _n ?=?{1,2,...,n}) closed under intersection and containing U _n is known as a Moore family. The set of Moore families for a fixed n is in bijection with the set of Moore co-families (union-closed families containing the empty set) denoted ${\mathbb{M}}_n$ . This paper follows the work initiated in Colomb et al. (Ann Math Artif Intell 67(2):109–122, 2013) in which we have given an inductive definition of the lattice of Moore co-families. In the present paper we use this definition to define a recursive decomposition tree of any Moore co-family and we design an original algorithm to compute the closure under union of any family. Then we compare performance of this algorithm to performance of Ganter’s algorithm and Norris’ algorithm.     

Effect of Molybdenum on the Structure and on the Crystallization of SiO2–Na2O–CaO–B2O3 Glasses

Crystallization of the poorly durable Na₂MoO₄ phase able to incorporate radioactive cesium must be avoided in SiO₂–Al₂O₃–B₂O₃–Na₂O–CaO glasses developed for the immobilization of Mo-rich nuclear wastes. Increasing amounts of B₂O₃ and MoO₃ were added to a SiO₂–Na₂O–CaO glass, and crystallization tendency was studied. Na₂MoO₄ crystallization tendency decreased with the increase of B₂O₃ concentration whereas the tendency of CaMoO₄ to crystallize increased due to preferential charge compensation of BO₄⁻ entities by Na⁺ ions. ²⁹Si MAS NMR showed that molybdenum acts as a reticulating agent in glass structure. Trivalent actinides surrogate (Nd³⁺) were shown to enter into CaMoO₄ crystals formed in glasses.     

3D MRI of explanted sheep hearts with submillimeter isotropic spatial resolution: comparison between diffusion tensor and structure tensor imaging

Magnetic Resonance Materials in Physics, Biology and Medicine - The aim of the study is to compare structure tensor imaging (STI) with diffusion tensor imaging (DTI) of the sheep heart...     

Inter-MAC Green Path Selection for Heterogeneous Networks

Gigabit home networks represent a key technology to make the Future Internet success a reality. Consumers will require networks to be simple to install, without the need of any new wire and with green consideration. To make this network ubiquitous, seamless and robust, a technology independent MAC layer will ensure its global control and provide connectivities to any number of devices the user wishes to connect to it in any room. In order to make this vision comes true, substantial progress is required in the fields of protocol design and in systems architectures. For this goal, we introduce a new convergence layer denoted inter-MAC, which provides a common infrastructure to the home network, Among the inter-MAC functionalities, we focused the interest on the path selection mechanism including the green aspect. To improve quality of service, reduce energy consumption and radiofrequency devices number, we define a new path selection protocol based on several metrics. We present some preliminary results obtained on an experimental test bed.     

From big smartphone data to worldwide research: The Mobile Data Challenge

This paper presents an overview of the Mobile Data Challenge (MDC), a large-scale research initiative aimed at generating innovations around smartphone-based research, as well as community-based evaluation of mobile data analysis methodologies. First, we review the Lausanne Data Collection Campaign (LDCC), an initiative to collect unique longitudinal smartphone dataset for the MDC. Then, we introduce the Open and Dedicated Tracks of the MDC, describe the specific datasets used in each of them, discuss the key design and implementation aspects introduced in order to generate privacy-preserving and scientifically relevant mobile data resources for wider use by the research community, and summarize the main research trends found among the 100+ challenge submissions. We finalize by discussing the main lessons learned from the participation of several hundred researchers worldwide in the MDC Tracks.     

Camera Control in Computer Graphics

Recent progress in modelling, animation and rendering means that rich, high fidelity virtual worlds are found in many interactive graphics applications. However, the viewer's experience of a 3D world is dependent on the nature of the virtual cinematography, in particular, the camera position, orientation and motion in relation to the elements of the scene and the action. Camera control encompasses viewpoint computation, motion planning and editing. We present a range of computer graphics applications and draw on insights from cinematographic practice in identifying their different requirements with regard to camera control. The nature of the camera control problem varies depending on these requirements, which range from augmented manual control (semi‐automatic) in interactive applications, to fully automated approaches. We review the full range of solution techniques from constraint‐based to optimization‐based approaches, and conclude with an examination of occlusion management and expressiveness in the context of declarative approaches to camera control.     

Optimal computation with non-unitary quantum walks

Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times, respectively. Non-unitary quantum walks can provide a useful optimisation of these properties, producing a more uniform distribution on the line, and faster mixing times on the cycle. We investigate the interplay between quantum and random dynamics by comparing the resources required, and examining numerically how the level of quantum correlations varies during the walk. We show numerically that the optimal non-unitary quantum walk proceeds such that the quantum correlations are nearly all removed at the point of the final measurement. This requires only O(logT)$O(logT)$ random bits for a quantum walk of T$T$ steps.     

Post-buckling dynamic behavior of self-assembled 3D microstructures

The paper presents the snap-through phenomenon in the case of micro fabricated clamped-clamped buckled beam. This dynamic post-buckling behavior is likely to occur in 3D microstructures when they are subjected to large vibration amplitudes. The main difference between this work and previous studies is the MEMS specific beam dimension, especially the large initial deflection of the buckled beam that involves the inversion of the two first resonance frequencies. The mathematical development allows showing how the vibration amplitude of the supporting base affects the post-buckling dynamic behavior of the beam. For each frequency, the limit between the stable behavior and the snap-through behavior is evaluated. Moreover, the effect of environment is taken into account from the damping point of view. Samples are fabricated and the experiment is described. Measurements are compared to the theoretical approach and the results are in good agreement with the proposed model.     

Traffic analysis of peer-to-peer IPTV communities

The Internet is currently experiencing one of the most important challenges in terms of content distribution since its first uses as a medium for content delivery: users from passive downloaders and browsers are moving towards content producers and publishers. They often distribute and retrieve multimedia contents establishing network communities. This is the case of peer-to-peer IPTV communities.In this work we present a detailed study of P2P IPTV traffic, providing useful insights on both transport- and packet-level properties as well as on the behavior of the peers inside the network. In particular, we provide novel results on the (i) ports and protocols used; (ii) differences between signaling and video traffic; (iii) behavior of the traffic at different time scales; (iv) differences between TCP and UDP traffic; (v) traffic generated and received by peers; (vi) peers neighborhood and session duration. The knowledge gained thanks to this analysis is useful for several tasks, e.g. traffic identification, understanding the performance of different P2P IPTV technologies and the impact of such traffic on network nodes and links, and building more realistic models for simulations.¹