• Title/Summary/Keyword: Problem Space

Search Result 3,971, Processing Time 0.031 seconds

SOLVABILITY FOR THE PARABOLIC PROBLEM WITH JUMPING NONLINEARITY CROSSING NO EIGENVALUES

  • Jung, Tacksun;Choi, Q-Heung
    • Korean Journal of Mathematics
    • /
    • v.16 no.4
    • /
    • pp.545-551
    • /
    • 2008
  • We investigate the multiple solutions for a parabolic boundary value problem with jumping nonlinearity crossing no eigenvalues. We show the existence of the unique solution of the parabolic problem with Dirichlet boundary condition and periodic condition when jumping nonlinearity does not cross eigenvalues of the Laplace operator $-{\Delta}$. We prove this result by investigating the Lipschitz constant of the inverse compact operator of $D_t-{\Delta}$ and applying the contraction mapping principle.

  • PDF

AN ITERATIVE METHOD FOR SOLVING EQUILIBRIUM PROBLEM FIXED POINT PROBLEM AND GENERALIZED VARIATIONAL INEQUALITIES PROBLEM

  • Zhang, Lijuan;Li, Juchun
    • East Asian mathematical journal
    • /
    • v.27 no.5
    • /
    • pp.527-538
    • /
    • 2011
  • In this paper, we introduce a new iterative scheme for finding a common element of the set of an equilibrium problem, the set of fixed points of nonexpansive mapping and the set of solutions of the generalized variational inequality for ${\alpha}$-inverse strongly g-monotone mapping in a Hilbert space. Under suitable conditions, strong convergence theorems for approximating a common element of the above three sets are obtained.

Fast Construction of Three Dimensional Steiner Minimum Tree Using PTAS (PTAS를 이용한 3차원 스타이너 최소트리의 신속한 구성)

  • Kim, In-Bum
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.7
    • /
    • pp.87-95
    • /
    • 2012
  • In this paper, PTAS three-dimensional Steiner minimum tree connecting numerous input nodes rapidly in 3D space is proposed. Steiner minimum tree problem belongs to NP problem domain, and when properly devised heuristic introduces, it is generally superior to other algorithms as minimum spanning tree affiliated with P problem domain. But when the number of input nodes is very large, the problem requires excessive execution time. In this paper, a method using PTAS is proposed to solve the difficulty. In experiments for 70,000 input nodes in 3D space, the tree produced by the proposed 8 space partitioned PTAS method reduced 86.88% execution time, compared with the tree by naive 3D steiner minimum tree method, though increased 0.81% tree length. This affirms the proposed method can work well for applications that many nodes of three dimensions are need to connect swifty, enduring slight increase of tree length.

A study on the characteristic of problem solving process in the architectural design process (건축디자인과정에서 문제해결의 특성에 관한 연구)

  • Kim, Yong-Il;Han, Jae-Su
    • Journal of The Korean Digital Architecture Interior Association
    • /
    • v.11 no.3
    • /
    • pp.53-59
    • /
    • 2011
  • In creative design, it is necessary to understand the characteristic of architectural design. In the world of design problem, a distinction can be made between those that are well-defined and those that are ill-defined. Well-defined problems are those for which the ends or goal, are already prescribed and apparent, their solution requires the provision of appropriate means. For ill-defined problems, on the other hand, both the ends and the means of solution are unknown at the outset of the problem solving exercise, at least in their entirety. Most of design problems is ill-defined, which is unknown at the beginning of the problem solving exercise. In order to solve the design problem, Designers take advantage of the search methods of problem space, such as global-search-methods(depth-first-methods, breath-first-methods), local-search-methods(generate and test, heuristics, hill-climbing, reasoning) and visual thinking, which is represented through sketching. Sketching is a real part of design reasoning and it does so through a special kind of visual imagery. Also in the design problem solving it have been an important means of problem exploration and solution generation. By sketching, they represent images held in the mind as well as makes graphic images which help generate mental images of entity that is being designed. The search methods of problem space and a visual thinking have been crucially considered in the architectural design. The purpose of this paper is to explore the property of design by means of the pre-existed-experiment data and literature research. The findings will help design the architectural design for more creative results.

An Analysis of the Characteristics on the Middle School Students' Thinking Processes in Solving Physics Problems (물리문제(物理問題) 해결과정(解決過程)에서 중학생(中學生)들의 사고과정(思考過程)의 특성(特性) 분석(分析))

  • Park, Hac-Kyoo;Lee, Yong-Hyun
    • Journal of The Korean Association For Science Education
    • /
    • v.13 no.1
    • /
    • pp.31-47
    • /
    • 1993
  • This study was intended to find the characteristics of the middle school students' thinking processes and problem spaces when they solved the physics problems. Ten ninth grade students in Chon-Buk Do, Korea were participated in this study. The researcher investigated their thinking processes in solving 5 physics problems on electric circuit. "Thinking aloud" method was used as a research method. The students' thinking processes were recorded using an audio tape recorder and transfered into protocols. The protocols were analyzed by problem solving process coding system which was developed by Lee(1987) on the basis of Larkin's problem solving process model. The results are as follows : (1) On the average 2.85 items were solved among 5 test items, and only one person could solve all of the items correctly. (2) Problems were solved in sequence of understanding the problem, planning, carrying out the plan, and evaluating steps regardless of the problem difficulty. (3) In regard to the thinking process steps, there was no difference between the good solvers and the poor ones. But in the detail performance of problem solving, the former was different from the latter in respect with using the design of general solving procedure. (4) The basic problem spaces by the item analysis were divided into two classes. One was the problem space by using Qualitative approach in problem solving, and the other was one by using Quantitative approach. As novices in physics problem solving, most of the students used the problem space by using the Quantitative approach.

  • PDF

A Study of Residents' Demand for External Space of Apartment Site (아파트 외부공간 실태와 조성기법)

  • 김한수
    • Journal of the Korean housing association
    • /
    • v.11 no.3
    • /
    • pp.87-98
    • /
    • 2000
  • This study derives problems of external space utilization site from on-site observation and questionnaire survey in order to suggest solutions for the problems. The main results are follows. First, fences as visual boundaries of apartment site play some negative roles - separation of space and heterogeneity of circumstance. This study suggests green fences to cure this problem. Second, residents want to change space use - ground to be used as green space or space for relaxation in stead of parking lots, elevator hall as social space, and underground as bike parks or health centers. Third, rooftop space, used as empty space or machine storage space, should be designed to be utilized as relaxation space by making easy to enter and exit.

  • PDF

Study on High-Density Library Storage as a Solution to the Space Shortage Problem - A Case Study of Rice University Library Service Center - (도서관의 공간문제 해결을 위한 고밀도 장서고에 관한 연구 -Rice University Library Service Center의 사례를 중심으로-)

  • Ahn, Joon-Suk
    • Journal of the Korean Institute of Educational Facilities
    • /
    • v.17 no.6
    • /
    • pp.23-30
    • /
    • 2010
  • Because the effort to solve space shortage in academic libraries has never been successful, the rapid development of digital technology is being considered as a panacea to revolutionize analog libraries and to open a new era for digital libraries. However, this technology is yet to be perfected. Even with the use of digital technology, we are currently still looking for more space to accommodate newly printed materials and at the same time store valuable resources that are seldomly used. In 1985, Harvard adopted the industrial high-density shelving system into their library. No other retrieving system has proven to be more successful as the Harvard model. Presently, more than 50 colleges have built over 70 high-density library storage facilities. Rice University Library Service Center (RLSC) can be examined as an example of the Harvard-model. This paper will focus on assessing the operating system and architectural requirements of the RLSC which may allow for a more efficient, economical, and fundamental resolution to the library space shortage problem.

State Space Exploration of Concurrent Systems with Minimal Visit History (최소방문 기록을 이용한 병행 시스템의 상태 공간 순회 기법)

  • Lee, Jung-Sun;Choi, Yun-Ja;Lee, Woo-Jin
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.9
    • /
    • pp.669-675
    • /
    • 2010
  • For detecting requirement errors in early system development phase, the behaviors of a system should be described in formal methods and be analyzed with analysis techniques such as reachability analysis and cycle detection. However, since they are usually based on explicit exploration of system state space, state explosion problem may be occurred when a system becomes complex. That is, the memory and execution time for exploration exponentially increase due to a huge state space. In this paper, we analyze the fundamental causes of this problem in concurrent systems and explore the state space without composing concurrent state spaces for reducing the memory requirement for exploration. Also our new technique keeps a visited history minimally for reducing execution time. Finally we represent experimental results which show the efficiency of our technique.

Frozen Orbits Construction for a Lunar Solar Sail

  • Khattab, Elamira Hend;Radwan, Mohamed;Rahoma, Walid Ali
    • Journal of Astronomy and Space Sciences
    • /
    • v.37 no.1
    • /
    • pp.1-9
    • /
    • 2020
  • Frozen orbit is an attractive option for orbital design owing to its characteristics (its argument of pericenter and eccentricity are kept constant on an average). Solar sails are attractive solutions for massive and expensive missions. However, the solar radiation pressure effect represents an additional force on the solar sail that may greatly affect its orbital behavior in the long run. Thus, this force must be included as a perturbation force in the dynamical model for more accuracy. This study shows the calculations of initial conditions for a lunar solar sail frozen orbit. The disturbing function of the problem was developed to include the lunar gravitational field that is characterized by uneven mass distribution, third body perturbation, and the effect of solar radiation. An averaging technique was used to reduce the dynamical problem to a long period system. Lagrange planetary equations were utilized to formulate the rate of change of the argument of pericenter and eccentricity. Using the reduced system, frozen orbits for the Moon sail orbiter were constructed. The resulting frozen orbits are shown by two 3Dsurface (semi-major, eccentricity, inclination) figures. To simplify the analysis, we showed inclination-eccentricity contours for different values of semi-major axis, argument of pericenter, and values of sail lightness number.

Design of Space Search-Optimized Polynomial Neural Networks with the Aid of Ranking Selection and L2-norm Regularization

  • Wang, Dan;Oh, Sung-Kwun;Kim, Eun-Hu
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.4
    • /
    • pp.1724-1731
    • /
    • 2018
  • The conventional polynomial neural network (PNN) is a classical flexible neural structure and self-organizing network, however it is not free from the limitation of overfitting problem. In this study, we propose a space search-optimized polynomial neural network (ssPNN) structure to alleviate this problem. Ranking selection is realized by means of ranking selection-based performance index (RS_PI) which is combined with conventional performance index (PI) and coefficients based performance index (CPI) (viz. the sum of squared coefficient). Unlike the conventional PNN, L2-norm regularization method for estimating the polynomial coefficients is also used when designing the ssPNN. Furthermore, space search optimization (SSO) is exploited here to optimize the parameters of ssPNN (viz. the number of input variables, which variables will be selected as input variables, and the type of polynomial). Experimental results show that the proposed ranking selection-based polynomial neural network gives rise to better performance in comparison with the neuron fuzzy models reported in the literatures.