Une optimisation en temps de calcul pour la prédiction de zones de couverture radioélectriques

This article presents a method which optimises the computation time for the prediction of a radio coverage, whatever the propagation model used. The principle consists in reducing the number of application points of the propagation model in relation to a classical technique. The proposed method is based on a multi resolution analysis of measured signals carried out around 2 GHz, and on an electromagnetic analysis of the propagation environment. The performances of the method are evaluated in term of reduction in computation time and of accuracy, in comparaison with the classical technique.     

The plastic spin concept and a simple illustration of its role in finite plastic transformations

The basic kinematics and the rate constitutive equations are briefly presented within the framework of a macroscopic formulation of finite plastic transformations for structured media, employing the concept of tensorial structure variables. The key feature is the necessity to provide constitutive relations for the plastic spin according to the proposition of Mandel and Kratochvil. After obtaining these relations for a transversely isotropic medium employing the representation theorems for isotropic second order antisymmetric tensor-valued functions, the role of the plastic spin is illustrated by the analysis of large simple shear for such a medium.     

Automated design of robust discriminant analysis classifier for foot pressure lesions using kinematic data

In the recent years, the use of motion tracking systems for acquisition of functional biomechanical gait data, has received increasing interest due to the richness and accuracy of the measured kinematic information. However, costs frequently restrict the number of subjects employed, and this makes the dimensionality of the collected data far higher than the available samples. This paper applies discriminant analysis algorithms to the classification of patients with different types of foot lesions, in order to establish an association between foot motion and lesion formation. With primary attention to small sample size situations, we compare different types of Bayesian classifiers and evaluate their performance with various dimensionality reduction techniques for feature extraction, as well as search methods for selection of raw kinematic variables. Finally, we propose a novel integrated method which fine-tunes the classifier parameters and selects the most relevant kinematic variables simultaneously. Performance comparisons are using robust resampling techniques such as Bootstrap 632+ and k-fold cross-validation. Results from experimentations with lesion subjects suffering from pathological plantar hyperkeratosis, show that the proposed method can lead to approximately 96% correct classification rates with less than 10% of the original features.     

Experimenting with pattern-matching algorithms

Two new pattern-matching algorithms based on the Boyer-Moore algorithm are presented. Their performance is compared to that of earlier relevant variants in terms of the number of character comparisons and the required running time by exhaustive simulation. Experimental results show the efficiency of both these two new algorithms.     

西九文化区

正OMA发展西九文化区,必须面对一项挑战:将一个盛载政府极大抱负,以及持分者多元利益的超大型多用途项目,转化成一个既有趣又严肃、既有规划又允许即兴、既中国化又国际化的文化区。这个文化区规模庞大,但不失亲密融洽的感觉;富地标性,但十分谦和;容易理解,却能带来惊喜。为避免造成过分冲击,OMA采纳了一种每个香港市民都熟悉的建筑类型作为方案的发展     

Cooperative Caching in Wireless Multimedia Sensor Networks

The recent advances in miniaturization and the creation of low-power circuits, combined with small-sized batteries have made the development of wireless sensor networks a working reality. Lately, the production of cheap complementary metal-oxide semiconductor cameras and microphones, which are able to capture rich multimedia content, gave birth to what is called Wireless Multimedia Sensor Networks (WMSNs). WMSNs will boost the capabilities of current wireless sensor networks, and will fuel several novel applications, like multimedia surveillance sensor networks. WMSNs introduce several new research challenges, mainly related to mechanisms to deliver application-level Quality-of-Service (e.g., latency minimization). To address this goal in an environment with extreme resource constraints, with variable channel capacity and with requirements for multimedia in-network processing, the caching of multimedia data, exploiting the cooperation among sensor nodes is vital. This article presents a cooperative caching solution particularly suitable for WMSNs. The proposed caching solution exploits sensor nodes which reside in “positions” of the network that allow them to forward packets or communicate decisions within short latency. These so-called “mediator” nodes are selected dynamically, so as to avoid the creation of hot-spots in the communication and the depletion of their energy. The mediators are not more powerful than the rest of the nodes, but they have some special role in implementing the cooperation among the sensors. The proposed cooperative caching protocol includes components for locating cached data as well as for implementing data purging out of the sensor caches. The proposed solution is evaluated extensively in an advanced simulation environment, and it is compared to the state-of-the-art cooperative caching algorithm for mobile ad hoc networks. The results confirm that the proposed caching mechanism prevails over its competitor.     

An integrated implementation framework for compile‐time metaprogramming

Compile‐time metaprograms are programs executed during the compilation of a source file, usually targeting to update its source code. Even though metaprograms are essentially programs, they are typically treated as exceptional cases without sharing common practices and development tools. Toward this direction, we identify a set of primary requirements related to language implementation, metaprogramming features, software engineering support, and programming environments and elaborate on addressing these requirements in the implementation of a metaprogramming language. In particular, we introduce the notion of integrated compile‐time metaprograms, as coherent programs assembled from specific metacode fragments present in the source code. We show the expressiveness of this programming model and illustrate its advantages through various metaprogram scenarios. Additionally, we present an integrated tool chain, supporting full‐scale build features and compile‐time metaprogram debugging. Copyright © 2013 John Wiley & Sons, Ltd.