• Title/Summary/Keyword: social graph

Search Result 164, Processing Time 0.022 seconds

A Study on Application of Teaching-Learning Program based on Constructivist Views for Mathematically gifted Students in Primary School (초등 영재 교육에서의 구성주의 교수.학습 모형 적용 연구 - 알고리즘 문제를 중심으로 -)

  • Choi, Keun-Bae;Kim, Hong-Seon
    • Communications of Mathematical Education
    • /
    • v.21 no.2 s.30
    • /
    • pp.153-176
    • /
    • 2007
  • The purpose of this paper is to analyze teaching-learning program which can be applied to mathematically gifted students in primary school, Our program is based on constructivist views on teaching and learning of mathematics. Mainly, we study the algorithmic thinking of mathematically gifted students in primary school in connection with the network problems; Eulerian graph problem, the minimum connector problem, and the shortest path problem, The above 3-subjects are not familiar with primary school mathematics, so that we adapt teaching-learning model based on the social constructivism. To achieve the purpose of this study, seventeen students in primary school participated in the study, and video type(observation) and student's mathematical note were used for collecting data while the students studied. The results of our study were summarized as follows: First, network problems based on teaching-learning model of constructivist views help students learn the algorithmic thinking. Second, the teaching-learning model based on constructivist views gives an opportunity of various mathematical thinking experience. Finally, the teaching-learning model based on constructivist views needs more the ability of teacher's research and the time of teaching for students than an ordinary teaching-learning model.

  • PDF

Identifying the biological and physical essence of protein-protein network for yeast proteome : Eigenvalue and perturbation analysis of Laplacian matrix (이스트 프로테옴에 대한 단백질-단백질 네트워크의 생물학적 및 물리학적 정보인식 : 라플라스 행렬에 대한 고유치와 섭동분석)

  • Chang, Ik-Soo;Cheon, Moo-Kyung;Moon, Eun-Joung;Kim, Choong-Rak
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2004.11a
    • /
    • pp.265-271
    • /
    • 2004
  • The interaction network of protein -protein plays an important role to understand the various biological functions of cells. Currently, the high -throughput experimental techniques (two -dimensional gel electrophoresis, mass spectroscopy, yeast two -hybrid assay) provide us with the vast amount of data for protein-protein interaction at the proteome scale. In order to recognize the role of each protein in their network, the efficient bioinformatical and computational analysis methods are required. We propose a systematic and mathematical method which can analyze the protein -protein interaction network rigorously and enable us to capture the biological and physical essence of a topological character and stability of protein -protein network, and sensitivity of each protein along the biological pathway of their network. We set up a Laplacian matrix of spectral graph theory based on the protein-protein network of yeast proteome, and perform an eigenvalue analysis and apply a perturbation method on a Laplacian matrix, which result in recognizing the center of protein cluster, the identity of hub proteins around it and their relative sensitivities. Identifying the topology of protein -protein network via a Laplacian matrix, we can recognize the important relation between the biological pathway of yeast proteome and the formalism of master equation. The results of our systematic and mathematical analysis agree well with the experimental findings of yeast proteome. The biological function and meaning of each protein cluster can be explained easily. Our rigorous analysis method is robust for understanding various kinds of networks whether they are biological, social, economical...etc

  • PDF

An Analysis of Students' Graphicacy in Korea Based on the National Assessment of Educational Achievement, from 2005 to 2007 (우리나라 학생들의 학교급별 도해력 발달수준 분석 - 2005${\sim}$2007년 국가수준 학업성취도 평가를 중심으로-)

  • Park, Sun-Mee;Kim, Hye-Sook;Lee, Eui-Han
    • Journal of the Korean Geographical Society
    • /
    • v.44 no.3
    • /
    • pp.410-427
    • /
    • 2009
  • This study aims to rethink the meaning of graphicacy, discuss the possible criteria to evaluate the level of graphicacy, and show how the graphicacy differs through different grades. First, it finds that as school grades advance, implicit information processing abilities, and conceptual information processing abilities were more required comparing to explicit information processing abilities, when interpreting graphic data. Secondly, the percentage of items which examinee showed a proficient level, decreased as school grades advanced. Thirdly, the graphicacy level of sixth graders was the status of being able to derive explicit information from pictorial maps and read implicit information in simple contour map or line graphs. Ninth graders were able to infer causal relationship between geographic phenomenons by utilizing graphic materials. Tenth graders could read graphic materials by utilizing simple knowledge and experience.

A Technique for Detecting Interaction-based Communities in Dynamic Networks (동적 네트워크에서 인터랙션 기반 커뮤니티 발견 기법)

  • Kim, Paul;Kim, Sangwook
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.8
    • /
    • pp.357-362
    • /
    • 2016
  • A social network or bio network is one of the complex networks that are formed by connecting specific relationships between interacting objects. Usually, these networks consist of community structures. Automatically detecting the structures is an important technique to understand and control the interaction objects. However, the topologies and structures of the networks change by interactions of the objects, with respect to time. Conventional techniques for finding the community structure have a high computational complexity. Additionally, the methods inefficiently deal with repeated computation concerning graph operation. In this paper, we propose an incremental technique for detecting interaction-based communities in dynamic networks. The proposed technique is able to efficiently find the communities, since there is an awareness of changed objects from the previous network, and it can incrementally reuse the previous community structure.

A Study on the General Wearing Attitude and Brand Image Perception for Golf Wear (골프복 범용착용실태와 이미지 인식에 관한 연구)

  • Koo, In-Sook
    • Journal of Fashion Business
    • /
    • v.12 no.1
    • /
    • pp.76-92
    • /
    • 2008
  • The purpose of this study was to analyze the general wearing attitude & brand Image Perception for Golf Wear in wearer's mind, and to investigate the brand preference on the image characteristics of golf wear, and to find out the wearer's purchasing point for golf wear, for developing the possibility and strategy of the golf wear market for the apparel marketers and manufacturers. For this study, the data obtained from 210 respondents were analyzed by the descriptive statistics, Pearson's simple correlation, Crossing Analysis, parato graph. The results from the study were as follow : The respondents who were specially wearing for golf game were 23.3%(49 persons) among the 210 respondents. The 210 respondents evaluated highly the features of golf wear, such as design(51%), quality(44.3%), materials(36.2%), color(35.2%), size(21.0%), as the purchasing point for golf shirts, otherwise, the 210 respondents evaluated lowly the social aspects of golf wear, such as, fashion conformity, brand loyalty and promotion. And the most important material features for the golf wear was the elasticity, speed dryness by the 210 respondents The most frequent brand by 207 respondents described in the free style was Daks(11.1%) and Ping(11.1%). The 205 respondents described in the free style evaluated Daks(14.6%) as the most preference brand. The reason for the most preference brand was based with the comfort and pleasure of design, quality, color, size, materials.

Progressive Analysis of Private Education Expenses for Mathematics Subjects of Elementary School Students (초등학생의 수학 교과 사교육비에 대한 추이적 분석)

  • Kim, Somin;Lee, Jong-hak
    • Journal of the Korean School Mathematics Society
    • /
    • v.24 no.3
    • /
    • pp.243-259
    • /
    • 2021
  • This study examines trends by school level, region, subject, and type centered on elementary schools when private education is perceived as a social problem due to the overheating of private education and its over-dependence. This study aims to provide a direction to ease the school mathematics education and meet the expectations of school mathematics education. As a result of this study, in mathematics subjects, the graph of private education expenses for mathematics subjects was not affected by the period and showed a somewhat consistent linear trend. In other words, we found that the private education cost of the mathematics subject was solid compared to other factors, and was not significantly affected by external variables, and was consistent. It is meaningful to examine the trends of private education costs in mathematics subjects with a comparison between the past and present and to grasp what factors and how they have changed and developed.

An Efficient Expert Discrimination Scheme Based on Academic Documents (학술 문헌 기반 효율적인 전문가 판별 기법)

  • Choi, Do-Jin;Oh, Young-Ho;Pyun, Do-Woong;Bang, Min-Ju;Jeon, Jong-Woo;Lee, Hyeon-Byeong;Park, Deukbae;Lim, Jong-Tae;Bok, Kyoung-Soo;Yoo, Hyo-Keun;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.12
    • /
    • pp.1-12
    • /
    • 2021
  • An objective expert discrimination scheme is needed for finding researchers who have insight and knowledge about a particular field of research. There are two types of expert discrimination schemes such as a citation graph based method and a formula based method. In this paper, we propose an efficient expert discrimination scheme considering various characteristics that have not been considered in the existing formula based methods. In order to discriminate the expertise of researchers, we present six expertise indices such as quality, productivity, contributiveness, recentness, accuracy, and durability. We also consider the number of social citations to apply the characteristics of academic search sites. Finally, we conduct various experiments to prove the validity and feasibility of the proposed scheme.

Integrating physics-based fragility for hierarchical spectral clustering for resilience assessment of power distribution systems under extreme winds

  • Jintao Zhang;Wei Zhang;William Hughes;Amvrossios C. Bagtzoglou
    • Wind and Structures
    • /
    • v.39 no.1
    • /
    • pp.1-14
    • /
    • 2024
  • Widespread damages from extreme winds have attracted lots of attentions of the resilience assessment of power distribution systems. With many related environmental parameters as well as numerous power infrastructure components, such as poles and wires, the increased challenge of power asset management before, during and after extreme events have to be addressed to prevent possible cascading failures in the power distribution system. Many extreme winds from weather events, such as hurricanes, generate widespread damages in multiple areas such as the economy, social security, and infrastructure management. The livelihoods of residents in the impaired areas are devastated largely due to the paucity of vital utilities, such as electricity. To address the challenge of power grid asset management, power system clustering is needed to partition a complex power system into several stable clusters to prevent the cascading failure from happening. Traditionally, system clustering uses the Binary Decision Diagram (BDD) to derive the clustering result, which is time-consuming and inefficient. Meanwhile, the previous studies considering the weather hazards did not include any detailed weather-related meteorologic parameters which is not appropriate as the heterogeneity of the parameters could largely affect the system performance. Therefore, a fragility-based network hierarchical spectral clustering method is proposed. In the present paper, the fragility curve and surfaces for a power distribution subsystem are obtained first. The fragility of the subsystem under typical failure mechanisms is calculated as a function of wind speed and pole characteristic dimension (diameter or span length). Secondly, the proposed fragility-based hierarchical spectral clustering method (F-HSC) integrates the physics-based fragility analysis into Hierarchical Spectral Clustering (HSC) technique from graph theory to achieve the clustering result for the power distribution system under extreme weather events. From the results of vulnerability analysis, it could be seen that the system performance after clustering is better than before clustering. With the F-HSC method, the impact of the extreme weather events could be considered with topology to cluster different power distribution systems to prevent the system from experiencing power blackouts.

Proposal of Analysis Method for Biota Survey Data Using Co-occurrence Frequency

  • Yong-Ki Kim;Jeong-Boon Lee;Sung Je Lee;Jong-Hyun Kang
    • Proceedings of the National Institute of Ecology of the Republic of Korea
    • /
    • v.5 no.3
    • /
    • pp.76-85
    • /
    • 2024
  • The purpose of this study is to propose a new method of analysis focusing on interconnections between species rather than traditional biodiversity analysis, which represents ecosystems in terms of species and individual counts such as species diversity and species richness. This new approach aims to enhance our understanding of ecosystem networks. Utilizing data from the 4th National Natural Environment Survey (2014-2018), the following eight taxonomic groups were targeted for our study: herbaceous plants, woody plants, butterflies, Passeriformes birds, mammals, reptiles & amphibians, freshwater fishes, and benthonic macroinvertebrates. A co-occurrence frequency analysis was conducted using nationwide data collected over five years. As a result, in all eight taxonomic groups, the degree value represented by a linear regression trend line showed a slope of 0.8 and the weighted degree value showed an exponential nonlinear curve trend line with a coefficient of determination (R2) exceeding 0.95. The average value of the clustering coefficient was also around 0.8, reminiscent of well-known social phenomena. Creating a combination set from the species list grouped by temporal information such as survey date and spatial information such as coordinates or grids is an easy approach to discern species distributed regionally and locally. Particularly, grouping by species or taxonomic groups to produce data such as co-occurrence frequency between survey points could allow us to discover spatial similarities based on species present. This analysis could overcome limitations of species data. Since there are no restrictions on time or space, data collected over a short period in a small area and long-term national-scale data can be analyzed through appropriate grouping. The co-occurrence frequency analysis enables us to measure how many species are associated with a single species and the frequency of associations among each species, which will greatly help us understand ecosystems that seem too complex to comprehend. Such connectivity data and graphs generated by the co-occurrence frequency analysis of species are expected to provide a wealth of information and insights not only to researchers, but also to those who observe, manage, and live within ecosystems.

A Folksonomy Ranking Framework: A Semantic Graph-based Approach (폭소노미 사이트를 위한 랭킹 프레임워크 설계: 시맨틱 그래프기반 접근)

  • Park, Hyun-Jung;Rho, Sang-Kyu
    • Asia pacific journal of information systems
    • /
    • v.21 no.2
    • /
    • pp.89-116
    • /
    • 2011
  • In collaborative tagging systems such as Delicious.com and Flickr.com, users assign keywords or tags to their uploaded resources, such as bookmarks and pictures, for their future use or sharing purposes. The collection of resources and tags generated by a user is called a personomy, and the collection of all personomies constitutes the folksonomy. The most significant need of the folksonomy users Is to efficiently find useful resources or experts on specific topics. An excellent ranking algorithm would assign higher ranking to more useful resources or experts. What resources are considered useful In a folksonomic system? Does a standard superior to frequency or freshness exist? The resource recommended by more users with mere expertise should be worthy of attention. This ranking paradigm can be implemented through a graph-based ranking algorithm. Two well-known representatives of such a paradigm are Page Rank by Google and HITS(Hypertext Induced Topic Selection) by Kleinberg. Both Page Rank and HITS assign a higher evaluation score to pages linked to more higher-scored pages. HITS differs from PageRank in that it utilizes two kinds of scores: authority and hub scores. The ranking objects of these pages are limited to Web pages, whereas the ranking objects of a folksonomic system are somewhat heterogeneous(i.e., users, resources, and tags). Therefore, uniform application of the voting notion of PageRank and HITS based on the links to a folksonomy would be unreasonable, In a folksonomic system, each link corresponding to a property can have an opposite direction, depending on whether the property is an active or a passive voice. The current research stems from the Idea that a graph-based ranking algorithm could be applied to the folksonomic system using the concept of mutual Interactions between entitles, rather than the voting notion of PageRank or HITS. The concept of mutual interactions, proposed for ranking the Semantic Web resources, enables the calculation of importance scores of various resources unaffected by link directions. The weights of a property representing the mutual interaction between classes are assigned depending on the relative significance of the property to the resource importance of each class. This class-oriented approach is based on the fact that, in the Semantic Web, there are many heterogeneous classes; thus, applying a different appraisal standard for each class is more reasonable. This is similar to the evaluation method of humans, where different items are assigned specific weights, which are then summed up to determine the weighted average. We can check for missing properties more easily with this approach than with other predicate-oriented approaches. A user of a tagging system usually assigns more than one tags to the same resource, and there can be more than one tags with the same subjectivity and objectivity. In the case that many users assign similar tags to the same resource, grading the users differently depending on the assignment order becomes necessary. This idea comes from the studies in psychology wherein expertise involves the ability to select the most relevant information for achieving a goal. An expert should be someone who not only has a large collection of documents annotated with a particular tag, but also tends to add documents of high quality to his/her collections. Such documents are identified by the number, as well as the expertise, of users who have the same documents in their collections. In other words, there is a relationship of mutual reinforcement between the expertise of a user and the quality of a document. In addition, there is a need to rank entities related more closely to a certain entity. Considering the property of social media that ensures the popularity of a topic is temporary, recent data should have more weight than old data. We propose a comprehensive folksonomy ranking framework in which all these considerations are dealt with and that can be easily customized to each folksonomy site for ranking purposes. To examine the validity of our ranking algorithm and show the mechanism of adjusting property, time, and expertise weights, we first use a dataset designed for analyzing the effect of each ranking factor independently. We then show the ranking results of a real folksonomy site, with the ranking factors combined. Because the ground truth of a given dataset is not known when it comes to ranking, we inject simulated data whose ranking results can be predicted into the real dataset and compare the ranking results of our algorithm with that of a previous HITS-based algorithm. Our semantic ranking algorithm based on the concept of mutual interaction seems to be preferable to the HITS-based algorithm as a flexible folksonomy ranking framework. Some concrete points of difference are as follows. First, with the time concept applied to the property weights, our algorithm shows superior performance in lowering the scores of older data and raising the scores of newer data. Second, applying the time concept to the expertise weights, as well as to the property weights, our algorithm controls the conflicting influence of expertise weights and enhances overall consistency of time-valued ranking. The expertise weights of the previous study can act as an obstacle to the time-valued ranking because the number of followers increases as time goes on. Third, many new properties and classes can be included in our framework. The previous HITS-based algorithm, based on the voting notion, loses ground in the situation where the domain consists of more than two classes, or where other important properties, such as "sent through twitter" or "registered as a friend," are added to the domain. Forth, there is a big difference in the calculation time and memory use between the two kinds of algorithms. While the matrix multiplication of two matrices, has to be executed twice for the previous HITS-based algorithm, this is unnecessary with our algorithm. In our ranking framework, various folksonomy ranking policies can be expressed with the ranking factors combined and our approach can work, even if the folksonomy site is not implemented with Semantic Web languages. Above all, the time weight proposed in this paper will be applicable to various domains, including social media, where time value is considered important.