• 제목/요약/키워드: graph of groups

검색결과 178건 처리시간 0.023초

An Empirical Study of Absolute-Fairness Maximal Balanced Cliques Detection Based on Signed Attribute Social Networks: Considering Fairness and Balance

  • Yixuan Yang;Sony Peng;Doo-Soon Park;Hye-Jung Lee;Phonexay Vilakone
    • Journal of Information Processing Systems
    • /
    • 제20권2호
    • /
    • pp.200-214
    • /
    • 2024
  • Amid the flood of data, social network analysis is beneficial in searching for its hidden context and verifying several pieces of information. This can be used for detecting the spread model of infectious diseases, methods of preventing infectious diseases, mining of small groups and so forth. In addition, community detection is the most studied topic in social network analysis using graph analysis methods. The objective of this study is to examine signed attributed social networks and identify the maximal balanced cliques that are both absolute and fair. In the same vein, the purpose is to ensure fairness in complex networks, overcome the "information cocoon" bottleneck, and reduce the occurrence of "group polarization" in social networks. Meanwhile, an empirical study is presented in the experimental section, which uses the personal information of 77 employees of a research company and the trust relationships at the professional level between employees to mine some small groups with the possibility of "group polarization." Finally, the study provides suggestions for managers of the company to align and group new work teams in an organization.

REGULAR MAPS-COMBINATORIAL OBJECTS RELATING DIFFERENT FIELDS OF MATHEMATICS

  • Nedela, Roman
    • 대한수학회지
    • /
    • 제38권5호
    • /
    • pp.1069-1105
    • /
    • 2001
  • Regular maps and hypermaps are cellular decompositions of closed surfaces exhibiting the highest possible number of symmetries. The five Platonic solids present the most familar examples of regular maps. The gret dodecahedron, a 5-valent pentagonal regular map on the surface of genus 5 discovered by Kepler, is probably the first known non-spherical regular map. Modern history of regular maps goes back at least to Klein (1878) who described in [59] a regular map of type (3, 7) on the orientable surface of genus 3. In its early times, the study of regular maps was closely connected with group theory as one can see in Burnside’s famous monograph [19], and more recently in Coxeter’s and Moser’s book [25] (Chapter 8). The present-time interest in regular maps extends to their connection to Dyck\`s triangle groups, Riemann surfaces, algebraic curves, Galois groups and other areas, Many of these links are nicely surveyed in the recent papers of Jones [55] and Jones and Singerman [54]. The presented survey paper is based on the talk given by the author at the conference “Mathematics in the New Millenium”held in Seoul, October 2000. The idea was, on one hand side, to show the relationship of (regular) maps and hypermaps to the above mentioned fields of mathematics. On the other hand, we wanted to stress some ideas and results that are important for understanding of the nature of these interesting mathematical objects.

  • PDF

Coactivity of Mast Cells and Stem Cells on Angiogenesis and Antioxidants' Potentials at Inflammation, Proliferation, and Tissue Remodeling Phases of Wound

  • Mousavi, Mahshad;Khanifar, Ahmad;Mousavi, Nazanin;Anbari, Khatereh;Chehelcheraghi, Farzaneh
    • Archives of Plastic Surgery
    • /
    • 제49권3호
    • /
    • pp.462-470
    • /
    • 2022
  • Background Reactive oxygen species cause serious damage to the physiological function of tissues. Determination of total antioxidant capacity of skin tissue is one of the determinants of damaged tissue function. Mast cells (MCs) are one of the groups of cells that are invited to the site of injury. The healing process begins with the rapid release of various types of MCs' intermediate factors at the site of injury. Bone marrow mesenchymal stem cell (BMMSC) production and secretion have been shown to regenerate the skin. The aim of this research was to evaluate the wound-healing and antioxidant effects of BMMSCs per MCs. Methods Fifty-four albino Wistar male rats were divided into three groups: (1) nonsurgery, (2) surgery, and (3) surgery + BMMSCs. Groups 2 and 3 were operated with a 3 × 8 cm flap and in group 3, cell injections (7 × 109 cell injection at the time of surgery) were performed. After days 4, 7, and 15, percentage of the surviving tissue, histological characteristics, superoxide dismutase (SOD) activity, and amount of malondialdehyde (MDA) were measured in the groups. For results, Graph Pad Prism 8 software was used, and data were analyzed and compared by analysis of variance and Tukey test. Results BMMSCs' application decreased the amount of MDA, increased SOD activity and survival rate of the flaps, and improved the histological characteristics. Conclusion This study revealed the protective effects BMMSCs alongside MCs against oxidative stress on the survival of the flaps. However, for clinical use, more research is needed to determine its benefits.

Resource Allocation and EE-SE Tradeoff for H-CRAN with NOMA-Based D2D Communications

  • Wang, Jingpu;Song, Xin;Dong, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권4호
    • /
    • pp.1837-1860
    • /
    • 2020
  • We propose a general framework for studying resource allocation problem and the tradeoff between spectral efficiency (SE) and energy efficiency (EE) for downlink traffic in power domain-non-orthogonal multiple access (PD-NOMA) and device to device (D2D) based heterogeneous cloud radio access networks (H-CRANs) under imperfect channel state information (CSI). The aim is jointly optimize radio remote head (RRH) selection, spectrum allocation and power control, which is formulated as a multi-objective optimization (MOO) problem that can be solved with weighted Tchebycheff method. We propose a low-complexity algorithm to solve user association, spectrum allocation and power coordination separately. We first compute the CSI for RRHs. Then we study allocating the cell users (CUs) and D2D groups to different subchannels by constructing a bipartite graph and Hungrarian algorithm. To solve the power control and EE-SE tradeoff problems, we decompose the target function into two subproblems. Then, we utilize successive convex program approach to lower the computational complexity. Moreover, we use Lagrangian method and KKT conditions to find the global optimum with low complexity, and get a fast convergence by subgradient method. Numerical simulation results demonstrate that by using PD-NOMA technique and H-CRAN with D2D communications, the system gets good EE-SE tradeoff performance.

고등학교 학생들의 로그함수에 대한 이해도 및 오류에 관한 연구 (A Study on the Understanding and Errors of the Logarithmic Function in High School Students)

  • 이경숙;김승동
    • 한국학교수학회논문집
    • /
    • 제5권1호
    • /
    • pp.111-122
    • /
    • 2002
  • The purpose of this study was to examine high school second graders' understanding of the basic nature of logarithm, the major type of error they made about logarithmic function and the cause of such an error, and to seek ways to instruct it better. For that purpose, three research questions were posed: 1. Investigate how much high school students in their second year comprehend the nature of logarithm. 2. Analyze what type of error they make about logarithmic function. 3. Analyze the cause of their error according to the selected error models and how it could be taught more efficiently. The findings of this study were as below: First, the natural science students had a better understanding of the basic nature of logarithm than the academic students. What produced the widest gap between the two groups' understanding was applying the nature of logarithm to the given problems, and what caused the smallest gap was the definition of logarithm and the condition of base. Second, the academic students had a poorer understanding of the basic nature of logarithmic function graph and of applying the nature of logarithm to the given problems. Third, the natural science students didn't comprehend well the basic nature of logarithmic function graph, the nature of characteristics and mantissa. Fourth, for all the students from academic and natural science courses, the most common errors were caused by the poor understanding of theorem or nature of the [E4] model. Fifth, the academic students made more frequent errors due to the unfamiliar signs of the [El] model, the imperfect understanding of theorem or nature of the [E4] model, and the technical part of the [E6] model. Sixth, the natural science students made more frequent errors because of the improper problem interpretation of the [E2] model and the logically improper inference of the [E3] model.

  • PDF

Creating Subnetworks from Transcriptomic Data on Central Nervous System Diseases Informed by a Massive Transcriptomic Network

  • Feng, Yaping;Syrkin-Nikolau, Judith A.;Wurtele, Eve S.
    • Interdisciplinary Bio Central
    • /
    • 제5권1호
    • /
    • pp.1.1-1.8
    • /
    • 2013
  • High quality publicly-available transcriptomic data representing relationships in gene expression across a diverse set of biological conditions is used as a context network to explore transcriptomics of the CNS. The context network, 18367Hu-matrix, contains pairwise Pearson correlations for 22,215 human genes across18,637 human tissue samples1. To do this, we compute a network derived from biological samples from CNS cells and tissues, calculate clusters of co-expressed genes from this network, and compare the significance of these to clusters derived from the larger 18367Hu-matrix network. Sorting and visualization uses the publicly available software, MetaOmGraph (http://www.metnetdb.org/MetNet_MetaOm-Graph.htm). This identifies genes that characterize particular disease conditions. Specifically, differences in gene expression within and between two designations of glial cancer, astrocytoma and glioblastoma, are evaluated in the context of the broader network. Such gene groups, which we term outlier-networks, tease out abnormally expressed genes and the samples in which this expression occurs. This approach distinguishes 48 subnetworks of outlier genes associated with astrocytoma and glioblastoma. As a case study, we investigate the relationships among the genes of a small astrocytoma-only subnetwork. This astrocytoma-only subnetwork consists of SVEP1, IGF1, CHRNA3, and SPAG6. All of these genes are highly coexpressed in a single sample of anaplastic astrocytoma tumor (grade III) and a sample of juvenile pilocytic astrocytoma. Three of these genes are also associated with nicotine. This data lead us to formulate a testable hypothesis that this astrocytoma outlier-network provides a link between some gliomas/astrocytomas and nicotine.

Student Group Division Algorithm based on Multi-view Attribute Heterogeneous Information Network

  • Jia, Xibin;Lu, Zijia;Mi, Qing;An, Zhefeng;Li, Xiaoyong;Hong, Min
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권12호
    • /
    • pp.3836-3854
    • /
    • 2022
  • The student group division is benefit for universities to do the student management based on the group profile. With the widespread use of student smart cards on campus, especially where students living in campus residence halls, students' daily activities on campus are recorded with information such as smart card swiping time and location. Therefore, it is feasible to depict the students with the daily activity data and accordingly group students based on objective measuring from their campus behavior with some regular student attributions collected in the management system. However, it is challenge in feature representation due to diverse forms of the student data. To effectively and comprehensively represent students' behaviors for further student group division, we proposed to adopt activity data from student smart cards and student attributes as input data with taking account of activity and attribution relationship types from different perspective. Specially, we propose a novel student group division method based on a multi-view student attribute heterogeneous information network (MSA-HIN). The network nodes in our proposed MSA-HIN represent students with their multi-dimensional attribute information. Meanwhile, the edges are constructed to characterize student different relationships, such as co-major, co-occurrence, and co-borrowing books. Based on the MSA-HIN, embedded representations of students are learned and a deep graph cluster algorithm is applied to divide students into groups. Comparative experiments have been done on a real-life campus dataset collected from a university. The experimental results demonstrate that our method can effectively reveal the variability of student attributes and relationships and accordingly achieves the best clustering results for group division.

The number of maximal independent sets of (k+1) -valent trees

  • 한희원;이창우
    • 한국전산응용수학회:학술대회논문집
    • /
    • 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
    • /
    • pp.16.1-16
    • /
    • 2003
  • A subset S of vertices of a graph G is independent if no two vertices of S are adjacent by an edge in G. Also we say that S is maximal independent if it is contained In no larger independent set in G. A planted plane tree is a tree that is embedded in the plane and rooted at an end-vertex. A (k+1) -valent tree is a planted plane tree in which each vertex has degree one or (k+1). We classify maximal independent sets of (k+1) -valent trees into two groups, namely, type A and type B maximal independent sets and consider specific independent sets of these trees. We study relations among these three types of independent sets. Using the relations, we count the number of all maximal independent sets of (k+1) -valent trees with n vertices of degree (k+1).

  • PDF

Modeling Dynamic Business Rules using A Dynamic Knowledge Approach

  • Karami, Nasser;Iijima, Junichi
    • Industrial Engineering and Management Systems
    • /
    • 제6권1호
    • /
    • pp.72-82
    • /
    • 2007
  • Business Rules are formal statements about the data and processes of an enterprise. They present projections of the organization's constraints and ways of working on their supporting information systems. Therefore, their collection, structuring and organization should be central activities within information systems. In an enterprise, business rules are used to represent certain aspects of a business domain (static rules) or business policy (dynamic rules). Hence, regarding problem domains in the organization, business rules are classified into two groups: static and dynamic business rules. The paper introduces a new concept of business rules, Extended Dynamic Business Rule (EDBR) which contains the results of the occurrence of business rule's action. The focus of this paper is in the organizing, defining and modeling of such business rules using Mineau's approach. Mineau's approach is an extension of Sowa's Conceptual Graph theory.

QUASI m-CAYLEY STRONGLY REGULAR GRAPHS

  • Kutnar, Klavdija;Malnic, Aleksander;Martinez, Luis;Marusic, Dragan
    • 대한수학회지
    • /
    • 제50권6호
    • /
    • pp.1199-1211
    • /
    • 2013
  • We introduce a new class of graphs, called quasi $m$-Cayley graphs, having good symmetry properties, in the sense that they admit a group of automorphisms G that fixes a vertex of the graph and acts semiregularly on the other vertices. We determine when these graphs are strongly regular, and this leads us to define a new algebro-combinatorial structure, called quasi-partial difference family, or QPDF for short. We give several infinite families and sporadic examples of QPDFs. We also study several properties of QPDFs and determine, under several conditions, the form of the parameters of QPDFs when the group G is cyclic.