In this paper, we exploit an exogenous change in the passing standard required to obtain a General Educational Development (GED) credential to identify the impact of the GED on the quarterly earnings of male dropouts, utilizing the Texas Schools Micro Data Panel (TSMP). These unique data contain demographic and GED test score information from the Texas Education Agency linked to preand post-tes...

In this paper we explore the labor market returns to the General Education Development exam, or GED, using data from the Current Population Survey. We examine how the return to the GED varies between U.S. natives and the foreign-born who received their formal education outside of the U.S. We find that the foreign-schooled with a GED earn significantly higher wages than both foreign-schooled dro...

MOTIVATION Analysis of expression quantitative trait loci (eQTL) significantly contributes to the determination of gene regulation programs. However, the discovery and analysis of associations of gene expression levels and their underlying sequence polymorphisms continue to pose many challenges. Methods are limited in their ability to illuminate the full structure of the eQTL data. Most rely on...

UNLABELLED This study evaluated the wound healing activity of a glycolic extract of Dillenia indica (GED) prepared from the mature fruits of the plant applied alone or in combination with microcurrent stimulation to skin wounds surgically induced on the back of Wistar rats. METHODS The animals were randomly divided into six groups: (A) negative control group; (B) group receiving micro...

Graph edit distance (GED) is an important similarity measure adopted in a similarity-based analysis between two graphs, and computing GED is a primitive operator in graph database analysis. Partially due to the NP-hardness, the existing techniques for computing GED are only able to process very small graphs with less than 30 vertices. Motivated by this, in this paper we systematically study the...

The graph edit distance (GED) is a flexible and widely used dissimilarity measure between graphs. Computing the GED between two graphs can be performed by solving a quadratic assignment problem (QAP). However, the problem is NP complete hence forbidding the computation of the optimal GED on large graphs. To tackle this drawback, recent heuristics are based on a linear approximation of the initi...

One of the most interesting topics in social network science are social groups, i.e. their extraction, dynamics and evolution. One year ago the method for group evolution discovery (GED) was introduced. The GED method during extraction process takes into account both the group members quality and quantity. The quality is reflected by user importance measure. In this paper the influence of diffe...

This paper examines the labor market value of the GED for females, questioning two implicit assumptions that have been employed in earlier studies. We show that providing access to work experience may be a critical mechanism through which education credentials impart labor market value and that the labor market value of the GED credential depends on the skills with which dropouts left school. O...

Graph similarity search is a common and fundamental operation in graph databases. One of the most popular graph similarity measures is the Graph Edit Distance (GED) mainly because of its broad applicability and high interpretability. Despite its prevalence, exact GED computation is proved to be NP-hard, which could result in unsatisfactory computational efficiency on large graphs. However, exac...