Search

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]

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 presents a preliminary comparison of citation impact between two types of Best Paper Awards recipients: pre-and post-publication peer-selected best papers. Two hundred and ninety-nine pairs of pre-and post-publication peer-selected best papers from 15 highly prestigious computer science conferences spanning more than two decades were gathered for empirical analysis. Each pair was published in the same proceedings, and their citation information was collected within a 10-year period after their formal publication. A series of pairwise comparisons were performed in order to unbiasedly uncover their differences in citation counts (i.e., a good proxy for citation impact), as well as in citation speed, citation diversity, and citation location distributions (i.e., three characteristic properties of citation impact). The empirical results demonstrate that in computer science, the post-publication peer-selected best papers receive significantly more citations than their pre-publication counterparts, with an estimated probability of up to 0.79 (95% CI: 0.74 ~ 0.83). Meanwhile, they tend to accumulate their citations more quickly in the later (versus earlier) stages—they can scarcely be fast-aging papers, and their accumulated citations tend to cover a broader scope of academic disciplines. Overall, however, the pre-and post-publication peer-selected best papers have very similar citation location distributions. Both of them are most frequently cited in the Background sections, followed by the Methods sections, and finally the Results sections. In addition, the citation impact superiority of the post-publication peer-selected best papers remains consistent across different fields of research and over a long period of time, from 1997 to 2022. [ABSTRACT FROM AUTHOR]

Science as a whole is organized into broad fields, and as a consequence, research, resources, students, etc., are also classified, assigned, or invited following a similar structure. Some fields have been established for centuries, and some others are just flourishing. Funding, staff, etc., to support fields are offered if there is some activity on it, commonly measured in terms of the number of published scientific papers. How to find them? There exist well-respected listings where scientific journals are ascribed to one or more knowledge fields. Such lists are human-made, but the complexity begins when a field covers more than one area of knowledge. How to discern if a particular paper is devoted to a field not considered in such lists? In this work, we propose a methodology able to classify the universe of papers into two classes; those belonging to the field of interest, and those that do not. This proposed procedure learns from the title and abstract of papers published in monothematic or "pure" journals. Provided that such journals exist, the procedure could be applied to any field of knowledge. We tested the process with Geographic Information Science. The field has contacts with Computer Science, Mathematics, Cartography, and others, a fact which makes the task very difficult. We also tested our procedure and analyzed its results with three different criteria, illustrating its power and capabilities. Interesting findings were found, where our proposed solution reached similar results as human taggers also similar results compared with state-of-the-art related work. [ABSTRACT FROM AUTHOR]

In the future, intelligent machines will replace or enhance human capabilities in many areas. Artificial intelligence is the intelligence exhibited by machines or software. It is the subfield of computer science. Artificial intelligence is becoming a popular field in computer science as it has enhanced the human life in many areas. Artificial intelligence in the last two decades has greatly improved performance of the manufacturing, service sector and so in the field of education. Study in the field of artificial intelligence has given rise to the rapidly growing technology known as expert system. Application areas of artificial intelligence is heaving a huge impact on various fields of life as expert system is widely used in these days to solve the complex problems in various areas as education, engineering, business, medicine, weather forecasting etc. The areas employing the technology of artificial intelligence have seen an increase in the quality and efficiency. This paper gives an overview of this technology and the scope of artificial intelligence in different areas with special reference to the use of this technology in the field of education along with its meaning, searching techniques, inventions and future. [ABSTRACT FROM AUTHOR]

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]

The 33rd International Workshop On Combinatorial Algorithms (IWOCA 2022) was held at the University of Trier in Germany. This workshop covers a wide range of topics related to combinatorial algorithms. The special issue of the journal Algorithmica contains extended versions of selected papers from IWOCA 2022, which were nominated by the Program Committee and underwent a rigorous reviewing process. The special issue includes nine papers on various topics such as perfect matchings, algorithmic questions, and winner determination algorithms. One paper was chosen as the Best Paper of IWOCA 2022 and another as the Best Student Paper. The special issue is recommended for readers interested in exploring more papers from IWOCA 2022. [Extracted from the article]

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

The International Journal of Semantic Computing has published a special issue on Semantic Computing, which includes five selected papers from the 17th IEEE International Conference on Semantic Computing. Semantic Computing focuses on the derivation, description, integration, and use of semantics for various resources. The papers in the special issue cover topics such as intent detection, constructing probabilistic models from knowledge graphs, unsupervised estimation of subjective content descriptions, the influence of noisy labels on question answering systems, and automatic domain-adaptive sentiment analysis. Each paper presents innovative approaches and findings in their respective areas of research. [Extracted from the article]

Decentralization is a pervasive concept found across disciplines, including Economics, Political Science, and Computer Science, where it is used in distinct yet interrelated ways. Here, we develop and publicly release a general pipeline to investigate the scholarly history of the term, analysing 425 , 144 academic publications that refer to (de)centralization. We find that the fraction of papers on the topic has been exponentially increasing since the 1950s. In 2021, 1 author in 154 mentioned (de)centralization in the title or abstract of an article. Using both semantic information and citation patterns, we cluster papers in fields and characterize the knowledge flows between them. Our analysis reveals that the topic has independently emerged in the different fields, with small cross-disciplinary contamination. Moreover, we show how Blockchain has become the most influential field about 10 years ago, while Governance dominated before the 1990s. In summary, our findings provide a quantitative assessment of the evolution of a key yet elusive concept, which has undergone cycles of rise and fall within different fields. Our pipeline offers a powerful tool to analyze the evolution of any scholarly term in the academic literature, providing insights into the interplay between collective and independent discoveries in science. [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]

There is widespread debate on whether to anonymize author identities in peer review. The key argument for anonymization is to mitigate bias, whereas arguments against anonymization posit various uses of author identities in the review process. The Innovations in Theoretical Computer Science (ITCS) 2023 conference adopted a middle ground by initially anonymizing the author identities from reviewers, revealing them after the reviewer had submitted their initial reviews, and allowing the reviewer to change their review subsequently. We present an analysis of the reviews pertaining to the identification and use of author identities. Our key findings are: (I) A majority of reviewers self-report not knowing and being unable to guess the authors' identities for the papers they were reviewing. (II) After the initial submission of reviews, 7.1% of reviews changed their overall merit score and 3.8% changed their self-reported reviewer expertise. (III) There is a very weak and statistically insignificant correlation of the rank of authors' affiliations with the change in overall merit; there is a weak but statistically significant correlation with respect to change in reviewer expertise. We also conducted an anonymous survey to obtain opinions from reviewers and authors. The main findings from the 200 survey responses are: (i) A vast majority of participants favor anonymizing author identities in some form. (ii) The "middle-ground" initiative of ITCS 2023 was appreciated. (iii) Detecting conflicts of interest is a challenge that needs to be addressed if author identities are anonymized. Overall, these findings support anonymization of author identities in some form (e.g., as was done in ITCS 2023), as long as there is a robust and efficient way to check conflicts of interest. [ABSTRACT FROM AUTHOR]

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

The problem of finding a maximum size matching in a graph (known as the maximum matching problem) is one of the most classical problems in computer science. Despite a significant body of work dedicated to the study of this problem in the data stream model, the state-of-the-art single-pass semi-streaming algorithm for it is still a simple greedy algorithm that computes a maximal matching, and this way obtains 1 / 2 -approximation. Some previous works described two/three-pass algorithms that improve over this approximation ratio by using their second and third passes to improve the above mentioned maximal matching. One contribution of this paper continues this line of work by presenting new three-pass semi-streaming algorithms that work along these lines and obtain improved approximation ratios of 0.6111 and 0.5694 for triangle-free and general graphs, respectively. Unfortunately, a recent work Konrad and Naidu (Approximation, randomization, and combinatorial optimization. Algorithms and techniques, APPROX/RANDOM 2021, August 16–18, 2021. LIPIcs, vol 207, pp 19:1–19:18, 2021. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.19) shows that the strategy of constructing a maximal matching in the first pass and then improving it in further passes has limitations. Additionally, this technique is unlikely to get us closer to single-pass semi-streaming algorithms obtaining a better than 1 / 2 -approximation. Therefore, it is interesting to come up with algorithms that do something else with their first pass (we term such algorithms non-maximal-matching-first algorithms). No such algorithms were previously known, and the main contribution of this paper is describing such algorithms that obtain approximation ratios of 0.5384 and 0.5555 in two and three passes, respectively, for general graphs. The main significance of our results is not in the numerical improvements, but in demonstrating the potential of non-maximal-matching-first algorithms. [ABSTRACT FROM AUTHOR]

Motivated by the fact that the fuzzy quasi-normed space provides a suitable framework for complexity analysis and has important roles in discussing some questions in theoretical computer science, this paper aims to study the nearest point problems in fuzzy quasi-normed spaces. First, by using the theory of dual space and the separation theorem of convex sets, the properties of the fuzzy distance from a point to a set in a fuzzy quasi-normed space are studied comprehensively. Second, more properties of the nearest point are given, and the existence, uniqueness, characterizations, and qualitative properties of the nearest points are obtained. The results obtained in this paper are of great significance for expanding the application fields of optimization theory. [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]

The article focuses on the importance of clinical informatics in neonatal care, highlighting its potential to provide critical resources for clinicians. Topics include the specialized data needed for neonatal care, the challenges in transitioning from paper to electronic health records, and the impact of informatics on real-time patient management and research.

Continuous improvement in the clinical performance of neonatal intensive care units (NICU) depends on the use of locally relevant, reliable data. However, neonatal databases with these characteristics are typically unavailable in NICUs using paper-based records, while in those using electronic records, the inaccuracy of data and the inability to customize commercial data systems limit their usability for quality improvement or research purposes. We describe the characteristics and uses of a simple, neonatologist-centered data system that has been successfully maintained for 30 years, with minimal resources and serving multiple purposes, including quality improvement, administrative, research support and educational functions. Structurally, our system comprises customized paper and electronic components, while key functional aspects include the attending-based recording of diagnoses, integration into clinical workflows, multilevel data accuracy and validation checks, and periodic reporting on both data quality and NICU performance results. We provide examples of data validation methods and trends observed over three decades, and discuss essential elements for the successful implementation of this system. This database is reliable and easily maintained; it can be developed from simple paper-based forms or used to supplement the functionality and end-user customizability of existing electronic medical records. This system should be readily adaptable to NICUs in either high- or limited-resource environments. [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]

The goal of this paper is to estimate object's 6D pose based on the texture-less dataset. The pose of each projection view is obtained by rendering the 3D model of each object, and then the orientation feature of the object is implicitly represented by the latent space obtained from the RGB image. The 3D rotation of the object is estimated by establishing the codebook based on a template matching architecture. To build the latent space from the RGB images, this paper proposes a network based on a variant Adversarial Autoencoder (Makhzani et al. in Computer Science, 2015). To train the network, we use the dataset without pose annotation, and the encoder and decoder do not have a structural symmetry. The encoder is inspired by the existing model (Yang et al. in proceedings of IJCAI, 2018), (Yang et al. in proceedings 11 of CVPR, 2019) that incorporates the function of feature extraction from two different streams. Based on this network, the latent feature vector that implicitly represents the orientation of the object is obtained from the RGB image. Experimental results show that the method in this paper can realize the 6D pose estimation of the object and the result accuracy is better than the advanced method (Sundermeyer et al. in proceedings of ECCV, 2018). [ABSTRACT FROM AUTHOR]

Baba is You is a 2019 indie puzzle game whose levels are two-dimensional grids of objects. This paper demonstrates how a universal Turing machine could be created as a custom level in the game if a specific in-game limit were to be removed. A player could perform any computation by playing this level, allowing infinitely many new and meaningful puzzles to be created. Furthermore, the construction is such that the level is won if and only if the Turing machine halts, proving perfect play of the game to be unattainable by any computer. The machine is found to be exponentially time-complex, and the paper concludes with a discussion of the practical feasibility of in-game computation. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to commemorate the late scholar Loet Leydesdorff for his great academic contribution on the basis of data from Web of Science. In the span of more than 40 years, he had 526 publications, with the years 2004-2021 being the most productive (394 publications). His international collaborations spread widely across 36 countries, with Germany, the USA, the UK, China, Russia, and South Korea being the most significant. His most frequent collaboration partners included Lutz Bornmann (Germany), Staša Milojević (USA), Caroline Wagner (USA), Henry Etzkowitz (USA), Jonathan Adams (UK), Ronald Rousseau (Belgium), and Ping Zhou (China). With a broad and deep knowledge background, Leydesdorff's research extended across multiple disciplines and fields, but he was most active in library and information science and computer science. He made profound contributions to the study of bibliometrics, innovation systems (the Triple Helix model), and communications. Leydesdorff had a remarkable and extensive citation impact, with citations in 221 WoS subject categories from 120 countries. His publications in 1996, 1998, 2000, 2005, 2006, and 2012 are highly cited, and those on university-industry-government relations (the Triple Helix model) are the most cited. [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]

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 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]

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]

Numerous technologies and systems, including autonomous vehicles, surveillance systems, and robotic applications, rely on the capability to accurately detect pedestrians to ensure their safety. As the demand for realtime object detection continues to rise, many researchers have dedicated their efforts to developing effective and trustworthy algorithms for pedestrian recognition. By integrating learning complexity-aware cascades with an enhanced you only look once (YOLO) algorithm, the paper presents a real-time system for identifying both items and pedestrians. The performance of the proposed approach is evaluated using the Karlsruhe Institute of Technology and Toyota Technological Institute (KITTI) pedestrian dataset across both the v4 and v8 versions of the YOLO framework. Prioritizing both speed and accuracy, the enhanced YOLO algorithm outperforms its baseline counterpart. The demonstrated superiority of the suggested technique on the KITTI pedestrian dataset underscores its effectiveness in real-world contexts. Furthermore, the complexity-aware learning cascades contribute to a streamlined detection model without compromising performance. When applied to scenarios requiring real-time identification of objects and individuals, the proposed method consistently delivers promising outcomes. [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]

Photonic crystals are periodic dielectric structures that possess a wealth of physical characteristics. Owing to the unique way they interact with the light, they provide new degrees of freedom to precisely modulate the electromagnetic fields, and have received extensive research in both academia and industry. At the same time, fueled by the advances in computer science, inverse design strategies are gradually being used to efficiently produce on-demand devices in various domains. As a result, the interdisciplinary area combining photonic crystals and inverse design emerges and flourishes. Here, we review the recent progress for the application of inverse design in photonic crystals. We start with a brief introduction of the background, then mainly discuss the optimizations of various physical properties of photonic crystals, from eigenproperties to response-based properties, and end up with an outlook for the future directions. Throughout the paper, we emphasize some insightful works and their design algorithms, and aim to give a guidance for readers in this emerging field. [ABSTRACT FROM AUTHOR]

Affective computing is a multidisciplinary field encompassing artificial intelligence, natural language processing, linguistics, computer science, and social sciences. This field aims to deepen our comprehension and capabilities by deploying inventive algorithms. This article presents a groundbreaking approach, the Cumulative Attribute-Weighted Graph Neural Network, which is innovatively designed to integrate trimodal textual, audio, and visual data from the two multimodal datasets. This method exemplifies its effectiveness in performing comprehensive multimodal sentiment analysis. Our methodology employs vocal inputs to generate speaker embeddings trimodal analysis. Using a weighted graph structure, our model facilitates the efficient integration of these diverse modalities. This approach underscores the interrelated aspects of various emotional indicators. The paper's significant contribution is underscored by its experimental results. Our novel algorithm achieved impressive performance metrics on the CMU-MOSI dataset, with an accuracy of 94% and precision, recall, and F1-scores above 92% for Negative, Neutral, and Positive emotion categories. Similarly, on the IEMOCAP dataset, the algorithm demonstrated its robustness with an overall accuracy of 93%, where exceptionally high precision and recall were noted in the Neutral and Positive categories. These results mark a notable advancement over existing state-of-the-art models, illustrating the potential of our approach in enhancing Sentiment Recognition through the synergistic use of trimodal data. This study's comprehensive analysis and significant results demonstrate the proposed algorithm's effectiveness in nuanced emotional state recognition and pave the way for future advancements in affective computing, emphasizing the value of integrating multimodal data for improved accuracy and robustness. [ABSTRACT FROM AUTHOR]

Community detection has been a subject of extensive research due to its broad applications across social media, computer science, biology, and complex systems. Modularity stands out as a predominant metric guiding community detection, with numerous algorithms aimed at maximizing modularity. However, modularity encounters a resolution limit problem when identifying small community structures. To tackle this challenge, this paper presents a novel approach by defining community structure information from the perspective of encoding edge information. This pioneering definition lays the foundation for the proposed fast community detection algorithm CSIM, boasting an average time complexity of only O (n log n) . Experimental results showcase that communities identified via the CSIM algorithm across various graph data types closely resemble ground truth community structures compared to those revealed via modularity-based algorithms. Furthermore, CSIM not only boasts lower time complexity than greedy algorithms optimizing community structure information but also achieves superior optimization results. Notably, in cyclic network graphs, CSIM surpasses modularity-based algorithms in effectively addressing the resolution limit problem. [ABSTRACT FROM AUTHOR]

The approximate uniform sampling of graph realizations with a given degree sequence is an everyday task in several social science, computer science, engineering etc. projects. One approach is using Markov chains. The best available current result about the well-studied switch Markov chain is that it is rapidly mixing on P-stable degree sequences (see DOI:10.1016/j.ejc.2021.103421). The switch Markov chain does not change any degree sequence. However, there are cases where degree intervals are specified rather than a single degree sequence. (A natural scenario where this problem arises is in hypothesis testing on social networks that are only partially observed.) Rechner, Strowick, and Müller–Hannemann introduced in 2018 the notion of degree interval Markov chain which uses three (separately well studied) local operations (switch, hinge-flip and toggle), and employing on degree sequence realizations where any two sequences under scrutiny have very small coordinate-wise distance. Recently, Amanatidis and Kleer published a beautiful paper (DOI:10.4230/LIPIcs.STACS.2023.7), showing that the degree interval Markov chain is rapidly mixing if the sequences are coming from a system of very thin intervals which are centered not far from a regular degree sequence. In this paper, we substantially extend their result, showing that the degree interval Markov chain is rapidly mixing if the intervals are centered at P-stable degree sequences. [ABSTRACT FROM AUTHOR]

Recommender systems can strongly influence which information we see online, e.g., on social media, and thus impact our beliefs, decisions, and actions. At the same time, these systems can create substantial business value for different stakeholders. Given the growing potential impact of such AI-based systems on individuals, organizations, and society, questions of fairness have gained increased attention in recent years. However, research on fairness in recommender systems is still a developing area. In this survey, we first review the fundamental concepts and notions of fairness that were put forward in the area in the recent past. Afterward, through a review of more than 160 scholarly publications, we present an overview of how research in this field is currently operationalized, e.g., in terms of general research methodology, fairness measures, and algorithmic approaches. Overall, our analysis of recent works points to certain research gaps. In particular, we find that in many research works in computer science, very abstract problem operationalizations are prevalent and questions of the underlying normative claims and what represents a fair recommendation in the context of a given application are often not discussed in depth. These observations call for more interdisciplinary research to address fairness in recommendation in a more comprehensive and impactful manner. [ABSTRACT FROM AUTHOR]

Currently, generative applications are reshaping different fields, such as art, computer vision, speech processing, and natural language. The computer science personalization area is increasingly relevant since large companies such as Spotify, Netflix, TripAdvisor, Amazon, and Google use recommender systems. Then, it is rational to expect that generative learning will increasingly be used to improve current recommender systems. In this paper, a method is proposed to generate synthetic recommender system datasets that can be used to test the recommendation performance and accuracy of a company on different simulated scenarios, such as large increases in their dataset sizes, number of users, or number of items. Specifically, an improvement in the state-of-the-art method is proposed by applying the Wasserstein concept to the generative adversarial network for recommender systems (GANRS) seminal method to generate synthetic datasets. The results show that our proposed method reduces the mode collapse, increases the sizes of the synthetic datasets, improves their ratings distributions, and maintains the potential to choose the desired number of users, number of items, and starting size of the dataset. Both the baseline GANRS and the proposed Wasserstein-based WGANRS deep learning architectures generate fake profiles from dense, short, and continuous embeddings in the latent space instead of the sparse, large, and discrete raw samples that previous GAN models used as a source. To enable reproducibility, the Python and Keras codes are provided in open repositories along with the synthetic datasets generated to test the proposed architecture (https://github.com/jesusbobadilla/ganrs.git). [ABSTRACT FROM AUTHOR]

As the world grapples with the pressing challenge of environmental sustainability, the need for innovative solutions to combat air pollution has become paramount. Air pollution is a complex issue that necessitates real-time monitoring of pollution sources for effective mitigation. This paper explores the potential of swarm algorithms applied as a novel and efficient approach to address this critical environmental concern. Swarm algorithms offer a promising framework for coordinating fleets of drones to collaboratively monitor and analyze air pollution sources. The unique capabilities of drones, including their agility, accessibility, and versatility, make them ideal candidates for aerial data collection. When harnessed in a swarm, these drones can create a dynamic and adaptable network that provides a more comprehensive and fine-grained understanding of air pollution dynamics. This paper delves into the conceptual foundations of using swarm algorithms in drone-based air pollution monitoring. [ABSTRACT FROM AUTHOR]

In this Medical News article, Arvind Narayanan, PhD, a professor of computer science at Princeton University, discusses the benefits of using artificial intelligence in research and clinical settings while remaining cautious of hype, biases, and data privacy issues. [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]

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]

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]

Geovisualization is an interdisciplinary field that combines cartography, geographic information science, computer science, psychology, and more. It involves representing spatial data in various ways, such as maps, animations, and interactive configurations, to explore relationships, patterns, and trends related to geographic entities and phenomena. This article presents eight contributions to the field, including topics such as urban planning, color in maps and art, spatial modeling, construction cost visualization, hydrological flow calculation, map-based data visualization, cartographic generalization, and historical cartographic data representation. The article highlights the challenges and opportunities in geovisualization and emphasizes its importance in conveying meaningful information in the era of big data and artificial intelligence. [Extracted from the article]

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]

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

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]