Search

The document "Featured Papers in Computer Methods in Biomedicine" from the journal Bioengineering (Basel) highlights seven research papers showcasing the intersection of computer science and biomedicine. The papers cover topics such as predicting low bone mineral density in older women, improving ML models for disease prediction, creating patient-specific anatomical reconstructions, detecting atrial fibrillation, classifying Parkinson's disease patients, analyzing EEG data for brain connectivity, and exploring EEG-based brain-machine interfaces for older adults. The document emphasizes the potential of computational methods to revolutionize healthcare through personalized treatments, improved diagnostics, and enhanced patient outcomes. [Extracted from the article]

Context: The retraction of research papers, for whatever reason, is a growing phenomenon. However, although retracted paper information is publicly available via publishers, it is somewhat distributed and inconsistent. Objective: The aim is to assess: (i) the extent and nature of retracted research in Computer Science (CS) (ii) the post-retraction citation behaviour of retracted works and (iii) the potential impact upon systematic reviews and mapping studies. Method: We analyse the Retraction Watch database and take citation information from the Web of Science and Google scholar. Results: We find that of the 33,955 entries in the Retraction watch database (16 May 2022), 2,816 are classified as CS, i.e., ≈ 8%. For CS, 56% of retracted papers provide little or no information as to the reasons. This contrasts with 26% for other disciplines. There is also some disparity between different publishers, a tendency for multiple versions of a retracted paper to be available beyond the Version of Record (VoR), and for new citations long after a paper is officially retracted (median = 3; maximum = 18). Systematic reviews are also impacted with ≈ 30% of the retracted papers having one or more citations from a review. Conclusions: Unfortunately, retraction seems to be a sufficiently common outcome for a scientific paper that we as a research community need to take it more seriously, e.g., standardising procedures and taxonomies across publishers and the provision of appropriate research tools. Finally, we recommend particular caution when undertaking secondary analyses and meta-analyses which are at risk of becoming contaminated by these problem primary studies. [ABSTRACT FROM AUTHOR]

Purpose: The number of citations has been widely used to measure the significance of a paper. However, there is a need in introducing another index to determine superiority or inferiority of papers with the same number of citations. We determine superiority or inferiority of papers by using the ranking based on the number of citations and PageRank. Design/methodology/approach: We show the positive linear correlation between Citation Rank (the ranking of the number of citation) and PageRank. On this basis, we identify high-quality, prestige, emerging, and popular papers. Findings: We found that the high-quality papers belong to the subjects of biochemistry and molecular biology, chemistry, and multidisciplinary sciences. The prestige papers correspond to the subjects of computer science, engineering, and information science. The emerging papers are related to biochemistry and molecular biology, as well as those published in the journal "Cell." The popular papers belong to the subject of multidisciplinary sciences. Research limitations: We analyze the Science Citation Index Expanded (SCIE) from 1981 to 2015 to calculate Citation Rank and PageRank within a citation network consisting of 34,666,719 papers and 591,321,826 citations. Practical implications: Our method is applicable to forecast emerging fields of research subjects in science and helps policymakers to consider science policy. Originality/value: We calculated PageRank for a giant citation network which is extremely larger than the citation networks investigated by previous researchers. [ABSTRACT FROM AUTHOR]

The present study aims to measure the contributions of Prof. Anurag Kumar, who served as the Director at the Indian Institute of Science (IISc) in Bengaluru between August 2014 to July 2020. He has contributed 181 publications during his 36 years of career. He has published his majority of publications 171 (94.48%) in collaboration; most active collaborators with Prof. Anurag Kumar are Altman E. with (17) publications, Kuri Joy (15), Anand (14), and Singh (12). His highest Collaboration Coefficient found is 0.73 in 2013, and the highest Modified Collaboration Coefficient is 1.33 in the year 2018. The highest degree of collaboration observed for Prof. Anurag Kumar was 1.00. The highest Collaborative Index of Prof. Anurag found is 4.75 in the year 2016. His publications received 2595 citations so far, with 14.3 citations for each publication and an average citation of 72.08 per year. He has produced most of his publications in the field of computer science (45.9%). He preferred conference papers as his communication channel, where he published 100 (55.24%) papers out of 181. Prof. Anurag Kumar has contributed the highest (62) publication between 2005-2010, and he has published his first publication at the age of 30. [ABSTRACT FROM AUTHOR]

This paper aims to investigate the differences between conference papers and journal papers in the field of computer science based on Bayesian network. This paper investigated the differences between conference papers and journal papers in the field of computer science based on Bayesian network, a knowledge-representative framework that can model relationships among all variables in the network. We defined the variables required for Bayesian networks modeling, calculated the values of each variable based Aminer dataset (a literature data set in the field of computer science), learned the Bayesian network and derived some findings based on network inference. The study found that conferences are more attractive to senior scholars, the academic impact of conference papers is slightly higher than journal papers, and it is uncertain whether conference papers are more innovative than journal papers. The study was limited to the field of computer science and employed Aminer dataset as the sample. Further studies involving more diverse datasets and different fields could provide a more complete picture of the matter. By demonstrating that Bayesian networks can effectively analyze issues in Scientometrics, the study offers valuable insights that may enhance researchers' understanding of the differences between journal and conference in computer science. Academic conferences play a crucial role in facilitating scholarly exchange and knowledge dissemination within the field of computer science. Several studies have been conducted to examine the distinctions between conference papers and journal papers in terms of various factors, such as authors, citations, h-index and others. Those studies were carried out from different (independent) perspectives, lacking a systematic examination of the connections and interactions between multiple perspectives. This paper supplements this deficiency based on Bayesian network modeling. [ABSTRACT FROM AUTHOR]

This paper introduces a ranking and selection approach to psychoacoustic and psychophysical experimentation, with the aim of identifying top-ranking samples in listening experiments with minimal pairwise comparisons. We draw inspiration from sports tournament designs and propose to adopt modified knockout (KO) tournaments. Two variants of modified KO tournaments are described, which adapt the tree selection sorting algorithm and the replacement selection algorithm known from computer science. To validate the proposed method, a listening experiment is conducted, where binaural renderings of seven chamber music halls are compared regarding loudness and reverberance. The rankings obtained by the modified KO tournament method are compared to those obtained from a traditional round-robin (RR) design, where all possible pairs are compared. Moreover, the paper presents simulations to illustrate the method's robustness when choosing different parameters and assuming different underlying data distributions. The study's findings demonstrate that modified KO tournaments are more efficient than full RR designs in terms of the number of comparisons required for identifying the top ranking samples. Thus, they provide a promising alternative for this task. We offer an open-source implementation so that researchers can easily integrate KO designs into their studies. [ABSTRACT FROM AUTHOR]

With the help of clustering analysis tools in the field of computer science, this paper conducts a visual study on the structure of contemporary large-scale public buildings. It summarizes the expression strategies of large-scale public building structures and provides references for research and practice in the new era. Based on the visualization analysis results of VOS viewer, this paper conducts analysis from three aspects: first, by reflecting on the development of traditional wood structure technology, it reveals the lag in the development of contemporary architectural structures; second, based on the new temporal context, it distinguishes the cognitive paradigm of contemporary architectural structures; third, it clarifies the inherent requirements of architectural structure representation and explores the possible answers to the expression of architectural structures in the new era. [ABSTRACT FROM AUTHOR]

Buildings are complex structures composed of heterogeneous elements; these require building management systems (BMSs) to dynamically adapt them to occupants' needs and leverage building resources. The fast growth of information and communication technologies (ICTs) has transformed the BMS field into a multidisciplinary one. Consequently, this has caused several research papers on data-driven solutions to require examination and classification. This paper provides a broad overview of BMS by conducting a systematic literature review (SLR) summarizing current trends in this field. Unlike similar reviews, this SLR provides a rigorous methodology to review current research from a computer science perspective. Therefore, our goal is four-fold: (i) Identify the main topics in the field of building; (ii) Identify the recent data-driven methods; (iii) Understand the BMS's underlying computing architecture (iv) Understand the features of BMS that contribute to the smartization of buildings. The result synthesizes our findings and provides research directions for further research. [ABSTRACT FROM AUTHOR]

The action required to stem the environmental and social implications of climate change depends crucially on how humankind shapes technology, economy, lifestyle and policy. With transport CO2 emissions accounting for about a quarter of the total, we examine the contribution of CO2 output by scientific travel. Thankfully for the reputation of the scientific community, CO2 emissions associated with the trips required to present a paper at a scientific conference account for just 0.003% of the yearly total. However, with CO2 emissions for a single conference trip amounting to 7% of an average individual’s total CO2 emissions, scientists should lead by example by demonstrating leadership in addressing the issue. [ABSTRACT FROM AUTHOR]

In the realm of connected networks, distance-based parameters, particularly the partition dimension of graphs, have extensive applications across various fields, including chemistry and computer science. A notable variant of the partition dimension is the fault-tolerant resolving partition, which is critical in computer science for networking, optimization, and navigation tasks. In networking, fault-tolerant partitioning ensures robust communication pathways even in the event of network failures or disruptions. In optimization, it aids in developing efficient algorithms capable of withstanding errors or changes in input data. In navigation systems, fault-tolerant partitioning supports reliable route planning and navigation services under uncertain or dynamic conditions. This paper focuses on the fault-tolerant partition dimension within the specific context of the cycle with chord graphs, exploring its properties and implications for enhancing the robustness and reliability of networked systems. [ABSTRACT FROM AUTHOR]

Graph theory is a crucial branch of mathematics in fields like network analysis, molecular chemistry, and computer science, where it models complex relationships and structures. Many indices are used to capture the specific nuances in these structures. In this paper, we propose a new index, the weighted asymmetry index, a graph-theoretic metric quantifying the asymmetry in a network using the distances of the vertices connected by an edge. This index measures how uneven the distances from each vertex to the rest of the graph are when considering the contribution of each edge. We show how the index can capture the intrinsic asymmetries in diverse networks and is an important tool for applications in network analysis, optimization problems, social networks, chemical graph theory, and modeling complex systems. We first identify its extreme values and describe the corresponding extremal trees. We also give explicit formulas for the weighted asymmetry index for path, star, complete bipartite, complete tripartite, generalized star, and wheel graphs. At the end, we propose some open problems. [ABSTRACT FROM AUTHOR]

In classical set theory, elements of the set are written once but the sets in which the same item is repeated several times in daily life are in all areas of our lives. These sets are called multisets and are studied in many fields such as Mathematics, Physics, Chemistry, and Computer Sciences. Sequences consisting of elements of these sets are called multiset sequences. In this paper, we study the concept of I-lacunary statistical convergence of multiset sequences and investigate some important results. [ABSTRACT FROM AUTHOR]

The study of linguistics applied to computer science is a much-discussed topic today. In this area, particularly relevant is the software localization process describing the linguistic and cultural adaptation of software products to a specific market scenario. Software localization is going through a phase of strong development due to the great market demand and the current trend of making the computer more human-like in the way it interacts with the user. This paper focuses on "linguistic" localization by addressing the language translation process from the perspective of translation studies. In particular, the process of translating the language assets in a game and making the game linguistically and culturally appropriate for the target market will be explored. The study provides a systematic literature review of the main localization methods developed over the last four decades, along with the major issues and challenges mainly related to the main linguistic and cultural aspects of videogames. The review results are integrated with the results of a qualitative analysis conducted through a focus group with the participation of both academic and professional experts in software and videogame localization. The results of this study are worthwhile for many academics and industry professionals as they provide an in-depth overview of the localization process in software and videogames as well as potential directions for future research. [ABSTRACT FROM AUTHOR]

Dual generalized commutative quaternions have broad application prospects in many fields. Additionally, the matrix equation A X B = C has important applications in mathematics and engineering, especially in control systems, economics, computer science, and other disciplines. However, research on the matrix equation A X B = C over the dual generalized commutative quaternions remains relatively insufficient. In this paper, we derive the necessary and sufficient conditions for the solvability of the dual generalized commutative quaternion matrix equation A X B = C . Furthermore, we provide the general solution expression for this matrix equation, when it is solvable. Finally, a numerical algorithm and an example are provided to confirm the reliability of the main conclusions. [ABSTRACT FROM AUTHOR]

Frequent gradual pattern extraction is an important problem in computer science widely studied by the data mining community. Such a pattern reflects a co-variation between attributes of a database. The applications of the extraction of the gradual patterns concern several fields, in particular, biology, finances, health and metrology. The algorithms for extracting these patterns are greedy in terms of memory and computational resources. This clearly poses the problem of improving their performance. This paper proposes a new approach for the extraction of gradual and frequent patterns based on the reduction of candidate generation and processing costs by exploiting frequent itemsets whose size is a power of two to generate all candidates. The analysis of the complexity, in terms of CPU time and memory usage, and the experiments show that the obtained algorithm outperforms the previous ones and confirms the interest of the proposed approach. It is sometimes at least 5 times faster than previous algorithms and requires at most half the memory. [ABSTRACT FROM AUTHOR]

The growing diffusion of perspectivism within the debate on information system ontologies [ISOs] does not correspond to a thorough analysis of what perspectivism specifically consists of. This paper aims to fill this void. First, I show what supporting perspectivism in information system ontologies [PISO] means in terms of (minimal) claims and implications; then I argue that the definitions of ISO implicitly assume PISO's (minimal) claims or, in other words, that ISOs presuppose and maintain PISO. Section 2 presents the main definitions of ISO. Section 3 specifies what claims are common to all perspectivists in ISO. Sects. 4–7 analyze the implications of those claims. Section 8 explores the chance of multiple perspectivisms within ISOs' domain. Finally, Sects. 9–10 assume that, if PISO's (minimal) claims and (their) implications can be inferred from ISO's definitions, then ISOs are perspectivist, or PISO's minimal claims are assumptions underlying ISOs. [ABSTRACT FROM AUTHOR]

Metaphors that compare the computer to a human brain are common in computer science and can be traced back to a fertile period of research that unfolded after the Second World War. To conceptualize the emerging "intelligent" properties of computing machines, researchers of the era created a series of virtual objects that served as interpretive devices for representing the immaterial functions of the computer. This paper analyses the use of the terms "artificial" and "virtual" in scientific papers, textbooks, and popular articles of the time, and examines how, together, they shaped models in computer science used to conceptualize computer processes. [ABSTRACT FROM AUTHOR]

The recognition that different aspects of the urban environment can affect individuals' mental health is growing, as they are responsible for facilitating or inhibiting behaviors and lifestyles that affect sentiment. The increasing availability of user-generated data on social media provides information about users and their surroundings, enabling sentiment analysis. This study investigates the global production of documents on sentiment analysis and the built environment, urban or city, published between 2009 and 2023. Bibliometric indicators on trends, most cited articles, authors, institutions, countries, funding agencies, and thematic research areas were analyzed. The bibliometrix library of R software was used for the performance analysis and the VOSviewer software for mapping scientific connections. A total of 728 eligible papers were identified from 2009 to June 2023. Most publications were computer science papers (n=487). This type of analysis provides researchers with guidance on the possible critical points that can be found in this field of research, as well as informs about the multiplicity of scientific research conducted globally so far by authors, countries, sources, allocated funding, and active institutions, allowing improving the production of documents on sentiment analysis concerning the urban environment. [ABSTRACT FROM AUTHOR]

Nowadays, there has been a rapidly increasing number of scientific submissions in multiple research domains. A large number of journals have various acceptance rates, impact factors, and rankings in different publishers. It becomes time-consuming for many researchers to select the most suitable journal to submit their work with the highest acceptance rate. A paper submission recommendation system is more critical for the research community and publishers as it gives scientists another support to complete their submission conveniently. This paper investigates the submission recommendation system for two main research topics: computer science and applied mathematics. Unlike the previous works (Wang et al., 2018; Son et al., 2020) that extract TF–IDF and statistical features as well as utilize numerous machine learning algorithms (logistics regression and multiple perceptrons) for building the recommendation engine, we present an efficient paper submission recommendation algorithm by using different bidirectional transformer encoders and the Mixture of Transformer Encoders technique. We compare the performance between our methodology and other approaches by one dataset from Wang et al. (2018) with 14012 papers in computer science and another dataset collected by us with 223,782 articles in 178 Springer applied mathematics journals in terms of top K accuracy (K = 1 , 3 , 5 , 10). The experimental results show that our proposed method extensively outperforms other state-of-the-art techniques with a significant margin in all top K accuracy for both two datasets. We publish all datasets collected and our implementation codes for further references. 1 1 https://github.com/BinhMisfit/PSRMTE. • Bidirectional transformer encoders can improve the performance of the paper submission recommendation system. • The Mixture of Transformer Encoders framework shows the efficiency in the paper submission recommendation problem. • Proposed techniques can surpass other recent techniques on two datasets related. [ABSTRACT FROM AUTHOR]

Background: Peer evaluation is the cornerstone of science evaluation. In this paper, we analyze whether or not a form of peer evaluation, the pre-publication selection of the best papers in Computer Science (CS) conferences, is better than random, when considering future citations received by the papers. Methods: Considering 12 conferences (for several years), we collected the citation counts from Scopus for both the best papers and the non-best papers. For a different set of 17 conferences, we collected the data from Google Scholar. For each data set, we computed the proportion of cases whereby the best paper has more citations. We also compare this proportion for years before 2010 and after to evaluate if there is a propaganda effect. Finally, we count the proportion of best papers that are in the top 10% and 20% most cited for each conference instance. Results: The probability that a best paper will receive more citations than a non best paper is 0.72 (95% CI = 0.66, 0.77) for the Scopus data, and 0.78 (95% CI = 0.74, 0.81) for the Scholar data. There are no significant changes in the probabilities for different years. Also, 51% of the best papers are among the top 10% most cited papers in each conference/year, and 64% of them are among the top 20% most cited. Discussion: There is strong evidence that the selection of best papers in Computer Science conferences is better than a random selection, and that a significant number of the best papers are among the top cited papers in the conference. [ABSTRACT FROM AUTHOR]

An augmented reality browser is an alternative of a web browser in augmented spaces, which aimed at navigating and publishing overlaid interactive contents. This enabled end users to explore digital information on existing points of interests (POIs) and the application developers to publish overlaid information in the form of layers and channels, etc. These browsing interfaces were vital for publishing and locating contents to unfold the potential of augmented spaces. This paper contributed an analytical review on the recent emergence of mobile augmented reality browsers from the perspective of technological information publishing and usage scenarios. This comparative analysis of the augmented reality browsers would help researchers and industrial scientists to identify the most relevant augmented reality browser for specific applications like object tracking, content overlaying, and ensuring realism up to major extent. This study would also provide guidelines for next generation enriched, seamless and adaptive augmented reality browsers. [ABSTRACT FROM AUTHOR]

An automatic computer vision algorithm that detects individual paper fibres from an image, assesses the possibility of grasping the detected fibres with microgrippers and detects the suitable grasping points is presented. The goal of the algorithm is to enable automatic fibre manipulation for mechanical characterisation, which has traditionally been slow manual work. The algorithm classifies the objects in images based on their morphology, and detects the proper grasp points from the individual fibres by applying given geometrical constraints. The authors test the ability of the algorithm to detect the individual fibres with 35 images containing more than 500 fibres in total, and also compare the graspability analysis and the calculated grasp points with the results of an experienced human operator with 15 images that contain a total of almost 200 fibres. The detection results are outstanding, with fewer than 1% of fibres missed. The graspability analysis gives sensitivity of 0.83 and specificity of 0.92, and the average distance between the grasp points of the human and the algorithm is 220 µm. Also, the choices made by the algorithm are much more consistent than the human choices. [ABSTRACT FROM AUTHOR]

Currently, equity of access to computer science education represents a challenge: computer science education is indispensable for active participation in a computational world, but current initiatives tend to increase existing gaps due to cultural, socioeconomic and contextual factors. This paper proposes a model for equitable computing education that contributes to the reduction of these gaps through three main strategies: (I) Investigating how students learn in particular contexts; (II) Building teacher capacity to teach computing through professional development programs, while investigating how teachers learn, and how they succeed (or fail) in bringing it to the classroom; and (III) Designing accessible devices for teaching computing. This accessibility includes devices that are low-cost, but that are also versatile, in terms of their appearance, the ways they interact, and the concepts they teach. This article describes the model for equitable computer education, and shows a case study for each of the strategies. [ABSTRACT FROM AUTHOR]

The superiority of BWM over other weighting methods for obtaining the weight values of the attributes is that it achieves high-confidence results with a reasonable number of pairwise comparisons. Although the best-worst method (BWM) is a well-known multi-criteria decision-making (MCDM) method that has been successfully utilized in almost all scientific areas to solve challenging real-life problems, no research has comprehensively examined the state-of-the-art in this regard. The present study depicts a detailed overview of publications concerned with BWM during the period 2015–2022. Based on the information obtained from the Scopus database, this work presents a big picture of current research on BWM. In other words, this paper analyzes the existing literature about BWM and identifies thematic contexts, application areas, emerging trends, and remaining research gaps to shed light on future research agendas aligning with those gaps. Further, the most recent BWM research is analyzed in the top ten scientific areas, from engineering to materials science. “Engineering”, “computer science”, and “business, management, and accounting” are the hottest fields of BWM research. China is the most active country regarding “engineering” and “computer science”, whereas India is the leader in “business, management, and accounting”. The study also reveals that there are still many research gaps in BWM research. The big picture taken in this study will not only showcase the current situation of BWM research but will also positively impact the direction and quality of new research. [ABSTRACT FROM AUTHOR]

This paper explores the computational challenges of clique transversal problems in d-degenerate graphs, which are commonly encountered across theoretical computer science and various network applications. We examine d-degenerate graphs to highlight their utility in representing sparse structures and assess several variations of clique transversal problems, including the b-fold and { b } -clique transversal problems, focusing on their computational complexities for different graph categories. Our analysis identifies that certain instances of these problems are polynomial-time solvable in specific graph classes, such as 1-degenerate or 2-degenerate graphs. However, for d-degenerate graphs where d ≥ 2 , these problems generally escalate to NP-completeness. We also explore the parameterized complexity, pinpointing specific conditions that render these problems fixed-parameter tractable. [ABSTRACT FROM AUTHOR]

Lecture Notes in Computer Science (LNCS) is a globally recognised publication outlet for the field of Computer Science, including in South Africa. In this study, spanning from 1973 to 2022, we investigated the research participation of South African based authors in LNCS. The publication output and citation impact of these authors were compared to the global Computer Science and LNCS output. The authorship patterns and collaborative behaviour of South African LNCS papers were explored, and a keyword or topic analysis also conducted. Of the total of 518 662 LNCS papers published globally between 1973 and 2022, South African based researchers contributed 1150 papers (0.22%). The LNCS papers from South Africa exhibit a strong collaborative publication culture, with 1043 (91%) co-authored and 107 (9%) singleauthored works. Local LNCS researchers prefer institutional collaboration (43%), followed by international (37%) and national collaboration (11%). Europe emerged as the most significant collaboration partner for LNCS researchers in South Africa. Of the 1150 papers, 836 (73%) had received citations, while 314 (27%) had not. On average, papers published by South African based authors received 6.05 citations, compared to the global LNCS average of 9.49 citations per paper. A keyword analysis revealed that the majority of papers by South African authors focus on artificial intelligence. The results indicate that, although LNCS serves as a reputable dissemination platform for Computer Science research output both globally and locally, South African authors should consider publishing more journal articles to build and improve their researcher profiles. Significance: * The study shows that LNCS is the most frequent publication outlet for Computer Science researchers, globally and in South Africa. * The study offers insight into the publication output, authorship patterns, collaborative behaviour and citation impact of South African based Computer Science researchers. [ABSTRACT FROM AUTHOR]

The security that resides in the public-key cryptosystems relies on the presumed computational hardness of mathematical problems behind the systems themselves (e.g. the semiprime factorization problem in the RSA cryptosystem), that is because there is not known any polynomial time (classical) algorithm to solve them. The paper focuses on the computing paradigm of virus machines within the area of Unconventional Computing and Natural Computing. Virus machines, which incorporate concepts of virology and computer science, are considered as number computing devices with the environment. The paper designs a virus machine that solves a generalization of the semiprime factorization problem and verifies it formally. [ABSTRACT FROM AUTHOR]

Abstract: Combining the techniques of paper prototyping and card sorting into a single session has the benefits of helping users to understand a new technology on the one hand, and of gaining insight into the users’ mental models of that technology on the other hand. However, acquainting users with a new technology via a paper prototype might affect their mental models, as assessed with the card sorting technique. The aim of this paper was to explore the possibility of combining the two techniques in a single research session. Thirty-seven users participated in a study concerning a payment system based on Near Field Communication (NFC). Eight group sessions were organized, including both a paper prototyping exercise and a card sorting exercise. The order of the exercises was alternated. The findings of this case study seem to suggest that the paper prototyping exercise resulted into deeper insights into the participants’ mental models resulting from the card sorting exercise. At the same time, paper prototyping seemed to prevent participants to come up with new names for their card sorting categories. [Copyright &y& Elsevier]

Informed consent is the cornerstone of human research subject protection. Many subjects sign consent documents without understanding the study purpose, procedures, risks, benefits, and their rights. Proof of comprehension is not required and rarely obtained. Understanding might improve by using an interactive system with multiple options for hearing, viewing and reading about the study and the consent form at the subject’s own pace with testing and immediate feedback. This prospective randomized study compared the IRB-approved paper ICF for an actual clinical research study with an interactive presentation of the same study and its associated consent form using an iPad device in two populations: clinical research professionals, and patients drawn from a variety of outpatient practice settings. Of the 90 participants, 69 completed the online test and survey questions the day after the session (maximum 36 hours post-session). Among research professionals (n = 14), there was a trend (p  = .07) in the direction of iPad subjects testing better on the online test (mean correct  =  77%) compared with paper subjects (mean correct  =  57%). Among patients (n = 55), iPad subjects had significantly higher test scores than standard paper consent subjects (mean correct  =  75% vs 58%, p < .001). For all subjects, the total time spent reviewing the paper consent was 13.2 minutes, significantly less than the average of 22.7 minutes total on the three components to be reviewed using the iPad (introductory video, consent form, interactive quiz). Overall satisfaction and overall enjoyment slightly favored the interactive iPad presentation. This study demonstrates that combining an introductory video, standard consent language, and an interactive quiz on a tablet-based system improves comprehension of research study procedures and risks. [ABSTRACT FROM AUTHOR]

In this paper, we propose a method to aid authors in choosing alternative keywords that help their papers gain visibility. These alternative keywords must have a certain level of popularity in the scientific community and, simultaneously, be keywords with fewer competitors. The competitors are derived from other papers containing the same keywords. Having fewer competitors would allow an author's paper to have a higher consult frequency. In order to recommend keywords, we must first determine an attention–survival score. The attention score is obtained using the popularity of a keyword. The survival score is derived from the number of manuscripts using the same keyword. With these two scores, we created a new algorithm that finds alternative keywords with a high attention–survival score. We used ontologies to ensure that alternative keywords proposed by our method are semantically related to the original authors' keywords that they wish to refine. The hierarchical structure in an ontology supports the relationship between the alternative and input keywords. To test the sensibility of the ontology, we used two sources: WordNet and the Computer Science Ontology (CSO). Finally, we launched a survey for the human validation of our algorithm using keywords from Web of Science papers and three ontologies: WordNet, CSO, and DBpedia. We obtained good results from all our tests. [ABSTRACT FROM AUTHOR]

Computational thinking, defined as a way of thinking that can be applied to various fields that require problem-solving skills, has become prevalent in education. Students, i.e., future specialists, have to be prepared for complex thinking competence, necessary for solving business and societal problems, for which a combination of mathematical thinking and computational thinking is essential. The preliminary premise is that there is a correlation between ability in specific mathematical and computational fields. Therefore, this paper aims to highlight the significance of investigating the relations between those fields from linguistic point of view. In order to better understand the relationship between abilities in specific mathematical and computational fields, this paper presents an analysis of a new approach, namely, developing hypotheses for exploring the relationship between metalanguages of different fields of Mathematics and Computer Science. Additionally, the paper describes the first stage of a study on a doctoral level in an attempt to suggest possible statistical analyses suitable for testing hypotheses based on meta-analysis of the current literature. [ABSTRACT FROM AUTHOR]

The paper presents a new algorithm for reflection symmetry detection, which is specialized to detect maximal symmetric patterns in an Earth observation (EO) dataset. First, we stress the particularities that make symmetry detection in EO data different from detection in other geometric sets. The EO data acquisition cannot provide exact pairs of symmetric elements and, therefore, the approximate symmetry must be addressed, which is accomplished by voxelization. Besides this, the EO data symmetric patterns in the top view usually contain the most useful information for further processing and, thus, it suffices to detect symmetries with vertical symmetry planes. The algorithm first extracts the so-called interesting voxels and then finds symmetric pairs of line segments, separately for each horizontal voxel slice. The results with the same symmetry plane are then merged, first in individual slices and then through all the slices. The detected maximal symmetric patterns represent the so-called partial symmetries, which can be further processed to identify global and local symmetries. LiDAR datasets of six urban and natural attractions in Slovenia of different scales and in different voxel resolutions were analyzed in this paper, demonstrating high detection speed and quality of solutions. [ABSTRACT FROM AUTHOR]

This paper describes results of a scientometric study of "Robotics" research publications during the period of 10 years i.e. (2009-2018). The raw data was collected from leading citation database i.e. Scopus. The study examines and analysis various scientometrics parameter and after the analysis it has been found that the out of total 4325 research paper, the highest documents were published in 2018 i.e. 791 (18.29%) while the minimum 134 (3.1%) of research papers were found in the year 2009 and the annual growth rate of publications was in fluctuating trends. The maximum (1.23) relative growth rate was found in 2010; the highest doubling time (3.43) was recorded in 2018; the maximum papers were written by more than three authors i.e. 1657 research papers. The average degree of author's collaborations was (0.93). Krishna, K.M. was the most productive author with (51) research papers contribution. Out of a total 16670 citations, 2718 citations were recorded in 2010 and a total 4325 publications, 2704 (62.52%) of records were conference paper. The highest publications came from computer science subject and the highest publications were published in ACM international conference proceeding series while the maximum 2508 'Robotics keyword was used by the authors during the period of study. [ABSTRACT FROM AUTHOR]

A drug molecule is a substance that changes an organism's mental or physical state. Every approved drug has an indication, which refers to the therapeutic use of that drug for treating a particular medical condition. While the Large Language Model (LLM), a generative Artificial Intelligence (AI) technique, has recently demonstrated effectiveness in translating between molecules and their textual descriptions, there remains a gap in research regarding their application in facilitating the translation between drug molecules and indications (which describes the disease, condition or symptoms for which the drug is used), or vice versa. Addressing this challenge could greatly benefit the drug discovery process. The capability of generating a drug from a given indication would allow for the discovery of drugs targeting specific diseases or targets and ultimately provide patients with better treatments. In this paper, we first propose a new task, the translation between drug molecules and corresponding indications, and then test existing LLMs on this new task. Specifically, we consider nine variations of the T5 LLM and evaluate them on two public datasets obtained from ChEMBL and DrugBank. Our experiments show the early results of using LLMs for this task and provide a perspective on the state-of-the-art. We also emphasize the current limitations and discuss future work that has the potential to improve the performance on this task. The creation of molecules from indications, or vice versa, will allow for more efficient targeting of diseases and significantly reduce the cost of drug discovery, with the potential to revolutionize the field of drug discovery in the era of generative AI. [ABSTRACT FROM AUTHOR]

Machine learning (ML) methods are proliferating in scientific research. However, the adoption of these methods has been accompanied by failures of validity, reproducibility, and generalizability. These failures can hinder scientific progress, lead to false consensus around invalid claims, and undermine the credibility of ML-based science. ML methods are often applied and fail in similar ways across disciplines. Motivated by this observation, our goal is to provide clear recommendations for conducting and reporting ML-based science. Drawing from an extensive review of past literature, we present the REFORMS checklist (recommendations for machine-learning-based science). It consists of 32 questions and a paired set of guidelines. REFORMS was developed on the basis of a consensus of 19 researchers across computer science, data science, mathematics, social sciences, and biomedical sciences. REFORMS can serve as a resource for researchers when designing and implementing a study, for referees when reviewing papers, and for journals when enforcing standards for transparency and reproducibility. [ABSTRACT FROM AUTHOR]

Searching over a sorted list is a classical problem in computer science. Binary Search takes at most log 2 ⁡ n + 1 tries to find an item in a sorted list of size n. Interpolation Search achieves an average time complexity of O (log ⁡ log ⁡ n ) for uniformly distributed data. Hybrids of Binary Search and Interpolation Search are also available to handle data with unknown distributions. This paper analyzes the computation cost of these methods and shows that interpolation can significantly affect their performance—accordingly, a new method, Interpolation Once Binary Search (IOBS), is proposed. The experimental results show that IOBS outperforms the hybrids of Binary Search and Interpolation Search for nonuniformly distributed data. [ABSTRACT FROM AUTHOR]

This research paper delves into the effectiveness and impact of behavior change techniques fostered by information technologies, particularly wearables and Internet of Things (IoT) devices, within the realms of engineering and computer science. By conducting a comprehensive review of the relevant literature sourced from the Scopus database, this study aims to elucidate the mechanisms and strategies employed by these technologies to facilitate behavior change and their potential benefits to individuals and society. Through statistical measurements and related works, our work explores the trends over a span of two decades, from 2000 to 2023, to understand the evolving landscape of behavior change techniques in wearable and IoT technologies. A specific focus is placed on a case study examining the application of behavior change techniques (BCTs) for monitoring vital signs using wearables, underscoring the relevance and urgency of further investigation in this critical intersection of technology and human behavior. The findings shed light on the promising role of wearables and IoT devices for promoting positive behavior modifications and improving individuals' overall well-being and highlighting the need for continued research and development in this area to harness the full potential of technology for societal benefit. [ABSTRACT FROM AUTHOR]

Trust can be considered as a multidisciplinary concept, which is strongly related to the context and it falls in different fields such as Philosophy, Psychology or Computer Science. Trust is fundamental in every relationship, because without it, an entity will not interact with other entities. This aspect is very important especially in the Internet of Things (IoT), where many entities produced by different vendors and created for different purposes have to interact among them through the internet often under uncertainty. Trust can overcome this uncertainty, creating a strong basis to ease the process of interaction among these entities. We believe that considering trust in the IoT is fundamental, and in order to implement it in any IoT entity, it is fundamental to consider it through the whole System Development Life Cycle. In this paper, we propose an analysis of different works that consider trust for the IoT. We will focus especially on the analysis of frameworks that have been developed in order to include trust in the IoT. We will make a classification of them providing a set of parameters that we believe are fundamental in order to properly consider trust in the IoT. Thus, we will identify important aspects to be taken into consideration when developing frameworks that implement trust in the IoT, finding gaps and proposing possible solutions. [ABSTRACT FROM AUTHOR]

Researchers in cognitive science have long been interested in modeling human perception using statistical methods. This requires maneuvers because these multiple dimensional data are always intertwined with complex inner structures. The previous studies in cognitive sciences commonly applied principal component analysis (PCA) to truncate data dimensions when dealing with data with multiple dimensions. This is not necessarily because of its merit in terms of mathematical algorithm, but partly because it is easy to conduct with commonly accessible statistical software. On the other hand, dimension reduction might not be the best analysis when modeling data with no more than 20 dimensions. Using state-of-the-art techniques, researchers in various research disciplines (e.g., computer vision) classified data with more than hundreds of dimensions with neural networks and revealed the inner structure of the data. Therefore, it might be more sophisticated to process human perception data directly with neural networks. In this paper, we introduce the multi-dimensional data analysis platform (MuDAP), a powerful toolbox for data analysis in cognitive science. It utilizes artificial intelligence as well as network analysis, an analysis method that takes advantage of data symmetry. With the graphic user interface, a researcher, with or without previous experience, could analyze multiple dimensional data with great ease. [ABSTRACT FROM AUTHOR]

The ordered weighted averaging (OWA) operator was proposed by Yager back in 1988 and constitutes a parameterized family of aggregation functions between the minimum and the maximum. The purpose of this paper is to perform a bibliometric review of this aggregation operator during the last 35 years through the Web of Science (WoS) Core Collection database and the Visualization of Similarities (VOS) viewer software. The results show that the OWA operator is an increasingly popular aggregation operator, especially in Computer Science. The results also allow the assertion that Yager, as expected, is still the most influential and productive author. Moreover, the study reveals that institutions from over 80 countries have contributed to OWA research, highlighting the high presence of Chinese universities and the emergence of Pakistani ones. Other interesting findings are presented to provide a comprehensive and up-to-date analysis of the OWA operator literature. [ABSTRACT FROM AUTHOR]

As part of ongoing research bridging ethnomethodology and computer science, in this article we offer an alternate reading of Alan Turing's 1936 paper, "On Computable Numbers". Following through Turing's machinic respecification of computation, we hope to contribute to a deflationary position on AI by showing that the activities attributed to AIs are achieved in the course of methodic hands-on work with computational systems and not in isolation by them. Turing's major innovation was a demonstration that mathematical and logical operations could be broken down into elementary, mechanically executable operations, devoid of intellectual content. Drawing out lessons from a re-enactment of Turing's methods as a means of reflecting on contemporary artificial intelligence (AI), including the way those methods disappear into the technology, we will suggest the interesting question raised in "On Computable Numbers" is less about the possibilities of designing machines that "can think" (cf. Turing, 1950), but the practical work we do, and which is made possible, when we ourselves set out to think like machines. [ABSTRACT FROM AUTHOR]

Large-scale benchmark datasets are crucial in advancing research within the computer science communities. They enable the development of more sophisticated AI models and serve as "golden" benchmarks for evaluating their performance. Thus, ensuring the quality of these datasets is of utmost importance for academic research and the progress of AI systems. For the emerging vision-language tasks, some datasets have been created and frequently used, such as Flickr30k, COCO, and NoCaps, which typically contain a large number of images paired with their ground-truth textual descriptions. In this paper, an automatic method is proposed to assess the quality of large-scale benchmark datasets designed for vision-language tasks. In particular, a new cross-modal matching model is developed, which is capable of automatically scoring the textual descriptions of visual images. Subsequently, this model is employed to evaluate the quality of vision-language datasets by automatically assigning a score to each 'ground-truth' description for every image picture. With a good agreement between manual and automated scoring results on the datasets, our findings reveal significant disparities in the quality of the ground-truth descriptions included in the benchmark datasets. Even more surprising, it is evident that a small portion of the descriptions are unsuitable for serving as reliable ground-truth references. These discoveries emphasize the need for careful utilization of these publicly accessible benchmark databases. [ABSTRACT FROM AUTHOR]

Electroencephalography (EEG) is a mechanism to understand the brain's functioning by analyzing brain electrical signals. More recently, it has been more commonly used in studies that are focused on the causation and effect of dementia. More tools are now available to gather EEG data. This brings about the challenge of understanding brain signals, which involves signal processing. Professionals with an electrical engineering background are very comfortable analyzing EEG data. Still, scientists in computer science and related fields need a source that can identify all the tools available and the process of analyzing the data. This paper deals specifically with the existing EEG data analysis tools and the processes involved in analyzing the EEG data using these tools. Furthermore, the paper goes in-depth into identifying the tools and the mechanisms of data processing techniques. In addition, it lists a set of definitions required for a better understanding of EEG data analysis, which can be challenging. The purpose of this paper is to serve as a reference for not only scientists that are new to EEG data analysis but also seasoned scientists that are looking for a specific data component in EEG and can go straight to the section of the paper that deals with the tool that they are using. [ABSTRACT FROM AUTHOR]

The purpose of this study is to propose an improved credit allocation method that makes the leading author of the paper more distinguishable and makes the deification more robust under malicious manipulations. We utilize a modified Sigmoid function to handle the fat-tail distributed citation counts. We also remove the target paper in calculating the contribution of co-citations. Following previous studies, we use 30 Nobel Prize-winning papers and their citation networks based on the American Physical Society (APS) and the Microsoft Academic Graph (MAG) dataset to test the accuracy of our proposed method (NCCAS). In addition, we use 654,148 articles published in the field of computer science from 2000 to 2009 in the MAG dataset to validate the distinguishability and robustness of NCCAS. Compared with the state-of-the-art methods, NCCAS gives the most accurate prediction of Nobel laureates. Furthermore, the leading author of the paper identified by NCCAS is more distinguishable compared with other co-authors. The results by NCCAS are also more robust to malicious manipulation. Finally, we perform ablation studies to show the contribution of different components in our methods. Due to limited ground truth on the true leading author of a work, the accuracy of NCCAS and other related methods can only be tested in Nobel Physics Prize-winning papers. NCCAS is successfully applied to a large number of publications, demonstrating its potential in analyzing the relationship between the contribution and the recognition of authors with different by-line orders. Compared with existing methods, NCCAS not only identifies the leading author of a paper more accurately, but also makes the deification more distinguishable and more robust, providing a new tool for related studies. [ABSTRACT FROM AUTHOR]

Aims: This article aims to perform a Systematic Literature Review (SLR) to better understand the structures of different methods, techniques, models, methodologies, and technologies related to provenance data management in health information systems (HISs). The SLR developed here seeks to answer the questions that contribute to describing the results. Method: An SLR was performed on six databases using a search string. The backward and forward snowballing technique was also used. Eligible studies were all articles in English that presented on the use of different methods, techniques, models, methodologies, and technologies related to provenance data management in HISs. The quality of the included articles was assessed to obtain a better connection to the topic studied. Results: Of the 239 studies retrieved, 14 met the inclusion criteria described in this SLR. In order to complement the retrieved studies, 3 studies were included using the backward and forward snowballing technique, totaling 17 studies dedicated to the construction of this research. Most of the selected studies were published as conference papers, which is common when involving computer science in HISs. There was a more frequent use of data provenance models from the PROV family in different HISs combined with different technologies, among which blockchain and middleware stand out. Despite the advantages found, the lack of technological structure, data interoperability problems, and the technical unpreparedness of working professionals are still challenges encountered in the management of provenance data in HISs. Conclusion: It was possible to conclude the existence of different methods, techniques, models, and combined technologies, which are presented in the proposal of a taxonomy that provides researchers with a new understanding about the management of provenance data in HISs. [ABSTRACT FROM AUTHOR]

This paper provides a survey of apparent personality trait analysis based on multimodal trait prediction and optimization of multimodal output parameters. This paper analyzes, synthesizes, and compares the development of different methods of Personality computing based on the personality trait analysis within the Big Five model (OCEAN model) and based on audio, visual and textual inputs. The results of the trait analysis and detection are different for different methods, from trait extracted from handwriting with an accuracy of 62-83%, trait extracted from with 56-62%, trait extracted from audio with 70%, trait extracted from visual element images and videos 87-91%, from aggregation function min and max 52 - 81%, mean and median 85%, and methods based on robustness and Huber function 72 - 77 %. Trait analysis is a problem with numerous real-life applications. Accurate trait recognition and analysis of various human traits are tasks that have been studied for a very long time in the field of psychology and lately represent an important area of study in the field of computer science and computing. The best results in the field of apparent personality trait analysis were achieved with convolutional neural networks. Multimodal trait prediction will give a better prediction than prediction based on a single modality, and optimization with aggregation functions and robust methods can achieve a better prediction of the models. [ABSTRACT FROM AUTHOR]

Can free agency be compatible with determinism? Compatibilists argue that the answer is yes, and it has been suggested that the computer science principle of "computational irreducibility" sheds light on this compatibility. It implies that there cannot, in general, be shortcuts to predict the behavior of agents, explaining why deterministic agents often appear to act freely. In this paper, we introduce a variant of computational irreducibility that intends to capture more accurately aspects of actual (as opposed to apparent) free agency, including computational sourcehood, i.e., the phenomenon that the successful prediction of a process' behavior must typically involve an almost-exact representation of the relevant features of that process, regardless of the time it takes to arrive at the prediction. We argue that this can be understood as saying that the process itself is the source of its actions, and we conjecture that many computational processes have this property. The main contribution of this paper is technical, in that we analyze whether and how a sensible formal definition of computational sourcehood is possible. While we do not answer the question completely, we show how it is related to finding a particular simulation preorder on Turing machines, we uncover concrete stumbling blocks towards constructing such a definition, and demonstrate that structure-preserving (as opposed to merely simple or efficient) functions between levels of simulation play a crucial role. [ABSTRACT FROM AUTHOR]