Progression in Computer networks and emerging of new technologies in this field helps to find out new protocols and frameworks that provides new computer network-based services. E-government services, a modernized version of conventional government, are created through the steady evolution of technology in addition to the growing need of societies for numerous services. Government services are deeply related to citizens’ daily lives; therefore, it is important to evolve with technological developments—it is necessary to move from the traditional methods of managing government work to cutting-edge technical approaches that improve the effectiveness of government systems for providing services to citizens. Blockchain technology is amon

<p>Vehicular ad-hoc networks (VANET) suffer from dynamic network environment and topological instability that caused by high mobility feature and varying vehicles density. Emerging 5G mobile technologies offer new opportunities to design improved VANET architecture for future intelligent transportation system. However, current software defined networking (SDN) based handover schemes face poor handover performance in VANET environment with notable issues in connection establishment and ongoing communication sessions. These poor connectivity and inflexibility challenges appear at high vehicles speed and high data rate services. Therefore, this paper proposes a flexible handover solution for VANET networks by integrating SDN and

'Steganography is the science of hiding information in the cover media', a force in the context of information sec, IJSR, Call for Papers, Online Journal

The evolution of the Internet of things (IoT) led to connect billions of heterogeneous physical devices together to improve the quality of human life by collecting data from their environment. However, there is a need to store huge data in big storage and high computational capabilities.   Cloud computing can be used to store big data.  The data of IoT devices is transferred using two types of protocols: Message Queuing Telemetry Transport (MQTT) and Hypertext Transfer Protocol (HTTP). This paper aims to make a high performance and more reliable system through efficient use of resources. Thus, load balancing in cloud computing is used to dynamically distribute the workload across nodes to avoid overloading any individual r

An efficient modification and a novel technique combining the homotopy concept with  Adomian decomposition method (ADM) to obtain an accurate analytical solution for Riccati matrix delay differential equation (RMDDE) is introduced  in this paper  . Both methods are very efficient and effective. The whole integral part of ADM is used instead of the integral part of homotopy technique. The major feature in current technique gives us a large convergence region of iterative approximate solutions .The results acquired by this technique give better approximations for a larger region as well as previously. Finally, the results conducted via suggesting an efficient and easy technique, and may be addressed to other non-linear problems.

Objective: We hypothesized that attacking cancer cells by combining various modes of action can hinder them from taking the chance to evolve resistance to treatment. Incorporation of photodynamic therapy (PDT) with oncolytic virotherapy might be a promising dual approach to cancer treatment. Methods: NDV AMHA1 strain as virotherapy in integration with aminolaevulinic acid (ALA) using low power He-Ne laser as PDT in the existing work was examined against breast cancer cells derived from Iraqi cancer patients named (AMJ13). This combination was evaluated using Chou–Talalay analysis. Results: The results showed an increased killing rate when using both 0.01 and 0.1 Multiplicity of infection (MOI) of the virus when combined with a dose of 617

A skip list data structure is really just a simulation of a binary search tree. Skip lists algorithm are simpler, faster and use less space. this data structure conceptually uses parallel sorted linked lists. Searching in a skip list is more difficult than searching in a regular sorted linked list. Because a skip list is a two dimensional data structure, it is implemented using a two dimensional network of nodes with four pointers. the implementation of the search, insert and delete operation taking a time of upto . The skip list could be modified to implement the order statistic operations of RANKand SEARCH BY RANK while maintaining the same expected time. Keywords:skip list , parallel linked list , randomized algorithm , rank.