• Title/Summary/Keyword: ratio-graph

Search Result 165, Processing Time 0.024 seconds

ON TRANSLATION LENGTHS OF PSEUDO-ANOSOV MAPS ON THE CURVE GRAPH

  • Hyungryul Baik;Changsub Kim
    • Bulletin of the Korean Mathematical Society
    • /
    • v.61 no.3
    • /
    • pp.585-595
    • /
    • 2024
  • We show that a pseudo-Anosov map constructed as a product of the large power of Dehn twists of two filling curves always has a geodesic axis on the curve graph of the surface. We also obtain estimates of the stable translation length of a pseudo-Anosov map, when two filling curves are replaced by multicurves. Three main applications of our theorem are the following: (a) determining which word realizes the minimal translation length on the curve graph within a specific class of words, (b) giving a new class of pseudo-Anosov maps optimizing the ratio of stable translation lengths on the curve graph to that on Teichmüller space, (c) giving a partial answer of how much power is needed for Dehn twists to generate right-angled Artin subgroup of the mapping class group.

An Analysis of Teaching Statistical Graphs in Elementary School Mathematics Textbooks (초등학교 수학 교과서에 나타난 통계 그래프 지도 방법 분석)

  • Lim Ji Ae;Kang Wan
    • Journal of Elementary Mathematics Education in Korea
    • /
    • v.7 no.1
    • /
    • pp.65-86
    • /
    • 2003
  • Mathematics textbooks are substitutive showing real characters of didactic transposition in pseudo-contextualization and pseudo-personalization. This study analyzed statistical graphs in elementary school mathematics textbooks according to the first to the 7th curriculum in Korea. It focused on the didactic principles used in those methods through those view of Didactic Transposition Theory. The features of the elementary school mathematics textbooks in Korea are investigated and described ethnomethodologically according to each curriculum periods in dividing bar graph, line graph, pictograph, graph of ratio, histogram. The teaching sequences and methods of the statistical graphs, order and methods of sub-learning activities, teaming data, matter of the learning activity indicator were summarized. Usually, the teaching sequences, excepting the graphs of ratio, statistical graphs are introduced in the second semester of each grade. The graph of ratio is introduced in the first semester of 6th grade. As a result of analysing sub-Loaming activities, using them increased from the first to the 7th curriculum and its form was fixed constructive and stable at the 4th curriculum textbooks. As a result of analysing the teaming data, the data of the social aspects are used more frequently and the data of the individual preferences trended more gradually. As a result of analysing the matter of the teaming activity indicators, concept-explanation question style were used more frequently. Statement-practice style and consideration style trended gradually. Concluding remarks are: First, the didactic transposition of the elementary school mathematics textbooks developed systematically according to the first to the 7th curriculum; Second, mathematics textbooks gradually introduced the positive learning style of activity and the learners' spontaneousness; Third, more concrete practice activities and reflective activities were variously introduced considering the level and interest of each elementary student.

  • PDF

Analysis on Signal Flow Graph of Slotted LIne (Slotted Line의 Signal Flow Graph 해석)

  • 박기수
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.6 no.3
    • /
    • pp.8-11
    • /
    • 1969
  • In the precision measurement of the voltage standing wave ratio (VSWR) or reflection coefficient by means of the slotted line technique, one of the important factors is the maximum error due to the discontinuities and multi-reflection in the slotted line. Particularly, this error becomes a critical factor when the VSWR or the reflection coefficient to be measured is very small. In this paper, the exact expression of this error is obtained by means of the Signal flow graph method.

  • PDF

Dynamic Channel Assignment Scheme Using Graph Coloring in Femtocell Networks (펨토셀 네트워크에서 그래프 컬러링을 이용한 동적채널할당 방법)

  • Kim, Se-Jin;Cho, IlKwon;Kim, Yi-Kang;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.4
    • /
    • pp.257-265
    • /
    • 2013
  • In this paper, we proposed a Dynamic Channel Assignment (DCA) scheme called Graph Coloring based DCA (GC-DCA) to improve system performance for downlink femtocell networks with high density femto Access Point (AP) deployments. The proposed scheme consists of two steps: one is a femto AP grouping step considering interference and the other is a DCA step considering Signal to Interference plus Noise Ratio (SINR) for femto User Equipments (UEs). Simulation results show that the proposed GC-DCA outperforms other schemes in terms of the mean femto UE capacity and probability of femto UEs which have capacities less than a given transmit rate.

Efficient Shortest Path Techniques on a Summarized Graph based on the Relationships (관계기반 요약그래프에서 효율적인 최단경로 탐색기법)

  • Kim, Hyunwook;Seo, HoJin;Lee, Young-Koo
    • Journal of KIISE
    • /
    • v.44 no.7
    • /
    • pp.710-718
    • /
    • 2017
  • As graphs are becoming increasingly large, the costs for storing and managing data are increasing continuously. Shortest path discovery over a large graph requires long running time due to frequent disk I/Os and high complexity of the graph data. Recently, graph summarization techniques have been studied, which reduce the size of graph data and disk I/Os by representing highly dense subgraphs as a single super-node. Decompressing should be minimized for efficient shortest path discovery over the summarized graph. In this paper, we analyze the decompression performance of a summarized graph and propose an approximate technique that discovers the shortest path quickly with a minimum error ratio. We also propose an exact technique that efficiently discovered the shortest path by exploiting an index built on paths containing super-nodes. In our experiments, we showed that the proposed technique based on the summarized graph can reduce the running time by up to 70% compared with the existing techniques performed on the original graph.

Graph-Based framework for Global Registration (그래프에 기반한 전역적 정합 방법)

  • 김현우;홍기상
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.671-674
    • /
    • 2000
  • In this paper, we present a robust global registration algorithm for multi-frame image mosaics. When we perform a pair-wise registration recovering a projective transformation between two consecutive frames, severe mis-registration among multiple frames, which are not consecutive, can be detected. It is because the concatenation of those pair-wise transformations leads to global alignment errors. To overcome those mis-registrations, we propose a new algorithm using multiple frames for constructing image mosaics. We use a graph to represent the temporal and spatial connectivity and show that global registration can be obtained through the search for an optimal path in the constructed graph. The definition of an adequate objective function characterizing the global registration provides a direct manipulation of the graph. In the presence of moving objects, especially large ones compared with low texture backgrounds, by using the likelihood ratio as the objective function, we can deal with some of the most challenging videos like basketball or soccer Moreover, the algorithm can be parallelized so it can be more efficiently implemented. Finally, we give some experimental results from real videos.

  • PDF

The Analysis of MMPI and Clinical Study for Somatization Disorder and Depressive Disorder Patients (우울증성 장애 및 신체형 장애 환자에 대한 MMPI분석과 임상고찰)

  • Choe, Byeong-Man;Jung, In-Chul;Lee, Sang-Ryong;Park, Ji-Un
    • Journal of Oriental Neuropsychiatry
    • /
    • v.13 no.2
    • /
    • pp.41-56
    • /
    • 2002
  • The Analysis of MMPI and Clinical Study was carried out the 28 patients with somatoform disorder and depressive disorder who were treated in Daejeon University Oriental Hospital from 19 June 2001 to 17 April 2002. The results were summarized as follows. 1. The ratio of female was higher, especially in the depressive disorder, the ratio of female was higher and in the age distribution, the 40 aged were higher frequence. 2. In the somatoform disorder, symptoms appeared to be busy in physical symptoms, and they were in descending order the digestive organs system, head and face portion and musculoskeletal system symptoms, in the depressive disorder, appeared to be busy in psychosomatic system symptoms and in the prescription drugs, soyosan(逍遙散), punsimkiyyin(分心氣飮) were used to be busy. 3. In the scales of L, F, K, somatoform disorder showed ${\wedge}$ typed graph, and depressive disorder showed ${\vee}$ typed graph. 4. In the somatoform disorder, scales of Hs, Hy, D, Pa were higher, and in the depressive disorder, scales of Hy, Hs, Pd, D were higher. 5. In the scales of Hs, D, Hy, somatoform disorder showed ${\vee}$ typed graph, and depressive disorder showed/typed graph. 6. the average of T-scores and the ratio over 65 score and 70 score showed common distribution.

  • PDF

ANIDS(Advanced Network Based Intrusion Detection System) Design Using Association Rule Mining (연관법칙 마이닝(Association Rule Mining)을 이용한 ANIDS (Advanced Network Based IDS) 설계)

  • Jeong, Eun-Hee;Lee, Byung-Kwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.12
    • /
    • pp.2287-2297
    • /
    • 2007
  • The proposed ANIDS(Advanced Network Intrusion Detection System) which is network-based IDS using Association Rule Mining, collects the packets on the network, analyze the associations of the packets, generates the pattern graph by using the highly associated packets using Association Rule Mining, and detects the intrusion by using the generated pattern graph. ANIDS consists of PMM(Packet Management Module) collecting and managing packets, PGGM(Pattern Graph Generate Module) generating pattern graphs, and IDM(Intrusion Detection Module) detecting intrusions. Specially, PGGM finds the candidate packets of Association Rule large than $Sup_{min}$ using Apriori algorithm, measures the Confidence of Association Rule, and generates pattern graph of association rules large than $Conf_{min}$. ANIDS reduces the false positive by using pattern graph even before finalizing the new pattern graph, the pattern graph which is being generated is compared with the existing one stored in DB. If they are the same, we can estimate it is an intrusion. Therefore, this paper can reduce the speed of intrusion detection and the false positive and increase the detection ratio of intrusion.

Efficient determination of the size of experiments by using graphs in balanced design of experiments (균형된 실험계획법에서 그래프를 활용한 실험의 크기의 효율적인 결정)

  • Lim, Yong B.;Youn, Sora;Chung, Jong Hee
    • Journal of Korean Society for Quality Management
    • /
    • v.46 no.3
    • /
    • pp.651-658
    • /
    • 2018
  • Purpose: The algorithm described in Lim(1998) is available to determine the sample size directly given specified significance level, power and signal-to-noise ratio. We research on the efficient determination of the sample size by visual methods. Methods: We propose three graphs for investigating the mutual relationship between the sample size r, power $1-{\beta}$ and the detectable signal-to-noise ratio ${\Delta}$. First graph shows the relationship between ${\Delta}$ and $1-{\beta}$ for the given r and it can be checked whether the power is sufficient enough. Second graph shows the relationship between r and ${\Delta}$ for the given power $1-{\beta}$. Third graph shows the relationship between r and $1-{\beta}$ for the given ${\Delta}$. It can be checked that which effects are sensitive to the efficient sample size by investigating those graphs. Results: In factorial design, randomized block design and the split plot design how to determine the sample size directly given specified significance level, power and signal-to-noise ratio is programmed by using R. A experiment to study the split plot design in Hicks(1982) is used as an example. We compare the sample sizes calculated by randomized block design with those by split plot design. By using graphs, we can check the possibility of reducing the sample size efficiently. Conclusion: The proposed visual methods can help an engineer to make a proper plan to reduce the sample size.

Model Test for the Damage Assessment of Adjacent Frame Structures in Urban Excavation (지반 굴착에 따른 인접 프레임구조물의 손상평가에 관한 모형실험 연구)

  • Kim, Seong-Cheol;Hwang, Eui-Seok;Kim, Zu-Cheol;Kim, Hak-Moon
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2005.03a
    • /
    • pp.1490-1495
    • /
    • 2005
  • In this study, Model test of concrete frame structures with various shapes and locations are carried out by means of applying Peck's(1969) settlement method. The results of the model test indicated that important correlations existed between the behavior of frame structure and ground movement. Also, the damage level of frame structure closely influenced by the phase of excavation. Therefore, prediction of damage level at early phase of construction should be very precise. The damage level graph by Cording et al.(2001), the angular distortion provided gradually more serious damage to frame structures for the all cases. But the damage level graph by Burland(1997), was difficult to confirm because of very small amount of deflection ratio.

  • PDF