Search

Purpose: The research on social media-based academic communication has made great progress with the development of the mobile Internet era, and while a large number of research results have emerged, clarifying the topology of the knowledge label network (KLN) in this field and showing the development of its knowledge labels and related concepts is one of the issues that must be faced. This study aims to discuss the aforementioned issue. Design/methodology/approach: From a bibliometric perspective, 5,217 research papers in this field from CNKI from 2011 to 2021 are selected, and the title and abstract of each paper are subjected to subword processing and topic model analysis, and the extended labels are obtained by taking the merged set with the original keywords, so as to construct a conceptually expanded KLN. At the same time, appropriate time window slicing is performed to observe the temporal evolution of the network topology. Specifically, the basic network topological parameters and the complex modal structure are analyzed empirically to explore the evolution pattern and inner mechanism of the KLN in this domain. In addition, the ARIMA time series prediction model is used to further predict and compare the changing trend of network structure among different disciplines, so as to compare the differences among different disciplines. Findings: The results show that the degree sequence distribution of the KLN is power-law distributed during the growth process, and it performs better in the mature stage of network development, and the network shows more stable scale-free characteristics. At the same time, the network has the characteristics of "short path and high clustering" throughout the time series, which is a typical small-world network. The KLN consists of a small number of hub nodes occupying the core position of the network, while a large number of label nodes are distributed at the periphery of the network and formed around these hub nodes, and its knowledge expansion pattern has a certain retrospective nature. More knowledge label nodes expand from the center to the periphery and have a gradual and stable trend. In addition, there are certain differences between different disciplines, and the research direction or topic of library and information science (LIS) is more refined and deeper than that of journalism and media and computer science. The LIS discipline has shown better development momentum in this field. Originality/value: KLN is constructed by using extended labels and empirically analyzed by using network frontier conceptual motifs, which reflects the innovation of the study to a certain extent. In future research, the influence of larger-scale network motifs on the structural features and evolutionary mechanisms of KLNs will be further explored. [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 performance of a permissioned blockchain, namely, Hyperledger Fabric, is modeled and analyzed in a quantitative manner in this paper. Various types of nodes contribute to the performance of Hyperledger Fabric, and each of those is modeled and tracked along the operational flow of the permissioned blockchain. There are nodes for endorsement, ordering, and commitment to realize the due decentralized network operations. A quantitative model for each type of nodes has been proposed in Ke and Park (Performance study on various Hyperledger Fabric node types and transaction flow, IEEE BCCA, 2021) along with numerical analysis. Each type of the nodes is characterized in terms of transaction/block queue size and waiting time, and the transaction/block arrival rates and the transaction/block service rates are considered for simulation purposes. The analysis is extended beyond the analysis in Ke and Park (Performance study on various Hyperledger Fabric node types and transaction flow, IEEE BCCA, 2021) in this paper to particularly demonstrate how the arrival rates and the service rates co-influence the performance and how the number of channels impacts the performance, in order to ultimately facilitate a more dynamic way of optimization, taking the co-relation across different types of nodes into account. The major contribution of this paper to the field of computer science by creating a series of queuing models to evaluate the performance of different types of nodes: Chaincode Execution and Endorsement, Block Creation and Delivery, Transaction Validation and Block Committing, and Transaction Processing. [ABSTRACT FROM AUTHOR]

Purpose – Informally computer scientists reported they could access free copies of research papers they needed via tools such as Google Scholar. To ascertain whether this perception came from widespread free access or from unnoticed employer-paid access, the purpose of this paper was to locate computer science papers and determine what proportion was freely available using Google Scholar. Design/methodology/approach – A sample of 1,967 conference papers and periodical papers from 2003 to 2010, indexed in the ACM Guide to Computing Literature, was searched for manually in Google Scholar, using the paper or article title and the first author's surname and supplementary searches as needed. Findings – Free full-text versions were found for 52 per cent of the conference papers and 55 per cent of the periodical papers. Documents with older publication dates were more likely to be freely accessible than newer documents, with free versions found for 71 per cent of items published in 2003 and 43 per cent of items published in 2010. Research limitations/implications – Results were limited to the retrieval of known computer science publications via Google Scholar. Future research could examine whether the decline found in this study is specific to Google Scholar or reflects a decrease in the free sharing of research by computer scientists. Originality/value – Previous research for computer science found lower levels of free access than this research determined, but the decline found in this study runs contrary to increases that have been found. This research confirms many computer science papers are available for free but also that subscription holdings are necessary for complete coverage of papers in the field. [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]

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]

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]

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]

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]

Our world is turbulent: ecological, social, political, technological, economic, and competitive business environments change constantly. Consumers have changing preferences, learn, build trust in brands, adopt new products, and are persuaded by advertising. Firms innovate and engage in and respond to competition. Exogenous events, such as changes in economic conditions and regulations, as well as human crises, also cause major shifts in markets. This special issue focuses on novel Marketing data and modern methodologies from different fields (e.g., Operations Research (OR), Statistics, Econometrics, and Computer Science), which help firms understand, utilize, and respond to market dynamics more efficiently. Here we propose a framework comprising analytical methods and data for dynamic markets that is useful for structuring research in this domain. Next, we summarize the history of the Marketing/OR interface. We highlight studies at the Marketing/OR interface from the last decade focusing specifically on dynamic markets and use our proposed framework to identify trends and gaps in the extant literature. After that, we present and summarize the papers of the current special issue and their contributions to the field against the backdrop of our framework and the trends in the literature. Finally, we conclude and discuss which future Marketing/OR research could tackle important issues in dynamic markets. [ABSTRACT FROM AUTHOR]

Let d-claw (or d-star) stand for K 1 , d , the complete bipartite graph with 1 and d ≥ 1 vertices on each part. The d-claw vertex deletion problem, d -claw-vd, asks for a given graph G and an integer k if one can delete at most k vertices from G such that the resulting graph has no d-claw as an induced subgraph. Thus, 1 -claw-vd and 2 -claw-vd are just the famous vertex cover problem and the cluster vertex deletion problem, respectively. In this paper, we strengthen a hardness result recently proved in Jena and Subramani (in: Du, Du, Wu, and Zhu (eds) Theory and applications of models of computation - 17th annual conference, TAMC 2022, Tianjin, China, September 16–18, 2022, Proceedings, 2022), by showing that cluster vertex deletion remains NP -complete even when restricted to planar bipartite graphs of maximum degree 3 and arbitrary large girth. Moreover, for every d ≥ 3 , we show that d -claw-vd is NP -complete even when restricted to planar bipartite graphs of maximum degree d. These hardness results are optimal with respect to degree constraint. By extending the hardness result in Bonomo-Braberman et al (in: Computing and combinatorics - 26th international conference, COCOON 2020, Proceedings, Lecture Notes in Computer Science, vol 12273, Springer, 2020, pp 14–26, 2020), we show that, for every d ≥ 3 , d -claw-vd is NP -complete even when restricted to split graphs without (d + 1) -claws, and split graphs of diameter 2. On the positive side, we prove that d -claw-vd is polynomially solvable on what we call d-block graphs, a class properly contains all block graphs. This result extends the polynomial-time algorithm in Cao et al (Theor Comput Sci, 2018) for 2 -claw-vd on block graphs to d -claw-vd for all d ≥ 2 and improves the polynomial-time algorithm proposed by Bonomo-Brabeman et al. for (unweighted) 3 -claw-vd on block graphs to 3-block graphs. [ABSTRACT FROM AUTHOR]

Computational models are foundational concepts in computer science; many of these models such as P systems are based on natural biological processes. P systems represent a wide framework for a variety of concepts of data mining, as models of data clustering approaches. Data clustering is a technique for analyzing data based on its structure that is widely utilized for many applications. In this paper, the proposed model (PSO-MFM) has combined the Particle Swarm Optimization algorithm (PSO) with Mitochondrial Fusion Model to overcome some constraints of clustering techniques. The solving of clustering problem based on particle swarm is investigated in the proposed model when mutual dynamic rules are used. It can find the best cluster centers for a data set and improve clustering performance by utilizing the distributed parallel computing concept of mutual dynamic rules of mitochondrial fusion model. The comparative results demonstrate that the proposed strategy outperforms competition models when it comes to clustering accuracy, stability and the most efficient in time complexity. [ABSTRACT FROM AUTHOR]

With the increase interest and number of the users in Social media, the file handling has also increased. To manage the load, cloud servers are being used by the service providers. To identify and cluster file is a difficult task that is important in the domain of computer science. Various traditional approaches for identification exists that uses design features. The problem with these methods is get that they can be easily spoofed. To resolve the issue, in this paper, a hybrid algorithm combining the features of Random Forest with AdaBoost is proposed. The algorithm Internet of Thing (IoT) data file formatting (IDFF) classifies data as (text, image, audio and video) and gives better accuracy. Our proposed research obtains better Accuracy (93%), Precision (95%), Recall (95%), F-Measure (95%), and G-Mean (96%). [ABSTRACT FROM AUTHOR]

With the advent of technological advancement in learning, such as context-awareness, ubiquity and personalisation, various innovations in teaching and learning have led to improved learning. This research paper aims to develop a system that supports personalised learning through adaptive content, adaptive learning path and context awareness to meet individual learner's requirements and promote the effectiveness and performance of the learning process. Furthermore, the study used an experimental control group to ascertain the significance of learners' learning styles and preferences in improving learning performance. The model considers different modules such as personalisation, location support, learning plan and context awareness while relying on the proper classification of learners' learning styles. The system was experimented using 127 learners of a Computer Science Course. The result obtained using 10-fold cross-validation on various algorithms shows better performance in ROC, Kappa and Accuracy, which were all used to evaluate the quality of classification outcome and compared with learners' performances in assessments. During classification, Naïve Bayes Model has the highest average ROC value of 0.979, TP Rate of 0.951 and FP Rate of 0.045. The results obtained show an improvement in learning. [ABSTRACT FROM AUTHOR]

The integration of biology, computer science, and statistics has given rise to the interdisciplinary field of bioinformatics, which aims to decode biological intricacies. It produces extensive and diverse features, presenting an enormous challenge in classifying bioinformatic problems. Therefore, an intelligent bioinformatics classification system must select the most relevant features to enhance machine learning performance. This paper proposes a feature selection model based on the fractal concept to improve the performance of intelligent systems in classifying high-dimensional biological problems. The proposed fractal feature selection (FFS) model divides features into blocks, measures the similarity between blocks using root mean square error (RMSE), and determines the importance of features based on low RMSE. The proposed FFS is tested and evaluated over ten high-dimensional bioinformatics datasets. The experiment results showed that the model significantly improved machine learning accuracy. The average accuracy rate was 79% with full features in machine learning algorithms, while FFS delivered promising results with an accuracy rate of 94%. [ABSTRACT FROM AUTHOR]

This editorial introduces the special issue, Resources for Undergraduate Cryptology. We begin by describing possible roles for cryptology in the undergraduate mathematics curriculum together with a brief overview of the subject. We conclude with a brief preview of each paper included in this issue. [ABSTRACT FROM AUTHOR]

Since the Ronan Point collapse in the UK in 1968, the progressive collapse analysis of residential buildings has gradually drawn the attention of civil engineers and the scientific community. Recent advances in computer science and the development of new numerical methodologies allow us to perform high-fidelity collapse simulations. This paper assesses different scenarios that could have hypothetically caused the collapse of the Champlain Tower South Condo in Surfside, Florida, in 2021, one of the most catastrophic progressive collapse events that has ever occurred. The collapse analysis was performed using the latest developments in the Applied Element Method (AEM). A high-fidelity numerical model of the building was developed according to the actual structural drawings. Several different collapse hypotheses were examined, considering both column failures and degradation scenarios. The analyses showed that the failure of deep beams at the pool deck level, directly connected to the perimeter columns of the building, could have led to the columns' failure and subsequent collapse of the eastern wing of the building. The simulated scenario highlights the different stages of the collapse sequence and appears to be consistent with what can be observed in the footage of the actual collapse. To improve the performance of the structure against progressive collapse, two modifications to the original design of the building were introduced. From the analyses, it was found that disconnecting the pool deck beam from the perimeter columns could have been effective in preventing the local collapse of the pool deck slab from propagating to the rest of the building. Moreover, these analyses indicate that enhancing the torsional strength and stiffness of the core could have prevented the collapse of the eastern part of the building, given the assumptions and initiation scenarios considered. Building catastrophic collapses can cause significant lives and economic losses. Poor design and maintenance, in combination with aging, will more likely increase, in the next years, the number of buildings potentially vulnerable to the risk of collapse, due to either seismic, accidental, or degradation actions. This research focuses on the analysis of the Champlain Tower South condo collapse, which occurred in Surfside, Florida, in 2021. Different hypothetical collapse scenarios were simulated, comparing the analysis results with the actual evidence of the collapse. The analyses have shown that the degradation of the pool deck slab, due to corrosion, may have contributed to the collapse of the building. Finally, two different minor revisions of the original design of the building were analyzed to reduce the risk of failure and understand how the collapse of similar residential buildings could be prevented. [ABSTRACT FROM AUTHOR]

In this paper we discuss the types of knowledge used by six middle school students as they engaged with a debugging task designed to integrate ideas from computer science, mathematics and science. Our findings show that the computational thinking practice of debugging is a rich source of opportunities to integrate these different disciplines. The analysis illustrates how the types of knowledge the students did and did not use at each step of the debugging process were related to their ability to succeed at each step. Our work contributes to theory and practice by uncovering implications for studying debugging through two refined frameworks and for designing debugging tasks to support transdisciplinary learning. [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]

Diversity has become increasingly relevant in computer science and technology development, both in terms of inclusive design teams and as a concept used to design "diversity-aware" technologies. The latter part has received less attention and notions of diversity leveraged to design technologies remain understudied. This paper critically examines diversity concepts employed by computer scientists and designers by reviewing 120 articles in two subfields of computer science: personalized recommendations and human–computer interaction. Drawing on Black feminism and critical race theory-inspired literature, I offer a critique of demographic and cultural user representations and underscore the shortcomings of diversity as a strategy to increase user satisfaction and fairness. Particularly concerning is the unreflected use of binary, static, and individual-level diversity concepts in the design of technologies. Such concepts render structural inequalities between and within groups of users invisible and thereby risk reinforcing existing injustices. The paper closes with considerations on whether and how diversity concepts can be leveraged by designers in a social justice–oriented manner. [ABSTRACT FROM AUTHOR]

This paper elaborates on the notion of uncertainty in the context of annotation in large text corpora, specifically focusing on (but not limited to) historical languages. Such uncertainty might be due to inherent properties of the language, for example, linguistic ambiguity and overlapping categories of linguistic description, but could also be caused by a lack of annotation expertise. By examining annotation uncertainty in more detail, we identify the sources, deepen our understanding of the nature and different types of uncertainty encountered in daily annotation practice, and discuss practical implications of our theoretical findings. This paper can be seen as an attempt to reconcile the perspectives of the main scientific disciplines involved in corpus projects, linguistics and computer science, to develop a unified view and to highlight the potential synergies between these disciplines. [ABSTRACT FROM AUTHOR]

The words "Programming is the second literacy" were coined more than 40 years ago [13], but never came to life. The paper develops and details that old slogan by proposing that the mainstream mathematics education in schools should merge with education in computer science/programming. Of course, this means a deep structural reform of school mathematics education. We are not talking about adapting the 20th century mathematics to the 21st century—as it outlined in [10, 19], we mean the 21st century mathematics education for the 21st century mathematics. To the best of our knowledge, this paper is perhaps the first known attempt to start a proper feasibility study for this reform. The scope of the paper does not allow us to touch the delicate socio-political (and financial) sides of the reform, we are looking only at general curricular and didactic aspects and possible directions of the reform. In particular, we indicate approaches to development of a Domain Specifiic Language (DSL) as a basis for all programming aspects of a new course. [ABSTRACT FROM AUTHOR]

• Evidence-based early childhood computer science curriculum utilizing the free ScratchJr programming, Coding as Another Language (CAL). • Results from cluster randomized controlled trial show CAL's feasibility to implement, and effectiveness for improving coding skills. • Despite the time taken away from the math and literacy blocks to teach CAL, standardized test for literacy improved and math remained the same. • During the cluster randomized controlled trial, both the control and the intervention groups improved equally on computational thinking. This paper describes the iterative research and evaluation of the Coding as Another Language (CAL) curriculum that utilizes the free ScratchJr programming language in kindergarten to second grade. CAL was designed using principles of three theoretical frameworks: Curriculum Research Framework (CRF), which proposes different phases in the creation of research-based curriculum; Constructionism, which presents a computationally-rich project-based methodology based on identifying powerful ideas from a learning domain; and Positive Technological Development, which intentionally integrates socio-emotional and ethical dimensions into curricular experiences. The pedagogical foundation of CAL involves the understanding of coding as a literacy, that is, putting developmentally-appropriate powerful ideas of computer science in conversation with those taught in language arts. The paper first describes CAL and then presents results from both a pilot study and a cluster randomized controlled trial that set to evaluate CAL's feasibility and impact on students' learning outcomes. Our findings showed that the CAL curriculum was not only feasible to implement, but also effective for improving coding skills. However, CAL's impact on computational thinking is less clear given that in the cluster randomized controlled trial, both the control and the intervention groups improved equally on a measure of computational thinking. [ABSTRACT FROM AUTHOR]

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]

Driving research questions from the prevailing issues and interests and developing from them new theories, formulas, algorithms, methods, and designs, and linking them to the interests of the larger audience is a vital component of scientific research papers. The present article discusses outlining purposes or stating the nature of the present research, and listing research questions or hypotheses in the introduction of academic papers. This corpus-based genre study focuses particularly on Move 3 of the model "occupying the niche." The results indicating disciplinary variation show that the writers of Computer Science (CS) research articles, over the years have developed an increased use of outlining purpose/stating the nature of the present research, having the characteristics of purposive, descriptive, extension of the previous work, contrast to the existing work, brevity, complexity, and a description of methodology. It also shows that listing research questions or hypothesis may have distinctively different functions in developing genres as compared to the established ones such as physics. [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]

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]

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 present paper seeks to quantify the scholarly literature on Information Literacy (IL) during the last two decades by collecting data from the Scopus database from 2002 to 2021. The overall output includes 8769 records and 73181 citations. The average citation per paper is 10.81. "Communication in Computer and Information Science" was the most influential source among the titles for publishing research, with 386 papers. With 59 articles, Maria Pinto, affiliated with Granada University, has been named the most productive author. Lloyd has the most citations as well as the highest hindex. Purdue University and the University of Granada have been the most notable affiliations in institutional research production. The United States accounted for 42.70 percent of research production in total publications. [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]

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]

The study of nervous system architecture and its behavior is an interdisciplinary science related to "Neuroscience." It contains each and every detail related to neuroevolution, molecular and cellular biostructure, anatomy, and pharmacology. To understand this complex structure and architecture of nervous system, a fast, reliable, and advanced technology is required. Object recognition (OR) plays a vital role to understand and adapt the complex system in an easy way. Object recognition provides a computational and cognitive platform to link neuroscience with the human-machine interface for proper interaction in the medical field. OR-computational neuroscience deals with the neural pattern through different models, whereas OR-cognitive science helps to understand the behavior mechanism of neural architecture. The goal of this research is to explain how the brain interprets and processes information using electrical and chemical signals. The paper contains OR-based models in the field of neuroscience. It examines neural representations, neuronal type communication, and neural learning in depth. This paper provides an overview of OR-based cognitive computational neuroscience as well as the models that go with it. A thorough examination of the applications is presented, followed by a discussion of potential future paths. [ABSTRACT FROM AUTHOR]

In recent years, cellular neural networks (CNNs) have become a popular apparatus for simulations in neuroscience, biology, medicine, computer sciences and engineering. In order to create more adequate models, researchers have considered memory effects, reaction–diffusion structures, impulsive perturbations, uncertain terms and fractional-order dynamics. The design, cellular aspects, functioning and behavioral aspects of such CNN models depend on efficient stability and control strategies. In many practical cases, the classical stability approaches are useless. Recently, in a series of papers, we have proposed several extended stability and control concepts that are more appropriate from the applied point of view. This paper is an overview of our main results and focuses on extended stability and control notions including practical stability, stability with respect to sets and manifolds and Lipschitz stability. We outline the recent progress in the stability and control methods and provide diverse mechanisms that can be used by the researchers in the field. The proposed stability techniques are presented through several types of impulsive and fractional-order CNN models. Examples are elaborated to demonstrate the feasibility of different technologies. [ABSTRACT FROM AUTHOR]

Coauthorship prediction applies predictive analytics to bibliographic data to predict authors who are highly likely to be coauthors. In this study, we propose an approach for coauthorship prediction based on bibliographic network embedding through a graph‐based bibliographic data model that can be used to model common bibliographic data, including papers, terms, sources, authors, departments, research interests, universities, and countries. A real‐world dataset released by AMiner that includes more than 2 million papers, 8 million citations, and 1.7 million authors were integrated into a large bibliographic network using the proposed bibliographic data model. Translation‐based methods were applied to the entities and relationships to generate their low‐dimensional embeddings while preserving their connectivity information in the original bibliographic network. We applied machine learning algorithms to embeddings that represent the coauthorship relationships of the two authors and achieved high prediction results. The reference model, which is the combination of a network embedding size of 100, the most basic translation‐based method, and a gradient boosting method achieved an F1 score of 0.9 and even higher scores are obtainable with different embedding sizes and more advanced embedding methods. Thus, the strengths of the proposed approach lie in its customizable components under a unified framework. [ABSTRACT FROM AUTHOR]

Neuronal models have remained an important area of research in computer science. The dendritic neuron model (DNM) is a novel neuronal model in recent years. Previous studies have focused on training DNM using more appropriate algorithms. This paper proposes an improvement to DNM based on the activity of excitation and proposes three new models. Each of the three improved models are designed to mimic the excitation and inhibition activity of neurons. The improved model proposed in this paper is shown to be effective in the experimental part. All three models and original DNM have their own strengths, so it can be considered that the new model proposed in this paper well enriches the diversity of neuronal models and contributes to future research on networks models. [ABSTRACT FROM AUTHOR]

Purpose: The purpose of this paper is to characterize library and information science (LIS) as fragmenting discipline both historically and by applying Whitley's (1984) theory about the organization of sciences and Fuchs' (1993) theory about scientific change. Design/methodology/approach: The study combines historical source analysis with conceptual and theoretical analysis for characterizing LIS. An attempt is made to empirically validate the distinction between LIS context, L&I services and information seeking as fragmented adhocracies and information retrieval and scientific communication (scientometrics) as technologically integrated bureaucracies. Findings: The origin of fragmentation in LIS due the contributions of other disciplines can be traced in the 1960s and 1970s for solving the problems produced by the growth of scientific literature. Computer science and business established academic programs and started research relevant to LIS community focusing on information retrieval and bibliometrics. This has led to differing research interests between LIS and other disciplines concerning research topics and methods. LIS has been characterized as fragmented adhocracy as a whole, but we make a distinction between research topics LIS context, L&I services and information seeking as fragmented adhocracies and information retrieval and scientific communication (scientometrics) as technologically integrated bureaucracies. Originality/value: The paper provides an elaborated historical perspective on the fragmentation of LIS in the pressure of other disciplines. It also characterizes LIS as discipline in a fresh way by applying Whitley's (1984) theory. [ABSTRACT FROM AUTHOR]

Cluster analysis is one of the most fundamental methods in data mining, and it has been widely used in economics, social sciences and computer science. However, with the rapid development of Internet technology, the volume of data required for various web applications has grown rapidly, making the traditional clustering analysis methods face technical challenges. How to obtain useful information in a large amount of data quickly and efficiently is an urgent problem in many industrial fields. With the continuous development of cloud computing technology, large amounts of data can be performed quickly and efficiently. Hadoop is an open source distributed cloud computing platform with HDFS (Digital File System) and MapReduce as its core. HDFS provides massive data storage, while MapReduce uses the MapReduce programming model to achieve parallel processing. Compared with the traditional parallel programming model, it contains basic functions such as data partitioning, task scheduling, and parallel processing, making it possible for users to develop distributed applications on their own without understanding the basics of distributed basics, thus facilitating the design of parallel programs. K-means algorithm is a typical clustering analysis method, which is widely used in industry, but the number of iterations will increase significantly due to the growth of data volume, thus reducing the efficiency of computation. In order to better apply to the cluster analysis of large-scale data, this paper firstly implements a parallelization algorithm based on MapReduce on Hadoop platform using the basic idea of MapReduce and improves the K-means algorithm for the problems of blindness and easy to fall into local optimum when selecting randomly in clusters. [ABSTRACT FROM AUTHOR]

In this paper, we study quantum Ordered Binary Decision Diagrams(OBDD ) model; it is a restricted version of read-once quantum branching programs, with respect to "width" complexity. It is known that the maximal gap between deterministic and quantum complexities is exponential. But there are few examples of functions with such a gap. We present a new technique ("reordering") for proving lower bounds and upper bounds for OBDD with an arbitrary order of input variables if we have similar bounds for the natural order. Using this transformation, we construct a total function REQ such that the deterministic OBDD complexity of it is at least 2 Ω (n / log n) , and the quantum OBDD complexity of it is at most O (n 2 / log n) . It is the biggest known gap for explicit functions not representable by OBDD s of a linear width. Another function(shifted equality function) allows us to obtain a gap 2 Ω (n) vs O (n 2) . Moreover, we prove the bounded error quantum and probabilistic OBDD width hierarchies for complexity classes of Boolean functions. Additionally, using "reordering" method we extend a hierarchy for read-k-times Ordered Binary Decision Diagrams ( k - OBDD ) of polynomial width, for k = o (n / log 3 n) . We prove a similar hierarchy for bounded error probabilistic k - OBDD s of polynomial, superpolynomial and subexponential width. The extended abstract of this work was presented on International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8 – 12, 2017 Khadiev and Khadieva (2017) [ABSTRACT FROM AUTHOR]

The rise of the Internet and social media (i.e. reviews, forum discussions, blogs and social networks) constituted an interesting source to detect user opinion trends. This study examines the global publication output on opinion mining and sentiment analysis from documents published in 2000 to 2020. Bibliometric indicators on the trends, most cited papers, authors, institutions, countries, funding agencies and research subject areas were independently screened and analysed using bibliometrix package in R. A total of 7603 eligible documents were identified from 2000 to 2020. The total number of citations for all publications was 129,251, with an average of 17.0 citations per publication. About 14,629 authors wrote those documents with 1.93 authors per document and a collaboration index of 1.98. The most prolific author was Cambria Erik, with 47 publications and h-index of 42. The leading countries for research were China with n = 824, India with n = 576 and the United States with n = 244 publications. Lecture Notes in Computer Science proceedings was the top-ranked venue for publications with n = 434, h-index of 32 and 4598 total citation scores. National Natural Science Foundation of China was the top-ranked funding agency for research, and most of the publications were computer science (n = 6320) documents. The study provides an in-depth assessment of the landmark of the hot research topic and acknowledges the contribution of the most productive and active authors across different countries in the world. In addition, the findings could support the younger scholars in their future research direction and improve the efficiency in potential future research collaborations and projects. [ABSTRACT FROM AUTHOR]

The new way of thinking science from Newtonian determinism to nonlinear unpredictability and the dawn of advanced computer science and technology can be summarized in the words of the theoretical physicist Michel Baranger, who, in 2000, said in a conference: "Twenty-first-century theoretical physics is coming out of the chaos revolution; it will be about complexity and its principal tool will be the computer.". This can be extended to natural sciences in general. Modelling and predicting ionosphere variables have been considered since many decades as a paramount objective of research by scientists and engineers. The new approach to natural sciences influenced also ionosphere research. Ionosphere as a part of the solar–terrestrial environment is recognized to be a complex chaotic system, and its study under this new way of thinking should become an important area of ionospheric research. After discussing the new context, this paper will try to review recent advances in the exploration of ionosphere parameter time series in terms of chaos theory and the use of machine-learning algorithms. [ABSTRACT FROM AUTHOR]