Channel Allocation with MIMO in Cognitive Radio Network

Wireless Personal Communications - The bulk volume and diverse data generated by Smart grid applications require use of Cognitive Radio (CR) technology for efficient handling. The CR technology...     

Study of the X-ray optical anisotropy of materials via X-ray interferometry

A new method for studying the X-ray optical anisotropy of materials which is based on the X-ray interferometric technique of measurement is described. Unlike the existing methods, in which the sample under study is placed in the path of one of the interfering beams, the test samples in the proposed method are placed directly in the path of two interfering beams; this eliminates the effect of other factors on the displacement of the interference moirefringes. In this method, moirefringes simultaneously occur during the same exposure both in the absence and in the presence of samples with different orientations of the optical axes. A relative displacement of moirefringes is observed in three different columns of the same beam, which makes it possible not only to simultaneously observe and immediately identify the presence of X-ray optical anisotropy but also to measure the values of refractive indexes n _o and n _e for a given sample (n _o is the refractive index for an emission with the polarization perpendicular to the principal cross section, and n _e is the refractive index for a beam with the polarization in the plane of the principal section and parallel to the optical axis). The new method is used to record the X-ray optical anisotropy of a cellophane film and to measure the values of refractive indexes n _o and n _e for cellophane. It is found that the cellophane film is an X-ray optically positive anisotropic medium.     

Aqueous extraction kinetics of phenolic compounds from jamun (Syzygium cumini L.) seeds

In this study, aqueous extraction of phenolic compounds from jamun (Syzygium cumini L.) seed was undertaken. The effects of various parameters such as extraction temperature (34.8–85.2°C), extraction time (49.8–100.2 min), and liquid-to-solid ratio (9.8–60.2 mL/g) on the extraction yield, extract purity (i.e., total polyphenol content), and its antioxidant activities (1,1-diphenyl-2-picrlthydrazyl free radical scavenging assay and ferric reducing antioxidant power) were investigated. Response surface methodology was used to optimize the extraction conditions. The optimum extraction conditions (49.2°C, 89.4 min, and 51.6:1 mL/g) produced an extract with 17.3% extraction yield, high total polyphenol content (415 mg gallic acid equivalent/g dried extract) and significant antioxidant activity (IC₅₀: 35.4 ± 0.7 µg/mL). The high-performance liquid chromatography analysis of seed extract revealed the presence of gallic acid (90.8 mg/g dried extract), ellagic acid (36 mg/g dried extract), caffeic acid (26.07 mg/g dried extract), p-coumaric acid (0.26 mg/g dried extract), catechin (9.05 mg/g dried extract), epicatechin (0.42 mg/g dried extract), and quercetin (1.54 mg/g dried extract). Tannic acid (188.5 mg/g dried extract) was also identified as a major phenolic compound. The extraction kinetics was also studied and experimental data were fitted to four kinetic models such as first-order model, second-order model, Peleg’s model, and Minchev and Minkov model, to evaluate their applicability.     

Factor-based evaluation for English to Hindi MT outputs

Design and implementation of automatic evaluation methods is an integral part of any scientific research in accelerating the development cycle of the output. This is no less true for automatic machine translation (MT) systems. However, no such global and systematic scheme exists for evaluation of performance of an MT system. The existing evaluation metrics, such as BLEU, METEOR, TER, although used extensively in literature have faced a lot of criticism from users. Moreover, performance of these metrics often varies with the pair of languages under consideration. The above observation is no less pertinent with respect to translations involving languages of the Indian subcontinent. This study aims at developing an evaluation metric for English to Hindi MT outputs. As a part of this process, a set of probable errors have been identified manually as well as automatically. Linear regression has been used for computing weight/penalty for each error, while taking human evaluations into consideration. A sentence score is computed as the weighted sum of the errors. A set of 126 models has been built using different single classifiers and ensemble of classifiers in order to find the most suitable model for allocating appropriate weight/penalty for each error. The outputs of the models have been compared with the state-of-the-art evaluation metrics. The models developed for manually identified errors correlate well with manual evaluation scores, whereas the models for the automatically identified errors have low correlation with the manual scores. This indicates the need for further improvement and development of sophisticated linguistic tools for automatic identification and extraction of errors. Although many automatic machine translation tools are being developed for many different language pairs, there is no such generalized scheme that would lead to designing meaningful metrics for their evaluation. The proposed scheme should help in developing such metrics for different language pairs in the coming days.     

Vacant codes grouping and fast OVSF code assignment scheme for WCDMA networks

Channelization codes used in WCDMA are Orthogonal Variable Spreading Factor (OVSF) codes. These codes suffer from code blocking limitation. Many designs are proposed to avoid this limitation but most of them do not consider number of codes searched, which affects call establishment delay prior to handling a call. We propose a fast OVSF code assignment design which aims to reduce number of codes searched with optimal/suboptimal code blocking. The code assignment scheme aims to use those vacant codes whose parents are already blocked. This leads to occurrence of more vacant codes in groups, which ultimately leads to less code blocking for higher rate calls. The number of codes searched increases linearly in our design compare to most of other novel proposed single code methods like crowded first assignment, where it increases exponentially with increase in user rates. Also the calculation of vacant codes at one layer will be sufficient to identify the vacant code adjacency for all the layers which reduces complexity. Simulation results are presented to verify the superiority of the design.     

Efficient hybrid enhanced genetic algorithm and ant colony system model for rerouting multimedia message in multiple node–link failures within wireless network

Failure-resilient wireless networks have attracted the interest of the research community and have been an open area of concern in the studies of wireless network in recent years. Accordingly, different research on restoration techniques have been carried out to proffer solution to the network component failures. In the same vein, this article proposes a hybridized enhanced genetic algorithm and ant colony system (EGAACS) survivability model, which can instantly resolve node–link failure problems, thus improving the quality of service of the wireless network. The EGAACS is a hybrid model that combines the principles of the enhanced genetic algorithm (EGA) and ant colony system (ACS) models to form a capacity efficiency solution that outperforms the ACS and EGA models in terms of path cost and transmission delay. The resilience of this proposed EGAACS model is verified for different wireless network sizes (20, 30, 40, and 50 node networks). Simulation results show that the proposed EGAACS model generates the best close to optimal paths in terms of the path cost and transmission delay in comparison to the EGA and ACS models. In fact, the performance of the proposed EGAACS model is more conspicuous as the size of the network increases. More importantly, the proposed EGAACS model is suitable for real-time wireless network as it exhibits moderate computational time complexity.     

Slantlet filter-bank-based satellite image enhancement using gamma-corrected knee transformation

In this paper, an efficient and relatively fast approach for satellite image enhancement is proposed. This technique is based on auto-knee transfer function with suitable gamma correction using slantlet transform for two-scale decomposed image. Dark or low contrast, big-data (or large sized) multispectral images can be easily enhanced by proper tuning for the value of gamma-parameter using slantlet transform. Here, sub-band decomposition is achieved by employing single-level slantlet filter-bank, which is just equivalent to second-level sub-band decomposition using discrete wavelet transform) that has been employed initially. For this purpose, main information of the image is concentrated to lowest sub-band, over which gamma correction is applied after computing the knee transfer function adaptively for low quality input image. In addition to this two-scale decomposition-based enhancement, here, gamma-corrected energy redistributed slantlet transform-based textural enhancement framework is also suggested. The experimentation comprised of relative performance evaluation and comparison on the same scale; clearly reflects the outperformance of proposed methodology over various well-known pre-existing state-of-the-art techniques both quantitatively and qualitatively.     

Top Down Code Search to Locate An Optimum Code and Reduction in Code Blocking for CDMA Networks

In this paper, a top down code search scheme is proposed that identify an optimum OVSF code for assignment at the base station of CDMA wireless networks. An optimum vacant code is the one whose usage produces least code blocking compared to other eligible codes. This scheme provides least code blocking compared to existing schemes without reassignments. In addition, the codes searched during locating the optimum code are significantly less than other existing schemes. The call establishment delay which is a significant factor for real time applications is directly proportional to the number of searches and should be low. The design is explained for single code, and extended to multi code assignment to improve code blocking. The multi code assignment is done using four ways. The first and second multi code schemes uses minimum and maximum rakes for a fixed rate system. The third scheme called scattered multi code scheme divide the incoming call into rate fractions equal to number of rakes available in the system, and each rate fraction is handled in a similar way in which the new call is handled in single code scheme. The rate fractions may be scattered or grouped in the code tree. The fourth multi code scheme, namely grouped multi code scheme allocates codes to all the fractions as close as possible. This maximizes future higher rate vacant codes availability by leaving a complete sub tree vacant when call using multi code ends.