• Title/Summary/Keyword: Number of Solutions

Search Result 1,913, Processing Time 0.034 seconds

A Study on Operation Planning of Childcare Centers to Improve the Quality of Childcare Service (보육서비스 품질 개선을 위한 어린이집 운영계획 수립에 관한 연구)

  • Song, Seung-Min;Kim, Taeho
    • Journal of Korean Society for Quality Management
    • /
    • v.41 no.3
    • /
    • pp.371-380
    • /
    • 2013
  • Purpose: This study analyzes the optimal operation scheme of childcare centers in Korea to maximize the quality of childcare service by determining the number of children and number of teachers. Methods: This study employs a mathematical programming methodology called 'nonlinear integer programming (NLIP)' to solve the optimization problems and compare the quality of childcare service of optimal solutions with those of present operation scheme. Results: It is very successful in obtaining the optimal solutions for alternative capacities and they guarantee the substantial improvement in the quality of childcare service. Conclusion: Though more variables should be adapted for defining the quality of childcare service robustly, it is possible to conclude that childcare centers should modify their operation scheme to improve the quality of childcare service.

Micro and macro in the dynamics of dilute polymer solutions: Convergence of theory with experiment

  • Prakash, J. Ravi
    • Korea-Australia Rheology Journal
    • /
    • v.21 no.4
    • /
    • pp.245-268
    • /
    • 2009
  • Recent developments in dilute polymer solution rheology are reviewed, and placed within the context of the general goals of predicting the complex flow of complex fluids. In particular, the interplay between the use of polymer kinetic theory and continuum mechanics to advance the microscopic and the macroscopic description, respectively, of dilute polymer solution rheology is delineated. The insight that can be gained into the origins of the high Weissenberg number problem through an analysis of the configurational changes undergone by a single molecule at various locations in the flow domain is discussed in the context of flow around a cylinder confined between flat plates. The significant role played by hydrodynamic interactions as the source of much of the richness of the observed rheological behaviour of dilute polymer solutions is highlighted, and the methods by which this phenomenon can be incorporated into a macroscopic description through the use of closure approximations and multi scale simulations is discussed.

Existence and Uniqueness of Solutions for the Semilinear Fuzzy Integrodifferential Equations with Nonlocal Conditions and Forcing Term with Memory

  • Kwun, Young-Chel;Park, Jong-Seo;Kim, Seon-Yu;Park, Jin-Han
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.6 no.4
    • /
    • pp.288-292
    • /
    • 2006
  • Many authors have studied several concepts of fuzzy systems. Balasubramaniam and Muralisankar (2004) proved the existence and uniqueness of fuzzy solutions for the semilinear fuzzy integrodifferential equation with nonlocal initial condition. Recently, Park, Park and Kwun (2006) find the sufficient condition of nonlocal controllability for the semilinear fuzzy integrodifferential equation with nonlocal initial condition. In this paper, we study the existence and uniqueness of solutions for the semilinear fuzzy integrodifferential equations with nonlocal condition and forcing term with memory in $E_{N}$ by using the concept of fuzzy number whose values are normal, convex, upper semicontinuous and compactly supported interval in $E_{N}$.

COUNTING FORMULA FOR SOLUTIONS OF DIAGONAL EQUATIONS

  • Moon, Young-Gu;Lee, June-Bok;Park, Young-Ho
    • Bulletin of the Korean Mathematical Society
    • /
    • v.37 no.4
    • /
    • pp.803-810
    • /
    • 2000
  • Let N($d_1,...,{\;}d_n;c_1,...,{\;}c_n$) be the number of solutions $(x_1,...,{\;}x_n){\in}F^{n}_p$ of the diagonal equation $c_lx_1^{d_1}+c_2x_2^{d_2}+{\cdots}+c_nx_n^{d_n}{\;}={\;}0{\;}n{\geq},{\;}c_j{\;}{\in}{\;}F^{*}_q,{\;}j=1,2,...,{\;}n$ where $d_j{\;}>{\;}1{\;}and{\;}d_j{\;}$\mid${\;}q{\;}-{\;}1$ for all j = 1,2,..., n. In this paper, we find all n-tuples ($d_1,...,{\;}d_n$) such that the reduced form of ($d_1,...,{\;}d_n$) and N($d_1,...,{\;}d_n;c_1,...,{\;}c_n$) are the same as in the theorem obtained by Sun Qi [3]. Improving this, we also get an explicit formula for the number of solutions of the diagonal equation, unver a certain natural restriction on the exponents.

  • PDF

Mathematics Teachers' Abstraction Levels and Multiple Approaches: The Case of Multiplicative and Divisibility Structure of Numbers

  • Unal, Hasan
    • Research in Mathematical Education
    • /
    • v.13 no.3
    • /
    • pp.197-216
    • /
    • 2009
  • The purpose of this study was to investigate middle and high school mathematics teachers' levels and multiple approaches in United States practicing their abstraction levels and, different strategies and method of solutions towards given number theory problems. The mathematics teachers taking part in this study are consisted of 25 members of online graduate and undergraduate course (MAE 5641 and MAE 4813) delivered through Online Learning System called as the Blackboard (http://www.blackboard.com). Data collection methods include journal entries, written solutions to problems, the teachers' reflections on said problems, and post interviews. Data analysis was done based on [Hazzan, O. & Zazkis, R. (2005). Reducing abstraction: The case of school mathematics. Educ. Stud. Math. 58(1), 101-119]. Analysis of students' written solutions revealed that transitions among the solution methods have major effect on abstraction levels. Elevation and reducing abstraction is a dynamic process.

  • PDF

Exact Algorithms of Transforming Continuous Solutions into Discrete Ones for Bit Loading Problems in Multicarrier Systems

  • Chung, Yong-Joo;Kim, Hu-Gon
    • Management Science and Financial Engineering
    • /
    • v.16 no.3
    • /
    • pp.71-84
    • /
    • 2010
  • In this study, we present the exact methods of transforming the continuous solutions into the discrete ones for two types of bit-loading problem, marginal adaptive (MA) and rate adaptive (RA) problem, in multicarrier communication systems. While the computational complexity of existing solution methods for discrete optimal solutions depends on the number of bits to be assigned (R), the proposed method determined by the number of subcarriers (N), making ours be more efficient in most cases where R is much larger than N. Furthermore our methods have some strength of their simpler form to make a practical use.

Stochastic Scheduling Problems for Maximizing the Expected Number of Early Jobs with Common or Exchangeable Due Dates

  • Choi, Jae Young;Kim, Heung-Kyu
    • Management Science and Financial Engineering
    • /
    • v.18 no.2
    • /
    • pp.5-11
    • /
    • 2012
  • In this paper, stochastic scheduling problems are considered when processing times and due dates follow arbitrary distributions and due dates are either common or exchangeable. For maximizing the expected number of early jobs, two policies, one, based on pairwise comparisons of the processing times, and the other, based on survivabilities, are introduced. In addition, it is shown that the former guarantees optimal solutions when the processing times and due dates are deterministic and that the latter guarantees optimal solutions when the due dates follow exponential distributions. Then a new approach, exploiting the two policies, is proposed and analyzed which turns out to give better job sequences in many situations. In fact, the new approach guarantees optimal solutions both when the processing times and due dates are deterministic and when the due dates follow exponential distributions.

An Optimization Approach to Routing and Wavelength Assignment in WDM All-Optical Mesh Networks without Wavelength Conversion

  • Lee, Kyung-Sik;Kang, Kug-Chang;Lee, Tae-Han;Park, Sung-Soo
    • ETRI Journal
    • /
    • v.24 no.2
    • /
    • pp.131-141
    • /
    • 2002
  • This paper considers a routing and wavelength assignment problem (RWAP) for the implementation of efficient Wavelength Division Multiplexing all-optical mesh networks without wavelength conversion. For a given physical network and required connections, the solution to the RWAP consists in how to select a suitable path and wavelength among the many possible choices for each connection so that no two paths using the same wavelength pass through the same link, while minimizing the number of required wavelengths. We introduce an integer programming formulation of the RWAP, which has an exponential number of variables, and propose an algorithm to solve it based on the column generation technique. The proposed algorithm can yield high quality solutions and tight lower bounds at the same time. Though the proposed algorithm cannot guarantee optimal solutions, computational results show that the algorithm yields provably good solutions within a reasonable time.

  • PDF

AN ACCELERATING SCHEME OF CONVERGENCE TO SOLVE FUZZY NON-LINEAR EQUATIONS

  • Jun, Younbae
    • The Pure and Applied Mathematics
    • /
    • v.24 no.1
    • /
    • pp.45-51
    • /
    • 2017
  • In this paper, we propose an accelerating scheme of convergence of numerical solutions of fuzzy non-linear equations. Numerical experiments show that the new method has significant acceleration of convergence of solutions of fuzzy non-linear equation. Three-dimensional graphical representation of fuzzy solutions is also provided as a reference of visual convergence of the solution sequence.

SYMMETRIC SURFACE WAVES OVER A BUMP

  • Choi, J.W.;An, Daniel;Lim, Chae-Ho;Park, Sang-Ro
    • Journal of the Korean Mathematical Society
    • /
    • v.40 no.6
    • /
    • pp.1051-1060
    • /
    • 2003
  • We study the surface waves of an incompressible fluid passing over a small bump. A forced KdV equation for surface wave is derived without assuming that flow is uniform at far upstream. New types of steady solutions are discovered numerically. Two new cut off values of Froude number are found, above the larger of which two symmetric solutions exist and under the smaller of which two different symmetric solutions exist.