• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.361-372
• /
• 2006

In this paper, we consider the multi-point boundary value problems for one-dimensional p-Laplacian at resonance: $({\phi}_p(x'(t)))'=f(t,x(t),x'(t))$, subject to the boundary value conditions: ${\phi}_p(x'(0))={\sum}^{n-2}_{i=1}{\alpha}_i{\phi}_p(x'({\epsilon}i)),\;{\phi}_p(x'(1))={\sum}^{m-2}_{i=1}{\beta}_j{\phi}_p(x'({\eta}_j))$ where ${\phi}_p(s)=/s/^{p-2}s,p>1,\;{\alpha}_i(1,{\le}i{\le}n-2){\in}R,{\beta}_j(1{\le}j{\le}m-2){\in}R,0<{\epsilon}_1<{\epsilon}_2<...<{\epsilon}_{n-2}1,\;0<{\eta}1<{\eta}2<...<{\eta}_{m-2}<1$, By applying the extension of Mawhin's continuation theorem, we prove the existence of at least one solution. Our result is new.

• Korean Journal of Mathematics
• /
• v.17 no.4
• /
• pp.495-505
• /
• 2009

By means of Green function and fixed point theorem related with cone theoretic method we show that there exist multiple nonnegative solutions of a Dirichlet problem $$\array{-[p(t)x^{\prime}(t)]^{\prime}={\lambda}q(t)f(x(t)),\;t{\in}I=[0,\;T]\\x(0)=0=x(T)}$$, and a mixed problem $$\array{-[p(t)x^{\prime}(t)]^{\prime}={\mu}q(t)f(x(t)),\;t{\in}I=[0,\;T]\\x^{\prime}(0)=0=x(T)}$$, where ${\lambda}$ and ${\mu}$ are positive parameters.

• The Pure and Applied Mathematics
• /
• v.15 no.4
• /
• pp.407-414
• /
• 2008

In this paper, we study the self-adjoint second order boundary value problem with integral boundary conditions: (p(t)x'(t))'+f(t,x(t))=0, t $${\in}$$ (0,1), x'(0)=0, x(1) = $${\int}_0^1$$ x(s)g(s)ds. A new result on the existence of positive solutions is obtained. The interesting points are: the first, we employ a new tool-the recent Leggett-Williams norm-type theorem for coincidences; the second, the boundary value problem is involved in integral condition; the third, the solutions obtained are positive.

• The Pure and Applied Mathematics
• /
• v.17 no.3
• /
• pp.257-268
• /
• 2010

We investigate the existence of the following Dirichlet boundary value problem $({\mid}u'\mid^{p-2}u')'\;+\;(p\;-\;1)[\alpha{\mid}u^+\mid^{p-2}u^+\;-\;\beta{\mid}u^-\mid^{p-2}u^-]$ = (p - 1)h(t), u(0) = u(T) = 0, where p > 1, $\alpha$ > 0, $\beta$ > 0 and ${\alpha}^{-\frac{1}{p}}\;+\;{\beta}^{-\frac{1}{p}}\;=\;2$, $T\;=\;{\pi}_p/{\alpha}^{\frac{1}{p}}$, ${\pi}_p\;=\; \frac{2{\pi}}{p\;sin(\pi/p)}$ and $h\;{\in}\;L^{\infty}$(0,T). The results of this paper generalize some early results obtained in [8] and [9]. Moreover, the method used in this paper is elementary and new.

• Korean Journal of Mathematics
• /
• v.18 no.1
• /
• pp.87-96
• /
• 2010

We consider the semilinear biharmonic equation with Dirichlet boundary condition. We give a theorem that there exist at least three nontrivial solutions for the semilinear biharmonic boundary value problem. We show this result by using the critical point theory, the finite dimensional reduction method and the shape of the graph of the corresponding functional on the finite reduction subspace.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.81-89
• /
• 2000

In this paper, we analyzed the performance for CATV/LAN added priority problem. Upstrea nm channel which analyzed very deeply for CATV/LAN network have the preferential access property depending upon that positionand unidirectional property. To solve that fairness problem and priority, we propose the CSMA-CD/U/P-P protocolthat transmit as P1 probability if data packets happen. We assumed 2-Class priority(high, low). As the analyticresult and simulation, we obtained P1, value and its average delay time under priority problem assumed twoscenarios. Also, we get its variance value and queue length. Especially, the mean delay time increases nearer thanposition from H/E

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.2
• /
• pp.411-422
• /
• 2010

By using the fixed point index theory, we investigate the existence of at least two positive solutions for p-Laplace equation with sign-changing nonlinear terms $(\varphi_p(u'))'+a(t)f(t,u(t),u'(t))=0$, subject to some boundary conditions. As an application, we also give an example to illustrate our results.

• Management Science and Financial Engineering
• /
• v.14 no.1
• /
• pp.87-90
• /
• 2008

We show that when a max-cut problem is allowed native-weight edges, to decide if the problem has a cut of a positive weight is NP-hard. This implies that there is no polynomial time algorithm which guarantees a cut whose objective value is no less than $1/p(<I>)$ times the optimum for any polynomially computable polynomial p, where denotes the encoding length of an instance I.