This paper presents identification of intima media thickness (IMT) in common carotid Artery ultrasound video sequence. It is fully using automatic segmentation; these are based on unsupervised manner. The aim of this study introduces a novel unsupervised Computer Aided Detection (CAD) Algorithm that is able to identify and measure the IMT in 2D ultrasound carotid images. The developed technique relies on a suite on image processing algorithms that embeds a statistical model to identify the two interfaces that form the IMT without user intervention. The experimental results show that the proposed CAD system is robust in accurately estimating the IMT in ultrasound carotid data.

Privacy protection of mobile Adhoc Network is more demanding than that of wired Networks. This is due to open nature and mobility of wireless media that required strong privacy protection. RDBWS is efficient for removal of active and passive attacks in MANET. A number of schemes have been proposed to protect privacy in MANET. However none of the protocols avoids all these attacks in a single protocol. In this paper we design a RDBWS protocol with provable secure Routing for unlikability and unobservability for all types of packets. It uses encryption and decryption by means of public encryption scheme. It uses encryption and decryption by means of publickey encryption scheme.

This paper presents enterprises are expanding Infrastructure as a service in university activity. Now a day’s most of the organization came in to cloud computing and also they run it as successful one. In this paper we tried to make use Infrastructure as a service technology in a university which helps the students and teachers to have a new development and advancement in education system. The project describes general an architecture allowing Mobile IP hosts to access the network that is protected by a firewall from the public Internet in cloud. The implementation based on adaptation of student, teacher and administrator.

In this work, an automated segmentation approach is presented that performs a FCM (Fuzzy C Means) on computed tomography (CT) scans to subdivide the lungs into lobes. FCM is used to segment boundary of region accurately. A marker based watershed transformation is also computed on tomography (CT) scans to subdivide the lungs into lobes. The cost image for the watershed transformation and FCM is computed by combining information from fissures, bronchi and pulmonary vessels. Finally identify the best performance of the image between FCM and watershed transformation. Lung lobe segmentation is relevant in clinical applications particularly for treatment planning. The location and distribution of pulmonary diseases are important parameters for the selection of a suitable treatment. Locally distributed emphysema can be treated more effective by lobar volume resection than homogeneously distributed emphysema. Another application is quantitative monitoring of pulmonary diseases such as emphysema or fibrosis. A lobe-wise analysis shows the progression of the disease in more detail.

BLAST is one of the most popular sequence analysis tools used by molecular biologists. It is designed to efficiently find similar regions between two sequences that have biological significance. However, because the size of genomic databases is growing rapidly, the computation time of BLAST, when performing a complete genomic database search, is continuously increasing. In this paper, we present a new approach for genomic sequence database scanning utilizing retouched bloom filter based FPGA architecture. An RBF is an extension that makes the Bloom filter more flexible by permitting the removal of false positives, at the expense of introducing false negatives, and that allows a controlled trade-off between the two. We further provide some simple heuristics that decrease the false positive rate more than the corresponding increase in the false negative rate, when creating RBFs. The RBF algorithms require space that is at most a small constant multiple of the Bloom filters vector size. Compared to the creation of a standard Bloom filter, the RBF algorithms also incur additional processing costs related to key removal. These costs are a constant multiple of a number of RBF parameters, such as the number of hash functions and the number of false positives to remove. These heuristics are more effective than the ones we have presented in prior work.

Energy consumption wireless networks the Turbo codes are mostly used, It has very low transmission energy consumption. To decrease transmission energy consumption, lookup table-log-BCJR (LUT-Log-BCJR) architectures produce small dispensation energy utilization is required. In this paper, we molder the LUT-Log-BCJR structural design change most of essential add compare select (ACS) operations and execute using a novel low-complexity ACS unit. We show the structural design of extent fewer gates, current LUT-Log-BCJR architectures, assisting 71% energy utilization decrease. Evaluate the modern maximum logarithmic Bahl-Cocke-Jelinek-Raviv method; our advanced design smooths the progress of a 10% reduction in the overall energy utilization when the range above 60 m.

Private Information Retrieval (PIR) is one of the fundamental security requirements for database outsourcing. A major threat is information hacking form database access patterns generated by query executions used by the data base server. The standard private information retrieval schemes which are widely regarded as theoretical solutions, entail o(n) computational overhead per query for a data base with n items. Recent works propose to protect access patterns by introducing a trusted component with constant storage size. The resulting privacy assurance is a strong as private information retrieval (PIR), through with o(1) online computation cost, they still have o(n) amortized cost per query due to periodically full database shuffles. In this paper, we design a novel scheme in the same model with provable security, which only shuffles a portion of the database without storage, the amortized server computational complexity is reduced than previous algorithm. Our scheme can protect the access pattern privacy of database of billions of entries, at lower cost.