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

검색결과 3,971건 처리시간 0.027초

On Special finsler Spaces With Common Geodesics

  • Kim, Byung-Doo;Park, Ha-Yong
    • 대한수학회논문집
    • /
    • 제15권2호
    • /
    • pp.331-338
    • /
    • 2000
  • In the present paper, we investigate a problem in a sym-metric Finsler space, which is a special space. First we prove that if a symmetric space remains to be a symmetric one under the Z-projective change, then the space is of zero curvature. Further we will study W-recurrent space and D-recurrent space under the pro-jective change.

  • PDF

Accelerated Tseng's Technique to Solve Cayley Inclusion Problem in Hilbert Spaces

  • Shamshad, Husain;Uqba, Rafat
    • Kyungpook Mathematical Journal
    • /
    • 제62권4호
    • /
    • pp.673-687
    • /
    • 2022
  • In this study, we solve the Cayley inclusion problem and the fixed point problem in real Hilbert space using Tseng's technique with inertial extrapolation in order to obtain more efficient results. We provide a strong convergence theorem to approximate a common solution to the Cayley inclusion problem and the fixed point problem under some appropriate assumptions. Finally, we present a numerical example that satisfies the problem and shows the computational performance of our suggested technique.

접미사 배열 생성 과정에서 구간 최소간 위치를 상수 시간에 찾기 위한 효율적인 자료구조 (An Efficient Data Structure to Obtain Range Minima in Constant Time in Constructing Suffix Arrays)

  • 박희진
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제31권3_4호
    • /
    • pp.145-151
    • /
    • 2004
  • 본 논문에서는 배열에서 구간 최소값 위치를 상수 시간에 찾기 위한 효율적인 자료구조를 제시한다. 최근의 생물 정보학 분야에서 빠른 DNA 서열의 검색을 위해 접미사 배열이 많이 사용되고 있는데 이 접미사 배열을 생성하는 문제는 구간 최소값 위치 문제를 포함하고 있다. 이 접미사 배열을 생성할 때는 구간 최소값 위치 문제를 빠르게 푸는 것뿐만 아니라 공간 효율적으로 해결하는 것도 중요하다. 그 이유는 DNA 서열이 수백만 개에서 수십 억 개의 염기를 가진 굉장히 큰 데이타이기 때문이다. 배열의 구간 최소간 위치를 상수 시간에 찾기 위해 지금까지 알려진 가장 효율적인 자료구조는 배열의 구간 최소값 문제를 Cartesian 트리에서의 LCA(Lowest Common Ancestor) 문제로 바꾸고 이 트리에서의 LCA 문제를 다시 특수한 배열에서의 구간 최소값 문제로 바꾸어 푸는 방법을 이용한 자료구조이다. 이 자료구조는 이론적으로 O(n) 공간을 사용하여 O(n) 시간에 생성된다. 하지만 이 자료구조는 배열의 구간 최소값 문제를 두 번에 걸쳐 다른 문제로 변환하는 과정을 포함하고 있기 때문에 실제로 사용되는 공간은 상당히 큰 13n이며 또한 많은 시간이 요구된다. 본 논문에서 제시하는 자료구조는 배열의 구간 최소값 문제를 다른 문제로 변환하지 않고 직접 구하는 자료구조이다. 따라서 이론적으로 O(n) 공간을 차지하며 O(n) 시간에 생성될 뿐만 아니라 실제적으로도 5n의 적은 공간을 사용하며 빠른 시간에 생성된다.

VLBI상관서브시스템 시작품의 개발에 관한 연구 (A STUDY ON DEVELOPMENT OF VLBI CORRELATION SUBSYSTEM TRIAL PRODUCT)

  • 오세진;노덕규;염재환;정현수;이창훈
    • 천문학논총
    • /
    • 제24권1호
    • /
    • pp.65-81
    • /
    • 2009
  • We present the performance test results of VLBI Correlation Subsystem (VCS) trial product which was being developed for 1 year from August 2007. It is a core component of Korea-Japan Joint VLBI Correlator (KJJVC). The aim for developing VCS trial product is to improve the performance of VCS main product to reduce the efforts and cost, and to solve the design problems by performing the preliminary test of the manufactured trial product. The function of VCS trial product is that it is able to process the 2 stations-1 baseline, 8 Gbps/station speed, 1.2 Gbps output speed with FX-type. VCS trial product consists of Read Data Control Board (RDC), Fourier Transform Board (FTB), and Correlation and Accumulation Board (CAB). Almost main functions are integrated in the FTB and CAB board. In order to confirm the performance of VCS trial product functions, the spectral analysis, delay compensation and correlation processing experiments were carried out by using simulation and real observation data. We found that the overflow problem of re-quantization after FFT processing was occurred in the delay compensation experiment. We confirmed that this problem was caused by valid bit-expression of the re-quantized data. To solve this problem, the novel method will be applied to VCS main product. The effectiveness of VCS trial product has been verified through the preliminary experimental results, but the overflow problem was occurred.

메타버스에서의 참여형 PBL 수업 설계 (A Design of Participative Problem Based Learning (PBL) Class in Metaverse)

  • 이승호
    • 실천공학교육논문지
    • /
    • 제14권1호
    • /
    • pp.91-97
    • /
    • 2022
  • 핵심적인 미래역량(비판적 사고, 의사소통, 협업, 창의성) 개발을 위한 대표적인 교육방법으로 문제중심 학습법(PBL, problem based learning)이 주목받으며 대학에서의 적용이 확산되고 있다. PBL 수업의 중요한 특징 두 가지는 '팀원들과의 협업'과 '상호작용에 기반한 참여형, 자기주도적 학습'이다. 최근 코로나19 팬데믹이 장기화 됨에 따라 비대면 원격수업이 대학교육에서 임시방편이 아닌 필수요소가 되었고, 시공간 제약에 의해 앞서 언급한 두 가지 특징을 충족시키기 어렵다는 한계점에 부딪혔다. 본 논문에서는 기존에 H대학에서 비대면으로 운영했던 PBL 강좌 사례에 대한 한계점을 분석하고, 메타버스 가상공간에서 이루어지는 개선된 PBL 수업 방식을 상세하게 설계하였다. 제안하는 메타버스 활용 PBL 수업에서는 팀에서 진행한 연구 내용들을 담은 자료(이미지, pdf, 동영상 파일 등)를 3차원 가상공간에 갤러리 형태로 자유롭게 꾸미고 전시할 수 있어서 팀원들의 적극적인 참여를 유도할 수 있다. 또한 갤러리를 팀원들의 프로젝트 협업 공간으로 활용할 수도 있고, 최종 프리젠테이션 장소로 활용할 수도 있다. 이 수업 방식은 가능한 빠른 시일 내에 동일 PBL 수업에 적용하여 효과성을 분석하고 개선점을 도출할 것이다.

Dynamic Action Space Handling Method for Reinforcement Learning Models

  • Woo, Sangchul;Sung, Yunsick
    • Journal of Information Processing Systems
    • /
    • 제16권5호
    • /
    • pp.1223-1230
    • /
    • 2020
  • Recently, extensive studies have been conducted to apply deep learning to reinforcement learning to solve the state-space problem. If the state-space problem was solved, reinforcement learning would become applicable in various fields. For example, users can utilize dance-tutorial systems to learn how to dance by watching and imitating a virtual instructor. The instructor can perform the optimal dance to the music, to which reinforcement learning is applied. In this study, we propose a method of reinforcement learning in which the action space is dynamically adjusted. Because actions that are not performed or are unlikely to be optimal are not learned, and the state space is not allocated, the learning time can be shortened, and the state space can be reduced. In an experiment, the proposed method shows results similar to those of traditional Q-learning even when the state space of the proposed method is reduced to approximately 0.33% of that of Q-learning. Consequently, the proposed method reduces the cost and time required for learning. Traditional Q-learning requires 6 million state spaces for learning 100,000 times. In contrast, the proposed method requires only 20,000 state spaces. A higher winning rate can be achieved in a shorter period of time by retrieving 20,000 state spaces instead of 6 million.

대학생의 우주 교육을 위한 라즈베리 파이 기반 캔위성 수업자료 개발과 적용 (Development of CanSat Instruction Materials using Raspberry Pi for Space Education in University and Its Application)

  • 유승훈;이상현;이상구;이영건
    • 공학교육연구
    • /
    • 제26권1호
    • /
    • pp.3-11
    • /
    • 2023
  • The purpose of this study is to develop Raspberry Pi-based CanSat instruction materials for liberal arts classes to be used in university space education. The educational satellite simulation program is developed by applying the ADDIE program consisting of analysis, design, development, execution, and evaluation of 15 lessons per semester. The usefulness of the instruction materials is evaluated by a validity test of a total of 6 experts. The proposed materials are applied to 100 college students from various majors. To analyze the impact on creative problem-solving ability, a questionnaire is conducted before and after class, and as a result, it is confirmed that there is a significant improvement in all areas after class. The class satisfaction survey is conducted for a total of 10 questions, and the average score is 4.41 out of 5, which is high. In conclusion, the proposed instruction materials make it possible to achieve successful space education using Raspberry Pi and improve creative problem-solving ability in universities.

예산과 공간 제약하에서 크랭크샤프트 생산라인의 생산능력 증대를 위한 시뮬레이션 기반의 연구 (A Simulation Based Study on Increasing Production Capacity in a Crankshaft Line Considering Limited Budget and Space)

  • 왕관;송수;신양우;문덕희
    • 대한산업공학회지
    • /
    • 제40권5호
    • /
    • pp.481-491
    • /
    • 2014
  • In this paper, we discussed a problem for improving the throughput of a crankshaft manufacturing line in an automotive factory in which the budget for purchasing new machines and installing additional buffers is limited. We also considered the constraint of available space for both of machine and buffer. Although this problem seems like a kind of buffer allocation problem, it is different from buffer allocation problem because additional machines are also considered. Thus, it is not easy to calculate the throughput by mathematical model, and therefore simulation model was developed using $ARENA^{(R)}$ for estimating throughput. To determine the investment plan, a modified Arrow Assignment Rule under some constraints was suggested and it was applied to the real case.

단원형배열안테나와 공간분할테이블을 이용한 방향탐지 및 추적 (Direction Finding and Tracking using Single-Ring Circular Array Antenna and Space Division Table)

  • 박현규;우대웅;김재식;박진성
    • 한국군사과학기술학회지
    • /
    • 제25권2호
    • /
    • pp.117-124
    • /
    • 2022
  • Single-ring circular array antennas can be applied to direction finding systems in order to use nose-section in other purposes, and the interferometry is a proper direction finding method to those systems. We usually make the interferometer baseline long enough to achieve good angular accuracy. However, an interferometer with baseline longer than a half-wavelength has the ambiguity problem. In this paper, we present a novel method for solving the ambiguity problem in interferometry systems. This technique is based on the amplitude comparison method and the space division table, and it can place a target within the angular region in which the ambiguity problem does not occur by roughly estimating direction-of-arrival. The Monte Carlo simulation results show that proposed method can effectively remove the ambiguity problem in the system.

트리즈의 물리적 모순에 대한 모순해결 나비모형의 모순관계와 해결차원 분류 (Classification of Contradiction Relations and their Solving Dimensions based on the Butterfly Model for Contradiction Solving for Physical Contradiction of TRIZ)

  • 현정석;박찬정
    • 지식경영연구
    • /
    • 제15권4호
    • /
    • pp.15-34
    • /
    • 2014
  • Creative problem solving has become an important issue in many fields. Among problems, dilemma need creative solutions. New creative and innovative problem solving strategies are required to handle the contradiction relations of the dilemma problems because most creative and innovative cases solved contradictions inherent in the dilemmas. Among various kinds of problem solving theories, TRIZ provides the concept of physical contradiction as a common problem solving principle in inventions and patents. In TRIZ, 4 separation principles solve the physical contradictions of given problems. The 4 separation principles are separation in time, separation in space, separation within a whole and its parts, and separation upon conditions. Despite this attention, an accurate definitions of the separation principles of TRIZ is missing from the literature. Thus, there have been several different interpretations about the separation principles of TRIZ. The different interpretations make problems more ambiguous to solve when the problem solvers apply the 4 separation principles. This research aims to fill the gap in several ways. First, this paper classify the types of contradiction relations and the contradiction solving dimensions based on the Butterfly model for contradiction solving. Second, this paper compares and analyzes each contradiction relation type with the Butterfly diagram. The contributions of this paper lies in reducing the problem space by recognizing the structures and the types of contradiction problems exactly.