Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 192 )

2018 ( 274 )

2017 ( 293 )

2016 ( 458 )

Custom range...

Search Results: 1 - 10 of 223955 matches for " Pushpa R "
All listed articles are free for downloading (OA Articles)
Page 1 /223955
Display every page Item
Marginal permeability of one step self-etch adhesives: Effects of double application or the application of hydrophobic layer
Pushpa R,Suresh B
Journal of Conservative Dentistry , 2010,
Abstract: Aim : The purpose of this in vitro investigation was to evaluate the influence of double application and application of hydrophobic layer on marginal adaptation of four self-etch adhesive systems (XENOIII, ALLBONDSE, CLEARFIL SE TRI BOND, FUTURA BOND). Materials and Methods : One hundred and twenty class V cavities were prepared on intact, extracted human premolars and were divided into three groups of ten teeth each for all four adhesives. Group 1: Application of bonding agents as per manufacturer directions. Group 2: Double application of bonding agents. Group 3: Application of hydrophobic layer. The specimens were restored with composite and light cured. After thermocycling and immersion in 2% Basic Fuchsin dye solution, the teeth were sectioned and dye penetration was observed under a stereomicroscope at 20× magnification. All the samples were scored and results were analyzed using Kruskal-Wallis and Mann-Whitney tests. Results : Group 3, in which the adhesive systems were coated with hydrophobic layer, showed significantly decreased microleakage, followed by Group 1 and Group 2 for all the adhesive systems. And there is no significant different between Group 1 and Group 2. Conclusion : Marginal permeability of one-step adhesives can be minimized by the application of more hydrophobic resin layer, and the double application of one-step self-etch system can be safely performed without jeopardizing the performance of adhesives.
Analysis of Ly $α$ absorption lines in the vicinity of QSOs
R. Srianand,Pushpa Khare
Physics , 1995, DOI: 10.1093/mnras/280.3.767
Abstract: We have compiled, from the literature, a sample of Ly ${\alpha}$ forest lines in the spectra of 69 QSOs, all observed with a resolution between 60 to 100 km s$^{-1}$. The sample is studied for proximity effect. We have tried to account for the effect of blending which is inherent in the intermediate resolution sample, by calculating the column density distribution, using an effective velocity dispersion parameter, from the observed equivalent width distribution. The use of this column density distribution in the proximity effect analysis reduces the background intensity values by a factor of 2 to 3 compared to the values obtained by using the column density distribution obtained from high resolution observations. Evidence is presented for a weak correlation between the effective velocity dispersion parameter and equivalent width. Such a correlation if present can increase the background values by a factor of up to 1.5. Considerations of proximity in the spectra of 16 QSOs, from our sample, exhibiting damped Ly ${\alpha}$ lines gives a background intensity which is 3 times smaller than the values obtained from the whole sample, confirming the presence of dust in the damped Ly $\alpha$ systems. Lines close to the QSOs are shown to be marginally stronger and broader compared to lines away from the QSOs. The Ly $\alpha$ lines with absorption redshift larger than emission redshift are shown to be uncorrelated with QSO luminosity, radio loudness or optical spectral index. These lines occur more frequently at high redshifts. Their presence is correlated weakly with the presence of associated metal line systems. The possibilities that the QSO emission redshift is considerably higher and that either the Ly $\alpha$ clouds or the QSOs have peculiar velocities are considered. It is argued that a combination of both these
M-quasi-hyponormal composition operators
Pushpa R. Suri,N. Singh
International Journal of Mathematics and Mathematical Sciences , 1987, DOI: 10.1155/s0161171287000760
Abstract: A necessary and sufficient condition is obtained for M-quasi-hyponormal composition operators. It has also been proved that the class of M-quasi-hyponormal composition operators coincides with the class of M-paranormal composition operators. Existence of M-hyponormal composition operators which are not hyponormal; and M-quasihyponormal composition operators which are not M-hyponormal and quasi-hyponormal are also shown.
Avoidance of Intruder Attack with Changed Bluetooth Authentication Procedure
Pushpa R. Suri,Sona Rani
Information Technology Journal , 2006,
Abstract: This study focuses on the mechanism of Bluetooth bonding and authentication. When two units want to communicate in a secure way, the need to be paired to each other. In the pairing process units are exchanging keys and authenticate each other. We have mention about Bluetooth security breaks and holes for attacker using. Finally this study ends with behavior of attacker and countermeasures of it.
Bluetooth Authentication and Personal Identification Number Estimation by Attacker
Pushpa R. Suri,Sona Rani
Information Technology Journal , 2007,
Abstract: This research deals with the mechanisms used in Bluetooth Link-level security Mode. In this mode, a Bluetooth device will initiate security measures before a channel is established. This is a built-in mechanism that is used regardless of the application layer security that may also be used. In this study we have discussed about the estimation of personal identification number by the attacker and demonstration of how the security of the Bluetooth devices is disturbed.
Ternary Tree and Memory-Efficient Huffman Decoding Algorithm
Pushpa R. Suri,Madhu Goel
International Journal of Computer Science Issues , 2011,
Abstract: In this study, the focus was on the use of ternary tree over binary tree. Here, a new one pass Algorithm for Decoding adaptive Huffman ternary tree codes was implemented. To reduce the memory size and fasten the process of searching for a symbol in a Huffman tree, we exploited the property of the encoded symbols and proposed a memory efficient data structure to represent the codeword length of Huffman ternary tree. In this algorithm we tried to find out the staring and ending address of the code to know the length of the code. And then in second algorithm we tried to decode the ternary tree code using binary search method. In this algorithm we tried to find out the staring and ending address of the code to know the length of the code. And then in second algorithm we tried to decode the ternary tree code using binary search method.
Object Oriented Information Computing over WWW
Pushpa R. Suri,Harmunish Taneja
International Journal of Computer Science Issues , 2010,
Abstract: Traditional search engines on World Wide Web (WWW) focus essentially on relevance ranking at the page level. But this lead to missing innumerable structured information about real-world objects embedded in static Web pages and online Web databases. Page-level information retrieval (IR) can unfortunately lead to highly inaccurate relevance ranking in answering object-oriented queries. On the other hand, Object Oriented Information Computing (OOIC) is promising and greatly reduces the complexity of the system while improving reusability and manageability. The most distinguishing requirement of today's complex heterogeneous systems is the need of the computing system to instantly adapt to vigorously changing conditions. OOIC allows reflecting the dynamic characteristics of the applications by instantiating objects dynamically. In this paper, major challenges of OOIC as well as its rudiments are recapped. The review includes the insight to PopRank Model and comparison analysis of conventional page rank based IR with OOIC.
Ternary Tree and Clustering Based Huffman Coding Algorithm
Pushpa R. Suri,Madhu Goel
International Journal of Computer Science Issues , 2010,
Abstract: In this study, the focus was on the use of ternary tree over binary tree. Here, a new two pass Algorithm for encoding Huffman ternary tree codes was implemented. In this algorithm we tried to find out the codeword length of the symbol. Here I used the concept of Huffman encoding. Huffman encoding was a two pass problem. Here the first pass was to collect the letter frequencies. You need to use that information to create the Huffman tree. Note that char values range from -128 to 127, so you will need to cast them. I stored the data as unsigned chars to solve this problem, and then the range is 0 to 255. Open the output file and write the frequency table to it. Open the input file, read characters from it, gets the codes, and writes the encoding into the output file. Once a Huffman code has been generated, data may be encoded simply by replacing each symbol with its code. To reduce the memory size and fasten the process of finding the codeword length for a symbol in a Huffman tree, we proposed a memory efficient data structure to represent the codeword length of Huffman ternary tree. In this algorithm we tried to find out the length of the code of the symbols used in the tree.
An integrated ranking algorithm for efficient information computing in social networks
Pushpa R. Suri,Harmunish Taneja
Computer Science , 2012, DOI: 10.5121/ijwsc.2012.3103
Abstract: Social networks have ensured the expanding disproportion between the face of WWW stored traditionally in search engine repositories and the actual ever changing face of Web. Exponential growth of web users and the ease with which they can upload contents on web highlights the need of content controls on material published on the web. As definition of search is changing, socially-enhanced interactive search methodologies are the need of the hour. Ranking is pivotal for efficient web search as the search performance mainly depends upon the ranking results. In this paper new integrated ranking model based on fused rank of web object based on popularity factor earned over only valid interlinks from multiple social forums is proposed. This model identifies relationships between web objects in separate social networks based on the object inheritance graph. Experimental study indicates the effectiveness of proposed Fusion based ranking algorithm in terms of better search results.
Biotransformation of Benzaldehyde to L-Phenylacetylcarbinol (L-PAC) by Free Cells of Torulaspora delbrueckii in presence of Beta-Cyclodextrin
Shukla, Vilas. B.;Kulkarni, Pushpa R.;
Brazilian Archives of Biology and Technology , 2002, DOI: 10.1590/S1516-89132002000300003
Abstract: studies were carried out to explore the possibility of decreasing the toxic and inhibitory effects of the substrate benzaldehyde during its biotransformation to l-pac by free cells of torulaspora delbrueckii using b -cyclodextrin (b -cd). use of various levels of benzaldehyde and acetaldehyde in presence of 2% of b -cd showed that, in presence of b -cd, the organism could tolerate higher levels of benzaldehyde and acetaldehyde. semi-continuous feeding of benzaldehyde and acetaldehyde was found to increase the yield of l-pac in comparison with one time feeding.
Page 1 /223955
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.