• 제목/요약/키워드: Space Programming

검색결과 433건 처리시간 0.024초

노인전문병원의 병동부문 공간구성에 관한 연구 (A study on the Spacial Composition for Ward in Geriatric Hospital)

  • 윤성중;이특구
    • 의료ㆍ복지 건축 : 한국의료복지건축학회 논문집
    • /
    • 제7권2호
    • /
    • pp.59-69
    • /
    • 2001
  • The purpose of this study is to provide a basic data for architectural planning on the wards and special quality of physical remedy spaces of geriatrics hospital. This research, to analyse dependency degree of inpatients in geriatric hospital, shows relativeness between remedy space and wards, and to show behavior of each patients reaction to there space. Result of interviewed inpatients who were sorted by age, sex, dependency degree, and days in hospital, suitable space programming is to need for physical and mental state. On the bases of survey and analysis, the basic data for planning and design the hospital for the elderly with dementia has been proposed.

  • PDF

Research and development of haptic simulator for Dental education using Virtual reality and User motion

  • Lee, Sang-Hyun
    • International journal of advanced smart convergence
    • /
    • 제7권4호
    • /
    • pp.114-120
    • /
    • 2018
  • The purpose of this paper is to develop simulations that can be used for virtual education in dentistry. This development goal is to allow dental students to learn the necessary surgical techniques at the point of their choice, not going into the operating room, away from time, space, and physical limits. In this paper configuration, the optimization method is applied convergent, and when the operation of the VR contents is performed, the content data is extracted from the interaction analysis formed in the VR engine, and the data is processed by the content algorithm. It also computes events and dental operations generated within the 3D engine programming and generates corresponding events through data processing according to the input signal. The visualization information is output to the HMD using the rendering information. In addition, the operating room environment was constructed by studying lighting and material for actual operating room environment. We applied the ratio of actual space to virtual space and the ratio between character and actual person to create a spatial composition at a similar rate to actual space.

공간 분할 방법을 이용한 최적 서열정렬 알고리즘 (Optimal Sequence Alignment Algorithm Using Space Division Technique)

  • 안희국;노희영
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제34권5호
    • /
    • pp.397-406
    • /
    • 2007
  • 두 서열 A와 B간의 최적정렬을 찾는 문제는 동적프로그래밍 알고리즘을 사용하여 효과적으로 해결 될 수 있다. 하지만, 길이가 각각 m, n인 두 서열, $S_1$, $S_2$를 정렬하기 위해서는 O(m*n)의 시간과 공간 복잡도를 갖기 때문에 서열의 길이가 길어질 경우에는 시간과 공간 비용 문제로 인해 적용 할 수 없게 된다. 실제 계산상에 제한요소로 작용하는 공간비용 문제를 해결하기 위해 Hirschberg에 의해 제시된 선형공간 알고리즘은 이 문제를 O(n*m)의 시간복잡도와 O(n+m)의 공간복잡도로서 해결하였다. 컴퓨터 기술의 발전으로 CPU의 처리속도가 향상되고, 사용가능한 주기억장치의 공간이 확대됨에 따라, 기억공간은 더 사용하더라도 처리속도는 높일 수 있는 방법이 필요하다. 이를 위해, 본 논문에서는 공간 분할 방법을 통하여 공간 소모는 선형공간 알고리즘보다 많지만, 처리 속도는 빠른 O(n*m)의 시간과 O(n+m)의 공간비용을 갖는 알고리즘을 제안한다. 또한 분할 시 서열의 길이변화에 따른 분할 수(d) 문제를 일반화하고, 입/출구 노드 개념을 이용하여 불필요한 연산을 제거하였다. 선형공간 알고리즘이 (m+n)의 공간으로 2*m*n에 가까운 속도를 갖는데 비해, 본 알고리즘은 (m+n)*d의 공간으로 m*n에 가까운 결과를 보임을 증명과 실험결과로부터 확인한다.

The Allocation of Inspection Efforts Using a Knowledge Based System

  • Kang, Kyong-sik;Stylianides, Christodoulos;La, Seung-houn
    • 품질경영학회지
    • /
    • 제18권2호
    • /
    • pp.18-24
    • /
    • 1990
  • The location of inspection stations is a significant component of production systems. In this paper, a prototype expert system is designed for deciding the optimal location of inspection stations. The production system is defined as a single channel of n serial operation stations. The potential inspection station can be located after any of the operation stations. Nonconforming units are generated from a compound binomial distribution with known parameters at any given operation station. Traditionally Dynamic programming, Zero-one integer programming, or Non-linear programming techniques are used to solve this problem. However a problem with these techniques is that the computation time becomes prohibitively large when t be number of potential inspection stations are fifteen or more. An expert system has the potential to solve this problem using a rule-based system to determine the near optimal location of inspection stations. This prototype expert system is divided into a static database, a dynamic database and a knowledge base. Based on defined production systems, the sophisticated rules are generated by the simulator as a part of the knowledge base. A generate-and-test inference mechanism is utilized to search the solution space by applying appropriate symbolic and quantitative rules based on input data. The goal of the system is to determine the location of inspection stations while minimizing total cost.

  • PDF

산업 현장의 안전거리 계측을 위한 동적 계획 신경회로망 (A Dynamic Programming Neural Network to find the Safety Distance of Industrial Field)

  • 김종만;김원섭;김영민;황종선;박현철
    • 한국전기전자재료학회:학술대회논문집
    • /
    • 한국전기전자재료학회 2001년도 기술교육위원회 창립총회 및 학술대회 의료기기전시회
    • /
    • pp.23-27
    • /
    • 2001
  • Making the safety situation from the various work system is very important in the industrial fields. The proposed neural network technique is the real titre computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objests during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of obejects. All of them request much memory space and titre. Therefore the most reliable neural-network algorithm is drived for real time recognition of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques. And the real time reconstruction of nonlinear image information is processed through several simulations. I-D LIPN hardware has been composed, and the real time reconstruction is verified through the various experiments.

  • PDF

Optimal Controller Design of One Link Inverted Pendulum Using Dynamic Programming and Discrete Cosine Transform

  • Kim, Namryul;Lee, Bumjoo
    • Journal of Electrical Engineering and Technology
    • /
    • 제13권5호
    • /
    • pp.2074-2079
    • /
    • 2018
  • Global state space's optimal policy is used for offline controller in the form of table by using Dynamic Programming. If an optimal policy table has a large amount of control data, it is difficult to use the system in a low capacity system. To resolve these problem, controller using the compressed optimal policy table is proposed in this paper. A DCT is used for compression method and the cosine function is used as a basis. The size of cosine function decreased as the frequency increased. In other words, an essential information which is used for restoration is concentrated in the low frequency band and a value of small size that belong to a high frequency band could be discarded by quantization because high frequency's information doesn't have a big effect on restoration. Therefore, memory could be largely reduced by removing the information. The compressed output is stored in memory of embedded system in offline and optimal control input which correspond to state of plant is computed by interpolation with Inverse DCT in online. To verify the performance of the proposed controller, computer simulation was accomplished with a one link inverted pendulum.

Multi-gene genetic programming for the prediction of the compressive strength of concrete mixtures

  • Ghahremani, Behzad;Rizzo, Piervincenzo
    • Computers and Concrete
    • /
    • 제30권3호
    • /
    • pp.225-236
    • /
    • 2022
  • In this article, Multi-Gene Genetic Programming (MGGP) is proposed for the estimation of the compressive strength of concrete. MGGP is known to be a powerful algorithm able to find a relationship between certain input space features and a desired output vector. With respect to most conventional machine learning algorithms, which are often used as "black boxes" that do not provide a mathematical formulation of the output-input relationship, MGGP is able to identify a closed-form formula for the input-output relationship. In the study presented in this article, MGPP was used to predict the compressive strength of plain concrete, concrete with fly ash, and concrete with furnace slag. A formula was extracted for each mixture and the performance and the accuracy of the predictions were compared to the results of Artificial Neural Network (ANN) and Extreme Learning Machine (ELM) algorithms, which are conventional and well-established machine learning techniques. The results of the study showed that MGGP can achieve a desirable performance, as the coefficients of determination for plain concrete, concrete with ash, and concrete with slag from the testing phase were equal to 0.928, 0.906, 0.890, respectively. In addition, it was found that MGGP outperforms ELM in all cases and its' accuracy is slightly less than ANN's accuracy. However, MGGP models are practical and easy-to-use since they extract closed-form formulas that may be implemented and used for the prediction of compressive strength.

Improved Dynamic Programming in Local Linear Approximation Based on a Template in a Lightweight ECG Signal-Processing Edge Device

  • Lee, Seungmin;Park, Daejin
    • Journal of Information Processing Systems
    • /
    • 제18권1호
    • /
    • pp.97-114
    • /
    • 2022
  • Interest is increasing in electrocardiogram (ECG) signal analysis for embedded devices, creating the need to develop an algorithm suitable for a low-power, low-memory embedded device. Linear approximation of the ECG signal facilitates the detection of fiducial points by expressing the signal as a small number of vertices. However, dynamic programming, a global optimization method used for linear approximation, has the disadvantage of high complexity using memoization. In this paper, the calculation area and memory usage are improved using a linear approximated template. The proposed algorithm reduces the calculation area required for dynamic programming through local optimization around the vertices of the template. In addition, it minimizes the storage space required by expressing the time information using the error from the vertices of the template, which is more compact than the time difference between vertices. When the length of the signal is L, the number of vertices is N, and the margin tolerance is M, the spatial complexity improves from O(NL) to O(NM). In our experiment, the linear approximation processing time was 12.45 times faster, from 18.18 ms to 1.46 ms on average, for each beat. The quality distribution of the percentage root mean square difference confirms that the proposed algorithm is a stable approximation.

과학고등학교 공간계획에 관한 연구 (A Study on the Space Planning for Science High Schools)

  • 조한희;이화룡
    • 교육시설 논문지
    • /
    • 제18권6호
    • /
    • pp.3-14
    • /
    • 2011
  • This research aims at proposing the space planning and architectural guideline required in designing the Science High School. It investigates specific features of the science high school which are distinguished from the general high school and analyses the compositional figure of teachers and students, the teaching methods and its educational curriculum, especially the revised educational curriculum in 2009. Meanwhile, it explores the administrative systems and facilities of the existing science high schools through both the document survey and on-the-spot interview. Such endeavor results in proposing the space classification, the space composition methods and a classroom managing system, which would be suited to the science high school. Finally it presents the architectural guidelines for planning the special subject learning area that is composed of a special subject classroom, a specified lab, medial space, a project and research room and teacher's room. The result of this study could be the fundamental resources for programming the special purposed high school as well as the science high school building.

  • PDF

전문교과 교육과정에 대응하기 위한 공업계고등학교 공간규모 산정에 관한 연구 (An Estimating Space Program of Technical High School for Future Educational Curriculum)

  • 이상민
    • 교육녹색환경연구
    • /
    • 제7권2호
    • /
    • pp.12-29
    • /
    • 2008
  • The problem should be approached in terms of recovering essential functions of technical high school and identification to supply stable and quality human resources in technical sector. An adequate space programming for technical high school is needed to educate effective skills and techniques. Considering the education directions of vocational high school, the article covers principals of technical school's construction plan and directions and, based on this, suggest the way of estimating the scale in construction plan of technical school. Through this research, systematic and reasonable space planning can be possible. The range of this research is based on development directions of society and education and an objective standard in a newly reformed the 7th Stage of Education. In addition, the research is limited to technical high school among kinds of vocational high school. The purpose is to redefine the role of technical school that face identification crisis currently, comparing to the past, and to suggest a more effective space planning. The research limits the space to classes for specialized subjects, a core space for education in technical school among diverse spaces.

  • PDF