Search

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]

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]

Boolean functions have important applications in information technology and computer science. Certificate complexity is an important combinatorial measure of Boolean function complexity. In this paper, we first introduce many concise and efficient notations then we study the elementary symmetric Boolean functions and obtain their certificate complexities when their degrees are odd or powers of 2. We show that both upper and lower bounds of certificate complexities can be attained. [ABSTRACT FROM AUTHOR]

Fuzzy Switch Graphs (FSG s) are reactive fuzzy graphs that model systems in which accessibility relations and fuzzy values are changed whenever an edge is crossed [19]. Reversal Fuzzy Switch Graphs (R F S G s) were presented in [6] and model fuzzy reactive systems which provide the activation and deactivation of resources, a functionality that FSG s do not offer [19]. Activation and deactivation of arrows in a switch graph makes its applicability wider in fields like computer science and engineering. In this sense, the definition of operations for R F S G s is an important issue, since it enables to understand the algebraic structure of these graphs and allows to generate new model of systems from the previous one. This paper introduces some aggregation-based operations: union, intersection and extension for R F S G s. For each operation, the paper verify some properties. It ends with an application for engineering. [ABSTRACT FROM AUTHOR]

This paper proposes a concise overview of Probabilistic Semantics according to a technology-oriented perspective. Indeed, while the progressive consolidation of Semantic Technology in a wide context and on a large scale is going to be a fact, the non-deterministic character of many problems and environments suggests the rise of additional researches around semantics to integrate the mainstream. Probabilistic extensions and their implications to the current semantic ecosystems are discussed in this paper with an implicit focus on the Web and its evolution. The critical literature review undertaken shows valuable theoretical works, effective applications, evidences of an increasing research interest as the response to real problems, as well as largely unexplored research areas. [ABSTRACT FROM AUTHOR]

India produces over two million engineering graduates a year as well as another million graduates in related fields such as computer science, biotechnology etc. Employers cite new graduates lack communication skills, problem solving skills and technical skills. The Indian Information Technology (IT) sector has fast changing technical requirements and understanding its requirement is very important for academics and professional trainers so that they can better prepare students with relevant skills. In this paper, we have developed a simple methodology to analyse the requirements of the Indian IT industry by parsing their job portals and extracting information from their job descriptions. We selected the top 10 IT companies by market cap to conduct our analysis. We extracted the number of jobs that contained each keywords like Java, CCNA, SAP, Agile and computed the popularity of each skill and ranked them accordingly. We find that IT industry requires software and skills like Java, Python, SQL are covered by most universities but paid and in demand commercial software tools like SAP, Oracle are not part of the curriculum. This methodology can also track the evolution of skills and predict new skills that can become popular in Industries in the future. [ABSTRACT FROM AUTHOR]

Boolean nested canalizing functions (NCF) have important applications in molecular regulatory networks, engineering and computer science. In the literature, there are two sensitivities to measure the complexity of a Boolean function. One is average sensitivity, the other one is maximal sensitivity. We follow the tradition and omit the word "maximal". In other words, in this paper, sensitivity is always maximal sensitivity. Using the past work of the authors and their coauthors on a characterization of NCF, we obtain the formula of the sensitivity of any NCF. We find that the sensitivity of any NCF is between ⌈ n + 2 2 ⌉ and n. Both lower and upper bounds are tight. We prove that the block sensitivity, hence the l -block sensitivity, is the same as the sensitivity for NCF. It is well known that monotone Boolean functions (MBF) also have this property. We characterize all functions which are both monotone and nested canalizing (MNCF). The closed formula of the cardinality of the set of MNCFs is also provided. • The closed formula of the maximal sensitivity of Boolean nested canalizing functions is obtained. • Both the lower and upper tight bounds of the maximal sensitivity of Boolean nested canalizing functions are computed. • The maximal sensitivity and the block sensitivity of nested canalizing functions are equal. • The algebraic normal forms of monotone nested canalizing functions are provided. • The closed formula of the number of monotone nested canalizing functions is obtained. [ABSTRACT FROM AUTHOR]

• Model personalisation requires more than anatomical personalisation. • Model uncertainty and sensitivity are important considerations for clinical interpretation. • Model verification and validation are critical for trust underpinning clinical decision support. • The cardiovascular digital twin will support diagnosis and prognosis by responding continuously to increasing volumes of information collected as the individual goes about their daily life. The aim of this position paper is to provide a brief overview of the current status of cardiovascular modelling and of the processes required and some of the challenges to be addressed to see wider exploitation in both personal health management and clinical practice. In most branches of engineering the concept of the digital twin, informed by extensive and continuous monitoring and coupled with robust data assimilation and simulation techniques, is gaining traction: the Gartner Group listed it as one of the top ten digital trends in 2018. The cardiovascular modelling community is starting to develop a much more systematic approach to the combination of physics, mathematics, control theory, artificial intelligence, machine learning, computer science and advanced engineering methodology, as well as working more closely with the clinical community to better understand and exploit physiological measurements, and indeed to develop jointly better measurement protocols informed by model-based understanding. Developments in physiological modelling, model personalisation, model outcome uncertainty, and the role of models in clinical decision support are addressed and 'where-next' steps and challenges discussed. [ABSTRACT FROM AUTHOR]

Abstract Object-oriented programming is widely used in both the industry and the education areas. The most-common model of object-oriented programming is the class-based one. However, popular languages not implementing this model are gaining traction as time goes by. This alternative model is the prototype-based one, with one key characteristic: there are no classes. In this paper, a visual tool is proposed as a vehicle for learning the prototype-based object-oriented programming, present, for instance, in Self, Lua, or JavaScript. This software has been in use for three years in a subject of the Computer Science Engineering degree, at the University of Vigo. Highlights • Pooi is an interactive environment which updates with each instruction. • The system sports an diagram viewer, an object inspector, and a REPL. • The software was designed for undergraduate students of computer science engineering. • This tool has been used successfully in lecturing object-oriented programming. • Pooi is free, offering also the sources, and a set of tutorials and examples: http://jbgarcia.webs.uvigo.es/prys/pooi/. [ABSTRACT FROM AUTHOR]

Today and with the development of computer technologies, traditional learning, which offers a static content for all learners, is no longer desired in learning environments. As a result, the exploitation of this development has given rise to new methods of learning. The mobile learning is one of these methods and specifically the adaptive mobile learning or context-aware mobile learning. Generally, the learning process goes through several stages; the assessment is part of this process and it is a key step in the learning activity, taking several ways. When we talk about an adaptive learning, we should think also about an adaptive assessment, where the learner can take an adaptive test content according to their context. In this paper, we present the Adaptive Formative Assessment in Context-Aware Mobile Learning (AFA-CAML) approach. The goal of this approach is to provide learners with an adaptive and personalized formative assessment taking into account the learner context based on the CAT (Computerized Adaptive Tests) theory. [ABSTRACT FROM AUTHOR]

• There are many possible connections from process systems engineering to theoretical computer science. • We show how approximation algorithms can address several process systems engineering applications. • We pose challenges that would enable major breakthroughs in process systems engineering. Designing and analyzing algorithms with provable performance guarantees enables efficient optimization problem solving in different application domains, e.g. communication networks, transportation, economics, and manufacturing. Despite the significant contributions of approximation algorithms in engineering, only limited and isolated works contribute from this perspective in process systems engineering. The current paper discusses three representative, NP -hard problems in process systems engineering: (i) pooling, (ii) process scheduling, and (iii) heat exchanger network synthesis. We survey relevant results and raise major open questions. Further, we present approximation algorithms applications which are relevant to process systems engineering: (i) better mathematical modeling, (ii) problem classification, (iii) designing solution methods, and (iv) dealing with uncertainty. This paper aims to motivate further research at the intersection of approximation algorithms and process systems engineering. [ABSTRACT FROM AUTHOR]

Over the last 20 years Machine Learning (ML) has been applied to a wide variety of applications in the fields of engineering and computer science. In the field of material science in particular, it has been used to help speed up predictions of structure property relationships and in general enhance the material design process. In this paper, we review the current status of ML and its specific application to polymer composites process simulation. We also review some case studies going beyond this focus, especially in the fields of computational fluid dynamics, solid mechanics and Computer Aided Engineering (CAE), to show the potential for further application in our research area. The types of ML algorithms, tools, techniques used in the various applications and their couplings with other CAE software tools are summarized and the overall result/potential of each application/method is highlighted. [ABSTRACT FROM AUTHOR]

One of the major fundamental issues of Computer Science is arrangement of elements in the database. The efficiency of the sorting algorithms is to optimize the importance of other sorting algorithms 11 . The optimality of these sorting algorithms is judged while calculating their time and space complexities 12 . The idea behind this paper is to modify the conventional Merge Sort Algorithm and to present a new method with reduced execution time. The newly proposed algorithm is faster than the conventional Merge Sort algorithm having a time complexity of O(n log 2 n). The proposed algorithm has been tested, implemented, compared and the experimental results are promising. [ABSTRACT FROM AUTHOR]

Ternary logic has some distinct advantage over binary logic. In this paper we propose a synthesis approach for ternary reversible circuits using ternary reversible gates. Our method takes a boolean function as input. The input is provided as .pla file. The .pla file is first converted into ternary logic function, which can be represented as permutation. The gate library used for synthesis is Ternary Not, Ternary Toffoli and Ternary Toffoli + (N T ,T T ,T T + ). The proposed constructive method, generates 3-cycles from the permutation, and then each 3-cycle is mapped to (N T ,T T ,T T + ) gate library. Experimental results show that the method generates lesser number of gates for some circuits compared to previously reported works. [ABSTRACT FROM AUTHOR]

Modern web technologies facilitate the creation of high-quality data visualizations, and rich, interactive components across a wide variety of devices. Scientific workflow systems can greatly benefit from these technologies by giving scientists a better understanding of their data or model leading to new insights. While several projects have enabled web access to scientific workflow systems, they are primarily organized as a large portal server encapsulating the workflow engine. In this vision paper, we propose the design for Kepler WebView, a lightweight framework that integrates web technologies with the Kepler Scientific Workflow System. By embedding a web server in the Kepler process, Kepler WebView enables a wide variety of usage scenarios that would be difficult or impossible using the portal model. [ABSTRACT FROM AUTHOR]

• A total of 75 studies was categorized within a systematic process. • A stage-based categorization was proposed. • Rigorous evaluation methodology was carried. The patterns present in biosignals, such as fetal heart rate (FHR), are valuable indicators of fetal well-being. In designing biosignal analysis systems, the variety of approaches and technology usage impairs the decision-making for the fundamental units of the systems. There is a need for an updated overview of studies encompassing the biosignal-based fetal state assessment systems. Therefore, we propose a systematic mapping study to identify and synthesize recent research regarding the building blocks that compose these systems. We followed well-established guidelines to perform a systematic mapping of studies regarding the building-blocks that compose the fetal state assessment systems and published between January 2016 and January 2021. A search string was determined based on the mapping questions and the PI (population and intervention) divisions. The search string was applied in digital libraries covering the fields of computer science, engineering, and medical informatics. Then, we applied the forward snowballing technique to complement the resulting set. This process resulted in 75 primary studies selected from a total of 871 papers. Selected studies were classified according to the publication types, systems design stages, datasets, and predictive capabilities. The results revealed that (i) The majority of the selected studies refer to the method as a type of publication and there is a lack of validation studies; (ii) The CTU-UHB was the most frequent biosignal-based dataset and UCI-CTG was the most frequent feature-based data; (iii) The selected studies made use of the system design stages alone or in a mixed-mode. The results indicated that the well-established classification models achieved competitive results compared with the state-of-the-art methods in data-constrained system designs. Moreover, we identified the need for validation studies in the clinical environment. [ABSTRACT FROM AUTHOR]

Abstract: This paper proposes an ear recognition technique which makes use of 3D along with co-registered 2D ear images. It presents a two-step matching technique to compare two 3D ears. In the first step, it computes salient 3D data points from 3D ear images with the help of local 2D feature points of co-registered 2D ear images. Subsequently, it uses these salient 3D points to coarsely align 3D ear images. In the second step, it performs final matching of coarsely aligned 3D ear images by using a Generalized Procrustes Analysis (GPA) and Iterative Closest Point (ICP) based matching technique (GPA-ICP). The proposed technique has been tested on 1780 images of 404 subjects (two or more images per subject) of University of Notre Dame public database-Collection J2 (UND-J2) which consists of co-registered 2D and 3D ear images with scale and pose variations. It has achieved a verification accuracy of 98.30% with an equal error rate of 1.8%. [Copyright &y& Elsevier]

Pushdown systems (PDS) are well adapted to model sequential programs with (possibly recursive) procedure calls. Therefore, it is important to have efficient model checking algorithms for PDSs. We consider in this paper CTL model checking for PDSs. We consider the “standard” CTL model checking problem where whether a configuration of a PDS satisfies an atomic proposition or not depends only on the control state of the configuration. We consider also CTL model checking with regular valuations, where the set of configurations in which an atomic proposition holds is a regular language. We reduce these problems to the emptiness problem in Alternating Büchi Pushdown Systems, and we give an algorithm to solve this emptiness problem. Our algorithms are more efficient than the other existing algorithms for CTL model checking for PDSs in the literature. We implemented our techniques in a tool, and we applied it to different case studies. Our results are encouraging. In particular, we were able to confirm the existence of known bugs in Linux source code. [ABSTRACT FROM AUTHOR]

Foreword to Special Section on VriPhys2017, containing extended best papers. [ABSTRACT FROM AUTHOR]