• Journal of applied mathematics & informatics
• /
• 제20권1_2호
• /
• pp.75-96
• /
• 2006

Let m, n be positive integers. We denote by R(m,n) (respectively P(m,n)) the class of all groups G such that, for every n subsets $X_1,X_2\ldots,X_n$, of size m of G there exits a non-identity permutation $\sigma$ such that $X_1X_2{\cdots}X_n{\cap}X_{\sigma(1)}X_{/sigma(2)}{\cdots}X_{/sigma(n)}\neq\phi$ (respectively $X_1X_2{\cdots}X_n=X_{/sigma(1)}X_{\sigma(2)}{\cdots}X_{\sigma(n)}$). Let G be a non-abelian group. In this paper we prove that (i) $G{\in}P$(2,3) if and only if G isomorphic to $S_3$, where $S_n$ is the symmetric group on n letters. (ii) $G{\in}R$(2, 2) if and only if ${\mid}G{\mid}\geq8$. (iii) If G is finite, then $G{\in}R$(3, 2) if and only if ${\mid}G{\mid}\geq14$ or G is isomorphic to one of the following: SmallGroup(16, i), $i\in$ {3, 4, 6, 11, 12, 13}, SmallGroup(32, 49), SmallGroup(32, 50), where SmallGroup(m, n) is the nth group of order m in the GAP [13] library.

• Journal of applied mathematics & informatics
• /
• 제15권1_2호
• /
• pp.511-525
• /
• 2004

we model communication and computer systems that process interactive and several and several types of background jobs. The scheduling policy in use is to share the processor among all interactive jobs and, at most, one background job of each type at a time according to the process sharing discipline. Background jobs of each type are served on a first-come-first-served basis. Such scheduling policy is called Processor Sharing with Background jobs (PSBJ). In fact, the PSBJ policy is commonly used on many communication and computer systems that allow interactive usage of the systems and process certain jobs in a background mode. In this paper, the stability conditions for the PSBJ policy are given and proved. Since an exact analysis of the policy seems to be very difficult, an approximate analytic model is proposed to obtain the average job sojourn times. The model requires the solution of a set of nonlinear equations, for which an iterative algorithm is given and its convergence is proved. Our results reveal that the model provides excellent estimates of average sojourn times for both interactive and background jobs with a few percent of errors in most of the cases considered.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제24권1호
• /
• pp.23-37
• /
• 2020

The quadratic error metric (QEM) algorithm has been frequently used for simplification of triangular surface models that utilize the vertex-pair algorithm. Simplified models obtained using such algorithms present the advantage of smaller storage capacity requirement compared to the original models. However, a number of cases exist where significant features are lost geometrically, and these features can generally be preserved by utilizing the advantages of the curvature-weighted algorithm. Based on the vertex-based geometric features, a method capable of preserving the geometric features better than the previous algorithms is proposed in this work. To validate the effectiveness of the proposed method, a simplification experiment is conducted using several models. The results of the experiment indicate that the geometrically important features are preserved well when a local feature is present and that the error is similar to those of the previous algorithms when no local features are present.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.21-38
• /
• 2006

Programmed grammars, one of the most important and well investigated classes of grammars with context-free rules and a mechanism controlling the application of the rules, can be described by graphs. We investigate whether or not the restriction to special classes of graphs restricts the generative power of programmed grammars with erasing rules and without appearance checking, too. We obtain that Eulerian, Hamiltonian, planar and bipartite graphs and regular graphs of degree at least three are pr-universal in that sense that any language which can be generated by programmed grammars (with erasing rules and without appearance checking) can be obtained by programmed grammars where the underlying graph belongs to the given special class of graphs, whereas complete graphs, regular graphs of degree 2 and backbone graphs lead to proper subfamilies of the family of programmed languages.

• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.39-49
• /
• 2004

Let G be a simple graph and let $\={G}$ denotes its complement. We say that G is integral if its spectrum consists entirely of integers. If $\overline{aK_{a}\;{\bigcup}\;{\beta}K_{b}}$ is integral we show that it belongs to the class of integral graphs $[\frac{kt}{\tau}\;{x_0}\;+\;\frac{mt}{\tau}\;z}\;K_{(t+{\ell}n)+{\ell}m}\;\bigcup\;[\frac{kt}{\tau}\;{y_0}\;+\;\frac{(t\;+\;{\ell}n)k\;+\;{\ell}m}{\tau}\;z]n\;K_{em)$, where (i) t, k, $\ell$, m, $n\;\in\;\mathbb{N}$ such that (m, n) = 1, (n,t) = 1 and ($\ell,\;t$) = 1 ; (ii) $\tau\;=\;((t\;+\;{\ell}n)k\;+\;{\ell}m,\;mt)$ such that $\tau\;$\mid$kt$; (iii) ($x_0,\;y_0$) is a particular solution of the linear Diophantine equation $((t\;+\;{\ell}n)k\;+\;{\ell}m)x\;-\;(mt)y\;=\;\tau\;and\;(iv)\;z\;{\geq}\;{z_0}$ where $z_{0}$ is the least integer such that $(\frac{kt}{\tau}\;{x_0}\;+\;\frac{mt}{\tau}\;{z_0})\;\geq\;1\;and\;(\frac{kt}{\tau}\;{y_0}\;+\;\frac{(t+{\ell}n)k+{\ell}m}{\tau}\;{z_0})\;\geq\;1$.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.921-936
• /
• 2011

In this paper, our main purpose is to establish the existence of weak solutions of a weak solutions of a class of p-q-Laplacian system involving concave-convex nonlinearities: $$\{\array{-{\Delta}_pu-{\Delta}_qu={\lambda}V(x)|u|^{r-2}u+\frac{2{\alpha}}{\alpha+\beta}|u|^{\alpha-2}u|v|^{\beta},\;x{\in}{\Omega}\\-{\Delta}p^v-{\Delta}q^v={\theta}V(x)|v|^{r-2}v+\frac{2\beta}{\alpha+\beta}|u|^{\alpha}|v|^{\beta-2}v,\;x{\in}{\Omega}\\u=v=0,\;x{\in}{\partial}{\Omega}}$$ where ${\Omega}$ is a bounded domain in $R^N$, ${\lambda}$, ${\theta}$ > 0, and 1 < ${\alpha}$, ${\beta}$, ${\alpha}+{\beta}=p^*=\frac{N_p}{N_{-p}}$ is the critical Sobolev exponent, ${\Delta}_su=div(|{\nabla}u|^{s-2}{\nabla}u)$ is the s-Laplacian of u. when 1 < r < q < p < N, we prove that there exist infinitely many weak solutions. We also obtain some results for the case 1 < q < p < r < $p^*$. The existence results of solutions are obtained by variational methods.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.421-426
• /
• 2007

The problem of vertex labeling with a condition at distance two in a graph, is a variation of Hale's channel assignment problem, which was first explored by Griggs and Yeh. For positive integer $p{\geq}q$, the ${\lambda}_{p,q}$-number of graph G, denoted ${\lambda}(G;p,q)$, is the smallest span among all integer labellings of V(G) such that vertices at distance two receive labels which differ by at least q and adjacent vertices receive labels which differ by at least p. Van den Heuvel and McGuinness have proved that ${\lambda}(G;p,q){\leq}(4q-2){\Delta}+10p+38q-24$ for any planar graph G with maximum degree ${\Delta}$. In this paper, we studied the upper bound of ${\lambda}_{p,q}$-number of some planar graphs. It is proved that ${\lambda}(G;p,q){\leq}(2q-1){\Delta}+2(2p-1)$ if G is an outerplanar graph and ${\lambda}(G;p,q){\leq}(2q-1){\Delta}+6p-4q-1$ if G is a Halin graph.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.621-638
• /
• 2009

The linear system Ax = b will have (i) no solution, (ii) only one non-trivial (trivial) solution, or (iii) infinity of solutions. Our focus will be on cases (ii) and (iii). The mathematical models of many real-world problems give rise to (a) ill-conditioned linear systems, (b) singular linear systems (A is singular with all its linearly independent rows are sufficiently linearly independent), or (c) ill-conditioned singular linear systems (A is singular with some or all of its strictly linearly independent rows are near-linearly dependent). This article highlights the scope and need of a randomized algorithm for ill-conditioned/singular systems when a reasonably narrow domain of a solution vector is specified. Further, it stresses that with the increasing computing power, the importance of randomized algorithms is also increasing. It also points out that, for many optimization linear/nonlinear problems, randomized algorithms are increasingly dominating the deterministic approaches and, for some problems such as the traveling salesman problem, randomized algorithms are the only alternatives.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.703-714
• /
• 2009

GPS is especially suitable for location systems in flat areas, but the availability of GPS is limited in highly urbanized and mountain areas, due to the nature of satellite communications. Dead reckoning is generally used to solve a location problem when a pedestrian is out of range of GPS coverage. To extend the apparent coverage of the GPS system for a hiker in mountain areas, we propose an integrated 3D location system that interpolates a 3D dead reckoning system based on information about contour lines. The speeds of hikers vary according to the inclination of the ground in sloped areas such as mountains. To reduce location measurement errors, we determine the angle of inclination based on the contour lines of the mountain, and use the speeds based on the inclination in the location system. The simulation results show that the proposed system is more accurate than the existing location system.

• 에너지공학
• /
• 제17권4호
• /
• pp.233-240
• /
• 2008

최근 새로운 2계 자기 수반형(self-adjoint) 중성자 수송 방정식으로 기존의 우성 및 기성 수송 방정식 외에 SAAF(Self-Adjoint Angular Flux) 수송 방정식이 소개되어, 이에 대한 적절한 경계조건, 수치해법, 정확도 등에 관한 논의가 활발히 진행되고 있다. 본 연구에서는 SAAF 수송 방정식의 수학적, 물리적 의미를 고찰하고 기존의 우성 및 기성 수송 방정식과의 연관성을 명확히 하였으며, Boltzmann 수송 방정식의 1계 차분식에서 2계의 SAAF 수송 방정식의 차분식을 유도하는 방법을 확산 가속법(diffusion synthetic acceleration method)과 함께 소개하였다. 유도된 SAAF 차분법이 계산 효율성과 수송해의 정확도를 증가시킴을 수치결과로 확인하였다.