One of the concerns of adopting an e-voting systems in the pooling place of any critical elections is the possibility of compromising the voting machine by a malicious piece of code, which could change the votes cast systematically. To address this issue, different techniques have been proposed such as the use of vote verification techniques and the anonymous ballot techniques, e.g., Code Voting. Verifiability may help to detect such attack, while the Code Voting assists to reduce the possibility of attack occurrence. In this paper, a new code voting technique is proposed, implemented and tested, with the aid of an open source voting. The anonymous ballot improved accordingly the paper audit trail used in this machine. The developed system,

The purpose of this study is testing the effect of orgnizational learning in orgnizational Effectivness an applied study in Al-hiqma Jordinan Medecine Company . study sosiety 88 manegers sleect 80 of them .study used SPSS to test the hypothesis.study reachs to significant conculctions

Support vector machine (SVM) is a popular supervised learning algorithm based on margin maximization. It has a high training cost and does not scale well to a large number of data points. We propose a multiresolution algorithm MRH-SVM that trains SVM on a hierarchical data aggregation structure, which also serves as a common data input to other learning algorithms. The proposed algorithm learns SVM models using high-level data aggregates and only visits data aggregates at more detailed levels where support vectors reside. In addition to performance improvements, the algorithm has advantages such as the ability to handle data streams and datasets with imbalanced classes. Experimental results show significant performance improvements in compa

   Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.

We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑

Realizing robust interconnectivity in a rapidly changing network topology is a challenging issue. This problem is escalating with the existence of constrained devices in a vehicular environment. Several standards have been developed to support reliable communication between vehicular nodes as the IEEE 1609 WAVE stack. Mitigating the impact of security/mobility protocols on limited capability nodes is a crucial aspect. This paper examines the burden of maintaining authenticity service that associated with each handover process in a vehicular network. Accordingly, a network virtualization-based infrastructure is proposed which tackles the overhead of IEEE 1906 WAVE standard on constrained devices existed in vehicular network. The virtualized

The efforts in designing and developing lightweight cryptography (LWC) started a decade ago. Many scholarly studies in literature report the enhancement of conventional cryptographic algorithms and the development of new algorithms. This significant number of studies resulted in the rise of many review studies on LWC in IoT. Due to the vast number of review studies on LWC in IoT, it is not known what the studies cover and how extensive the review studies are. Therefore, this article aimed to bridge the gap in the review studies by conducting a systematic scoping study. It analyzed the existing review articles on LWC in IoT to discover the extensiveness of the reviews and the topics covered. The results of the study suggested that many re

In this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates

A Wearable Robotic Knee (WRK) is a mobile device designed to assist disabled individuals in moving freely in undefined environments without external support. An advanced controller is required to track the output trajectory of a WRK device in order to resolve uncertainties that are caused by modeling errors and external disturbances. During the performance of a task, disturbances are caused by changes in the external load and dynamic work conditions, such as by holding weights while performing the task. The aim of this study is to address these issues and enhance the performance of the output trajectory tracking goal using an adaptive robust controller based on the Radial Basis Function (RBF) Neural Network (NN) system and Hamilton