• Title/Summary/Keyword: unit graph

Search Result 137, Processing Time 0.026 seconds

In the system of virtual studying, A consolidative scheme for learner's self-centered studying -for 4th grade mathematics in elementary school- (가상학습시스템에서 학습자의 자기주도적 학습을 위한 집중도 강화 방안 -초등학교 수학과 4학년을 중심으로-)

  • Kwon, Jae-Seong;Gyu, Seol-Moon
    • Journal of The Korean Association of Information Education
    • /
    • v.3 no.1
    • /
    • pp.125-133
    • /
    • 1999
  • This paper is to provide a provision, in the system of virtual studying on the base of web, that can be used when learners(student) don't feel interesting anymore in the situation of unit studying and wanders in virtual space. No doubt, It's possible to provoke learner's interesting with providing such as fine multi-media, graph, and animation. But This study propose a method for learner who is apt to tired of studying although activity program is developing.

  • PDF

Local Projective Display of Multivariate Numerical Data

  • Huh, Myung-Hoe;Lee, Yong-Goo
    • The Korean Journal of Applied Statistics
    • /
    • v.25 no.4
    • /
    • pp.661-668
    • /
    • 2012
  • For displaying multivariate numerical data on a 2D plane by the projection, principal components biplot and the GGobi are two main tools of data visualization. The biplot is very useful for capturing the global shape of the dataset, by representing $n$ observations and $p$ variables simultaneously on a single graph. The GGobi shows a dynamic movie of the images of $n$ observations projected onto a sequence of unit vectors floating on the $p$-dimensional sphere. Even though these two methods are certainly very valuable, there are drawbacks. The biplot is too condensed to describe the detailed parts of the data, and the GGobi is too burdensome for ordinary data analyses. In this paper, "the local projective display(LPD)" is proposed for visualizing multivariate numerical data. Main steps of the LDP are 1) $k$-means clustering of the data into $k$ subsets, 2) drawing $k$ principal components biplots of individual subsets, and 3) sequencing $k$ plots by Hurley's (2004) endlink algorithm for cognitive continuity.

A Determination of the Rainfall Durations of Various Recurrence Intervals (재현기간별 설계유효우량의 지속기간결정)

  • 윤용남;전병호
    • Water for future
    • /
    • v.12 no.2
    • /
    • pp.56-62
    • /
    • 1979
  • Many methods of estimating design floods from rainfall data involve a trial and error procedure to determine the duration of the design rainfall, which is very complicated and time-consuming. In this study, an effort was given to derive an analytical expression for estimating the appropriate duration for use with a particular unit hydrograph. According to the so-derived analytical expression the coordinateds of hvdrograph curve and rainfall curve for the Musim Representative Basin were computed and then plotted on a same scal graph paper on which the critical durations of design rainfall excess of various recurrence intervals were determined by the point of intersection of the tow curves.

  • PDF

Topological Investigation of the Generative Grammar for the Balcony Access Type Apartment Houses in Seoul (서울시 편복도 아파트 생성문법의 위상학적 유추에 대한 연구)

  • Seo, Kyung-Wook
    • Journal of the Korean housing association
    • /
    • v.19 no.1
    • /
    • pp.9-16
    • /
    • 2008
  • This study aims to construct the design competence by means of a topological approach. To this end, the linguistic concept of 'competence and performance' in Chomskian sense is borrowed and applied to the study. The usability of this method is then tested against the sample apartment plans from Gangnam-gu area in Seoul, and it is found that this enabled a middle-ground approach to a more productive grammar that overcomes the limits in Glassie's and Stiny's grammar systems. Through a series of analyses on the sample plans, it could be clarified that there appear classificatory levels in the competence that controls the planning of the building, zoning of the unit, and layout of LDK combination. At the end, it is evaluated that the generative grammar, constructed in this research, is the possible world in designers' minds, and this retrospective remodelling of the architectural competence could illuminate the 'design decision flow' that generates the sample plans.

Grapheme-based on-line recognition of cursive korean characters (자소 단위의 온라인 흘림체 한글 인식)

  • 정기철;김상균;이종국;김행준
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.9
    • /
    • pp.124-134
    • /
    • 1996
  • Korean has a large set of characters, and has a two-dimensional formation: each character is composed of graphemes in two dimensions. Whereas connections between characters are rare, connections inside a grapheme and between graphemes happen frequently and these connections generate many cursive strokes. To deal with the large character set and the cursive strokes, using the graphemes as a recognition unit is an efffective approach, because it naturally accommodates the structural characteristics of the characters. In this paper, we propose a grapheme-based on-line recognition method for cursive korean characters. Our method uses a TDNN recognition engine to segment cursive strokes into graphemes and a graph-algorithmic postprocessor based on korean grapheme composition rule and viterbi search algorithm to find the best recognition score path. We experimented the method on freely hand-written charactes and obtained a recognition rate of 94.5%.

  • PDF

A Study on Knowledge Representation for Recognizing Hazardous States in Chemical Processes (화학공정의 위험상태 인식을 위한 지식 표현에 관한 연구)

  • 안대명;황규석
    • Journal of the Korean Society of Safety
    • /
    • v.11 no.3
    • /
    • pp.104-111
    • /
    • 1996
  • A system was developed that could predict hazardous states for safe operation of chemical plants. This system aimed to prevent hazards of chemical processes from misoperation before real operation. In this study, a data base was organized which consisted of all hazards in the chemical processes. The structure of process was represented by signed direct graph(SDG) of NODEs and ARCs. Each NODE and ARC have property variables ; connected structure and state of processes etc. The hazards that could be occurred in processes were divided into two classes ; one is by operation of unit and the other is by hazardous materials. Using Hazardous States Transition Network, we could recognize transition progress of process states.

  • PDF

Study of Dark Matter at e+e- Collider using KISTI-5 Supercomputer

  • Park, Kihong;Cho, Kihyeon
    • International Journal of Contents
    • /
    • v.17 no.3
    • /
    • pp.67-73
    • /
    • 2021
  • Dark matter is barely known because it cannot be explained using the Standard Model. In addition, dark matter has not been detected yet. It is currently being explored through various ways. In this paper, we studied dark matter in an electron-positron collider using MadGraph5. The signal channel is e+e- → 𝜇+𝜇-A' where A' decays to dimuon. We studied the cross-section by increasing the center-of-mass energy. Central processing unit (CPU) time of simulation was compared with that using a local Linux machine and a KISTI-5 supercomputer (Knight Landing and Skylake). Furthermore, one or more cores were used for comparing CPU time among machines. Results of this study will enable the exploration of dark matter in electron-positron experiments. This study also serves as a reference for optimizing high-energy physics simulation toolkits.

Improving Software Pipelining Performance Using a Register Renaming Technique (소프트웨어 파이프라이닝에서 레지스터 변경을 통한 성능 개선)

  • Cho, Doosan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.1642-1643
    • /
    • 2010
  • 멀티미디어 도메인의 응용 프로그램에는 풍부한 병렬성이 내재하기 때문에 VLIW (Very Long Instruction Word) 형식의 신호처리 프로세서가 많이 사용되고 있다. VLIW 프로세서를 구성하는 복수의 연산처리유닛 (processing unit, PU)의 사용률은 컴파일러의 명령어 스케쥴러의 성능에 의하여 결정된다. 명령어들 사이의 병렬성을 분석하여 동시 수행가능한 명령어들을 각기 다른 PU 에서 수행되도록 프로그램 코드를 최적화한다. 하지만 기존의 명령어 스케쥴러는 복잡한 데이터 디펜던스 그래프 (data dependence graph, DDG)를 구성하여 복수의 PU 를 충분히 사용하도록 하지 못하는 문제점을 내재하고 있다. 이는 명령어 스케쥴러가 각 레지스터 사용시간을 별도로 고려하지 않기 때문에 실제로 내재된 데이터 디펜던스 보다 복잡성이 높은 디펜던스 그래프를 구성하게 되어 스케쥴러가 올바르게 최적화된 코드 스케쥴링 결과를 제공하지 못하기 때문이다. 본 연구에서는 레지스터의 라이프타임을 다른 레지스터를 이용하여 적절히 끊어주는 것으로 데이터 디펜던스 복잡도 완화하여 시스템 성능 향상의 가능성을 보이고 있다.

A Study on the Analyzing Space Configuration and Character of Exhibition Area in Neo-Classical Museum (신고전주의 뮤지엄의 공간구조분석과 전시영역특성에 관한 연구)

  • Oh, Ji-Young;Park, Hey-Kyung;Kim, Seok-Tae
    • Korean Institute of Interior Design Journal
    • /
    • v.20 no.3
    • /
    • pp.225-232
    • /
    • 2011
  • This study analyzed characteristics of space configuration and exhibition contents in the Neo-classism style museum while carrying out space syntax and visibility graph analysis. Therefore, this research has the purpose to survey the status of existing museum analyze their visual perception space structural characteristics and ultimately utilize their characteristics as basic data in planning out and designing space. As for the research scope, the research selected as research subject 4 Neo-classism style museum in Europe and US that composite set of room to room type and having major space. Research method is that the research analyzed the exhibition space of 4 art museums by using depth-map program which can analyze space with visual graph analysis function and analyzed the visibility among unit areas by each art museum integration and exhibition contents composition. In such analysis method, the research was able to Quantitatively analyze the visual characteristics of exhibition space that induce and adjusts the motion of audience. Visual perception quantitive analysis as in this research will enhance exhibition design by considering the correlation between audience and exhibited items when planning out art museum space to be established later on. Therefore, wien museum integration degree are high because of same openings direction and major space, Also another museums major space integrations are high level degree, and Exhibition area is set of high integration area. So, visitors can perceive exhibition contents easily.

A Topology Independent Heuristic Load Balancing Algorithm for Multiprocessor Environment (다중 프로세서 환경에서 연결구조에 무관한 휴리스틱 부하평형 알고리즘)

  • Song Eui-Seok;Sung Yeong-Rak;Oh Ha-Ryoung
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.1
    • /
    • pp.35-44
    • /
    • 2005
  • This paper proposes an efficient heuristic load balancing algorithm for multiprocessor systems. The algorithm minimizes the number of idle links to distribute load traffic and reduces its communication cost. Each processor iteratively tries to transfer unit load to/from all neighbor processors. However, real load transfer is collectively done after all load traffic is calculated. This prevents useless traffic and thus reduces the overall load traffic. The proposed algorithm can be employed in various interconnection topologies with slight modifications. In this paper, it is applied to hypercube, mesh, k-ary n-cube and general graph environments. For performance evaluation, simulation studies are performed. The proposed algorithm and the well-known existing algorithms are implemented and compared. The results show that the proposed algorithm always balances the loads perfectly. furthermore, in comparison with the existing algorithms, it reduces the communication costs by 77%, 74% and 73% in the hypercube, the mesh, and k-ary n-cube, respectively.