Carl Taswell

dblp:04/1712 · DBLP profile ↗
← Back
10ranked-venue papers
5as first author
2since 2021 · last 2024
0000-0002-9386-4574ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 7 · 2 first-author · 2 since 2021Software engineering, systems software and programming languages · 3 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorTheory of computation · 1 · 1 first-author
YearPublicationVenuePosition
2024 FAIR Metrics for Motivating Excellence in Peer Review
abstract
Past attempts to measure the quality of peer review have relied on either subjective ratings or tangentially related factors such as the sheer number or length of reviews. Previously, we introduced the Fair Attribution to Indexed Reports (FAIR) Metrics to quantify adherence to good citation practices via systematic semantic comparison of statements in the target document to those found in cited and uncited prior reports. In the present work, we define new FAIR Metrics for assessing the quality of peer review, extend the FAIR Metrics module of the PDP-DREAM Ontology with additional classes and properties needed to record FAIR Metrics analysis of a peer review, and demonstrate use with a simple example.
Adam Craig, Carl Taswell
e-Science2
2023 Example Evaluations of Plagiarism Cases Using FAIR Metrics and the PDP-DREAM Ontology
abstract
The FAIR Metrics, with acronym FAIR for Fair Acknowledgment of Information Records and Fair Attribution to Indexed Reports, measure how appropriately a document cites prior literature. We demonstrate use of a novel workflow for manual evaluation of the FAIR Metrics on five example publications, three of which were retracted for plagiarism. We recorded results of the analyses in Nexus-PORTAL-DOORS-Scribe (NPDS) records as an open access data set for continuing development of automated plagiarism detection tools.
Adam Craig, Anousha Athreya, Carl Taswell
e-Science3
2019 Managing Scientific Literature with Software from the PORTAL-DOORS Project
abstract
Scholarly research associated with finding and citing scientific literature in the 21st century requires new approaches to address the continuing problems that occur with the provenance of content in the literature as well as the peer and editorial review process for publishing this literature. The PORTAL-DOORS Project (PDP) has developed software for the Nexus-PORTAL-DOORS-Scribe (NPDS) cyberinfrastructure in support of identifying, describing, locating and linking things on the internet, web and grid with both lexical and semantic tools and applications. This presentation of our PDP software will highlight Discoverable Data with Reproducible Results for Equivalent Entities with Accessible Attributes and Manageable Metadata with the DREAM principles, and the Fair Acknowledgment of Information Records also called the Fair Attribution to Indexed Reports with the FAIR metrics. This software demonstration will explain use of the network of metadata repositories for scientific literature accessible from www.portaldoors.org, and use of the open source software that powers the NPDS cyberinfrastructure, PDP web sites and PDP web services. Our PDP software for the NPDS cyberinfrastructure will be released publicly at this presentation of the software where we will also discuss challenges in the peer review process that include plagiarism detection.
Shiladitya Dutta, Pooja Kowshik, Adarsh Ambati, Sathvik Nori, Koby Taswell, Carl Taswell
eScience6
2018 Formulation of FAIR Metrics for Primary Research Articles
Adam Craig, Carl Taswell
BIBM2
2015 SOLOMON: An ontology for Sensory-Onset, Language-Onset and Motor-Onset dementias
abstract
The PORTAL-DOORS system (PDS) has been designed as a resource metadata management system intended to support applications such as automated searches of online resources and meta-analyses of published literature. PDS comprises a network of Problem Oriented Registry of Tags and Labels (PORTAL) lexical registries and Domain Ontology Oriented Resource System (DOORS) semantic directories. Here we introduce a PDS-compliant concept-validating registry and hypothesis-exploring ontology that organizes focal-onset dementias including Sensory-Onset, Language-Onset and Motor-ONset (SOLOMON) dementias with novel classifying and relating concepts. This approach facilitates semantic search of resources and exploration of hypotheses related to neurodegeneration. SOLOMON interoperates with other PDS registries and ontologies including BrainWatch, ManRay and GeneScene.
Martin Skarzynski, Adam Craig, Carl Taswell
BIBM3
2008 DOORS to the Semantic Web and Grid With a PORTAL for Biomedical Computing
abstract
The semantic web remains in the early stages of development. It has not yet achieved the goals envisioned by its founders as a pervasive web of distributed knowledge and intelligence. Success will be attained when a dynamic synergism can be created between people and a sufficient number of infrastructure systems and tools for the semantic web in analogy with those for the original web. The domain name system (DNS), web browsers, and the benefits of publishing web pages motivated many people to register domain names and publish web sites on the original web. An analogous resource label system, semantic search applications, and the benefits of collaborative semantic networks will motivate people to register resource labels and publish resource descriptions on the semantic web. The Domain Ontology Oriented Resource System (DOORS) and Problem Oriented Registry of Tags and Labels (PORTAL) are proposed as infrastructure systems for resource metadata within a paradigm that can serve as a bridge between the original web and the semantic web. The Internet Registry Information Service (IRIS) registers [corrected] domain names while DNS publishes domain addresses with mapping of names to addresses for the original web. Analogously, PORTAL registers resource labels and tags while DOORS publishes resource locations and descriptions with mapping of labels to locations for the semantic web. BioPORT is proposed as a prototype PORTAL registry specific for the problem domain of biomedical computing.
Carl Taswell
IEEE Trans. Inf. Technol. Biomed.1
2008 Corrections to "DOORS to the Semantic Web and Grid With a PORTAL for Biomedical Computing"
Carl Taswell
IEEE Trans. Inf. Technol. Biomed.1
1999 Least and most disjoint root sets for Daubechies wavelets
abstract
A new set of wavelet filter families has been added to the systematized collection of Daubechies (1988) wavelets. This new set includes complex and real, orthogonal and biorthogonal, least and most disjoint families defined using constraints derived from the principle of separably disjoint root sets in the complex z-domain. All of the new families are considered to be constraint selected without a search and without any evaluation of filter properties such as time-domain regularity or frequency-domain selectivity. In contrast, the older families in the collection are considered to be search optimized for extremal properties. Some of the new families are demonstrated to be equivalent to some of the older families, thereby obviating the necessity for any search in their computation.
Carl Taswell
ICASSP1
1996 Speech compression with cosine and wavelet packet near-best bases
abstract
Compression of speech from the TIMIT corpus was investigated for several transform domain methods coding near-best and best bases from cosine and wavelet packet transforms. Satisficing (suboptimizing) search algorithms for selecting near-best bases were compared with optimizing algorithms for best bases in these adaptive tree-structured transforms. Experiments were performed on several hundred seconds of speech spoken by both male and female speakers from all dialect regions of the TIMIT corpus. Near-best bases provided rate-distortion performance effectively as good as that of best bases but without the additional computational penalty. Cosine packet bases outperformed wavelet packet bases.
Carl Taswell
ICASSP1
1994 Algorithm 735; Wavelet transform algorithms for finite-duration discrete-time signals
abstract
The algorithms split for the wavelet transform and merge for the reverse wavelet transform are presented for finite-duration discrete-time signals of arbitrary length not restricted to a power of 2. Alternative matrix-and vector-filter implementations of alternative truncated, circulant, and extended versions are discussed.Matrix-and vector-filter implementations yield identical results and enhance, respectively, didactic conceptualization and computational efficiency.Truncated, circulant, and extended versions produce the signal-end effects of, respectively, errors, periodization, and redundancy in the transform coefficients The use of any one of these three versions avoids the signal-end effects associated with the other two versions.Additional alternatives that eliminate all signal-end effects (albeit at the cost of increased algorithmic complexity) are discussed briefly.
Carl Taswell, Kevin C. McGill
ACM Trans. Math. Softw.1