In this paper, an algorithm for reconstruction of a completely lost blocks using Modified
Hybrid Transform. The algorithms examined in this paper do not require a DC estimation
method or interpolation. The reconstruction achieved using matrix manipulation based on
Modified Hybrid transform. Also adopted in this paper smart matrix (Detection Matrix) to detect
the missing blocks for the purpose of rebuilding it. We further asses the performance of the
Modified Hybrid Transform in lost block reconstruction application. Also this paper discusses
the effect of using multiwavelet and 3D Radon in lost block reconstruction.

Commercially pure titanium (cpTi) is widely used as dental implant material although it was found that titanium exhibited high modulus of elasticity and the lower corrosion tendency in oral environment. Niobium(Nb) was chosen for this study as an alternative to cpTi implant material due to its bioinert behavior and good elastic modulus and moderate cost in addition to corrosion resistance. This study was done to evaluate the effect of biomimetic coating on the surface properties of the commercially pure titanium and niobium implants by in vitro and in vivo experiments. The in vitro study was involved etching the samples of each material in HCl then soaking in 10M NaOH aqueous solution. These samples were then immersed in a 5 times concent

Two molecular imprinted polymer (MIP) membranes for Levofloxacin (LEV) were prepared based on PVC matrix. The imprinted polymers were prepared by polymerization of styrene (STY) as monomer, N,N methylene di acrylamide as a cross linker ,benzoyl peroxide (BPO) as an initiator and levofloxacin as a template. Di methyl adepate (DMA) and acetophenone (AOPH) were used as plasticizers , the molecular imprinted membranes and the non molecular imprinted membranes were prepared.  The slopes and detection limits of the liquid electrodes ranged from -21.96 – -19.38 mV/decade and 2×10^-4M- 4×10^-4M, and Its response time was around 1 minute, respectively. The liquid  electrodes were packed with 0.1 M standar

Home Computer and Information Science 2009 Chapter The Stochastic Network Calculus Methodology Deah J. Kadhim, Saba Q. Jobbar, Wei Liu & Wenqing Cheng Chapter 568 Accesses 1 Citations Part of the Studies in Computational Intelligence book series (SCI,volume 208) Abstract The stochastic network calculus is an evolving new methodology for backlog and delay analysis of networks that can account for statistical multiplexing gain. This paper advances the stochastic network calculus by deriving a network service curve, which expresses the service given to a flow by the network as a whole in terms of a probabilistic bound. The presented network service curve permits the calculation of statistical end-to-end delay and backlog bounds for broad

Neural cryptography deals with the problem of “key exchange” between two neural networks by using the mutual learning concept. The two networks exchange their outputs (in bits) and the key between two communicating parties ar eventually represented in the final learned weights, when the two networks are said to be synchronized. Security of neural synchronization is put at risk if an attacker is capable of synchronizing with any of the two parties during the training process.

The presence of antibiotic residues such as ciprofloxacin (CIPR) in an aqueous environment is dangerous when their concentrations exceed the allowable. Therefore, eliminating these residues from the wastewater becomes an essential issue to prevent their harm. In this work, the potential of efficient adsorption of ciprofloxacin antibiotics was studied using eco-friendly ZSM-5 nanocrystals‑carbon composite (NZC). An inexpensive effective natural binder made of the sucrose-citric acid mixture was used for preparing NZC. The characterization methods revealed the successful preparation of NZC with a favorable surface area of 103.739 m2/g, and unique morphology and functional groups. Investigating the ability of NZC for adsorbing CIPR antibioti

Due to the huge variety of 5G services, Network slicing is promising mechanism for dividing the physical network resources in to multiple logical network slices according to the requirements of each user. Highly accurate and fast traffic classification algorithm is required to ensure better Quality of Service (QoS) and effective network slicing. Fine-grained resource allocation can be realized by Software Defined Networking (SDN) with centralized controlling of network resources. However, the relevant research activities have concentrated on the deep learning systems which consume enormous computation and storage requirements of SDN controller that results in limitations of speed and accuracy of traffic classification mechanism. To fill thi

Localization is an essential demand in wireless sensor networks (WSNs). It relies on several types of measurements. This paper focuses on positioning in 3-D space using time-of-arrival- (TOA-) based distance measurements between the target node and a number of anchor nodes. Central localization is assumed and either RF, acoustic or UWB signals are used for distance measurements. This problem is treated by using iterative gradient descent (GD), and an iterative GD-based algorithm for localization of moving sensors in a WSN has been proposed. To localize a node in 3-D space, at least four anchors are needed. In this work, however, five anchors are used to get better accuracy. In GD localization of a moving sensor, the algo