On the local irregularity vertex coloring of volcano, broom, parachute, double broom and complete multipartite graphs

Let [Formula: see text] be a simple, finite, undirected, and connected graph with vertex set [Formula: see text] and edge set [Formula: see text]. A bijection [Formula: see text] is label function [Formula: see text] if [Formula: see text] and for any two adjacent vertices [Formula: see text] and [Formula: see text], [Formula: see text] where [Formula: see text] and [Formula: see text] is set ofvertices adjacent to [Formula: see text]. [Formula: see text] is called local irregularity vertex coloring. The minimum cardinality of local irregularity vertex coloring of [Formula: see text] is called chromatic number local irregular denoted by [Formula: see text]. In this paper, we verify the exact values of volcano, broom, parachute, double broom and complete multipartite graphs.

Expanding a Database-derived Biomedical Knowledge Graph via Multi-relation Extraction from Biomedical Abstracts

Knowledge graphs support multiple research efforts by providing contextual information for biomedical entities, constructing networks, and supporting the interpretation of high-throughput analyses. These databases are populated via some form of manual curation, which is difficult to scale in the context of an increasing publication rate. Data programming is a paradigm that circumvents this arduous manual process by combining databases with simple rules and heuristics written as label functions, which are programs designed to automatically annotate textual data. Unfortunately, writing a useful label function requires substantial error analysis and is a nontrivial task that takes multiple days per function. This makes populating a knowledge graph with multiple nodes and edge types practically infeasible. We sought to accelerate the label function creation process by evaluating the extent to which label functions could be re-used across multiple edge types. We used a subset of an existing knowledge graph centered on disease, compound, and gene entities to evaluate label function re-use. We determined the best label function combination by comparing a baseline database-only model with the same model but added edge-specific or edge-mismatch label functions. We confirmed that adding additional edge-specific rather than edge-mismatch label functions often improves text annotation and shows that this approach can incorporate novel edges into our source knowledge graph. We expect that continued development of this strategy has the potential to swiftly populate knowledge graphs with new discoveries, ensuring that these resources include cutting-edge results.

‘Maybe she just hasn’t matured yet’: Politeness, gate-keeping and the maintenance of status quo in a community of practice

Politeness research has much to offer work that explores the complexities of gate-keeping in a community of practice. In this article I draw upon principles and terminology from politeness research to explore the tension that arises when members of a particular community of practice (a university field hockey team) who are morally opposed to homosexuality are confronted with the fact that some of their teammates are openly gay. This line of investigation relies upon a redefinition of politeness2: I define politeness2 as the moral compulsion to respect the boundaries around different levels of social structure, which include (but are not limited to) sets of attitudes, perspectives and priorities. In the hockey players’ community of practice, two moral priorities are in conflict: an aversion to homosexuality on the one hand, and a desire for a friendly, socially inclusive club on the other. I investigate the various evaluative resources participants draw upon/produce in this community, which include evaluation schemes based upon the labels “rude” and “im/mature”. I claim that the label “im/mature” – and concepts related to this label – function in this community as a means of concealing the conflict between the two moral priorities and maintaining a commitment to both.