Textual image compression at low bit rates based on region-of-interest coding

In this paper, we deal with those applications of textual image compression where high compression ratio and maintaining or improving the visual quality and readability of the compressed images are of main concern. In textual images, most of the information exists in the edge regions; therefore, the compression problem can be studied in the framework of region-of-interest (ROI) coding. In this paper, the Set Partitioning in Hierarchical Trees (SPIHT) coder is used in the framework of ROI coding along with some image enhancement techniques in order to remove the leakage effect which occurs in the wavelet-based low-bit-rate compression. We evaluated the compression performance of the proposed method with respect to some qualitative and quantitative measures. The qualitative measures include the averaged mean opinion scores (MOS) curve along with demonstrating some outputs in different conditions. The quantitative measures include two proposed modified PSNR measures and the conventional one. Comparing the results of the proposed method with those of three conventional approaches, DjVu, JPEG2000, and SPIHT coding, showed that the proposed compression method considerably outperformed the others especially from the qualitative aspect. The proposed method improved the MOS by 20 and 30 %, in average, for high- and low-contrast textual images, respectively. In terms of the modified and conventional PSNR measures, the proposed method outperformed DjVu and JPEG2000 up to 0.4 dB for high-contrast textual images at low bit rates. In addition, compressing the high contrast images using the proposed ROI technique, compared to without using this technique, improved the average textual PSNR measure up to 0.5 dB, at low bit rates.     

High-capacity quantum key distribution using Chebyshev-map values corresponding to Lucas numbers coding

We propose an approach that achieves high-capacity quantum key distribution using Chebyshev-map values corresponding to Lucas numbers coding. In particular, we encode a key with the Chebyshev-map values corresponding to Lucas numbers and then use k-Chebyshev maps to achieve consecutive and flexible key expansion and apply the pre-shared classical information between Alice and Bob and fountain codes for privacy amplification to solve the security of the exchange of classical information via the classical channel. Consequently, our high-capacity protocol does not have the limitations imposed by orbital angular momentum and down-conversion bandwidths, and it meets the requirements for longer distances and lower error rates simultaneously.     

Solving the Problem of Forbidden States in Discrete Event Systems: A Novel Systematic Method for Reducing the Number of Control Places

This paper deals with the problem of forbidden states in Discrete Event Systems modelled by non‐safe Petri Nets. To avoid these states, some Generalized Mutual Exclusion Constraints can be assigned to them. These constraints limit the weight sum of tokens in some places and can be enforced on the system using control places. When the number of these constraints is large, a large number of control places should be added to the system. In this paper, a method is presented to assign the small number of constraints to forbidden states using some states which cover the forbidden states. So, a small number of control places are added to the system leading to obtaining a maximally permissive controller.     

An automatic subdigraph renovation plan for failure recovery of composite semantic Web services

A Web service-based system never fulfills a user＇s goal unless a failure recovery approach exists. It is inevitable that several Web services may either perish or fail before or during transactions. The completion of a composite process relies on the smooth execution of all constituent Web services. A mediator acts as an intermediary between providers and consumers to monitor the execution of these services. If a service fails, the mediator has to recover the whole composite process or else jeopardize achieving the intended goals. The atomic replacement of a perished Web service usually does not apply because the process of locating a matched Web service is unreliable. Even the system cannot depend on the replacement of the dead service with a com- posite service. In this paper, we propose an automatic renova- tion plan for failure recovery of composite semantic services based on an approach of subdigraph replacement. A replacement subdigraph is posed in lieu of an original subdigraph, which includes the failed service. The replacement is done in two separate phases, ofltine and online, to make the recovery faster. The ofitine phase foresees all possible subdigraphs, pre-calculates them, and ranks several possible replacements. The online phase compensates the unwanted effects and executes the replacement subdigraph in lieu of the original subdigraph. We have evaluated our approach during an experiment and have found that we could recover more than half of the simulated failures. These achievements show a significant improvement compared to current approaches     

Extraction of voltage harmonics using multi-layer perceptron neural network

This paper presents a harmonic extraction algorithm using artificial neural networks for Dynamic Voltage Restorers (DVRs). The suggested algorithm employs a feed forward Multi Layer Perceptron (MLP) Neural Network with error back propagation learning to effectively track and extract the 3rd and 5th voltage harmonics. For this purpose, two different MLP neural network structures are constructed and their performances compared. The effects of hidden layer, supervisors and learning rate are also presented. The proposed MLP Neural Network algorithm is trained and tested in MATLAB program environment. The results show that MLP neural network enable to extract each harmonic effectively.     

A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model

Network-wide broadcast (simply broadcast) is a frequently used operation in wireless ad hoc networks (WANETs). One promising practical approach for energy-efficient broadcast is to use localized algorithms to minimize the number of nodes involved in the propagation of the broadcast messages. In this context, the minimum forwarding set problem (MFSP) (also known as multipoint relay (MPR) problem) has received a considerable attention in the research community. Even though the general form of the problem is shown to be NP-complete, the complexity of the problem has not been known under the practical application context of ad hoc networks. In this paper, we present a polynomial time algorithm to solve the MFSP for wireless network under unit disk coverage model. We prove the existence of some geometrical properties for the problem and then propose a polynomial time algorithm to build an optimal solution based on these properties. To the best of our knowledge, our algorithm is the first polynomial time solution to the MFSP under the unit disk coverage model. We believe that the work presented in this paper will have an impact on the design and development of new algorithms for several wireless network applications including energy-efficient multicast, broadcast, and topology control protocols for WANETs and sensor networks.     

Medical image segmentation with transform and moment based features and incremental supervised neural network

In this study, a novel incremental supervised neural network (ISNN) is proposed for the segmentation of medical images. Performance of the ISNN is investigated for tissue segmentation in medical images obtained from various imaging modalities. Two feature extraction methods based on transform and moments are comparatively investigated to segment the tissues in medical images. Two-dimensional (2D) continuous wavelet transform (CWT) and the moments of the gray-level histogram (MGH) are computed in order to form the feature vectors of ultrasound (US) bladder and phantom images, X-ray computerized tomography (CT) and magnetic resonance (MR) head images. In the 2D-CWT method, feature vectors are formed by the intensity of one pixel of each wavelet-plane of different energy bands. The MGH represents the tissues within the sub-windows by using the spatial variation of image intensities. In this study, the ISNN and Grow and Learn (GAL) network are employed for the segmentation task. It is observed that the ISNN has significantly eliminated the disadvantages of the GAL network in the segmentation of the medical images.     

ADALINE based robust control in robotics: a Riemann-Liouville fractional differintegration based learning scheme

This paper presents an approach to improve the performance of intelligent sliding model control achieved by the use of a fundamental constituent of soft computing, named Adaptive Linear Element (ADALINE). The proposed scheme is based on the fractional calculus. A previously considered tuning scheme is revised according to the rules of fractional order differintegration. After a comparison with the integer order counterpart, it is seen that the control system with the proposed adaptation scheme provides (1) better tracking performance, (2) suppression of undesired drifts in parameter evolution and (3) a very high degree of robustness and insensitivity to disturbances. The claims are justified through some simulations utilizing the dynamic model of a two degrees of freedom (DOF) direct drive robot arm and overall, the contribution of the paper is to introduce the fractional order calculus into a robust and nonlinear control problem with some outperforming features that are absent when the integer order differintegration operators are adopted.