Design of a Web Based Underwater Acoustic Communication Testbed and Simulation Platform

Wireless Personal Communications - Underwater Wireless Sensor Networks (UWSNs) are playing a vital role in exploring the unseen underwater (UW) natural resources. However, performance evaluation of...     

Political Optimizer Based Feedforward Neural Network for Classification and Function Approximation

Neural Processing Letters - Political optimizer (PO) is a recently proposed human-behavior inspired meta-heuristic, which has shown tremendous performance on complex multimodal functions as well as...     

Recent advances in isotropic conductive adhesives for electronics packaging applications

Isotropic conductive adhesives (ICAs) have recently received a lot of focus and attention from the researchers in electronics industry as a potential substitute to lead-bearing solders. Numerous studies have shown that ICAs possess many advantages over conventional soldering such as environmental friendliness, finer pitch printing, lower temperature processing and more flexible and simpler processing. However, complete replacement of soldering by ICAs is yet not possible owing to several limitations of ICAs which are mainly related to reliability aspects like limited impact resistance, unstable contact resistance, low adhesion and conductivity etc. Continued efforts for last 15 years have resulted in development of ICAs with improved properties. This review article is aimed at providing a better understanding of ICAs, their principles, performance and significant research and development work addressing the technological utility of ICAs.     

KHATT: An open Arabic offline handwritten text database

A comprehensive Arabic handwritten text database is an essential resource for Arabic handwritten text recognition research. This is especially true due to the lack of such database for Arabic handwritten text. In this paper, we report our comprehensive Arabic offline Handwritten Text database (KHATT) consisting of 1000 handwritten forms written by 1000 distinct writers from different countries. The forms were scanned at 200, 300, and 600 dpi resolutions. The database contains 2000 randomly selected paragraphs from 46 sources, 2000 minimal text paragraph covering all the shapes of Arabic characters, and optionally written paragraphs on open subjects. The 2000 random text paragraphs consist of 9327 lines. The database forms were randomly divided into 70%, 15%, and 15% sets for training, testing, and verification, respectively. This enables researchers to use the database and compare their results. A formal verification procedure is implemented to align the handwritten text with its ground truth at the form, paragraph and line levels. The verified ground truth database contains meta-data describing the written text at the page, paragraph, and line levels in text and XML formats. Tools to extract paragraphs from pages and segment paragraphs into lines are developed. In addition we are presenting our experimental results on the database using two classifiers, viz. Hidden Markov Models (HMM) and our novel syntactic classifier.     

A new technique for the construction of confusion component based on inverse LA-semigroups and its application in steganography

The present article introduced a novel idea for information hiding namely steganography. We have used new notions for the construction of the nonlinear component for block cipher based on inverse LA-semigroups. This nonlinear component fundamentally provides confidentiality in the proposed steganographic algorithm. The construction of the algorithm is fundamentally twofold. Firstly, we have constructed a novel scheme to design confusion component namely substitution box (S-box). Secondly, we have utilized the anticipated nonlinear component in digital steganography. The suggested algorithm is tested for different standard digital images. The authentication of the proposed algorithm is confirmed through statistical analysis.

     

On ℤ2ℤ2[u]-additive codes

In this paper, a new class of additive codes which is referred to as ?₂ ?₂[u]-additive codes is introduced. This is a generalization towards another direction of recently introduced ?₂ ?₄-additive codes [J. Borges, C. Fernández-Córdoba, J. Pujol, J. Rif´a, and M. Villanueva, ?₂ ?₄-linear codes: Generator matrices and duality, Designs Codes Cryptogr. 54(2) (2010), pp. 167–179]. ?₂ ?₄-additive codes have shown to provide a promising class of codes with their algebraic structure and applications such as steganography. The standard generator matrices are established and by introducing orthogonality the parity-check matrices are also obtained. A MacWilliams-type identity that relates the weight enumerator of a code with its dual is proved. Furthermore, a Gray map that maps these codes to binary codes is defined and some examples of optimal codes which are the binary Gray images of ?₂ ?₂[u]-additive codes are presented.     

Three-qubit Grover’s algorithm using superconducting quantum interference devices in cavity-QED

We present a scheme for the implementation of three-qubit Grover’s algorithm using four-level superconducting quantum interference devices (SQUIDs) coupled to a superconducting resonator. The scheme is based on resonant, off-resonant interaction of the cavity field with SQUIDs and application of classical microwave pulses. We show that adjustment of SQUID level spacings during the gate operations, adiabatic passage, and second-order detuning are not required that leads to faster implementation. We also show that the marked state can be searched with high fidelity even in the presence of unwanted off-resonant interactions, level decay, and cavity dissipation.     

Performance analysis of multimedia based web traffic with QoS constraints

During the recent years, there has been a tremendous growth in the development and deployment of multimedia based networked applications such as video streaming, IP telephony, interactive games, among others. These applications, in contrast to elastic applications such as email and data sharing, are delay and delay jitter sensitive but can tolerate certain level of packet loss. A vital element of end-to-end delay and delay jitter is the random queueing delays in network switches and routers. Analysis of robust mechanisms for buffer management at network routers needs to be carried out in order to reduce end-to-end delay for traffic generated by multimedia applications. In this context, a threshold based buffer management scheme for accommodating multiple class multimedia traffic in network routers has been analysed. This technique effectively controls the allocation of buffer to various traffic classes according to their delay constraints. The forms of the joint state probabilities, as well as basic performance measures such as blocking probabilities are analytically established at equilibrium. Typical numerical experiments are included to illustrate the credibility of the proposed mechanism in the context of different quality of service (QoS) grades for various network traffic classes. This model, therefore, can be used as a powerful tool to provide a required grade of service to a particular class of multimedia based web traffic in any heterogeneous network.