排序方式: 共有25条查询结果,搜索用时 31 毫秒
1.
Zaimi Imane Houssaini Zineb Squalli Boushaba Abdelali Oumsis Mohammed Aboutajdine Driss 《Wireless Personal Communications》2018,98(1):945-981
Wireless Personal Communications - In promising application field such as Vehicular Ad hoc Networks, the ability of the driver to exchange video streams smoothly over the network regardless of his... 相似文献
2.
3.
Driss Aboutajdine 《Pattern recognition》2002,35(3):543-544
4.
Ali El Akadi Aouatif Amine Abdeljalil El Ouardighi Driss Aboutajdine 《Knowledge and Information Systems》2011,26(3):487-500
Gene expression data usually contain a large number of genes, but a small number of samples. Feature selection for gene expression data aims at finding a set of genes that best discriminates biological samples of different types. In this paper, we propose a two-stage selection algorithm for genomic data by combining MRMR (Minimum Redundancy–Maximum Relevance) and GA (Genetic Algorithm). In the first stage, MRMR is used to filter noisy and redundant genes in high-dimensional microarray data. In the second stage, the GA uses the classifier accuracy as a fitness function to select the highly discriminating genes. The proposed method is tested for tumor classification on five open datasets: NCI, Lymphoma, Lung, Leukemia and Colon using Support Vector Machine (SVM) and Naïve Bayes (NB) classifiers. The comparison of the MRMR-GA with MRMR filter and GA wrapper shows that our method is able to find the smallest gene subset that gives the most classification accuracy in leave-one-out cross-validation (LOOCV). 相似文献
5.
6.
Ouadoudi Zytoune Mohamed El aroussi Driss Aboutajdine 《Wireless Personal Communications》2010,55(2):147-161
In wireless sensor network, the power supply is, generally, a non-renewable battery. Consequently, energy effectiveness is
a crucial factor. To maximize the battery life and therefore, the duration of network service, a robust wireless communication
protocol providing a best energy efficiency is required. In this paper, we present a uniform balancing energy routing protocol.
In this later the transmission path is chosen for maximizing the whole network lifetime. Every transmission round, only the
nodes which have their remaining energies greater than a threshold can participate as routers for other nodes in addition
to sensing the environment. This choice allows the distribution of energy load among any sensor nodes; thus extends network
lifetime. The experimental results shows that the proposed protocol outperforms some protocols given in the literature. 相似文献
7.
Ismail Bennis Hacene Fouchal Ouadoudi Zytoune Driss Aboutajdine 《Wireless Communications and Mobile Computing》2016,16(9):1109-1123
Over the last few years, wireless sensor networks have become a great field of interest for the scientific community. This novel kind of network provides an array of applications for different aspects of human life. To give a satisfying performance to the final user, the wireless sensor networks must ensure the quality of service. The use of multipath technique was widely applied in the literature. Nevertheless, there might be a problem if the interference issues are not taken into account by the multipath routing design. In this paper, we propose a novel multipath routing protocol called Carrier Sense Aware Multipath Geographic Routing protocol (CSA‐MGR). This protocol creates multiple paths while avoiding any shared carrier sense range by using a distributed and dynamic process. In addition, the CSA‐MGR employs a new metrics named the Number of Common Neighbors to guarantee a faster and an efficient path construction. Simulations conducted over the NS‐2 simulator show promising results in terms of delay, Packet Delivery Ratio and routing overhead. The performance gain of CSA‐MGR in terms of delay is up to 275% compared with the Two‐Phase geographical Greedy Forwarding and up to 565% compared with the ad hoc on‐demand multipath distance vector. For the Packet Delivery Ratio, the performance gain of CSA‐MGR is up to 16% compared with the Two‐Phase geographic Greedy Forwarding and up to 28% compared with the ad hoc on‐demand multipath distance vector. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
8.
Alaoui-Fdili Othmane Coudoux François-Xavier Fakhri Youssef Corlay Patrick Aboutajdine Driss 《Multimedia Tools and Applications》2018,77(4):4509-4541
Multimedia Tools and Applications - In this paper, we propose an energy-efficient joint video encoding and transmission framework for network lifetime extension, under an end-to-end video quality... 相似文献
9.
In this paper, we present two new cumulant-based methods for time-varying ar parameter estimation : a batch-type evolutive method and an adaptive gradienttype algorithm. The evaluation of these techniques is performed through simulations on synthetic signals in free-noise case and when data are corrupted by an additive, zero-mean, Gaussian white noise. We compare them to their autocorrelation-based counterparts. The obtained results show, when using an appropriate criterion, the superiority of the cumulant-based evolutive method over both its autocorrelation-based counterpart and the cumulant-based gradient-type algorithm at expense of a great computational complexity. 相似文献
10.
F. Essannouni R. Oulad Haj Thami D. Aboutajdine A. Salam 《Journal of Real-Time Image Processing》2007,1(4):257-265
Fast Fourier transforms (FFTs) which are O(N logN) algorithms to compute a discrete Fourier transform (DFT) of size N have been called one of the ten most important algorithms of the twentieth century. However, even though many algorithms
have been developed to speed up the computation the sum of absolute difference (SAD) matching, they are exclusively designed
in the spatial domain. In this paper, we propose a fast frequency algorithm to speed up the process of (SAD) matching. We
use a new approach to approximate the SAD metric by cosine series which can be expressed in correlation terms. These latter
can be computed using FFT algorithms. Experimental results demonstrate the effectiveness of our method when using only the
first correlation terms for block and template matching in terms of accuracy and speed. The proposed algorithm is suitable
for software implementations and has a deterministic execution time unlike the existing fast algorithms for SAD matching.
相似文献
A. SalamEmail: |