• Journal of Elementary Mathematics Education in Korea
• /
• v.23 no.1
• /
• pp.119-141
• /
• 2019

This study was carried out in order to draw some implications for teaching statistical graph in mathematics education with respect to practical statistics education for promoting students' statistical literacy. We analyze 133 graphs appearing in 99 elementary textbooks of other subjects (subjects except from mathematics) by subjects and types, and identify some cases of graphs addressed by other subjects. As a results, statistical graph was most addressed in social studies, and bar graphs, line graphs, tables, and circle graphs are most used in other subjects. Moreover, there are some issues related to contents-(1) the problem of curricular sequencing between mathematics and other subjects, (2) the level of addressing ratio graph, and (3) the use of wavy lines. In terms of forms, (1) the visual variation of graphical representations, (2) representation combining multiple graphs, and (2) graphs specialized for particular subjects are drawn as other issues. We suggest some implications to be considered when teaching the statistical graph in elementary mathematics classes.

• Physical Therapy Rehabilitation Science
• /
• v.9 no.4
• /
• pp.287-294
• /
• 2020

Objective: This study aimed to investigate the effects of an ultrasound-based bar graph proportional to the quadriceps muscle thickness as a real-time visual feedback training tool in the elderly. Design: Cross-sectional study. Methods: Twenty-four elderly persons participated in this study and were randomly divided into three groups: oral training group (n=8, group 1), ultrasound imaging group (n=8, group 2), and graph group (n=8, group 3). In the pre condition, all participants performed maximal voluntary isometric contraction (MVIC) of the quadriceps with knee extension three times with oral training. In the post condition, group 1 performed MVIC of the quadriceps with oral training, group 2 performed MVIC of the quadriceps with real-time visual feedback using ultrasound imaging, and group 3 performed MVIC of the quadriceps with real-time visual feedback using a bar graph proportional to the quadriceps muscle thickness, three times for all groups. Muscle thickness, activity (mean, peak), tone, stiffness, logarithmic decrement, relaxation, and creep were measured in both conditions in all participants. Results: Visual feedback with a bar graph showed significant effects on muscle thickness, mean muscle activity, and peak muscle activity compared with oral training and visual feedback with ultrasound imaging (p<0.05). Conclusions: Isometric training of the quadriceps with real-time visual feedback using a bar graph proportional to the quadriceps muscle thickness may be more effective than other methods in improving muscle thickness and muscle activity. This study presented a tool that can help increase muscle thickness in the elderly.

• The Journal of the Korea Contents Association
• /
• v.13 no.5
• /
• pp.37-47
• /
• 2013

The objective of this research is to discover the rule of gameplay related to the task interdependence to analyse the behavior pattern of social gameplay. Previous literatures related to the gameplay were reviewed and game which was suitable for the gameplay of the task interdependence was selected. A party-play includes a team of five people in the experiment during the gameplay with think-aloud method and video/audio data about action protocol and verbal report were collected. The video observation and protocol analysis were conducted to analyse data. The objective coding scheme were developed from consolidated sequence model task analysis. The player's behavior was analysed. The result was revealed that four rules and four modified rules were included into the total eight behavior pattern. A behavior graph integrated with five gameplay was written. The excellent cooperative spot and error and failure place could be identified. The social gameplay behavior graph is expected to be the key practical design guideline on whether the level design and balance design are proper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.3203-3215
• /
• 2015

Due to the high growth of SNS population, service scalability is one of the critical issues to be addressed. The cloud environment provides the flexible computing and storage resources for services deployment, which fits the characteristics of scalable SNS deployment. However, if the SNS related information is not properly placed, it will cause unbalance load and heavy transmission cost on the storage virtual machine (VM) and cloud data center (CDC) network. In this paper, we characterize the SNS into a graph model based on the users' associations and interest correlations. The node weight represents the degree of associations, which can be indexed by the number of friends or data sources, and the link weight denotes the correlation between users/data sources. Then, based on the SNS graph, the two-step algorithm is proposed in this paper to determine the placement of SNS related data among VMs. Two k-means based clustering schemes are proposed to allocate social data in proper VM and physical servers for pre-configured VM and dynamic VM environment, respectively. The experimental example was conducted and to illustrate and compare the performance of the proposed schemes.

• Journal of Korea Multimedia Society
• /
• v.22 no.4
• /
• pp.502-514
• /
• 2019

Existing user research methods are subject to a variety of research conditions such as the amount and variety of data collected and the expertise of the facilitator of a group research session. In this study, we propose a new user research methodology using an 'Issue-Network' system, which is developed based on the theory and methods of social network analysis. The Issue-Network is designed to define problem spaces from the issues raised by users in a group research session in a form of an interactive network graph. The system helps to break out of ordinary perspectives of looking into problem spaces by enabling an alternative and more creative way to connect issues in the network. In this study, we took a case study of generating the Issue-Network on behalf of the problems raised by users in various driving-related situations. We were able to draw three navigation usage scenarios that cover relatively important problem spaces: safety and being ready for the unexpected, smart navigation and notifications, making use of the spare time. In the future, the Issue-Network system is expected to be used as a tool to identify problems and derive solutions in group research sessions involving a large number of users.

• Korean Institute of Interior Design Journal
• /
• v.27 no.3
• /
• pp.14-23
• /
• 2018

The spatial planning of the elderly care facility plans is analyzed using space syntax in terms of encouraging the social interaction of the residents in this study. First, through the visibility graph analysis, openness and accessibility of space is analysed. Second, the walking behavior of residents through agent analysis model is simulated. Third, the space planning methods for the elderly care facilities are proposed based on the results. The results are as follows. According to the visibility graph analysis, the main corridor has high visual openness and high accessibility. The visual openness and accessibility of the unit living room, where social interaction among residents is possible in each unit, is low. Space planning is needed to increase direct protection and observation of employees to the unit living room. The location of the nurse station that manages the entire floor needs to be located where the openness and accessibility is most high. The nursing station should have a high degree of connectivity to the entire space, so that any accidents can be managed and contact is accessible. Through the agent simulation the flow from the center to each unit space is highest in the corridor space and the inflow to the private rooms and the living room are similar. Therefore, it is necessary to plan the accessibility of the unit living room more for the natural inflow of residents.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.70-80
• /
• 2018

Due to the recent development of social media and mobile devices, graph data have been using in various fields. In addition, caching techniques for reducing I/O costs in the process of large capacity graph data have been studied. In this paper, we propose a multi-layer caching scheme considering the connectivity of the graph, which is the characteristics of the graph topology, and the history of the past subgraph usage. The proposed scheme divides a cache into Used Data Cache and Prefetched Cache. The Used Data Cache maintains data by weights according to the frequently used sub-graph patterns. The Prefetched Cache maintains the neighbor data of the recently used data that are not used. In order to extract the graph patterns, their past history information is used. Since the frequently used sub-graphs have high probabilities to be reused, they are cached. It uses a strategy to replace new data with less likely data to be used if the memory is full. Through the performance evaluation, we prove that the proposed caching scheme is superior to the existing cache management scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.540-557
• /
• 2021

Privacy vulnerability of social networks is one of the major concerns for social science research and business analysis. Most existing studies which mainly focus on un-weighted network graph, have designed various privacy models similar to k-anonymity to prevent data disclosure of vertex attributes or relationships, but they may be suffered from serious problems of huge information loss and significant modification of key properties of the network structure. Furthermore, there still lacks further considerations of privacy protection for important sensitive edges in weighted social networks. To address this problem, this paper proposes a privacy preserving method to protect sensitive weighted edges. Firstly, the sensitive edges are differentiated from weighted edges according to the edge betweenness centrality, which evaluates the importance of entities in social network. Then, the perturbation operations are used to preserve the privacy of weighted social network by adding some pseudo-edges or modifying specific edge weights, so that the bottleneck problem of information flow can be well resolved in key area of the social network. Experimental results show that the proposed method can not only effectively preserve the sensitive edges with lower computation cost, but also maintain the stability of the network structures. Further, the capability of defending against malicious attacks to important sensitive edges has been greatly improved.

• Journal of information and communication convergence engineering
• /
• v.12 no.1
• /
• pp.33-38
• /
• 2014

This paper investigates the shaping operation problem introduced by Callahan et al., namely the k-fragility maximization problem (k-FMP), whose goal is to find a subset of personals within a terrorist group such that the regeneration capability of the residual group without the personals is minimized. To improve the impact of the shaping operation, the degree centrality of the residual graph needs to be maximized. In this paper, we propose a new greedy algorithm for k-FMP. We discover some interesting discrete properties and use this to design a more thorough greedy algorithm for k-FMP. Our simulation result shows that the proposed algorithm outperforms Callahan et al.'s algorithm in terms of maximizing degree centrality. While our algorithm incurs higher running time (factor of k), given that the applications of the problem is expected to allow sufficient amount of time for thorough computation and k is expected to be much smaller than the size of input graph in reality, our algorithm has a better merit in practice.

• KIEAE Journal
• /
• v.11 no.6
• /
• pp.95-100
• /
• 2011

Although Space Syntax is a well-known technique for spatial analysis, debates have taken place among some researchers because the Space Syntax discards geometric information as both shapes and sizes of spaces, and hence may cause some inconsistencies. Therefore, this study aims at developing methods to recognize and manage spatial shapes for more precise space syntax analysis. To reach this goal, this study employed both a graph theory and binary spatial partitioning (BSP) tree to recognize and manage spatial information. As a result, spatial shapes and sizes could be recognized by checking loops in graph converted from spatial shapes of built environment. Each spatial shape could be managed sequentially by BSP tree with hierarchical structure. Through such recognition and management processes, convex maps composed of the fattest and fewest convex spaces could be drawn. In conclusion, we hope that the methods developed here will be useful for urban planning to find appropriate purposes of spaces to satisfy the sustainability of built environment on the basis of the spatial and social relationships in urban spaces.