Search

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]

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]

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]

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]

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]

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]

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]

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]

Internet has been source of knowledge for decades. The pool of information cannot be sustained in absence of the network of networks. Internet has many useful applications in commercial, social and educational areas. In today's scenario, e-learning is also one of the useful applications in the world of Internet. The medium of e-learning has achieved advancement in various fields such as adaptive e-learning systems. The branch of computer science with psycholinguistics has done tremendous job in providing technical solutions to learners. However, learning disorders on the platform of e-learning still require lots of research. Therefore, this paper provides a personalized assessment model for alphabet learning with learning objects for children's who face dyslexia. The cognitive inclination of dyslexic learner has been determined using assessment model. This paper studies the cognitive potential of dyslexic learner and has built a personalized e-learning platform to alleviate their alphabetical problems. [ABSTRACT FROM AUTHOR]

This paper aims at identifying the key role of "Smart Energy and Power Systems Modelling", within the context of Energy Informatics. The main objective is to describe how the specific subject of "Smart Energy and Power Systems Modelling" can give a key contribution within the novel domain of Energy Informatics, by successfully linking and integrating the different disciplines involved. First the paper will present how and where the specific subject of "Smart Energy and Power Systems Modelling" can position itself within the broad Energy Informatics domain. Afterwards the paper will explain how Cyber-Physical Systems (CPS) and Information and Communication Technologies (IoT), coupled with "Smart Energy and Power Systems Modelling", can enhance the Energy Informatics domain. In addition, the main challenges and opportunities for Energy Informatics specialists will be outlined, with regard to the interdisciplinary approach that characterises this field. [ABSTRACT FROM AUTHOR]

Automatic grading is not a new approach but the need to adapt the latest technology to automatic grading has become very important. As the technology has rapidly became more powerful on scoring exams and essays, especially from the 1990s onwards, partially or wholly automated grading systems using computational methods have evolved and have become a major area of research. In particular, the demand of scoring of natural language responses has created a need for tools that can be applied to automatically grade these responses. In this paper, we focus on the concept of automatic grading of short answer questions such as are typical in the UK GCSE system, and providing useful feedback on their answers to students. We present experimental results on a dataset provided from the introductory computer science class in the University of North Texas. We first apply standard data mining techniques to the corpus of student answers for the purpose of measuring similarity between the student answers and the model answer. This is based on the number of common words. We then evaluate the relation between these similarities and marks awarded by scorers. We consider an approach that groups student answers into clusters. Each cluster would be awarded the same mark, and the same feedback given to each answer in a cluster. In this manner, we demonstrate that clusters indicate the groups of students who are awarded the same or the similar scores. Words in each cluster are compared to show that clusters are constructed based on how many and which words of the model answer have been used. The main novelty in this paper is that we design a model to predict marks based on the similarities between the student answers and the model answer. We argue that computational methods be used to enhance the reliability of human scoring, and not replace it. Humans are required to calibrate the system, and to deal with situations that are challenging. Computational methods can provide insight into which student answers will be found challenging and thus be a place human judgement is required. [ABSTRACT FROM AUTHOR]

The problem of reducing ϵ -NN to (c , r) -NN is very important in theoretical computer science area and has attracted many research efforts. In this paper a new algorithm for such problem is proposed, which achieves O (log ⁡ n) query time. Comparing with the former algorithms for the same problem, this query time is the lowest, which is the main contribution of this paper. The low query time complexity is achieved by raising the preprocessing time and space complexity. How to reduce the cost added into the two complexities is also discussed in this paper. [ABSTRACT FROM AUTHOR]

[Display omitted] • DL algorithms unveil hidden patterns in genomics and biomedicine to empower IHS. • DL optimization enables intricate analysis of molecular-level data in biomedicine. • Open-source DL frameworks democratize access to cutting-edge tools for researchers. • Integration of DL in IHS allows for real-time monitoring and prediction of disease progression for proactive interventions. • DL-powered decision support systems aid clinicians in treatment planning and predicting patient response. The advancements in genomics and biomedical technologies have generated vast amounts of biological and physiological data, which present opportunities for understanding human health. Deep learning (DL) and machine learning (ML) are frontiers and interdisciplinary fields of computer science that consider comprehensive computational models and provide integral roles for disease diagnosis and therapy investigation. DL-based algorithms can discover the intrinsic hierarchies in the training data to show great promise for extracting features and learning patterns from complex datasets and performing various analytical tasks. This review comprehensively discusses the wide-ranging DL approaches for intelligent healthcare systems (IHS) in genomics and biomedicine. This paper explores advanced concepts in deep learning (DL) and discusses the workflow of utilizing role-based algorithms in genomics and biomedicine to integrate intelligent healthcare systems (IHS). The aim is to overcome biomedical obstacles like patient disease classification, core biomedical processes, and empowering patient-disease integration. The paper also highlights how DL approaches are well-suited for addressing critical challenges in these domains, offering promising solutions for improved healthcare outcomes. We also provided a concise concept of DL architectures and model optimization in genomics and bioinformatics at the molecular level to deal with biomedicine classification, genomic sequence analysis, protein structure classification, and prediction. Finally, we discussed DL's current challenges and future perspectives in genomics and biomedicine for future directions. [ABSTRACT FROM AUTHOR]

Influence maximization is an important research area in social network analysis where researchers are concerned with detecting influential nodes. The detection of influential nodes is of great interest in several disciplines including computer science, opinion propagation, political movements, or economics, where systems are often modeled as graphs. The Influence Maximization problem is proved NP-hard. This computational complexity is justified by two main factors. The first factor is about the important size of social networks. Modern social networks like TikTok and Facebook have reached an unprecedented number of users. Dynamic social networks, whose topology or/and informational content is able to evolve, represent the second factor. Maximizing influence in such networks remains a significant task. In this light, several methods have been proposed. Being motivated by this fact, we provide in this paper a detailed survey of influence maximization approaches. Our main concern is to provide a taxonomy of existing models in both static and dynamic networks. In addition, we provide a comparison of the state-of-the-art approaches according to a clear categorization. New trends for detecting influential nodes are also discussed. We provide then some challenges as well as future directions. • Taxonomy of existing IM models in both static and dynamic networks is provided. • A comparison of existing approaches according to a clear categorization is presented. • New trends for detecting influential nodes are also discussed. [ABSTRACT FROM AUTHOR]

In this paper, we discuss methods to assess the interestingness of a query in an environment of data cubes. We assume a hierarchical multidimensional database, storing data cubes and level hierarchies. We start with a comprehensive review of related work in the fields of human behavior studies and computer science. We define the interestingness of a query as a vector of scores along different aspects, like novelty, relevance, surprise and peculiarity and complement this definition with a taxonomy of the information that can be used to assess each of these aspects of interestingness. We provide both syntactic (result-independent) and extensional (result-dependent) checks, measures and algorithms for assessing the different aspects of interestingness in a quantitative fashion. We also report our findings from a user study that we conducted, analyzing the significance of each aspect, its evolution over time and the behavior of the study's participants. [ABSTRACT FROM AUTHOR]

In this paper, a novel numerical algorithm for efficient modeling of three-dimensional shape transformation governed by the modified Allen-Cahn (A-C) equation is developed, which has important significance for computer science and graphics technology. The new idea of the proposed method is as follows. Firstly, the operator splitting method is used to decompose the three-dimensional problem into a series of one-dimensional subproblems that can be solved in parallel in the same direction. Secondly, a temporal p-adaptive strategy, which is based on the extrapolation technique, is proposed to improve the convergence order in time and preserve the computational efficiency simultaneously. Finally, a parallel least distance modification technique is developed to force the discrete maximum bound principle. The proposed method achieves high precision and high efficiency at the same time. Numerical examples include the effectiveness of the p-adaptive method and the bound preserving least distance modification, and a series of complex three-dimensional shape transformation modelings. • The operator splitting method is used to solve 3D shape transformation PDE. • A temporal p-adaptive strategy is developed to improve computational efficiency. • A least-distance modification is developed to force the discrete maximum bound. [ABSTRACT FROM AUTHOR]

Abstract Photo-identification is a commonly used non-invasive technique that has been profitably employed in biological studies throughout the years. It starts from the assumption that a single individual can be recognized in multiple photos captured at different times by exploiting its unique representative and visible physical qualities such as marks, notches or any other definite feature. Hence, photo-identification is performed to infer knowledge about wild species' spatial and temporal distributions as well as population dynamics, thus providing valuable information especially when the species being investigated is ranked as data deficient. Furthermore, the technological improvements of the last decades and the large availability of devices with powerful computing capabilities are driving the research towards a common goal of enriching bio-ecological studies with innovative computer science approaches. In this scenario, computer vision plays a fundamental role, as it can successfully assist researchers in the analysis of large amounts of data. The aim of this paper is, in fact, to effectively provide a computer vision approach for the photo-identification of the Risso's dolphin, exploiting specific visual cues with a feature-based approach relying on SIFT and SURF feature detectors. The experiments have been conducted on image data acquired in the Gulf of Taranto from 2013 to 2017, conducting a comparative analysis of the performance of both SIFT and SURF, as well as a comparison with the state-of-the-art software DARWIN, and they proved the effectiveness of the proposed approach and suggested its application would be suitable to large scale studies. In conclusion, this paper shows an innovative computer vision application for the identification of unknown Risso's dolphin individuals that relies on a feature-based automated approach. The results suggest that the proposed approach can efficiently assist researchers during the photo-identification task of large amounts of data collected in such a challenging domain. Highlights • Computer vision is strategic for automatic photo-identification of Risso's dolphin. • SIFT based approach is robust and accurate (90%) for Risso's dolphin photo-ID. • This approach can efficiently assist researchers in large scale studies. • Increased knowledge of Risso's dolphin as data deficient species [ABSTRACT FROM AUTHOR]

Highlights • And-cross transitions are a useful abstraction that can make some constructs easier to specify for the modeler. • They can be transformed to and from alternative modeling solutions that require a greater number of transitions. • With fewer transitions, the time taken and memory required to certify a model to be deterministic using formal methods can be much reduced compared to other approaches. This is related to the time and memory required to compute the set of pairs of potentially conflicting transitions. Abstract In this paper, we present an approach to formally encode state machines expressed in Umple for symbolic verification. We illustrate this with a real-world modeling example that encodes and analyzes and-cross transitions. This paper discusses a formal description of our approach to represent state machine systems under analysis (SSUAs); a systematic approach to certifying that SSUAs are deterministic; and an evaluation of performance (memory usage and execution time) on the case study. Method We describe a formalization of state machines in Umple that enables their translation to model checking tools and also to code that is consistent with this. We present three alternative modeling solutions for a sample problem and a solution based on the use of and-cross transitions. State machine models corresponding to these solutions are represented in Umple, a model-oriented programming language. These are automatically transformed to SMV, the input language of the nuXmv (or NuSMV) model checker. By cleanly separating concerns, we systematically integrate components of hierarchical state systems as opposed to the traditional flattening approach, yet manage the complexity introduced by concurrency and and-crossing. We then compose and verify a set of requirements (e.g., correctness, safety, liveliness, etc.) on the resulting systems of all the modeling approaches to empirically compare the different modeling alternatives with the use of and-cross transitions. Results We can encode and formally analyse complex state machines with and-cross transition(s). We observed a large reduction in the number of required transitions for encoding the SSUA, as opposed to the alternative approaches. We asserted that solutions derived from the approaches are identical behavior-wise even though each approach models the SSUA differently. Each of the approaches yielded the same result for potentially conflicting pairs which is a false positive (i.e., the SSUAs are deterministic). We observe that each approach maintains the same global state-space irrespective of the variations in their number of transitions. Furthermore, we observe that it is untrue that a more abstract method applied to an SSUA outperforms its less abstract counterpart whenever parameters (such as execution time, memory usage and the number of Binary Decision Diagrams - BDDs) are the factors under consideration. Contributions A systematic approach to encode state machines with and-cross transitions (including unusual transitions). An enhanced but fully automated approach to discovering nondeterminism in state machines even in the presence of unbounded domains and multiple and-cross transitions within the same enclosing orthogonal state. An empirical study of the impact of abstraction on some performance parameters. We also present an extended formalization of Umple state machines. [ABSTRACT FROM AUTHOR]

Abstract Many metrics have been proposed to measure coupling—the degree of association between modules in a system. They have often been described in different ways, hindering comparison and research. Their definitions are often incomplete regarding language features in some languages, meaning that different tool developers may implement the same metric differently. This complicates comparing results from studies that use different tools. This paper therefore aims to define coupling metrics consistently and unambiguously. The paper describes a model of coupling that uses the reification of the concept of dependency as its fundamental unit. Based on this model, it defines a framework for defining coupling metrics. It shows how to define several well-known coupling metrics in the framework, and how defining different metrics based on the same model facilitates direct comparisons. It discusses how the framework resolves issues due to incomplete metric definitions, such as different language features. This formal framework is sufficiently simple that it can be implemented in such a way as to provide multiple metrics. [ABSTRACT FROM AUTHOR]

In natural language processing (NLP), transformer based models have surpassed recurrent neural networks (RNN) as state of the art, being introduced specifically to address the limitations of RNNs originating from its sequential nature. As a similar sequence modeling problem, transformer methods can be readily adapted for deep learning time series prediction. This paper proposes a sparse transformer based approach for electricity load prediction. The layers of a transformer addresses the shortcomings of RNNs and CNNs by applying the attention mechanism on the entire time series, allowing any data point in the input to influence any location in the output of the layer. This allows transformers to incorporate information from the entire sequence in a single layer. Attention computations can also be parallelized. Thus, transformers can achieve faster speeds, or trade this speed for more layers and increased complexity. In experiments on public datasets, the sparse transformer attained comparable accuracy to an RNN-based SOTA method (Liu et al., 2022) while being up to 5× faster during inference. Moreover, the proposed model is general enough to forecast the load from individual households to city levels as shown in the extensive experiments conducted. [ABSTRACT FROM AUTHOR]

In this paper, the synchronized output regulation (SOR) problem of leader-following heterogeneous linear networked systems aiming at tracking periodical signals is investigated. Only the output information of each agent is delivered throughout the communication network. For tracking a general periodic signal consisting many sinusoid functions, the dimension of the internal model compensator embedded in each agent will be too high to be implemented in practice. To cope with this difficulty, a distributed repetitive control method is proposed in this paper. A stability condition is developed, as well as the bound of error size. Then it is shown that the controller always exists for any given bound of tracking error. At last, the efficacy of analytic results is illustrated by simulation examples. [ABSTRACT FROM AUTHOR]

This paper describes the application of a community detection algorithm, namely LinkRank algorithm, on a citation network. Community detection is a task in network analysis which aims to find sets of tightly connected nodes that are loosely connected with other nodes outside of those sets. In our study, we focused on a citation network which depicts relationships between cited papers and the papers which cite those papers. The objectives of our study are to identify communities of papers based on the citation relationships and analyze the similarities of topics within each community. The approach of our study to reach the objectives is by applying LinkRank algorithm to a citation network. LinkRank algorithm is chosen because it can be applied to a directed network where other algorithms that we have surveyed can only be used on undirected network. The citation network that we used in our study is from Aminer website. In applying the algorithm, we had to port the original source code which is written in C programming language into Python programming language for our convenience in doing the experiment. The result shows that the algorithm able to detect 10,442 communities from 188,514 nodes. Once the communities have been detected, we sampled top three communities (the ones with the largest number of members) and took the top 10 nodes with the highest PageRank score in each of those communities. The samples show that most of the nodes have similar topic, but there are still some nodes with different topics mixed inside the same community. We found the ratio between nodes with similar and different topics to be 7 to 3, that is 70% of the nodes have similar topic while the other 30% have different topics. Thus, the homophily of each community does not reach 100%. Nevertheless, our study confirms that LinkRank algorithm can be used for community detection on directed network. [ABSTRACT FROM AUTHOR]

A Wireless Sensor Network (WSN) is used to monitor an area for events. Each node in the WSN has a sensing range and a communication range. The sensing coverage of a sensor node is the area determined by the sensing range of the sensor node. Sensing coverage of the network is the collective coverage of the sensor nodes in a WSN. Sufficient number of sensor nodes need to be deployed to ensure adequate coverage of a region. Further, since sensor nodes have limited battery life, it is also essential to reduce the energy consumption. This would help improve the network lifetime and thus the coverage lifetime. To reduce energy consumption in the WSN, some of the nodes with overlapping sensing areas could be turned off using a coverage optimization protocol. In this paper, we discuss various coverage optimization protocols. These protocols are broadly classified as clustering and distributed protocols. Further, these protocols are classified based on the type of sensing model used, node location information, and mechanism used to determine neighboring node information (based on probe or computational geometry). In this paper, we review the key coverage optimization protocols and present open research issues related to energy efficient coverage. [ABSTRACT FROM AUTHOR]

In all engineering discipline in universities, introductory programming is an essential part of the curriculum. However, many students find great difficulty with the learning of programming without instructor assistance and it becomes a barrier to their further studies of computer science and other disciplines. Intelligent Programming Tutors (IPTs) assist students to overcome difficulties in solving programming exercises, when they don't know how to proceed or they unable to find an error in their current state. Such a student may benefit from hints, guiding her toward a more complete and/or more correct version and allowing her to continue working on her own (Aleven et al., 2016). However, traditional IPTs take much time to create the expert knowledge because in computer programming tasks, the space of possible solutions is too large (Piech et al., 2015b). New development methods have emerged in recent years, which provide hints without an expert model. These techniques are based on data-driven approaches and/or program repair techniques and provide hints in the form of edits (such as inserting or deleting a piece of code). Students can apply these hints in their current state to change it into a more correct and/or more complete state. This paper aims to provide a best understanding of these new techniques and presents a comparative study between different approaches of automatic hint generation by presenting the forces and weaknesses of each approach. [ABSTRACT FROM AUTHOR]

Diagrams continue to play an important role in different areas of computer science. In this paper, we discuss how the cognitive processing of such diagrams can be conceptually understood. To this end, we refer to the CogniDia framework, a recent framework that describes the consecutive phases of cognitive processing. We discuss experimental results for the four categories of the framework. We conclude with an outlook on future research. [ABSTRACT FROM AUTHOR]

Directed Acyclic Graphs (DAGs) are directed graphs in which there is no path from a vertex to itself. DAGs are an omnipresent data structure in computer science and the problem of counting the DAGs of a given number of vertices has been solved in the 70's by Robinson. In many applications one needs to construct connected DAGs and to control their number of edges, but the adaptation of Robinson's enumeration to take this into account led to counting formulas based on the inclusion-exclusion principle, inducing a high computational cost for the uniform random sampling of DAGs based on this formula. In the present paper we propose two contributions. First we enumerate a new class of DAGs, enriched with an independent ordering of the children of each vertex, according to their numbers of vertices and edges. We obtain a constructive recursive counting formula for them (i.e. without using the inclusion-exclusion principle) using a new decomposition scheme. Then we show the applicability of our method by proposing a constructive enumeration of Robinson's labelled DAGs, by vertices and edges, based on the same decomposition. As a consequence we are able to derive efficient uniform random samplers for both models. [ABSTRACT FROM AUTHOR]

This paper provides a review of the analysis and modeling of human spatial planning, perception, and learning based on the dynamics of agent-environment interactions. The approach stems from an analysis and modeling framework that was previously conceived using interaction patterns emerging from system-wide interactions as the basic unit of analysis. The paper first discusses the rationals for using patterns in agent-environment interactions as units of organization of behavior, and as functional units of the modeling framework. These concepts are then illustrated through two applications using experimental data from a first-person flight simulator that implements agile obstacle navigation tasks. The first application focuses on the analysis of the formation and evolution of interaction patterns over successive trials, and the use of these patterns as basic elements of the task environment representation, enabling the evaluation of the learning process and assessment of the operator performance. The second application focuses on the analysis of interaction patterns as functional units supporting the modeling of the underlying perceptual guidance and control mechanisms. These examples demonstrate the relevance of dynamics in agent-environment interactions for studying a wide range of functions across the human control hierarchy. [ABSTRACT FROM AUTHOR]

The importance of derivatives in financial markets has known an exponential growth in the last decades, especially in risk management and speculation fields: this explains researchers’ interest in answering questions about this kind of contracts. In particular, in this paper we restrict our attention on European vanilla and barrier options , and we propose a statistical procedure to solve efficiently the problem of determining the no arbitrage price of this type of derivatives in an IoT context: starting form an Internet of Things (IoT) data flow, an IoT system takes information from several sources and stores it into a suitable database; this information is used in our estimation problem. Our scheme is based on some strong assumptions about the market model, in particular the completeness of the market , the log-normality of the underlying asset with a constant volatility. We conclude this paper with an application of our framework to a real case. [ABSTRACT FROM AUTHOR]

A number of studies have revealed and investigated how the clusters organized by cooperators emerge in a spatial prisoner’s dilemma. However, a qualitative analysis of the clusters formed by the cooperators has not yet been studied. This paper aims to propose a new technique for quantifying clusters that consist of players with cooperative strategies. The proposed method can be applied to the spatial prisoner’s dilemma in a square lattice network. In the proposed method, a minimum cluster is defined as a group of the cooperators based on a small square (2 by 2). This paper also defines a degree of the clusters by extending the small squares that based on how the players organize themselves into coordinated groups. The authors analyze and compare with typical examples of the clusters in the spatial prisoner’s dilemma. By analyzing the examples, this paper demonstrates that the proposed method quantifies the degree of the clusters organized by the cooperators. The authors also examine the significance of the proposed method by the simulations of the spatial prisoner’s dilemma. [ABSTRACT FROM AUTHOR]

Many organizations are stuck in the cloudify or not to cloudify limbo, mainly due to concerns related to the security of enterprise sensitive data. Removing this barrier is a key pre-condition to fully unleash the tremendous potential of cloud computing. In this paper, we provide a comprehensive analysis of the main threats that hamper cloud computing adoption on a wide scale, and a right to the point review of the solutions that are currently being provided by the major vendors. The paper also presents the (near) future directions of cloud security research, by taking a snapshot of the main research trends and most accredited approaches. The study is done on a best of breed selection of proprietary and Open Source cloud offerings. The paper is thus a useful navigation tool, that can be used by the IT personnel to gain more insight into the security risks related to the use of cloud computing, as well as to quickly weigh the pros and cons of state of the art solutions. [ABSTRACT FROM AUTHOR]

Home Automation Networks provide a promising opportunity in designing smart home systems and applications. In this context, Machine-to-Machine (M2M) networks are emerging as an efficient means to provide automated communication among distributed ubiquitous devices on in a standardized manner, but none have been adopted universally. In an effort to present the technologies used in the M2M and home integration environment, this paper presents the home area network elements and definitions, and reviews the standards, architectures and initiatives created to enable M2M communication and integration in several different environments, especially at the smart home domain. This paper points out differences between them and identifies trends for the future. [ABSTRACT FROM AUTHOR]

In the paper, the important role of tools and distributed IT resources in the dynamic development of astrophysics, astronomy, and space exploration are discussed. New possibilities and approaches to conducting research in the field of astronomy and astrophysics with the use of cloud computing and advanced data visualization techniques are also presented. Finally, some examples of the use of digital sky survey databases in scientific research are shown. [ABSTRACT FROM AUTHOR]

Graph theory has been since long time very helpful either in science or in real life. Since it has been introduced, it was considered like a crossroad in science. Many problems are computer science, in logistics, in physics, in electrical engineering, in automatic science were all inspired by graph theory. Moreover, sone algorithms such as the shortest path are omnipresent within our life. That is why nobody could ignore the importance of graph theory. Nowadays, the graph theory, as is, could not answer correctly to our new needs. In my point, for the current graph theory to answer much better to our new problem-solving requirements, the theory must include two more main pillars: the semantic factor and the superimposition factor. In this paper we introduce the all-new graph theory: the semantic superposed graph theory. [ABSTRACT FROM AUTHOR]

The treatment of concepts as decision functions characteristic for computer science and Artificial Intelligence has its roots in the logical tradition of Gottlob Frege. In its modern incarnation, decision functions, embedded in concrete knowledge representations, describe either crisp or vague assignments of categorization decisions to objects. In order to allow for effective communication between humans and computer systems, these decisions should be either effectively explained by the system or explainable with respect to the system, which in turn depends on the degree of epistemic transparency of the computer system and the conceptual representations it uses. In this, paper we distinguish between two basic types of representation: logic-based and nature-based. With respect to the latter, we identify five contributing factors to their relative epistemic opacity: A. structural complexity, B. learning procedures, C. operating on uncertain data, D. lack of translation procedures for low-level rules and representations, and E. lack of complete knowledge about natural computing systems. We consider the fourth factor (D.) to be the most important source of opacity on the level of computer systems and the fifth (E.) the main contributing factor on the level of human knowledge. [ABSTRACT FROM AUTHOR]

In the area of computer sciences there is a rapidly developing subject of mechatronics and robotics since its relevance to the fourth industrial revolution, especially in preprofessional education – schools etc. On the other side, technologies of virtual reality (VR technologies) have been spreading in education so far, including computer sciences and mechatronics and robotics education in Russian leading research universities. In National Research Nuclear University MEPhI we have a broad experience of application of hi-tech in education. In this paper we present the results of our practical research of application of VR instruments in preprofessional education in the area of mechatronics and robotics. One of the features of our research is that we have developed the educational program for obtaining practical skills in the area of VR digital technologies in compliance with the CDIO standards. [ABSTRACT FROM AUTHOR]

Natural Language Processing (NLP) has been a growing area of research in computer and cognitive sciences, using experimental approaches. Morphology and syntax play specifically a vital role in the correct interpretation of a sentence. In this paper, we will present a syntactic error correction system based on the automatic generation of correct sentences in Arabic. First, we extract the words from the considered sentence and we then generate all the possible sentences that are syntactically correct; based on a logical description of the rules of Arabic grammar in the ontology. We will afterwards compare the original sentence with the generated sentences to detect any eventual errors followed by the correction phase. In case the system has not found a sentence that looks similar to the original sentence, the correct alternative sentences are automatically offered. The use of the Arabic syntactic corrector can increase productivity and improve the quality of the text for anyone who writes in the Arabic language. Successful tests have been performed using a set of Arabic sentences. The implemented system achieved a precision rate of about 92% and a recall rate of about 84%. By observing the achieved results, it is concluded that our approach is promising. [ABSTRACT FROM AUTHOR]

Event sequence data is increasingly available. Many business operations are supported by information systems that record transactions, events, state changes, message exchanges, and similar elements. This observation also applies to various industries, including production, logistics, healthcare, financial services, and education. The variety of application areas explains that techniques for event sequence data analysis have been developed rather independently in different fields of computer science. Most prominent are contributions from information visualization and from process mining. So far, the contributions from these two fields have neither been compared nor have they been mapped to an integrated framework. Such intransparency is problematic since it bears the risk of opportunities of integration are missed and concepts established in one field are independently reinvented in the other one. In this paper, we develop the Event Sequence Visualization framework (ESeVis) that gives due credit to the traditions of both fields. Our mapping study provides an integrated perspective on both fields and identifies potential for synergies for future research. • We propose the ESeVis Framework to categorize visualizations of event sequence data. • We review the literature of event sequence data visualizations. • Instance representations of event sequences are mostly from information visualization. • Process mining focuses on generating formal models. • Potential for synergy of process mining and information visualization. [ABSTRACT FROM AUTHOR]