Study of Hopfield Neural Network for Noisy Random Patterns Using Evolutionary Approach
In this paper, a vigorous attempt has been made to study Hopfield neural network for storing and later recalling of random patterns using conventional hebbian learning rule and genetic algorithm. Storing of these patterns in the network is done using Hebbian learning rule followed by recalling of these patterns on presentation of distorted input patterns is done using both the methods i.e. Hebbian rule and genetic algorithm. The optimal weight matrix obtained is used to generate new weight matrices for the efficient recalling of prototype input patterns. Performance evaluation of the network is done on the basis of pattern recall with maximum noise present in patterns. The results thus obtained shows that the recall of these random patterns is more successful by using genetic algorithm.
Published by: Srishti Gangwar, T. P Singh
Author: Srishti Gangwar
Paper ID: V3I3-1451
Paper Status: published
Published: June 3, 2017
Intrapleural therapy for the prevention of recurrent spontaneous pneumothorax-A Randomized Comparative Evaluation of Bleomycin Pleurodesis & Autologous Blood Pleurodesis
Intrapleural therapy for the prevention of recurrent spontaneous pneumothorax-A Randomized Comparative Evaluation of Bleomycin Pleurodesis & Autologous Blood Pleurodesis Mudassir A. Khan, M. Akbar Bhat, A. Majeed, Naveed Khan, Faheem, Hilal, Saima N, Asif M. BACKGROUND: Pneumothorax is free air in pleural space i.e. between visceral and parietal pleura. Among various treatment options for recurrent pneumothorax, one is chemical pleurodesis; intended to achieve a symphysis between parietal and visceral pleura, in order to prevent accumulation of air (pneumothorax) in the pleural space. OBJECTIVE: Our objectives in this study were to evaluate the efficacy of autologous blood pleurodesis in the management of persistent air leak in primary spontaneous recurrent pneumothorax and to compare the efficiency, side effects, cost and complications of autologous blood pleurodesis vis a vis bleomycin pleurodesis. STUDY DESIGN: It was a prospective randomized comparative evaluation of autologous blood & bleomycin pleurodesis involving patients with persistent air leak resulting due to primary spontaneous recurrent pneumothorax. We followed the patients for a period of 1-22 months with average follow up of 11.766 months. METHODS: The study entitled, “Intrapleural therapy for the prevention of recurrent spontaneous pneumothorax-A Randomized Comparative Evaluation of Bleomycin Pleurodesis & Autologous Blood Pleurodesis” was carried out in the department of CVTS, SKIMS Srinagar Kashmir from May 2010 to Oct 2012. Total of thirty (30) patients with primary spontaneous recurrent pneumothorax were included in the study; 16 patients in Study Group (receiving autologous blood) & 14 patients in Control Group (receiving bleomycin). On an average 54.7ml (1ml/kg body weight) of peripheral venous blood taken from the patient's arm vein was immediately injected into the pleural cavity via the chest tube & chest tube was clamped for 1-2hrs. In bleomycin pleurodesis at 15 min after instillation of 20 ml of lidocaine 1%, about 55.7 units (1 iu/kg body wt.) of bleomycin in 100 ml of normal saline were instilled into the pleural cavity via the chest tube and the tube clamped for 1-2hrs. RESULTS: One (6.3%) patient in the Study group had failure of cessation of air leak after blood patch pleurodesis. Hence the success rate of cessation of air leak in Control group was 100% while as it is 93.7% in Study group (p-value=0.178, insignificant). In Study group 3(18.8%) patients had post-procedure pain but none had fever; while as in Control group 13(92.9%) patients had post-procedure pain & 6(42.9%) patients had fever. None of the patients from Study as well as Control groups had post-procedure empyema, tension pneumothorax, anaphylaxis, chest tube clogging or progressive respiratory failure. Per patient average cost of the procedure in Study group was Rs 53.13, while the average cost of procedure per patient in Control group was Rs1925.00 (p-value ≤0.0001). After 1-22 months (average 11.76) follow up, in Study group 3(20%) out of 15 patients had recurrence, and also in Control group 3(21.4%) out of 14 patients had recurrence of pneumothorax.( p-value (0.44) insignificant). CONCLUSION: The effectiveness of blood pleurodesis in cessation of air leak is approaching to that of bleomycin pleurodesis with similar recurrence rates in both groups. However the incidence of immediate post-procedure pain and fever is much higher in patients of bleomycin pleurodesis. Also compared to bleomycin, the autologous blood pleurodesis is very much cost effective. Our limited experience indicates that pleurodesis with self-donated blood is an easy-to-perform, painless, convenient, rapid and inexpensive procedure that is moderately effective in the short and medium term.
Published by: Mudassir Ahmad Khan, M. Akbar Bhat, A. Majeed, Naveed Khan, Faheem, Hilal, Saima .N, Asif .M
Author: Mudassir Ahmad Khan
Paper ID: V3I3-1412
Paper Status: published
Published: June 3, 2017
A Lot Can Happen Over Coffee (A Study with Special Reference to Cafe Coffee Day)
Café Coffee Day is a part of India's largest coffee conglomerate, Amalgamated Bean Coffee Trading Company Ltd. (ABCTCL). ABCTCL have their own 10,000 acres of estates where the coffee seeds are grown. The net worth of the coffee plantations is around US$250–300 million. They are one of the largest producers in Asia to produce Arabica coffee beans. To augment the balance, they also procure coffee beans from 11,000 small and medium coffee growers. Cafe Coffee Day was founded by V. G. Siddhartha from the state of Karnataka. The USP of CCD was providing a broadband internet over a cup of coffee. For over two decades they have brought in drastic changes in the Menu. They have modified their logo with easily identifiable bright-purple-and-red identity. CCD is expanding and exploring its layout to embrace sprawling lounge and squares and crafting sub-divisions for everything from highways to hospitals. This paper attempts to study the journey of CCD in brewing fresh formulations to stay relevant in the market.
Published by: Dr. S. Gayathry
Author: Dr. S. Gayathry
Paper ID: V3I3-1168
Paper Status: published
Published: June 1, 2017
Symbolism in Anita Desai’s Novels
Symbols have a vital role to play in displaying different states; generally, symbols used by Anita Desai are a part of circumstantial details of the narrative. In order to present submerged psychic truth she uses the technique of symbolism thoroughly carefully chosen a cluster of images, myths symbols are most prominently amongst the devices deployed by her. These symbols are capable of objectifying the inner psychic layers of the characters.
Published by: Bandna Semwal
Author: Bandna Semwal
Paper ID: V3I3-1441
Paper Status: published
Published: June 1, 2017
Matching Domination of Kronecker Product of Two Graphs
A dominating set D is called a connected dominating set, if it induces a connected subgraph in G. Since a dominating set must contain atleast one vertex from every component of G, it follows that a connected dominating set for a graph G exists if and only if G is connected. The minimum of cardinalities of the connected dominating sets of G is called the connected domination number of G and is denoted by γc(G). We have defined new parameter called the matching dominating set and the matching domination number.We consider Kronecker product of two graphs, matching domination of product graphs and recall the results associated to the matching domination of Kronecker product of graphs. We prove the following: • In G1(k)G2 then deg(ui, vj ) = deg(ui).deg(vj ). • If G1 and G2 are finite graphs without isolated vertices then G1(K)G2 is a finite graph without isolated vertices. • |VG1(k)G2 | = |VG1 ||VG2 | • |EG1(k)G2 | = 2|EG1 ||VE2 | • If G1 and G2 are regular graphs, then G1(K)G2 is also a regular graph. • If G1 or G2 is a bipartite graph then Gl(k)G2 is a bipartite graph. • The matching domination number of c4(k)Km is 4. • If G1, G2 are two graphs without isolated vertices then γm[G1(k)G2] = γm(G1).γm(G2) where G1(k)G2, is the Kronecker product of graphs.
Published by: P. Bhaskarudu
Author: P. Bhaskarudu
Paper ID: V3I3-1284
Paper Status: published
Published: June 1, 2017
Closed Sequential Pattern Mining Using Binary Representation by Same Support Threshold Value
This paper is Closed Sequential Pattern Mining by Same Support Threshold Value (ClospamSSV). The main intend is to find the closed frequent item sets from huge sequence database. The ClospamSSV discovers ideally Minimal Closed Sequential Patterns in long sequence databases. The experimental evaluation shows that the proposed algorithm outperforms the Clospam. The Same Support Value is used to prune search spaces according to the given supported threshold value.
Published by: N. Jayaveeran, S. Ramesh
Author: N. Jayaveeran
Paper ID: V3I3-1408
Paper Status: published
Published: June 1, 2017
