Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Search Results: 1 - 10 of 195 matches for " Bhowmik "
All listed articles are free for downloading (OA Articles)
Page 1 /195
Display every page Item
Pollen Production in Relation to Ecological Class of Some Hydrophytes and Marsh Plants  [PDF]
Somnath Bhowmik, Badal Kumar Datta
American Journal of Plant Sciences (AJPS) , 2013, DOI: 10.4236/ajps.2013.42043
Abstract: The knowledge of quantitative production and method of dispersal give some idea about the frequency of presence of particular plant pollen grains in the atmosphere or hydrosphere. Pollen production in terms of number per anther along with the particular anther number per flower, anther length, pollen grain size, mode of anther dehiscence was determined for 51 angiospermous hydrophytes and marsh species occurring in Tripura, India. Pollen production is species specific. The level of pollen production directly related to the anther size and anther number per flower. However, no such correlation could be drawn between pollen production and size of pollen grains. Most of the hydrophytic taxa of the present investigation are anemophilous. The anemophilous taxa are characterized by high pollen production. However no correlation could be drawn from the present study between the high pollen production and mode of anther dehiscence as in all the studied taxa they show only one kind of anther dehiscence.
A Comparison Study on Selective Traffic Models with Handoff Management Scheme for Wireless Mobile Network Infrastructure
Biswajit Bhowmik
International Journal of Information Technology and Computer Science , 2013,
Abstract: Wireless and Mobile Network Infrastructure services generally examine how different infrastructure providers are positioning themselves to compete in wireless services. These services analyze the opportunities and challenges facing by the infrastructure providers selling to wireless and mobile network operators worldwide. The opportunities and challenges are the review of strategies, market positioning, and future direction in the market for wireless and mobile network infrastructure. The service covers all generations of wireless and mobile network infrastructure: 2G, 2.5G, 3G, and 4G so on global in scope. Majority of the users are mobile while availing these services. Mobility is the most important feature of any wireless and mobile network. Usually, continuous service is achieved by supporting handoff from one cell to another. Poorly designed handoff schemes tend to generate very heavy signaling traffic and, thereby, lead to a dramatic decrease in quality of service. In this paper we make a comparison study on some selective traffic models with priority handoff scheme. The study shows how a handoff procedure has a significant impact on wireless mobile network performance on the basis of two primary criteria – Blocking probability of originating calls and the forced termination probability of ongoing calls. In addition to this the study shows arrival rate of handoff calls, and approximate number of mobile users that get serviced by underlying base station.
Detecting Auto Insurance Fraud by Data Mining Techniques
Rekha Bhowmik
Journal of Emerging Trends in Computing and Information Sciences , 2011,
Abstract: The paper presents fraud detection method to predict and analyze fraud patterns from data. To generate classifiers, we apply the Na ve Bayesian Classification, and Decision Tree-Based algorithms. A brief description of the algorithm is provided along with its application in detecting fraud. The same data is used for both the techniques. We analyze and interpret the classifier predictions. The model prediction is supported by Bayesian Na ve Visualization, Decision Tree visualization, and Rule-Based Classification. We evaluate techniques to solve fraud detection in automobile insurance.
Simplified Optimal Parenthesization Scheme for Matrix Chain Multiplication Problem using Bottom-up Practice in 2-Tree Structure
Biswajit BHOWMIK
Journal of Applied Computer Science & Mathematics , 2011,
Abstract: Dynamic Programming is one of the sledgehammers of the algorithms craft in optimizations. The versatility of the dynamic programming method is really appreciated by exposure to a wide variety of applications. In this paper a modified algorithm is introduced to provide suitable procedure that ensures how to multiply a chain of matrices. The model Optimal Parenthesization Scheme using 2-Tree Generation (OPS2TG) acts as one relevancies of the proposed algorithm. A new approach for how to break the matrix chain and how to insert parenthesis in it is also designed in this model. The comparison study between the proposed model and the classical approach shows acceptance of the model suggested here.
International Journal of Engineering Science and Technology , 2010,
Abstract: The massive increase in computation power over the last few decades has substantially enhanced our ability to solve complex problems with their performance evaluations in diverse areas of science and engineering. With the recent developments in the field of optimizations, these methods are now become lucrative to make decisions. Dynamic Programming is one of the elegant algorithm design standards and is powerful tool which yields classic algorithms for a variety of combinatorial optimization problems. In this paper fundamental working principles, major area of applications of this approach has been introduced. The strengths which make it more prevailing than the others is also opened up. Focusing the imperative drawbacks afterward comparison study of this algorithm design technique in this paper brings a general awareness to the implementation strategies.
Nirjhar Bhowmik
e-Journal of Dentistry , 2012,
D Bhowmik
Journal of Global Pharma Technology , 2010, DOI: 10.1234/jgpt.v2i5.207
Building Design Optimization Using Sequential Linear Programming
Rekha Bhowmik
Journal of Computers , 2008, DOI: 10.4304/jcp.3.4.58-64
Abstract: In this paper a nonlinear programming approach is used for the minimization of total communication cost to determine the optimum room dimensions for each room. The nonlinear programming problem is solved by the Improved Move Limit Method of Sequential Linear Programming. In this method, the objective function and all the constraints are linearised in the neighborhood of the design point and an optimum obtained through simplex algorithm. To ensure that the movement is not large, appropriate move limits are imposed as constraints. The linearization and LP solution are repeated until the exact optimum is located.
Debjit Bhowmik
Journal of Global Pharma Technology , 2010, DOI: 10.1234/jgpt.v2i4.182
Analytic Continuation of some zeta functions
Gautami Bhowmik
Mathematics , 2010,
Abstract: This is an expository paper on the meromorphic continuation of zeta functions with Euler products (for example zeta functions of groups and height zeta functions) or without (for example the Goldbach zeta function). As an application we show how a natural boundary of analytic continuation can give asymptotic results.
Page 1 /195
Display every page Item

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