Search

Sentiment analysis is one of the fastest growing research areas in computer science, making it challenging to keep track of all the activities in the area. We present a computer-assisted literature review, where we utilize both text mining and qualitative coding, and analyze 6996 papers from Scopus. We find that the roots of sentiment analysis are in the studies on public opinion analysis at the beginning of 20th century and in the text subjectivity analysis performed by the computational linguistics community in 1990’s. However, the outbreak of computer-based sentiment analysis only occurred with the availability of subjective texts on the Web. Consequently, 99% of the papers have been published after 2004. Sentiment analysis papers are scattered to multiple publication venues, and the combined number of papers in the top-15 venues only represent ca. 30% of the papers in total. We present the top-20 cited papers from Google Scholar and Scopus and a taxonomy of research topics. In recent years, sentiment analysis has shifted from analyzing online product reviews to social media texts from Twitter and Facebook. Many topics beyond product reviews like stock markets, elections, disasters, medicine, software engineering and cyberbullying extend the utilization of sentiment analysis. [ABSTRACT FROM AUTHOR]

Asking questions and making comments in conference Q&A sessions can be challenging for novice academics. Discussants not only try to seek answers or exchange ideas with the presenter but also endeavour to project a positive image of themselves by asking the 'right' questions in the 'right' way. However, many novice academics fear looking foolish because of unfocused and convoluted questions. Surprisingly, little guidance is available for how to formulate Q&A questions. This study attempts to address the gap by investigating the forms, functions and generic moves of 268 turns taken by discussants in 80 computer science conference Q&A sessions. Certain forms (i.e., question and comment) were found to be associated with certain pragmatic functions. This study reveals that different types of question/comment have major moves in common. The study also shows that the more evaluative and face-threatening the question is, the more important it is for the discussant to make the moves of building rapport with the presenter, and contextualising and justifying the main question/statement. The importance of justifying the main question/statement also resonates with the persuasive nature of scientific argumentative discourse. The findings can offer novice academics detailed explanations of the communicative purposes and strategies for this important conference interaction. • The two forms (question & comment) are associated with different functions. • All types of questions/comments were found to share the major generic moves. • Evaluative/critical questions entail building rapport as a move. • Evaluative/critical questions entail justifying the question as a move. • The importance of justification resonates with scientific argumentative discourse. [ABSTRACT FROM AUTHOR]

This paper presents results of topic modeling and network models of topics using the ICCS corpus, which contains domain-specific (computational science) papers over sixteen years (a total of 5695 papers). We discuss topical structures of ICCS, how these topics evolve over time in response to the topicality of various problems, technologies and methods, and how all these topics relate to one another. This analysis illustrates multidisciplinary research and collaborations among scientific communities, by constructing static and dynamic networks from the topic modeling results and the authors’ keywords. The results of this study give insights about the past and future trends of core discussion topics in computational science. We used the Non-negative Matrix Factorization(NMF) topic modeling algorithm to discover topics and labeled and grouped results hierarchically. We used Gephi to study static networks of topics, and an R library called DyA to analyze the dynamic networks of topics. [ABSTRACT FROM AUTHOR]

• This study explores the impact of different collaboration modes on the cited frequency of publications. • Compared with the existing works, our PSM-based method is more innovative since we investigate the impact of author's collaboration mode from a casual view. • Our method reduces the selection bias of samples and makes the variables more balanced. • Research collaboration, especially international collaboration, plays a significant role in promoting the impact of research results in three subfields of computer science. This study explores the impact of different collaboration modes on the cited frequency of publications. Though several studies have obtained some research results, most of them exploit association or regression-based methods, which may not lead to causal conclusions. To overcome the above challenges, we use the Propensity Score Matching (PSM) method to analyze and compare the citation frequencies resulting from four groups of collaboration models: international versus domestic, international multilateral versus international bilateral, domestic inter-organizational versus domestic intra-organizational, and domestic multi-author versus domestic single-author. More specifically, we conduct this analysis by exploring the publications with three computer science subfields from the Web of Science (WoS) database. The experimental results show that international collaboration, especially international multilateral collaboration, has a significant role in increasing the frequency of citations to scientific publications, showing that internationalization and collaboration are critical factors in the growth of the impact of the papers. Among national co-publications, collaborative publications within national organizations receive a higher citation impact. Multi-author collaborations significantly increase citation frequency compared to single-author publications. Our heterogeneity analysis across the different subfields of the computer science domain finds that the treatment effects for the three subfields differ modestly and mostly significant from the whole sample. Moreover, besides the implications for developing research policy and scientist collaboration, our study can capture the causal effect between author collaboration patterns and citation frequency to reveal their causal effects. [ABSTRACT FROM AUTHOR]

Abstract: Image acquisition has great influence on the performance of any computer vision application. Different methods can be utilized to acquire the digital image of a paper, whilst scanning scheme is among the most attractive methods. This attractiveness is because of the fewer types of potential deformations and the low cost of the scanning devices, e.g. flatbed scanners. However, paper is commonly placed imperfectly on the scanner. This slight rotation is not usually based on a pivot around the paper''s geometrical center (the well known regular rotation) but instead it is based on a pivot placed at the corner of the paper. Thus, the result is a digital image that is deformed with an “irregular rotation”. The characteristic of this deformation phenomenon is currently unknown to computer vision scientists. In this paper we provide an extensive investigation of this deformation. In addition, a new set of equations that sway and measure the transformation is proposed. Our investigation leads to the conclusion that the “irregular rotation” phenomenon produces a shear transformation. Furthermore, the experimental results confirm the theoretical findings. [Copyright &y& Elsevier]

Highlights: [•] Granular computing aspects of natural computing. [•] Review of different granular soft computing research. [•] Biological motivation, design principles, application areas, open research problems and challenging issues of these models. [ABSTRACT FROM AUTHOR]

Abstract: The need for applications that are developed especially for Computational Science and Engineering (CSE) has been growing rapidly in the recent years. These applications are often a prerequisite for research and have to be evolved and maintained for considerable periods of time. However, CSE researchers have traditionally put focus on achieving better computational performance and results rather than the software’s comprehensibility, maintainability and extensibility. This paper first presents two case studies on two different CSE research projects, where common and specific problems are identified. Second we propose solutions that intend to apply software engineering methodologies and tools to improve the CSE research software development. [ABSTRACT FROM AUTHOR]

Abstract: We present Open Review, a web-based platform aimed at stimulating executable papers by means of post-publication peer-review. Its goal is to bring computer science researchers to collaboratively build their work upon previous research results, in such a way that transparency, reproducibility and sustainability of research results are greatly improved. The main design goals of the platform are clarity, conciseness, and reproducibility. Its main features are to: (i) provide incentives for making research communities to participate, (ii) make papers executable by means of boards’ annotations, without necessarily involving the authors of an article, and (iii) give snapshots of the current research state on any given article. [Copyright &y& Elsevier]

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

Abstract: The Workshop for the Executable Paper Grand Challenge, taking place at the 2011 International Conference on Computational Science, is a platform for Grand Challenge contestants and finalists to present their concept of an Executable Paper, a method by which data intensive research is better represented in a scholarly journal article. The Executable Paper Grand Challenge is designed to enhance how scientific information is used and communicated in computer- and computational sciences. [Copyright &y& Elsevier]

• First survey of relevant research activities on Digital Calibration Certificate-DCC. • A thorough analysis of both the calibration process and the calibration certificate. • Modeling the calibration process, the calibration certificate life-cycle. • Identifying Calibration use-cases and stakeholders. • Advantages and disadvantages of various potential DCC formats. Calibration Certificates (CC) are essential for maintaining the accuracy of measurement instruments, which in turn are necessary to maintain the quality of products and services. Such certificates are mainly used in legal metrology for quality audits, accreditation and examination processes; and also in the operational metrology to adjust measurement results according to device uncertainty. Paper-based CC (PCC) or a digital copy of the paper format has been successfully used for this purpose for many decades. However, the PCC starts to fail short with the emergence of new technologies and applications that require automated creation, processing and updates of the calibration certificates. The last years have witnessed an intense effort on digital transformation in metrology and especially developing Digital Calibration Certificates (DCC). Until recently, we noticed the lack of agreement on the nature and the usage of such important new metrology artifacts as well as some repetition in the work by different researchers. To help reaching a minimum consensus on the subject, we present in this paper, a thorough analysis of the calibration certificate and the calibration process. Besides that, we aim by this work to provide an overview of the carried research on that point to help peer researchers to view the big picture and to avoid wasting their efforts in repeating same work on same ideas. Consequently, they can recognize the peer researchers and organizations working on the same topics, find available resources, identify research gaps and identify the best potential directions of their efforts as well. Finally, our paper aims also to establish a bridge between the metrological concepts and information technology concepts such that more computer science researchers can be involved in solving the problem. [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]

Boolean functions used in symmetric-key encryption should have high higher-order nonlinearity to resist several known cryptographic attacks, such as algebraic attacks and low-degree approximation attacks. The higher-order nonlinearity also plays an important role in coding theory and theoretical computer science, since it relates to the covering radius of Reed–Muller codes and the Gowers norm, respectively. It is well-known that bent functions have the highest nonlinearity in an even number of variables and thus they possess the best ability to withstand fast correlation attacks and best affine approximation attacks. However, there is currently limited knowledge regarding the higher-order nonlinearity of bent functions because computing the higher-order nonlinearity, or even providing tight lower bounds, is an extremely hard task. In 1974, Dillon proposed two well-known classes of bent functions based on partial spread (in brief, PS), called PS − and PS + , respectively. He also exhibited a subclass of bent functions in PS − , known as partial spread affine plane(PS a p for short). In this paper, we provide a lower bound on the third-order nonlinearity of the simplest PS a p bent functions in n variables, where n ≥ 6 is even, by calculating the nonlinearities of all second-order derivatives of this kind of bent functions. Compared to the two known lower bounds on the third-order nonlinearity given by Carlet and Tang et al. respectively, our lower bound is much better than these two ones. [ABSTRACT FROM AUTHOR]

The development of the computer and what is now known as artificial intelligence (AI) has evolved over more than two centuries in a long series of steps. The date of the invention of the first computer is estimated at 1822, when Charles Babbage (1791-1871) developed his first design of a working computer on paper, based mainly on a Jacquard loom. He worked on his project together with Augusta Ada King, Countess Lovelace (née Byron) (Ada Lovelace) (1815-1852), whom he called the "Sorceress of Numbers." This work will present the profile and achievements of Charles Babbage, Augusta Ada King, Countess Lovelace, and Alan Mathison Turing (1912 - 1954), who is considered the father of computer science and artificial intelligence, and then provide an outline of the tumultuous events affecting AI up to the present. [ABSTRACT FROM AUTHOR]

Graph mining is one of the significant tasks in the field of computer science. Most of the applications generate a vast amount of data which is represented with the help of a graph. Due to this graph representation, these applications have become complex and increased in size. Finding relevant information from that graph becomes a complicated task. For this community detection algorithms play a vital role in graph partitioning to retrieve relevant information. Finding communities in a graph reduces the complexity of the graph due to related data comes closer to forming a community. Many algorithms have been introduced in the last decade; the Clique percolation method (CPM) is the benchmark algorithm for finding an overlapping community. But in this method, some nodes remain unclassified, nodes that are not part of the clique. Paper proposed the clique-based Louvain algorithm(CBLA), which can classify the non-classified node (NCN) obtained after finding cliques in one of the communities by applying the Louvain algorithm. Louvain algorithm is used to classify the non-overlapped community, but with the help of cliques, it will also detect the overlapped nodes. This paper compared the proposed algorithm with four other benchmark algorithms. The proposed algorithm gives equal or enhanced performance among all compared algorithms. [ABSTRACT FROM AUTHOR]

Graph theory is a powerful and essential tool for applied scientists and engineers in analyzing and designing algorithms for several problems. Graph theory has a vital role in complex systems, especially in computer sciences. Applications of graph theory can be found in many scientific disciplines such as operational research, engineering, life sciences, management sciences, coding, and computer science. In the literature, there are two algorithms for constructing decompositions for the circulant graphs C 2 r , r with 2 r vertices and r degree. For r , m ⩾ 2 , a circulant-balanced complete multipartite graph C mr , (m - 1) r is a generalization to C 2 r , r. Here, the major contributions are the generalization of the algorithms used for constructing the decompositions for the circulant graphs C 2 r , r to generalized algorithms that can be used for the decomposition of C mr , (m - 1) r that have mr vertices and (m - 1) r degree. These generalized algorithms manage us to decompose the circulant graphs C mr , (m - 1) r by different graph classes. The paper's novelty is demonstrated by the fact that it is the first to suggest general approaches for decomposing circulant-balanced complete multipartite graphs. The constructed results in the present paper are suitable for generating different codes and also have great importance in the design of experiments. [ABSTRACT FROM AUTHOR]

Fair division of indivisible items is a well-studied topic in Economics and Computer Science. The objective is to allocate items to agents in a fair manner, where each agent has a valuation for each subset of items. Envy-freeness is one of the most widely studied notions of fairness. Since complete envy-free allocations do not always exist when items are indivisible, several relaxations have been considered. Among them, possibly the most compelling one is envy-freeness up to any item (EFX), where no agent envies another agent after the removal of any single item from the other agent's bundle. However, despite significant efforts by many researchers for several years, it is known that a complete EFX allocation always exists only in limited cases. In this paper, we show that a complete EFX allocation always exists when each agent is of one of two given types, where agents of the same type have identical additive valuations. This is the first such existence result for non-identical valuations when there are any number of agents and items and no limit on the number of distinct values an agent can have for individual items. We give a constructive proof, in which we iteratively obtain a Pareto dominating (partial) EFX allocation from an existing partial EFX allocation. [ABSTRACT FROM AUTHOR]

Since 2000, the field of machine scheduling—an integral part of computer science and operations research—has seen significant advancements. This paper explores the dynamic progression of machine scheduling, offering a detailed overview of its past advancements, current practices, and future directions. Anchoring the research in robust data analysis and statistical methodologies, the paper reveals the subtle yet impactful changes that have characterized the field in the last two decades. It examines the prominence of various scheduling problems, identifies leading research journals, and highlights international contributions and collaborations, thereby offering a thorough guide to the machine scheduling ecosystem. The study delves into specific problem characteristics and assesses performance criteria and solution methods to provide an in-depth view of the field's multifaceted nature. Ultimately, this paper captures the essence of machine scheduling's evolution and suggests new paths for exploration. The insights gained contribute significantly to academic discussions and equip practitioners with a comprehensive understanding of the dynamic landscape of machine scheduling. [ABSTRACT FROM AUTHOR]

• Eulerian trails are classical and important objects in theoretical computer science field. • Enumeration of Eulerian trails is known to be #P-complete. • Although the existence of an algorithm with linear time per output is known, the existence of a faster algorithm is open. • This paper shows optimal algorithms for Eulerian trails which run in constant time per solution on average. In this paper, we consider enumeration problems for edge-distinct and vertex-distinct Eulerian trails. Two Eulerian trails are said to be edge-distinct if the edge sequences are not identical, and they are said to be vertex-distinct if the vertex sequences are not identical. To solve these problems, we propose optimal enumeration algorithms that run in O (N + m) total time, where N is the number of solutions and m is the number of edges in an input connected graph. The proposed algorithms are based on the reverse search technique introduced by [Avis and Fukuda, DAM 1996], and the push-out amortization technique introduced by [Uno, WADS 2015]. [ABSTRACT FROM AUTHOR]

This paper proposes a deep learning approach for solving non-smooth convex optimization problems (NCOPs), which have broad applications in computer science, engineering, and physics. Our approach combines neurodynamic optimization with physics-informed neural networks (PINNs) to provide an efficient and accurate solution. We first use neurodynamic optimization to formulate an initial value problem (IVP) that involves a system of ordinary differential equations for the NCOP. We then introduce a modified PINN as an approximate state solution to the IVP. Finally, we develop a dedicated algorithm to train the model to solve the IVP and minimize the NCOP objective simultaneously. Unlike existing numerical integration methods, a key advantage of our approach is that it does not require the computation of a series of intermediate states to produce a prediction of the NCOP. Our experimental results show that this computational feature results in fewer iterations being required to produce more accurate prediction solutions. Furthermore, our approach is effective in finding feasible solutions that satisfy the NCOP constraint. [ABSTRACT FROM AUTHOR]

The large number of scientific publications around the world is increasing at a rate of approximately 4%–5% per year. This fact has resulted in the need for tools that deal with relevant and high-quality publications. To address this necessity, search and reference management tools that include some recommendation algorithms have been developed. However, many of these solutions are proprietary tools and the full potential of recommender systems is rarely exploited. There are some solutions which provide recommendations for specific domains, by using ad-hoc resources. Furthermore, some other systems do not consider any personalization strategy to generate the recommendations. This paper presents ArZiGo , a web-based full prototype system for the search, management, and recommendation of scientific articles, which feeds on the Semantic Scholar Open Research Corpus, a corpus that is growing continually with more than 190M papers from all fields of science so far. ArZiGo combines different recommendation approaches within a hybrid system, in a configurable way, to recommend those papers that best suit the preferences of the users. A group of 30 human experts has participated in the evaluation of 500 recommendations in 10 research areas, 7 of which belong to the area of Computer Science and 3 to the area of Medicine, obtaining quite satisfactory results. Besides the appropriateness of the articles recommended, the execution time of the implemented algorithms has also been analyzed. • A web system for the search, management, and recommendation of scientific articles. • A hybrid and multidisciplinary scientific article recommendation system. • A modular and scalable recommendation system. • Use of the Semantic Scholar Open Research Corpus as a corpus of articles. [ABSTRACT FROM AUTHOR]

Automatic classification of the plants is growing area of association with computer science and Botany, it has attracted many researchers to subsidize plant classification using image processing and machine learning techniques. Plants can be classified using number of traits such as leaf color, flowers, leaves, roots, leaf shape, leaf size etc. highly depends upon feature selection methods. However extraction of features from selected trait is most significant state in classification. State-of-the-art classification can be achieved by using leaf characteristics such as leaf venation patterns, leaf spectral signatures, leaf color, leaf shape, etc. This paper describes multimodal plant classification system using leaf venation patterns and its spectral signatures as a significant features. This paper shows that the feature fusion can be used to achieve efficient plant identification. The accuracy of identification for leaf spectral data, leaf venation features and HOG features is validated, it signifies that feature fusion technique performs better than that of non-imaging spectral signatures features only, with recognition result of 98.03% GAR and 93.51% GAR, respectively. [ABSTRACT FROM AUTHOR]

Solid codes provide outstanding fault-tolerance when used for information transmission through a noisy channel involving not only symbol substitutions, but also synchronisation errors and black-outs. In this paper we provide an automaton theoretic characterisation of solid codes which takes this fault-tolerance into account. The fault-tolerance afforded by a solid code L can be summarised as follows: Consider messages, encoded using L , being sent through a noisy channel. Any code words in L , which are present in the received message, will be decoded correctly, unless they themselves happen to be the results of errors. Thus, errors in the received message will not lead to incorrect decodings of those parts which are error-free. In this paper we consider acceptors which are fault-tolerant in this sense when analysing such received messages. These acceptors characterise the class of solid codes. For finite solid codes an automaton characterisation was published in the sixties by Levenshtein and Romanov. The characterisation uses state-invariant finite-state transducers which act as decoders in such a way that an output is generated exactly when a code word has been read completely. State-invariance means that acceptance does not depend on the initial state — every state can be used as the initial state. The results of Levenshtein and Romanov depend strongly on the fact that the code is finite. In this paper we provide a general automaton theoretic characterisation of arbitrary solid codes without any such restriction. Moreover, the solid code is regular as a language if and only if the automaton used in the characterisation can be reduced to an equivalent finite automaton with equivalent properties. The main results of this paper are as follows: Every acceptor defines a solid code. For every solid code there is a fault-tolerant acceptor defining the code. Such acceptors expose the decomposition of potentially faulty received messages according to the code. For solid codes which are regular as languages these acceptors can be chosen to be finite while preserving all important combinatorial properties. Part of this work was presented at the 14th Journées Montoises of Theoretical Computer Science [32]. [ABSTRACT FROM AUTHOR]

The multiple-attribute decision-making (MADM) problem is resolved through the q -rung complex diophantine neutrosophic normal set (q -rung CDNNS). An important way to express uncertain information is using q -rung orthopair fuzzy sets (q -ROFs). Yager introduced q -ROFs as a generalization of intuitionistic fuzzy sets in which the sum of membership and non-membership degrees is one. In addition, they have superiority over intuitionistic fuzzy sets and Pythagorean fuzzy sets. Complex diophantine fuzzy sets are generalizations of neutrosophic and diophantine fuzzy sets, respectively. Several aggregating operations (AOs) are discussed here, as well as their respective interpretations. The paper discusses q -rung CDNN weighted averaging (q -rung CDNNWA), q -rung CDNN weighted geometric (q -rung CDNNWG), q -rung generalized CDNN weighted averaging (q -rung GCDNNWA) and q -rung generalized CDNN weighted geometric (q -rung GCDNNWG). We will review several of these sets with important properties in greater detail using algebraic operations. Additionally, we develop an algorithm for solving MADM problems using these operators. Several real-world examples illustrate how enhanced score values can be applied. Sensor robots are said to rely heavily on computer science and machine tool technology. Four factors are to evaluate when determining a sensor robotics system's quality: resolution, sensitivity, error, and environment. It is possible to compare expert opinions with the criteria and determine the best alternative. Therefore, the value of q significantly impacts the model's results. To prove that the models considered are valid and useful, we will compare the current and proposed models. Thus, q has a significant impact on the results of the model. [ABSTRACT FROM AUTHOR]

The research domains and solutions of information technology have been rapidly changed as information technology continuously and deeply deployed into our society. On the other hand, it can be considered that there are some common knowledge creation processes in information technology researches. In this paper, we propose a common research process on creating new researches which were extracted by retrospectively reengineering knowledge creation model of our Information Technology research papers that were conducted with my co-authors. The research creation model is applied and evaluated by our publications. [ABSTRACT FROM AUTHOR]

Turing (1937) introduces a model of code that is followed by other pioneers of computing machines (such as Flowers 1983, Eckert, Mauchly, Brainerd 1945 and others). One of them is John von Neumann, who defines the concept of optimal code in the context of the conception of EDVAC. He later uses it to build on in his theoretical considerations of the universal constructor (von Neumann 1966). Von Neumann (1963) further presents one of the first neural network models, in relation to the work of McCulloch and Pitts (1943), for both theoretical purposes (von Neumann probe) and practical applications (computer architecture of EDVAC). The aim of this paper is (1) to describe the differences between Turingʼs and von Neumannʼs conceptualizations of code and the mechanical computing model. Between von Neumann's abstract technical conception (von Neumann 1963 and 1966) and Turingʼs more concrete biochemical conception (Turing 1952). Furthermore, (2) we want to answer the question why these influential models of mechanisms (predominantly in computer science) have so far been ignored by philosophers of the new mechanism (Machamer, Darden, Craver 2000, Glennan 2017). We will show that these classical models of machines are not only compatible with the new mechanism, but moreover complement it, since they represent a completely separate type of model of mechanism, alongside producing, maintaining and underlying (Zámečník 2021). The final (3) and main goal of our paper will be an attempt to relate von Neumannʼs and Turingʼs notion of mechanism to Barbieriʼs notion of extended mechanism (Barbieri 2015). [ABSTRACT FROM AUTHOR]

In a world whose attention to environmental and health problems is very high, the issue of properly managing nuclear waste is of a primary importance. Information and Communication Technologies have the due to support the definition of the next-generation plants for temporary storage of such wasting materials. This paper investigates on the adoption of one of the most cutting-edge techniques in computer science and engineering, i.e. Digital Twins, with the combination of other modern methods and technologies as Internet of Things, model-based and data-driven approaches. The result is the definition of a methodology able to support the construction of risk-aware facilities for storing nuclear waste. [ABSTRACT FROM AUTHOR]

The technological progress in computer science (particularly, in machine learning) has contributed to the improvement of medical services, both in detecting and treating diseases. The large volumes of data, that are overwhelming for human experts (doctors, nurses), can easily be managed by automated systems, as long as we have the computational resources. Obviously, human experts are still essential in the process - we think of the use of computer science in medicine as a collaboration between medical staff and artificial intelligence. The usual types of data that can be processed by automated systems are text, sound, and image types. In this paper, we approach the diagnosis subject and focus on data consisting of sound. We created a heart murmur detection system - it analyzes recordings and tells the user whether the sound samples indicate a heart murmur or not, based on a trained machine learning model. One of the main advantages of our system is the fact that we ran a large number of experiments, with different configurations of denoising techniques and features taken into consideration. We were able to draw some interesting conclusions, for example, we found out which features are the most important for the classification and which features are not worth computing. Also, our work denotes a thorough understanding of sound processing. [ABSTRACT FROM AUTHOR]

This article discusses the correlation between first-year students' prior knowledge of programming and their academic achievements. Many students who enroll in the Faculty of Computer Science and Information Technology at Riga Technical University drop out during their first year. Therefore, it is crucial to support first-year students in acquiring programming knowledge successfully. The Faculty of Computer Science and Information Technology provides an additional course called "Algorithmization Practice" for students without prior programming experience. The authors of this paper conducted research to investigate whether this course helps bridge the gap between students with and without prior programming knowledge and whether it improves the academic performance of students without prior knowledge in their first year. The collected data was summarized using descriptive statistics, and the final scores of students from different groups were compared to identify any differences between those who attended the "Algorithmization Practice" course and those who did not. Based on a sample of 1744 introductory programming course students, our analysis indicates that students who attended the additional course demonstrated better academic performance. [ABSTRACT FROM AUTHOR]

The NHS England Radiotherapy Service Specification calls for routine use of patient-reported outcome measures (PROMs). However, barriers exist at patient, healthcare professional and service levels. The aim of the present study was to determine the current use of PROMs within radiotherapy services in England. The current attitudes, barriers and enablers to the implementation of PROMs in radiotherapy practice were evaluated and practical recommendations to inform future implementation were developed. A mixed-methods approach was adopted to obtain quantitative and qualitative data. An online questionnaire was developed and disseminated to all radiotherapy operational delivery network managers across England. The questionnaire consisted of 12 open and closed questions relating to PROMs use, with the option to provide free-text responses. Inductive thematic analysis was conducted on free-text comments, whereas descriptive statistics were used to analyse quantitative data. In total, 182 responses were received from 40 of the 50 radiotherapy providers, resulting in a response rate of 84%. The current use of PROMs was analysed, including rationale for use, tools used, format of PROMs collection and timing within the radiotherapy pathway. Most respondents indicated that PROMs were used in the context of clinical trials only. Through thematic analysis, four identical key themes were identified relating to both barriers and enablers to PROMs use; these included IT infrastructure, time, human/financial resources and training/education. A fifth theme, standardisation, was identified as a key enabler to PROMs use. Our findings show that outside of clinical trials, PROMs are not routinely used in radiotherapy services due to barriers identified at professional and service levels. Here we provide recommendations to mitigate the barriers identified and implement PROMs in radiotherapy, including training for healthcare professionals and standardisation of PROMs tools and storage. This study provides a key first step in driving PROMs implementation within radiotherapy services across England. • Outside of clinical trials, PROMs were not widely used within radiotherapy services. • Common PROMs used included QOL, anxiety/depression and urinary/bowel function tools. • PROMs are completed using either paper or electronic forms, by staff or patients. • Barriers include IT infrastructure, time, resources (staff/finances) and training. • Enablers included IT, time, resources, training and standardisation. [ABSTRACT FROM AUTHOR]

Today's production methods are challenged by changing paradigms from a static constraint mass production and mass customization to continuing personalization and regionalization of product, production and markets. It is yet unclear what future production systems will be the most appropriate, how they will look like and how the current, uncertain trends in manufacturing can be tackled most effectively. In this paper, first results from a comprehensive questionnaire on »The Intelligent Production of the Future«, performed by a consortium of researchers from the Institute for Computer Science and Control (SZTAKI) and the Fraunhofer-Institute for Manufacturing Engineering and Automation IPA are outlined. During this survey, stakeholders and peers from more than 70 companies and research institutions in Germany, Austria and Hungary have been asked to share their impressions, describe their opinions and rate central statements on future production systems, methodologies and trends. The paper outlines the most important topics of future production systems and lessons learned during the evaluation of the survey. [ABSTRACT FROM AUTHOR]