Search

The second plenary meeting of the International Telecommunication Union Telecommunication Standardization Sector (ITU-T) Study Group (SG) 2 for the 2022--2024 study period was held virtually from March 13th to 22nd, 2023 with 137 participants from 42 countries. SG2 consists of Working Party (WP) 1, which standardizes numbers and identifiers, and WP2, which standardizes network management. In this article, we report on the status of WP1. As telecommunications services progress, SG2's activities related to numbers and identifiers have become broader. We categorize them into nine issues and report on the status of activities for each issue. [ABSTRACT FROM AUTHOR]

Entity management in a Linked Open Data (LOD) environment is a process of associating a unique, persistent, and dereferenceable Uniform Resource Identifier (URI) with a single entity. It allows data from various sources to be reused and connected to the Web. It can help improve data quality and enable more efficient workflows. This article describes a semi-automated entity management project conducted by the "Wikidata: WikiProject Chinese Culture and Heritage Group," explores the challenges and opportunities in describing Chinese women poets and historical places in Wikidata, the largest crowdsourcing LOD platform in the world, and discusses lessons learned and future opportunities. [ABSTRACT FROM AUTHOR]

This article is concerned with the problem of implementing an unbounded timestamp object from multiwriter atomic registers, in an asynchronous distributed system of n processes with distinct identifiers where timestamps are taken from an arbitrary universe. Ellen et al. [2008] showed that √n/2 - O(1) registers are required for any obstruction-free implementation of long-lived timestamp systems from atomic registers (meaning processes can repeatedly get timestamps). We improve this existing lower bound in two ways. First we establish a lower bound of n/6 - 1 registers for the obstruction-free long-lived timestamp problem. Previous such linear lower bounds were only known for constrained versions of the timestamp problem. This bound is asymptotically tight; Ellen et al. [2008] constructed a wait-free algorithm that uses n - 1 registers. Second we show that √2n-log n-O(1) registers are required for any obstruction-free implementation of one-shot timestamp systems (meaning each process can get a timestamp at most once). We show that this bound is also asymptotically tight by providing a wait-free one-shot timestamp system that uses at most [2√n] registers, thus establishing a space complexity gap between one-shot and long-lived timestamp systems. [ABSTRACT FROM AUTHOR]

The finding by the OSIRIS‐REx (Origins, Spectral Interpretation, Resource Identification, and Security‐Regolith Explorer) mission that its target (101955) Bennu is an active asteroid has raised questions as to whether the observed particle ejection events are driven by temperature. To investigate sublimation of water ice and rock thermal fracture as possible temperature‐driven causes, we modeled the global temperatures of Bennu and searched for correlations with the identified ejection points on the asteroid surface. We computed temperatures with the Advanced Thermophysical Model and the 75‐cm‐resolution global shape model of Bennu derived by the OSIRIS‐REx mission. We find that ~1,856 m2 of Bennu's polar regions have orbit‐averaged temperatures that are sufficiently cold to enable water ice, if buried within the top few meters of the surface, to remain stable over geological timescales. Millimeter thick layers of surface water ice are also stable over ~103‐year timescales within polar centimeter‐scale cold traps. However, we do not find evidence of conditions enabling ice stability in the warmer equatorial regions, where ejection events have been observed, implying that sublimation of water ice is not the cause of particle ejection. Conversely, rock thermal fracture remains a possible mechanism of particle ejection. We find high amplitudes of diurnal temperature variation, a proxy for the efficacy of thermal fracturing, at all latitudes on Bennu due to its extreme ruggedness. Therefore, if rock thermal fracture is the mechanism, particles could be ejected from any latitude, which is consistent with the continued observations of particle ejection by OSIRIS‐REx. Plain Language Summary: The OSIRIS‐REx mission discovered that particles are being ejected periodically from the surface of near‐Earth asteroid Bennu. Some hypotheses for the process (es) driving these ejection events relate to temperature. These include sublimation of volatile substances such as water (like in a comet) and thermal fracturing (cracking of rocks driven by day‐night temperature changes). To evaluate these hypotheses, we performed numerical simulations of temperatures across the surface of Bennu over its orbit. Temperatures on the majority of the surface, including at the ejection sites, are too warm for water ice to be present, even if covered by dust. We therefore conclude that sublimation of water ice is not responsible for the particle ejections. Nevertheless, portions of the polar regions are cold enough that subsurface water ice could exist. Small (centimeter‐scale) cold traps near the poles could store surface water ice for up to ~1,000 years. We find that thermal fracturing is a viable mechanism to explain the particle ejections because Bennu exhibits large day‐night differences in temperature. These large temperature differences occur even at high latitudes on the sunward facing sides of boulders. This widespread viability of thermal fracturing is consistent with the observation of particles ejecting from various latitudes on Bennu. Key Points: Modeled temperatures indicate that water ice sublimation is not the process ejecting particles from the surface of BennuSubsurface water ice however could be stable in small regions near the polesThe diurnal temperature curve has a large amplitude at all latitudes, which supports thermal fracturing as a cause of the ejection events [ABSTRACT FROM AUTHOR]

The article announces the ALCTS CaMMS Heads of Cataloging Departments Interest Group Meeting at American Library Association Annual Conference, Washington, DC, on June 24, 2019. Topics include focusing on the use of International Standard Name Identifiers (ISNIs) for named entities in records for their digital repository collections; adding Uniform Resource Identifiers (URIs) to their genre and subject heading; and adding terms from the Faceted Applications including Subject Terminology (FAST).

From its modest beginnings in the mid 1970s as a small research and development unit of Online Computer Library Center, Inc. (OCLC), OCLC Research has evolved to become a significant research organization, a preeminent laboratory for the exploration of innovative uses of library data and information system technology, and a key agent of change, advancing the state of the art within OCLC and in the global library and information science community. OCLC Research is one of the world's leading centers devoted to exploration, innovation, and community building on behalf of libraries, archives, and museums and is dedicated to helping memory institutions more effectively serve users of information, information systems, and cultural heritage collections. [ABSTRACT FROM AUTHOR]

In recent years, an increasing number of knowledge bases have been built using linked data, thus datasets have grown substantially. It is neither reasonable to store a large amount of triple data in a single graph, nor appropriate to store RDF in named graphs by class URIs, because many joins can cause performance problems between graphs. This paper presents an agglomerative-adapted approach for large-scale graphs, which is also a bottom-up merging process. The proposed algorithm can partition triples data in three levels: blank nodes, associated nodes, and inference nodes. Regarding blank nodes and classes/nodes involved in reasoning rules, it is better to store with an optimal neighbor node in the same partition instead of splitting into separate partitions. The process of merging associated nodes, needs to start with the node in the smallest cost and then repeat it until the final number of partitions is met. Finally, the feasibility and rationality of the merging algorithm are analyzed in detail through bibliographic cases. In summary, the partitioning methods proposed in this paper can be applied in distributed storage, data retrieval, data export, and semantic reasoning of large-scale triples graphs. In the future, we will research the automation setting of the number of partitions with machine learning algorithms. [ABSTRACT FROM AUTHOR]

The article analizes characteristics, definition, constitution, and technologies adopted for designing and implementing ontologies within the Semantic Web framework. Therefore, it describes relationships between Web ontologies and Linked Open Data (LOD), Resource Description Framework (RDF) model, Web Ontology Language (WQL), Simple Protocol and RDF Query Language (SPARQL) and Uniform Resources Identifiers (URIs). The study deals with naming, lexicalizing, localization and serializing. It identifies the most used methodologies for developing Web ontologies. The work describes the method proposed by Stuart (2016). According to this author, this article considers decisions about ontologies methods design representing Argentine scientific and academic research. It underlines the importance of methodological stage in the creation process of applied ontologies to optimizing their capacity of automatic inference. [ABSTRACT FROM AUTHOR]

Copyright of Ciência da Informação is the property of Instituto Brasileiro de Informacao em Ciencia e Tecnologia (IBICT) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Using appropriate entity URIs is a crucial factor for the success of semantic-enabled applications for data management and data retrieval. Especially data applications that collect data to build knowledge graphs rely on correct concept identifiers in favor of ambiguous literals. This collection involves human interaction in the web frontend without annoying the user. But appropriate user interfaces for this task are still a challenge. In this article, we focus on the design of form elements that unobtrusively allow input data both for human and machine interaction from a semantic point of view. Motivated by web-based scholarly document-submission systems, we first present a brief current-state analysis on the support of semantic input operations, investigate how these users input interfaces can be improved for concept linking purposes with an auto-suggestion behavior and finally evaluate with a proof-of concept implementation and user survey the advantages and acceptance of our approach. [ABSTRACT FROM AUTHOR]

Science is conducted collaboratively, often requiring the sharing of knowledge about computational experiments. When experiments include only datasets, they can be shared using Uniform Resource Identifiers (URIs) or Digital Object Identifiers (DOIs). An experiment, however, seldom includes only datasets, but more often includes software, its past execution, provenance, and associated documentation. The Research Object has recently emerged as a comprehensive and systematic method for aggregation and identification of diverse elements of computational experiments. While a necessary method, mere aggregation is not sufficient for the sharing of computational experiments. Other users must be able to easily recompute on these shared research objects. Computational provenance is often the key to enable such reuse. In this paper, we show how reusable research objects can utilize provenance to correctly repeat a previous reference execution, to construct a subset of a research object for partial reuse, and to reuse existing contents of a research object for modified reuse. We describe two methods to summarize provenance that aid in understanding the contents and past executions of a research object. The first method obtains a process-view by collapsing low-level system information, and the second method obtains a summary graph by grouping related nodes and edges with the goal to obtain a graph view similar to application workflow. Through detailed experiments, we show the efficacy and efficiency of our algorithms. [ABSTRACT FROM AUTHOR]

Abstract: The entity linking task consists in automatically identifying and linking the entities mentioned in a text to their uniform resource identifiers in a given knowledge base. This task is very challenging due to its natural language ambiguity. However, not all the entities mentioned in the document have the same utility in understanding the topics being discussed. Thus, the related problem of identifying the most relevant entities present in the document, also known as salient entities (SE), is attracting increasing interest. In this paper, we propose salient entity linking, a novel supervised 2‐step algorithm comprehensively addressing both entity linking and saliency detection. The first step is aimed at identifying a set of candidate entities that are likely to be mentioned in the document. The second step, besides detecting linked entities, also scores them according to their saliency. Experiments conducted on 2 different data sets show that the proposed algorithm outperforms state‐of‐the‐art competitors and is able to detect SE with high accuracy. Furthermore, we used salient entity linking for extractive text summarization. We found that entity saliency can be incorporated into text summarizers to extract salient sentences from text. The resulting summarizers outperform well‐known summarization systems, proving the importance of using the SE information. [ABSTRACT FROM AUTHOR]

Although it is not yet known for certain what will replace MARC, eventually bibliographic data will need to be transformed to move into a linked data environment. This article discusses why the National Library of Medicine chose to add Uniform Resource Identifiers for Medical Subject Headings as our starting point and details the process by which they were added to the MeSH MARC authority records, the legacy bibliographic records, and the records for newly cataloged items. The article outlines the various enhancement methods available, decisions made, and the rationale for the selected method. [ABSTRACT FROM PUBLISHER]

The CONSER BIBFRAME mapping project began in December 2015, and completed a mapping between the elements of the CONSER Standard Record and BIBFRAME 1.0. Subsequently, the group has converted that mapping to BIBFRAME 2.0, developed sample RDF serializations for each element, and is developing recommendations for PCC best practices. This article summarizes CONSER BIBFRAME mapping outcomes, describes Valerie Bross' contributions to the project, and presents topics for further consideration within the PCC: BIBFRAME development, and serials cataloging communities, including: changes to the description, literal vs. machine actionable data, enumeration and chronology information, modeling issues, and relationships. [ABSTRACT FROM PUBLISHER]

The aggregation of heterogeneous data from different institutions in cultural heritage and e-science has the potential to create rich data resources useful for a range of different purposes, from research to education and public interests. In this paper, we present the X3ML framework, a framework for information integration that handles effectively and efficiently the steps involved in schema mapping, uniform resource identifier (URI) definition and generation, data transformation, provision and aggregation. The framework is based on the X3ML mapping definition language for describing both schema mappings and URI generation policies and has a lot of advantages when compared with other relevant frameworks. We describe the architecture of the framework as well as details on the various available components. Usability aspects are discussed and performance metrics are demonstrated. The high impact of our work is verified via the increasing number of international projects that adopt and use this framework. [ABSTRACT FROM AUTHOR]

Automated computational materials science frameworks rapidly generate large quantities of materials data for accelerated materials design. In order to take advantage of these large databases, users should have the ability to efficiently search and extract the desired data. Therefore, we have extended the data-oriented AFLOW-repository A pplication- P rogram- I nterface (API) (Comput. Mater. Sci. 93 , 178 (2014)) to enable programmatic access to search queries. A U niform R esource I dentifier (URI)-based search API is proposed for the construction of complex queries for remote creation and retrieval of customized data sets. It is expected that the new language, AFLUX, from “ A utomatic F low of LUX (light)”, will enable remote search operations on the AFLOW set of computational materials science data repositories. In addition, AFLUX facilitates the verification and validation of the data in the AFLOW repositories. [ABSTRACT FROM AUTHOR]

The vehicle to represent Knowledge Organisation Systems (KOSs) in the environment of the Semantic Web and linked data is the Simple Knowledge Organisation System (SKOS). SKOS provides a way to assign a Uniform Resource Identifier (URI) to each concept, and this URI functions as a surrogate for the concept. This fact makes of main concern the need to clarify the URIs’ ontological meaning. The aim of this study is to investigate the relationship between the ontological substance of KOS concepts and concepts revealed through the grammatical and syntactic formalisms of natural language. For this purpose, we examined the dividableness of concepts in specific KOSs (i.e. a thesaurus, a subject headings system and a classification scheme) by applying Natural Language Processing (NLP) techniques (i.e. morphosyntactic analysis) to the lexical representations (i.e. RDF literals) of SKOS concepts. The results of the comparative analysis reveal that, despite the use of multi-word units, thesauri tend to represent concepts in a way that can hardly be further divided conceptually, while subject headings and classification schemes – to a certain extent – comprise terms that can be decomposed into more conceptual constituents. Consequently, SKOS concepts deriving from thesauri are more likely to represent atomic conceptual units and thus be more appropriate tools for inference and reasoning. Since identifiers represent the meaning of a concept, complex concepts are neither the most appropriate nor the most efficient way of modelling a KOS for the Semantic Web. [ABSTRACT FROM AUTHOR]

Existential blank nodes greatly complicate a number of fundamental operations on Resource Description Framework (RDF) graphs. In particular, the problems of determining if two RDF graphs have the same structure modulo blank node labels (i.e., if they are isomorphic), or determining if two RDF graphs have the same meaning under simple semantics (i.e., if they are simple-equivalent), have no known polynomial-time algorithms. In this article, we propose methods that can produce two canonical forms of an RDF graph. The first canonical form preserves isomorphism such that any two isomorphic RDF graphs will produce the same canonical form; this iso-canonical form is produced by modifying the well-known canonical labelling algorithm NAUTY for application to RDF graphs. The second canonical form additionally preserves simpleequivalence such that any two simple-equivalent RDF graphs will produce the same canonical form; this equi-canonical form is produced by, in a preliminary step, leaning the RDF graph, and then computing the iso-canonical form. These algorithms have a number of practical applications, such as for identifying isomorphic or equivalent RDF graphs in a large collection without requiring pairwise comparison, for computing checksums or signing RDF graphs, for applying consistent Skolemisation schemes where blank nodes are mapped in a canonical manner to Internationalised Resource Identifiers (IRIs), and so forth. Likewise a variety of algorithms can be simplified by presupposing RDF graphs in one of these canonical forms. Both algorithms require exponential steps in the worst case; in our evaluation we demonstrate that there indeed exist difficult synthetic cases, but we also provide results over 9.9 million RDF graphs that suggest such cases occur infrequently in the real world, and that both canonical forms can be efficiently computed in all but a handful of such cases. [ABSTRACT FROM AUTHOR]

Traditional computational models for enterprise software are still to a great extent centralized. However, rapid growing of modern computation techniques and frameworks causes that contemporary software becomes more and more distributed. Towards development of new complete and coherent solution for distributed enterprise software construction, synthesis of three well-grounded concepts is proposed: Domain-Driven Design technique of software engineering, REST architectural style and actor model of computation. As a result new resources-based framework arises, which after first cases of use seems to be useful and worthy of further research. [ABSTRACT FROM AUTHOR]

Robots working in teams can benefit from recruiting the help of nearby robots. But, while robots are typically aware of their neighbors' relative positions through information sensed locally (e.g., range and bearing), a robot does not necessarily know the network identifiers (IDs) of its neighbors directly from observation. In this work robots use a simple visual gesture, paired with wireless messages, to rapidly and effectively establish a one-to-one association between the relative positions (local, visual IDs) of neighboring robots and their network addresses (global, wireless IDs). We formalize the channel association problem and explore its structure from an information filter perspective. Under an idealized communication model, we investigate two simple probabilistic algorithms and contribute analyses of performance in terms of parameters, such as robot density, communication range, and movement speed. Branching Processes are used to predict the macroscopic performance of the algorithms, producing models that characterize the channel association behavior, given parameters that describe the multi-robot system. The approach also allows parameters to be fine-tuned when designing a system so that its performance meets some specified threshold. [ABSTRACT FROM AUTHOR]

Background: Toward improved interoperability of distributed biological databases, an increasing number of datasets have been published in the standardized Resource Description Framework (RDF). Although the powerful SPARQL Protocol and RDF Query Language (SPARQL) provides a basis for exploiting RDF databases, writing SPARQL code is burdensome for users including bioinformaticians. Thus, an easy-to-use interface is necessary. Results: We developed SPANG, a SPARQL client that has unique features for querying RDF datasets. SPANG dynamically generates typical SPARQL queries according to specified arguments. It can also call SPARQL template libraries constructed in a local system or published on the Web. Further, it enables combinatorial execution of multiple queries, each with a distinct target database. These features facilitate easy and effective access to RDF datasets and integrative analysis of distributed data. Conclusions: SPANG helps users to exploit RDF datasets by generation and reuse of SPARQL queries through a simple interface. This client will enhance integrative exploitation of biological RDF datasets distributed across the Web. [ABSTRACT FROM AUTHOR]

Background: Linkage of administrative data sources often relies on probabilistic methods using a set of common identifiers (e.g. sex, date of birth, postcode). Variation in data quality on an individual or organisational level (e.g. by hospital) can result in clustering of identifier errors, violating the assumption of independence between identifiers required for traditional probabilistic match weight estimation. This potentially introduces selection bias to the resulting linked dataset. We aimed to measure variation in identifier error rates in a large English administrative data source (Hospital Episode Statistics; HES) and to incorporate this information into match weight calculation.Methods: We used 30,000 randomly selected HES hospital admissions records of patients aged 0-1, 5-6 and 18-19 years, for 2011/2012, linked via NHS number with data from the Personal Demographic Service (PDS; our gold-standard). We calculated identifier error rates for sex, date of birth and postcode and used multi-level logistic regression to investigate associations with individual-level attributes (age, ethnicity, and gender) and organisational variation. We then derived: i) weights incorporating dependence between identifiers; ii) attribute-specific weights (varying by age, ethnicity and gender); and iii) organisation-specific weights (by hospital). Results were compared with traditional match weights using a simulation study.Results: Identifier errors (where values disagreed in linked HES-PDS records) or missing values were found in 0.11% of records for sex and date of birth and in 53% of records for postcode. Identifier error rates differed significantly by age, ethnicity and sex (p < 0.0005). Errors were less frequent in males, in 5-6 year olds and 18-19 year olds compared with infants, and were lowest for the Asian ethic group. A simulation study demonstrated that substantial bias was introduced into estimated readmission rates in the presence of identifier errors. Attribute- and organisational-specific weights reduced this bias compared with weights estimated using traditional probabilistic matching algorithms.Conclusions: We provide empirical evidence on variation in rates of identifier error in a widely-used administrative data source and propose a new method for deriving match weights that incorporates additional data attributes. Our results demonstrate that incorporating information on variation by individual-level characteristics can help to reduce bias due to linkage error. [ABSTRACT FROM AUTHOR]

The current Internet of Things (IoT) has made it very convenient to obtain information about a product from a single data node. However, in many industrial applications, information about a single product can be distributed in multiple different data nodes, and aggregating the information from these nodes has become a common task. In this paper, we provide a distributed service-oriented architecture for this task. In this architecture, each manufacturer provides service for their own products, and data nodes keep the information collected by themselves. Semantic technologies are adopted to handle problems of heterogeneity and serve as the foundation to support different applications. Finally, as an example, we illustrate the use of this architecture to solve the problem of product tracing. [ABSTRACT FROM AUTHOR]

Quality of data and interoperability are key for research information systems. Organisation identifiers enforce uniqueness and disambiguate institutional records ensuring necessary quality and consistency. The main goals of the present work are to create rules, principles and processes regarding registration of organisations in Portugal, to build a first version of an authoritative National Organisations Database, to develop an organisation reconciliation service and to set up a registration system for those organisations. The main outcome is the establishment of an organisation registration system and a mandatory national organisations database that syncs information between the main national and international registration systems like Ringgold and ISNI (ISNI+). [ABSTRACT FROM AUTHOR]

In 2015, the Cataloging and Metadata Services department of Rice University's Fondren Library developed a process to reconcile four years of authority headings against an internally developed thesaurus. With a goal of immediate cleanup as well as an ongoing maintenance procedure, staff developed a “hack” of OpenRefine's normal Reconciliation function that ultimately yielded 99.6% authority reconciliation and a stable process for monthly data verification. [ABSTRACT FROM PUBLISHER]

Link-shortening services save space and make the manual entry of URLs less onerous. Short links are often included on printed materials so that people using mobile devices can quickly enter URLs. Although mobile transcription is a common use-case, link-shortening services generate output that is poorly suited to entry on mobile devices: links often contain numbers and capital letters that require time consuming mode switches on touch screen keyboards. With the aid of computational modeling, we identified problems with the output of a link-shortening service, bit.ly . Based on the results of this modeling, we hypothesized that longer links that are optimized for input on mobile keyboards would improve link entry speeds compared to shorter links that required keyboard mode switches. We conducted a human performance study that confirmed this hypothesis. Finally, we applied our method to a selection of different non-word mobile data-entry tasks. This work illustrates the need for service design to fit the constraints of the devices people use to consume services. [ABSTRACT FROM AUTHOR]

Increasingly, scholarly articles contain URI references to “web at large” resources including project web sites, scholarly wikis, ontologies, online debates, presentations, blogs, and videos. Authors reference such resources to provide essential context for the research they report on. A reader who visits a web at large resource by following a URI reference in an article, some time after its publication, is led to believe that the resource’s content is representative of what the author originally referenced. However, due to the dynamic nature of the web, that may very well not be the case. We reuse a dataset from a previous study in which several authors of this paper were involved, and investigate to what extent the textual content of web at large resources referenced in a vast collection of Science, Technology, and Medicine (STM) articles published between 1997 and 2012 has remained stable since the publication of the referencing article. We do so in a two-step approach that relies on various well-established similarity measures to compare textual content. In a first step, we use 19 web archives to find snapshots of referenced web at large resources that have textual content that is representative of the state of the resource around the time of publication of the referencing paper. We find that representative snapshots exist for about 30% of all URI references. In a second step, we compare the textual content of representative snapshots with that of their live web counterparts. We find that for over 75% of references the content has drifted away from what it was when referenced. These results raise significant concerns regarding the long term integrity of the web-based scholarly record and call for the deployment of techniques to combat these problems. [ABSTRACT FROM AUTHOR]

Web archives have become a significant repository of our recent history and cultural heritage. Archival integrity and accuracy is a precondition for future cultural research. Currently, there are no quantitative or content-based tools that allow archivists to judge the quality of the Web archive captures. In this paper, we address the problems of detecting when a particular page in a Web archive collection has gone off-topic relative to its first archived copy. We do not delete off-topic pages (they remain part of the collection), but they are flagged as off-topic so they can be excluded for consideration for downstream services, such as collection summarization and thumbnail generation. We propose different methods (cosine similarity, Jaccard similarity, intersection of the 20 most frequent terms, Web-based kernel function, and the change in size using the number of words and content length) to detect when a page has gone off-topic. Those predicted off-topic pages will be presented to the collection's curator for possible elimination from the collection or cessation of crawling. We created a gold standard data set from three Archive-It collections to evaluate the proposed methods at different thresholds. We found that combining cosine similarity at threshold 0.10 and change in size using word count at threshold −0.85 performs the best with accuracy = 0.987, $$F_{1}$$ score = 0.906, and AUC $$=$$ 0.968. We evaluated the performance of the proposed method on several Archive-It collections. The average precision of detecting off-topic pages in the collections is 0.89. [ABSTRACT FROM AUTHOR]

Copyright of Automatisierungstechnik is the property of De Gruyter and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Aiming at the current problems of community detection algorithm in which user's properties are not used; the community structure is not stable and the efficiency of the algorithm is low, this paper proposes a community detection algorithm based on the user influence. In terms of the concept of user influence in the subject communication and the PageRank algorithm, this paper uses the properties of nodes of users in social networks to form the user influence factor. Then, the user with the biggest influence is set as the initial node of new community and the local modularity method is introduced into detecting the community structure. Experiments show that the improved algorithm can efficiently detect the community structure with large scale users and the results are stable. Therefore, this algorithm will have a wide applied prospect. [ABSTRACT FROM AUTHOR]

Information is provided on the LITA- and ALCTS (Association for Library Collections and Technical Services)-sponsored MARC Formats Transition Interest Group's (IG's) meeting on February 10, 2018 in Denver, Colorado as part of the American Library Association's meeting. Topics, including the use of URIs in library record cataloging at the U.S. National Library of Medicine (NLM), the conceptual model BIBFRAME, RDF document markup language and linked data, are discussed.

The article discusses the highlights of the meeting held by the Association for Library Collections & Technical Services (ALCTS) Catalog Management interest group at the June 2017 American Library Association Annual Conference in Chicago, Illinois. Issues and topics discussed during the meeting include the preparation for the transition to the linked data environment and the identification and recommendation of Uniform Resource Identifier (URI) data structure for the library community.

Taxonomic databases are perpetuating approaches to citing literature that may have been appropriate before the Internet, often being little more than digitised 5 x 3 index cards. Typically the original taxonomic literature is either not cited, or is represented in the form of a (typically abbreviated) text string. Hence much of the "deep data" of taxonomy, such as the original descriptions, revisions, and nomenclatural actions are largely hidden from all but the most resourceful users. At the same time there are burgeoning efforts to digitise the scientific literature, and much of this newly available content has been assigned globally unique identifiers such as Digital Object Identifiers (DOIs), which are also the identifier of choice for most modern publications. This represents an opportunity for taxonomic databases to engage with digitisation efforts. Mapping the taxonomic literature on to globally unique identifiers can be time consuming, but need be done only once. Furthermore, if we reuse existing identifiers, rather than mint our own, we can start to build the links between the diverse data that are needed to support the kinds of inference which biodiversity informatics aspires to support. Until this practice becomes widespread, the taxonomic literature will remain balkanized, and much of the knowledge that it contains will linger in obscurity. [ABSTRACT FROM AUTHOR]

Scientific names serve to label biodiversity information: information related to species. Names, and their underlying taxonomic definitions, however, are unstable and ambiguous. This negatively impacts the utility of names as identifiers and as effective indexing tools in biological informatics where names are commonly utilized for searching, retrieving and integrating information about species. Semiotics provides a general model for describing the relationship between taxon names and taxon concepts. It distinguishes syntactics, which governs relationships among names, from semantics, which represents the relations between those labels and the taxa to which they refer. In the semiotic context, changes in semantics (i.e., taxonomic circumscription) do not consistently result in a corresponding and reflective change in syntax. Further, when syntactic changes do occur, they may be in response to semantic changes or in response to syntactic rules. This lack of consistency in the cardinal relationship between names and taxa places limits on how scientific names may be used in biological informatics in initially anchoring, and in the subsequent retrieval and integration, of relevant biodiversity information. Precision and recall are two measures of relevance. In biological taxonomy, recall is negatively impacted by changes or ambiguity in syntax while precision is negatively impacted when there are changes or ambiguity in semantics. Because changes in syntax are not correlated with changes in semantics, scientific names may be used, singly or conflated into synonymous sets, to improve recall in pattern recognition or search and retrieval. Names cannot be used, however, to improve precision. This is because changes in syntax do not uniquely identify changes in circumscription. These observations place limits on the utility of scientific names within biological informatics applications that rely on names as identifiers for taxa. Taxonomic systems and services used to organize and integrate information about taxa must accommodate the inherent semantic ambiguity of scientific names. The capture and articulation of circumscription differences (i.e., multiple taxon concepts) within such systems must be accompanied with distinct concept identifiers that can be employed in association with, or in replacement of, traditional scientific names. [ABSTRACT FROM AUTHOR]

Linked data describes a method of publishing structured data which it can be interlinked and become more effective through semantic queries. This enables data from different sources to be connected and queried. It builds upon standard web technologies such as HTTP, RDF and URIs. This method helps human readers to share information in a way that can be read automatically by computers. Regarding the importance of Linked data, the main aim of this article is visualizing scientific mapping of linked data to show its progress through one decade. The scientometric study employs hierarchical cluster analysis, strategic diagrams and network analysis to map and visualize the linked data landscape of the "Scopus" publications through the use of co-word analysis. The study quantifies and describes the thematic evolution of the field based on a total of 717 Scopus articles and their associated 19977 keywords published between 1970s and 2014. According to the results the thematic visualization and the clusters show most concepts concentrated around computer related terms, such as big data; cloud computing semantic data; semantic technologies; semantic web; artificial intelligence; computer programming; semantic search, etc. In addition, we found that in recent years after librarians and information scientists doing researches in linked data on the behalf of computer scientist the "user" studies became important. [ABSTRACT FROM AUTHOR]

The Linked Open Data (LOD) graph represents a web-scale distributed knowledge graph interlinking information about entities across various domains. A core concept is the lack of pre-defined schema which actually allows for flexibly modelling data from all kinds of domains. However, Linked Data does exhibit schema information in a twofold way: by explicitly attaching RDF types to the entities and implicitly by using domain-specific properties to describe the entities. In this paper, we present and apply different techniques for investigating the schematic information encoded in the LOD graph at different levels of granularity. We investigate different information theoretic properties of so-called Unique Subject URIs (USUs) and measure the correlation between the properties and types that can be observed for USUs on a large-scale semantic graph data set. Our analysis provides insights into the information encoded in the different schema characteristics. Two major findings are that implicit schema information is far more discriminative and that applications involving schema information based on either types or properties alone will only capture between 63.5 and 88.1 % of the schema information contained in the data. As the level of discrimination depends on how data providers model and publish their data, we have conducted in a second step an investigation based on pay-level domains (PLDs) as well as the semantic level of vocabularies. Overall, we observe that most data providers combine up to 10 vocabularies to model their data and that every fifth PLD uses a highly structured schema. [ABSTRACT FROM AUTHOR]