• Title/Summary/Keyword: g-index

Search Result 2,938, Processing Time 0.019 seconds

A Proposal on Modified g-index for Evaluating Research Performance (연구성과 평가를 위한 g-지수의 변형 지수 제안)

  • Lee, Jae Yun
    • Journal of the Korean Society for information Management
    • /
    • v.34 no.3
    • /
    • pp.209-228
    • /
    • 2017
  • This study suggests a new Hirsch-type composite index, 'transposed g-index' with a different viewpoint on h-index and g-index. From this new point of view, the axes of the graph describing the h-index and g-index are transposed so that the horizontal axis corresponds to the citation frequency threshold and the vertical axis corresponds to the number of documents. Based on this transposed graph, a new indicator transposed g-index is suggested and applied to library and information science researchers' outcomes in Korean Citation Index database. The results show that this new index has more discriminating power than h-index and g-index, and is more sensitive to differences in quantitative aspects than quality of research. It is expected that the transposed g-index will be helpful for the multifaceted evaluation of the research outcome because it has differentiating characteristics that distinguish consistent researchers who continue to study from those who do not.

Distance Eccentric Connectivity Index of Graphs

  • Alqesmah, Akram;Saleh, Anwar;Rangarajan, R.;Gunes, Aysun Yurttas;Cangul, Ismail Naci
    • Kyungpook Mathematical Journal
    • /
    • v.61 no.1
    • /
    • pp.61-74
    • /
    • 2021
  • Let G = (V, E) be a connected graph. The eccentric connectivity index of G is defined by ��C (G) = ∑u∈V (G) deg(u)e(u), where deg(u) and e(u) denote the degree and eccentricity of the vertex u in G, respectively. In this paper, we introduce a new formulation of ��C that will be called the distance eccentric connectivity index of G and defined by $${\xi}^{De}(G)\;=\;{\sum\limits_{u{\in}V(G)}}\;deg^{De}(u)e(u)$$ where degDe(u) denotes the distance eccentricity degree of the vertex u in G. The aim of this paper is to introduce and study this new topological index. The values of the eccentric connectivity index is calculated for some fundamental graph classes and also for some graph operations. Some inequalities giving upper and lower bounds for this index are obtained.

JONES' INDEX FOR FIXED POINT ALGEBRAS

  • Lee, Jung-Rye
    • Communications of the Korean Mathematical Society
    • /
    • v.13 no.1
    • /
    • pp.29-36
    • /
    • 1998
  • We show that if M is a $II_1$-factor and a countable discrete group G acts outerly on M then Jones' index $[M:M^G]$ of a pair of $II_1^-factors is equal to the order $\mid$G$\mid$ of G. It is also shown that for a subgroup H of G Jones' index $[M^H:M^G]$ is equal to the group index [G:H] under certain conditions.

  • PDF

Triglyceride and Glucose (TyG) Index is a Clinical Surrogate Marker for the Diagnosis of Metabolic Syndrome

  • Shin, Kyung-A
    • Biomedical Science Letters
    • /
    • v.23 no.4
    • /
    • pp.348-354
    • /
    • 2017
  • TyG (triglyceride and glucose) index using triglyceride and fasting blood glucose is recommended as a useful marker for insulin resistance. The present study evaluated the usefulness of TyG index in diagnosing metabolic syndrome and suggested an optimal cut-off value. The subjects of this study were adult 4,415 adults aged 20 to 80 years who underwent health screening at J General Hospital from January 2016 to January 2017. Metabolic syndrome was based on AHA/NHLBI (American Heart Association/National Heart, Lung, and Blood Institute) criteria. TyG index correlated with metabolic syndrome risk factors including HOMA-IR. Compared with the participants in the lowest quartile of TyG index, odds ratios and 95% confidence intervals for metabolic syndrome were 8.5 (3.005~23.903), 20.0 (17.190~23.407) for those in the third, and the fourth quartile of TyG index. The optimal cut-off value of the metabolic syndrome was 8.81 for TyG index (sensitivity 86.7%, specificity 80.1%) and area under the ROC curve (AUC) was 0.894. In conclusion, TyG index is effective to identify individuals at risk for metabolic syndrome.

Usefulness of Triglyceride and Glucose Index to Predict the Risk of Hyperuricemia in Korean Adults (한국 성인에서 고요산혈증 위험을 예측하기 위한 중성지방-혈당 지수의 유용성)

  • Shin, Kyung-A;Kim, Eun Jae
    • Journal of the Korea Convergence Society
    • /
    • v.11 no.12
    • /
    • pp.283-290
    • /
    • 2020
  • The purpose of this study was to evaluate the usefulness of the triglyceride and glucose(TyG) index to predict the risk of hyperuricemia in Korean adults. This study included 14,266 men and 9,033 women over 20 years old who underwent health screenings from 2017 to 2019 at a general hospital in Seoul. To confirm the risk of hyperuricemia and predictive ability of the TyG index, logistic regression analysis and ROC curves were obtained. The accuracy of the TyG index for predicting hyperuricemia was 0.68, 0.61 for men and 0.67 for women(respectively p<0.001). The risk of hyperuricemia in the TyG index was 1.69 times higher in the fourth quartile than in the first quartile, 2.03 times higher in men and 2.07 times higher in women(respectively p<0.05). Thus the TyG index was not of high diagnostic usefulness as a screening test for hyperuricemia, but it was related to the TyG index and hyperuricemia.

New index for the gifted students(G-Index) with EEG analysis (뇌파검사 자료를 기반으로 한 과학영재 판별 지수(G-Index) 개발과 적용)

  • Kim, Kyung-Hwa;Kim, Kyu-Han;Lee, Sun-Kil;Hur, Myung;Kim, Yong-Jin
    • Journal of Gifted/Talented Education
    • /
    • v.15 no.1
    • /
    • pp.67-84
    • /
    • 2005
  • In this study we investigated the adequacy of tools for distinction gifted students through the comparison these mutual relation on the basis of data, like paper test, the depths interview score, and the rest data((TTCT: Torrance Tests of Creative Thinking, IQ test, FASP: Find A Shape Puzzle, V.T: Visualization Tests and Exp: experimental ability test), and analysis data of EEG test for examining the adequacy of tools for identification gifted students. So, we developed Brain Wave gifted Index(G-Index) for finding another distinction ability as using brain waves data. The standard of index development use gifted brain characteristic in closed-eyes rest state which is judged like that characteristic of distinction between gifted and normal students is the most clear and consistence. That is, the degree of unified pattern between each object and gifted PCA pattern was defined by Pearson method which added spatial mutual index to weight concept. This refer to mean number of spatial PCA pattern. Searching for the possibility of distinction gifted gave distinction effect in 76%. The result of regression analysis on the basis of mutual relation between the rest data is . The probability formula for distinct gifted group is as follow. $$P=\frac 1{1+e^{-[-0.018(TTCT)+0.057(IQ)+1.916(FASP)+0.682(V.T)+0.088(Exp.)+0.034(G-Index)-57.510]}}$$ The result of this calculation showed that probability for distinct in gifted group was very good(95.0%). On the basis of upper result, tools for identification gifted students should be estimated as using many-sided estimation data whatever possible. And following study about development, and operation of tools for distinction suitable to gifted student in science should be progressed.

BOUNDS ON THE HYPER-ZAGREB INDEX

  • FALAHATI-NEZHAD, FARZANEH;AZARI, MAHDIEH
    • Journal of applied mathematics & informatics
    • /
    • v.34 no.3_4
    • /
    • pp.319-330
    • /
    • 2016
  • The hyper-Zagreb index HM(G) of a simple graph G is defined as the sum of the terms (du+dv)2 over all edges uv of G, where du denotes the degree of the vertex u of G. In this paper, we present several upper and lower bounds on the hyper-Zagreb index in terms of some molecular structural parameters and relate this index to various well-known molecular descriptors.

Calculating the h-index and Its Variants Considering the Number of Authors in a Paper (공저자 수를 고려한 h-지수 산출)

  • Lee, Jae Yun
    • Journal of the Korean Society for information Management
    • /
    • v.33 no.3
    • /
    • pp.7-29
    • /
    • 2016
  • The h-index is a popular bibliometric indicator for evaluating individual researchers. However, it has been criticized for its inconsistency with reflecting increased number of citations and disregarding the number of co-authors in a paper. In order to overcome these problems, we examined the g-index and other Hirsch-type indices considering the number of co-authors. Test data collection was extracted from Korean Citation Index database published from 2004 to 2013. The results of this study are as follows: First, g-index is more reliable indicator than h-index with consistency. Second, number of co-authors must be considered to maintain the h-index as an complex indicator applying the quality and the quantity of research performance. Finally, hc-index and gc-index, with fractionalised counting of the papers, can fairly measure the research performance of humanities researchers, and successfully prevent specific disciplines or institutions occupying majority of top rankings.

DISTINGUISHING NUMBER AND DISTINGUISHING INDEX OF STRONG PRODUCT OF TWO GRAPHS

  • Alikhani, Saeid;Soltani, Samaneh
    • Honam Mathematical Journal
    • /
    • v.42 no.4
    • /
    • pp.645-651
    • /
    • 2020
  • The distinguishing number (index) D(G) (D'(G)) of a graph G is the least integer d such that G has an vertex labeling (edge labeling) with d labels that is preserved only by a trivial automorphism. The strong product G ☒ H of two graphs G and H is the graph with vertex set V (G) × V (H) and edge set {{(x1, x2),(y1, y2)}|xiyi ∈ E(Gi) or xi = yi for each 1 ≤ i ≤ 2.}. In this paper we study the distinguishing number and the distinguishing index of strong product of two graphs. We prove that for every k ≥ 2, the k-th strong power of a connected S-thin graph G has distinguishing index equal two.

THE NORMALIZED LAPLACIAN ESTRADA INDEX OF GRAPHS

  • Hakimi-Nezhaad, Mardjan;Hua, Hongbo;Ashrafi, Ali Reza;Qian, Shuhua
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.1_2
    • /
    • pp.227-245
    • /
    • 2014
  • Suppose G is a simple graph. The ${\ell}$-eigenvalues ${\delta}_1$, ${\delta}_2$,..., ${\delta}_n$ of G are the eigenvalues of its normalized Laplacian ${\ell}$. The normalized Laplacian Estrada index of the graph G is dened as ${\ell}EE$ = ${\ell}EE$(G) = ${\sum}^n_{i=1}e^{{\delta}_i}$. In this paper the basic properties of ${\ell}EE$ are investigated. Moreover, some lower and upper bounds for the normalized Laplacian Estrada index in terms of the number of vertices, edges and the Randic index are obtained. In addition, some relations between ${\ell}EE$ and graph energy $E_{\ell}$(G) are presented.