Evaluation of phytochemical constituents, quantitative analysis and antimicrobial efficacy of potential herbs against selected microbes

 Objectives: The aim was to evaluate the physicochemical composition, phytochemical analysis and antimicrobial activity of plant extracts.Methods: The plant samples (Citrus reticulata, Camellia sinensis and Punica granatum) were extracted using various solvents (acetone, butanol,chloroform, hexane, methanol and water) and antimicrobial assay was performed against selected microbes viz., Escherichia coli, Klebsiella pneumoniae,Pseudomonas aeuroginosa, Salmonella typhi, Staphylococcus aureus, Aspergillus flavus, Aspergillus niger, Aspergillus parasiticus, Fusarium oxysporumand Fusarium verticilloides.Results: Acetone and aqueous extracts (23 mm) of C. sinensis and P. granatum acquired maximum inhibition. P. granatum found to possess strongantifungal activity in acetone and methanol extract (19 mm) against F. verticilloides.Conclusion: These findings suggest that C. sinensis and P. granatum act as a potential source of the antimicrobial agent.Keywords: Phytonutrients, Plant extracts, Antimicrobial screening, Agar-well dilution, Inhibition

Comparison Of Modified Dual Ternary Indexing And Multi-Key Hashing Algorithms For Music Information Retrieval

In this work we have compared two indexing algorithms that have been used to index and retrieve Carnatic music songs. We have compared a modified algorithm of the Dual ternary indexing algorithm for music indexing and retrieval with the multi-key hashing indexing algorithm proposed by us. The modification in the dual ternary algorithm was essential to handle variable length query phrase and to accommodate features specific to Carnatic music. The dual ternary indexing algorithm is adapted for Carnatic music by segmenting using the segmentation technique for Carnatic music. The dual ternary algorithm is compared with the multi-key hashing algorithm designed by us for indexing and retrieval in which features like MFCC, spectral flux, melody string and spectral centroid are used as features for indexing data into a hash table. The way in which collision resolution was handled by this hash table is different than the normal hash table approaches. It was observed that multi-key hashing based retrieval had a lesser time complexity than dual-ternary based indexing The algorithms were also compared for their precision and recall in which multi-key hashing had a better recall than modified dual ternary indexing for the sample data considered.Comment: 11 pages, 5 figure

Interference Cancellation in Cooperative CDMA Networks

The wireless communication networks are subjected to multi access interference and multipath fading. To minimize the interference cancellation in CDMA networks, multiple user detection schemes and cooperative communication networks are used. consider the uplink of a cooperative CDMA network, where users cooperate by relaying each other’s messages to the base station. When spreading waveforms are not orthogonal, multiple access interference (MAI) exists at the relays and the destination, causing cooperative diversity gains to diminish. To overcome this problem, we integrate various multiuser detection (MUD) schemes to mitigate MAI in achieving the full advantages of cooperation. Specifically, the relay-assisted decorrelating multiuser detector (RADMUD) is proposed to separate interfering signals at the destination with the help of precoding at the relays along with pre-whitening at the destination. In this paper we examined the BER performance of various MUD schemes are analyzed and compared with cooperative system. The advantages of RAD-MUD with co-operative communication shows better BER performance compared with non co-operative wireless communication system and other existing cooperative MUD schemes are also shown through MATLAB Simulations

A Bi-directional Energy Splitable Model for Energy Optimization in Wireless Sensor Networks

Wireless Sensor Networks is a budding  prototype of networking and computing, where a node may be self powered and individual node have the capability to sense and compute and communicate. Wireless Sensor Networks have been proposed for variety of applications such as Industrial control and monitoring and home automation and consumer electronics and security andMilitary sensing, Asset tracking and supply chain management, Intelligent Agriculture, Missile directing, Fire alarming, Landslide Warning, Environmental monitoring and health monitoring and commercial applications. In Wireless Sensor Network large number of nodes are deployed randomly. Depends on the network architecture the application may be personalized such as Energy Efficiency, Routing and Power Management and data dissemination. Energy Optimization involves in minimizing an energy expenditure and maximizing the lifetime of the complete network. In the proposed work, the placement of nodes are directly involved with residual energy. Energy Optimization in sensor network is very difficult task to achieve it. The optimization of energy is performed through Bidirectional Energy Splitable Model. The data flow in both forward and backward directions are considered, In order to achieve the best QOS in transmission, some parameters such as load, delay and direction of individual nodes are considered. A mathematical model is developed to determine the data flow of  individual node based on the residual energy

Implementation of security module to protect programme theft in microcontroller-based applications

Source code plagiarism has become a serious threat for the development of small scale embedded industries and also the violations of intellectual property right are a threat for the development of hardware system. There are many software solutions for comparing source codes, but they are often not realistic in the present scenario. Digital watermarking scheme is one of the possible solutions for this problem. A novel watermarking technique is employed so that it can be easily and reliably detected by special techniques. In this paper, verification methods are presented to detect software plagiarism in the embedded application software without the implemented source code. All the approaches use side-channel information obtained during the execution of the suspicious code. The primary method is passive, i.e. no previous modification of the original code is required. It determines that the Hamming weights of the executed instructions of the suspicious device are used and uses string matching algorithms for comparisons with a reference implementation. The other method inserts additional code fragments as a watermark that can be identified in the power consumption of the executed source code. Proposed approaches are robust against code-transformation attacks

Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis

We show that there is a language that is Turing complete for NP but not many-one complete for NP, under a worst-case hardness hypothesis. Our hypothesis asserts the existence of a non-deterministic, double-exponential time machine that runs in time O(2^2^n^c) (for some c > 1) accepting Sigma^* whose accepting computations cannot be computed by bounded-error, probabilistic machines running in time O(2^2^{beta * 2^n^c) (for some beta > 0). This is the first result that separates completeness notions for NP under a worst-case hardness hypothesis

Tuberculoma of brain-study of prospective clinical EEG, CT scan data of fifty two patients

52 patients with tuberculomas of brain above 12 years of age were studied during 1981 to 1988. These patients presented with focal or generalised seizures with or without focal neurological signs or raised ICT and had an abnormal EEG which correlated with the site of lesion in the CT Scan. Follow up with serial CT Scans was at intervals of 3, 6, 9, 12 and 18 months. A minimum of 3 scans for each patient were available for analysis