http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
DYNAMICAL ANALYSIS OF A PLANT-HERBIVORE MODEL : BIFURCATION AND GLOBAL STABILITY
SAHA, TAPAN,BANDYOPADHYAY, MALAY 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.19 No.1
The first part of the paper deals with a brief introduction of the plant-herbivore model system along with deterministic analysis of local stability and Hopf-bifurcations. The second part consists of stability analysis of the limit cycle arising from Hopf-bifurcation and uniqueness of limit cycle. The third part deals with the study of global stability of the model system under consideration.
Dynamical analysis of a plant-herbivore model : bifurcation and global stability
Tapan Saha,Malay Bandyopadhyay 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.19 No.1-2
The first part of the paper deals with a brief introduction of the plant-herbivore model system along with deterministic analysis of local stability and Hopf-bifurcations. The second part consists of stability analysis of the limit cycle arising from Hopf-bifurcation and uniqueness of limit cycle. The third part deals with the study of global stability of the model system under consideration.
Multiple Scale Analysis of a Delayed Predator Prey Model within Random Environment
Tapan Saha,Malay Bandyopadhyay 한국전산응용수학회 2008 Journal of applied mathematics & informatics Vol.26 No.5
We consider a delayed predator prey model. The local stability and Hopf bifurcation results are stated taking the time delay as a control parameter. We apply multiple scale analysis to analyze the effects of additive white noises near the Hopf bifurcation point at the positive interior equilibrium state. The governing equations for the amplitude of oscillations on a slow time scale are derived. We identify the process of amplitude of oscillations and derive its transient properties. We show that oscillations, which would decay in the deterministic system whenever time delay lies below its critical value, persists for long time under the validity of multiple scale analysis.. We consider a delayed predator prey model. The local stability and Hopf bifurcation results are stated taking the time delay as a control parameter. We apply multiple scale analysis to analyze the effects of additive white noises near the Hopf bifurcation point at the positive interior equilibrium state. The governing equations for the amplitude of oscillations on a slow time scale are derived. We identify the process of amplitude of oscillations and derive its transient properties. We show that oscillations, which would decay in the deterministic system whenever time delay lies below its critical value, persists for long time under the validity of multiple scale analysis..
MULTIPLE SCALE ANALYSIS OF A DELAYED PREDATOR PREY MODEL WITHIN RANDOM ENVIRONMENT
Saha, Tapan,Bandyopadhyay, Malay Korean Society of Computational and Applied Mathem 2008 Journal of applied mathematics & informatics Vol.26 No.5
We consider a delayed predator prey model. The local stability and Hopf bifurcation results are stated taking the time delay as a control parameter. We apply multiple scale analysis to analyze the effects of additive white noises near the Hopf bifurcation point at the positive interior equilibrium state. The governing equations for the amplitude of oscillations on a slow time scale are derived. We identify the process of amplitude of oscillations and derive its transient properties. We show that oscillations, which would decay in the deterministic system whenever time delay lies below its critical value, persists for long time under the validity of multiple scale analysis.
Evaluation of Hepatoprotective Potential of Cassia tora Leaf Extract
Maity, Tapan Kumar,Mandal, Subhash C.,Mukherjee, Pulok K.,Saha, Kakali,Das, J.,Saha, B.P.,Pal, M. The Korean Society of Pharmacognosy 1997 Natural Product Sciences Vol.3 No.2
Methanolic extract of the leaves of Cassia tom was evaluated for its hepatoprotective potentials in rats by inducing hepatotoxicity with carbon tetrachloride. The extract at a dose of 400 mg/kg orally showed significant protective effect by lowering the serum levels of transaminase (SGOT and SGPT), bilirubin and alkaline phosphatase (ALP). The effects produced were comparable to that of a standard hepatoprotective agent.
AN EFFICIENT PRAM ALGORITHM FOR MAXIMUM-WEIGHT INDEPENDENT SET ON PERMUTATION GRAPHS
SAHA, ANITA,PAL, MADHUMANGAL,PAL, TAPAN K. 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.19 No.1
An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O($n^2$/ log n) processors on an EREW PRAM, provided the graph has at most O(n) maximal independent sets. The best known parallel algorithm takes O($log^2n$) time and O($n^3/log\;n$) processors on a CREW PRAM.
Antihepatotoxic Activity of Cassia tora Leaf Extract
Tapan K. Maity,Subhash C. Mandal,M. Pal,B. P. Saha 한국생약학회 1998 Natural Product Sciences Vol.4 No.4
Methanolic extract of Cassia tora leaves was evaluated for its hepatoprotective activity in rats by inducing hepatotoxicity with paracetamol (acute model). The extract at a dose of 400 ㎎/㎏ orally exhibited significant protective effect by lowering the serum levels of transaminase (SGOT and SGPT), bilirubin, and alkaline phosphatase (ALP). The effects produced were comparable to that of a standard hepatoprotective agent.
AN OPTIMAL PARALLEL ALGORITHM FOR SOLVING ALL-PAIRS SHORTEST PATHS PROBLEM ON CIRCULAR-ARC GRAPHS
SAHA, ANITA,PAL, MADHUMANGAL,PAL, TAPAN K. 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.17 No.1
The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.
An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
Anita Saha,Madhumangal Pal,Tapan K. Pal 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.17 No.1-2
The shortest-paths problem is a undamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an O(n2) time sequential algorithm and an O(n2/p + log n) time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.
An efficient PRAM algorithm for maximum-weightindependent set on permutation graphs
Anita Saha,Madhumangal Pal,Tapan K. Pal 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.19 No.1-2
An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O(n2/ log n) processors on an EREW PRAM, provided the graph has at most O(n) maximal independent sets. The best known parallel algorithm takes O(log2 n) time and O(n3/ log n) processors on a CREW PRAM.