Search

This commentary on John Symons' and Jack Horner's paper, besides sharing its main argument, challenges the authors' statement that there is no effective method to evaluate software-intensive systems as a distinguishing feature of software intensive science. It is underlined here how analogous methodological limitations characterise the evaluations of empirical systems in non-software intensive sciences. The authors' claim that formal methods establish the correctness of computational models rather than of the represented programme is here compared with the empirical adequacy problem typifying the model-based reasoning approach in physics, and the remark that testing all the paths of a software-intensive system is unfeasible is related to the enumerative induction problem in the justification of empirical law-like hypotheses in non-software intensive sciences. [ABSTRACT FROM AUTHOR]

The recent adoption of deep learning-based models for the processing and coding of multimedia signals has brought noticeable gains in performance, which have established deep learning-based solutions as the uncontested state-of-the-art both for computer vision tasks, targeting machine consumption, as well as, more recently, coding applications, targeting human visualization. Traditionally, applications requiring both coding and computer vision processing require first decoding the bitstream and then applying the computer vision methods to the decompressed multimedia signals. However, the adoption of deep learning-based solutions enables the use of compressed domain computer vision processing, with gains in performance and computational complexity over the decompressed domain approach. For point clouds (PCs), these gains have been demonstrated in the single available compressed domain computer vision processing solution, named Compressed Domain PC Classifier, which processes JPEG Pleno PC coding (PCC) compressed streams using a PC classifier largely compatible with the state-of-the-art spatial domain PointGrid classifier. However, the available Compressed Domain PC Classifier presents strong limitations by imposing a single, specific input size which is associated to specific JPEG Pleno PCC configurations; this limits the compression performance as these configurations are not ideal for all PCs due to their different characteristics, notably density. To overcome these limitations, this paper proposes the first Adaptive Compressed Domain PC Classifier solution which includes a novel adaptive bridge model that allows to process the JPEG Pleno PCC encoded bit streams using different coding configurations, now maximizing the compression efficiency. Experimental results show that the novel Adaptive Compressed Domain PC Classifier allows JPEG PCC to achieve better compression performance by not imposing a single, specific coding configuration for all PCs, regardless of its different characteristics. Moreover, the added adaptability power can achieve slightly better PC classification performance than the previous Compressed Domain PC Classifier and largely better PC classification performance (and lower number of weights) than the PointGrid PC classifier working in the decompressed domain. [ABSTRACT FROM AUTHOR]

This document is a guest editorial for a special issue of the journal "Programming & Computer Software" titled "Recent Trends on Advanced Computing: The Converging Technologies." The issue features research and practical implementation results from researchers and industry experts in computer science, engineering, and technology. The papers cover a range of topics including microservices, software quality, user engagement on social media, non-functional requirements, medical software architecture, fallacies in political speeches, intelligent learning environments, and more. The guest editors for this special issue are Prof. Dr. Andrei Tchernykh, Prof. Reyes Juárez Ramírez, Dr. Esteban Mocskos, and Prof. Sergio Nesmachnow. [Extracted from the article]

This special section is devoted to a selection of papers that appeared originally in the Proceedings of TACAS 2001, the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems [1] which took place in Genova, Italy in April 2001 as a constituent event of the European joint conferences on theory and Practice of Software. All papers present approaches, tools and algorithms that aim at extending the scope of formal techniques (coverage of systems specifications, data structures, size, and their trade-offs) for validation, verification, and testing of software systems. They are by no means a complete account of the numerous ways in which real software and software systems may become subject to rigorous investigation, but they provide an interesting sampling of novel approaches towards scalability of formal methods-based validation. [ABSTRACT FROM AUTHOR]

We seek a unified and distinctive citation description of both journals and individuals. The journal impact factor has a restrictive definition that constrains its extension to individuals, whereas the h-index for individuals can easily be applied to journals. Going beyond any single parameter, the shape of each negative slope Hirsch curve of citations vs. rank index is distinctive. This shape can be described through five minimal parameters or 'flags': the h-index itself on the curve; the average citation of each segment on either side of h; and the two axis endpoints. We obtain the five flags from real data for two journals and 10 individual faculty, showing they provide unique citation fingerprints, enabling detailed comparative assessments. A computer code is provided to calculate five flags as the output, from citation data as the input. Since papers (citations) can form nodes (links) of a network, Hirsch curves and five flags could carry over to describe local degree sequences of general networks. [ABSTRACT FROM AUTHOR]

Alan Turing's "Computing Machinery and Intelligence," published in 1950, is one of the founding texts in the field of artificial intelligence (AI), although the term was not coined until 1958, 4 years after his death. From the treatment of human intelligence as computational and the brain as mechanical to the comparison of animals to machines to the disregard for the materiality of computers to programming as a stand-in for procreation to fiction-inspired science, many of the core tenets that have shaped the field of AI have their origins in Turing's paper. A close analysis of the paper exposes some of the problematic logic underlying these tenets that are now proving damaging for both society and the planet. [ABSTRACT FROM AUTHOR]

The article announces the selection of the study "Decomposition Algorithms for Stochastic Programming on a Computational Grid," written by Jeff Linderoth and Stephen Wright by the editorial board of the periodical "Computational Optimization and Applications," for the Best Paper Award 2004. The paper describes research carried out by the authors at the Argonne National Laboratory which was supported by the National Science Foundation (NSF). The research involved the development of middleware software, the discovery of new algorithms that could exploit the power of grid platforms while not being affected too seriously by its less felicitous features and the implementation of these algorithms using the resulting codes to solve touchstone problems in optimization.

Software engineering (SE) research should be relevant to industrial practice. There have been regular discussions in the SE community on this issue since the 1980's, led by pioneers such as Robert Glass. As we recently passed the milestone of "50 years of software engineering", some recent positive efforts have been made in this direction, e.g., establishing "industrial" tracks in several SE conferences. However, many researchers and practitioners believe that we, as a community, are still struggling with research relevance and utility. The goal of this paper is to synthesize the evidence and experience-based opinions shared on this topic so far in the SE community, and to encourage the community to further reflect and act on the research relevance. For this purpose, we have conducted a Multi-vocal Literature Review (MLR) of 54 systematically-selected sources (papers and non peer-reviewed articles). Instead of relying on and considering the individual opinions on research relevance, mentioned in each of the sources, the MLR aims to synthesize and provide the "holistic" view on the topic. The highlights of our MLR findings are as follows. The top three root causes of low relevance, discussed in the community, are: (1) Researchers having simplistic views (or wrong assumptions) about SE in practice; (2) Lack of connection with industry; and (3) Wrong identification of research problems. The top three suggestions for improving research relevance are: (1) Using appropriate research approaches such as action-research; (2) Choosing relevant (practical) research problems; and (3) Collaborating with industry. By synthesizing all the discussions on this important topic so far, this paper aims to encourage further discussions and actions in the community to increase our collective efforts to improve the research relevance. Furthermore, we raise the need for empirically-grounded and rigorous studies on the relevance problem in SE research, as carried out in other fields such as management science. [ABSTRACT FROM AUTHOR]

The paper provides a detailed overview of the development of a containment pressure and temperature (P/T) analysis methodology for advanced power reactor 1400 (APR1400) nuclear power plants (NPPs). The study addresses the restrictions on exporting independent nuclear power plants by utilizing the containment analysis package (CAP) computer code developed in Korea. One of the key aspects highlighted in the paper is the comparison of results obtained from the CAP code with those from the CONTEMPT-LT/028 code which is used P/T analysis. The analysis focuses on two types of accidents: loss of coolant accidents (LOCA) and main steam line break (MSLB) accidents, which are considered as design basis accidents. By comparing the outcomes of both codes, the paper evaluates the performance and effectiveness of the CAP code in predicting the P/T behavior within the containment during these accidents. The paper also discusses the criteria and technical standards for the containment P/T analysis. It emphasizes the importance of ensuring that the peak P/T remain within the safety related systems, equipment, and structures of NPP. The design pressure is identified as a critical factor in achieving these objectives. In conclusion, the study presents the successful development of a containment P/T analysis methodology using the CAP computer code for APR1400. The methodology considers the specific characteristics of Korean NPPs and new code, CAP. The paper emphasizes the applicability and effectiveness of the CAP code in this context. However, further research and validation efforts are recommended to enhance the accuracy and reliability of the methodology for various design basis accidents. The developed methodology is expected to contribute to the safe and efficient operation of APR1400 NPPs and support Korea's ambitions in exporting NPPs' technology to other countries. [ABSTRACT FROM AUTHOR]

Regression testing is a means to assure that a change in the software, or its execution environment, does not introduce new defects. It involves the expensive undertaking of rerunning test cases. Several techniques have been proposed to reduce the number of test cases to execute in regression testing, however, there is no research on how to assess industrial relevance and applicability of such techniques. We conducted a systematic literature review with the following two goals: firstly, to enable researchers to design and present regression testing research with a focus on industrial relevance and applicability and secondly, to facilitate the industrial adoption of such research by addressing the attributes of concern from the practitioners' perspective. Using a reference-based search approach, we identified 1068 papers on regression testing. We then reduced the scope to only include papers with explicit discussions about relevance and applicability (i.e. mainly studies involving industrial stakeholders). Uniquely in this literature review, practitioners were consulted at several steps to increase the likelihood of achieving our aim of identifying factors important for relevance and applicability. We have summarised the results of these consultations and an analysis of the literature in three taxonomies, which capture aspects of industrial-relevance regarding the regression testing techniques. Based on these taxonomies, we mapped 38 papers reporting the evaluation of 26 regression testing techniques in industrial settings. [ABSTRACT FROM AUTHOR]

Intelligent Tutoring Systems (ITSs) are educational systems that reflect knowledge using artificial intelligence implements. In this paper, we give an outline of the Programming-Tutor architectural design with the core implements on user interaction. This pilot proposal is for designing a model domain of a subset in the computer programming language. The completed project would be adequate to show the idea of a completely developed computing Intelligent Tutoring System in online programming courses to offer benefits to students in the Pacific. This proposed concept would also provide students with an immersive learning experience in an online course to assist in a formative assessment to enhance student learning. A smart tutoring system can provide prompt input of high quality which not only conveys to students about the consistency of the solution but also provides them with information on the precision of the key concerning their existing solutions expertise. This Intelligent Tutoring System (ITS) is proposed to be designed using intelligent algorithms such as optimized ant colony to be able to support the online tutoring system that can initiate the complex learning principles in computing science courses. It is also hypothesized that, based on the performance of other Intelligent Tutoring Systems, students would be able to learn to program more easily in regional campuses and acquire experiences more rapidly and efficiently than students who are taught using conventional methods in an online mode. [ABSTRACT FROM AUTHOR]

Reliable and reproducible research is an important cornerstone of science, and version control systems not only make reproducible research possible in a rapid and easy way, but also provide a way of collaborating with co-authors. The purpose of this methodological paper is to present Git, a very successful version control system and how it can be used by economists working together on their papers and the accompanying computer code. Version control systems also make sharing the findings with the rest of the scientific community more easy and streamlined. To understand how version control systems came to be, one must be familiar with the history of free software. In the introduction, I will present free software and its philosophy and show how version control systems make free software possible. In the second section I present Git which is a widely used version control system. In the third section I show a basic usage of Git. In the fourth section, I conclude. [ABSTRACT FROM AUTHOR]

Computer code plays a vital role in modern science, from the conception and design of experiments through to final data analyses. Open sharing of code has been widely discussed as being advantageous to the scientific process, allowing experiments to be more easily replicated, helping with error detection, and reducing wasted effort and resources. In the case of psychology, the code used to present stimuli is a fundamental component of many experiments. It is not known, however, the degree to which researchers are sharing this type of code. To estimate this, we conducted a survey of 400 psychology papers published between 2016 and 2021, identifying those working with the open-source tools Psychtoolbox and PsychoPy that openly share stimulus presentation code. For those that did, we established if it would run following download and also appraised the code's usability in terms of style and documentation. It was found that only 8.4% of papers shared stimulus code, compared to 17.9% sharing analysis code and 31.7% sharing data. Of shared code, 70% ran directly or after minor corrections. For code that did not run, the main error was missing dependencies (66.7%). The usability of the code was moderate, with low levels of code annotation and minimal documentation provided. These results suggest that stimulus presentation code sharing lags behind other forms of code and data sharing, potentially due to less emphasis on such code in open-science discussions and in journal policies. The results also highlight a need for improved documentation to maximize code utility. [ABSTRACT FROM AUTHOR]

A foreword to a paper on automatic software repair published in the current issue is presented.

In Sweden, as in many other countries, programming has been added to the curriculum in recent years. This paper explores how and under what conditions programming is transformed into teaching in technology education. Teachers in grade 7–9 were interviewed about what and how they teach about programming in the context of technology education, and what influenced the choices they made. Data was analysed using content analysis. The results suggest that teachers mainly see programming as a medium to explore and understand technological systems and construction work. The results further implies that teachers are uncertain of what programming means in terms of practices and concepts, and how programming knowledge can be assessed. The process of transformation presents teachers with several challenges, related to their own knowledge of programming, quality of teaching materials, and knowing pupils' prior knowledge about programming. In addition, the results indicate that technology teachers work in isolation. In consequence, the intended interdisciplinary collaboration between technology and mathematics teachers on programming is largely absent. [ABSTRACT FROM AUTHOR]

This paper proposes a synchronous measurement system of four position-independent geometric errors (PIGEs) and two position-dependent geometric errors (PDGEs) for the rotary axis in five-axis machine tools. The measuring instruments used in this system include a touch-trigger probe and two standard calibration spheres. The main contribution of this paper simultaneously and directly measures four PIGEs and two PDGEs (axial and angular positioning errors) through only one measuring process. It is expected to improve the deficiencies of previous studies measuring PIGEs and PDGEs separately. The geometric errors of the C-axis of a mill-turn machine tool MT-540 were analyzed. The calculation process includes the establishment of the mathematical model of the machine and geometric error equations. The least squares method was used to solve the linear overdetermined system and calculate the values of the geometric errors. Before solving the geometric errors, the accuracy of the calculation process was verified by using the simulated method. The simulation results also confirm the feasibility of this measurement system. Then the data obtained from the experiments were used to calculate the geometric errors of the machine tool. During the experiments, the calibration procedure of the touch-trigger probe was calibrated. After the calibration procedure was completed, the mechanical coordinate values of the two standard calibration balls were measured. The geometric error equations were programmed on a computer, and the data of calibration spheres obtained from the experimental measurements were substituted into the program to calculate the four PIGEs and two PDGEs. [ABSTRACT FROM AUTHOR]

The Peter Landin prize honours the best paper presented at each year's International Symposium on the Implementation and Application of Functional Languages (IFL). It has been awarded every year since 2003, and covers a range of topics including functional operating systems, static analysis for cost information of functional programs, techniques to improve array processing for data locality and parallelism, explicit parallel coordination, supercompilation, and a rational deconstruction of Landin's SECD machine itself. This article describes the history of the prize, explains why Peter Landin was chosen as nominee, and describes each of the articles that have been awarded the prize to date. [ABSTRACT FROM AUTHOR]

Announces that the Best Paper Award for 2004 is the piece "Preconditioning Indefinite Systems in Interior Point Methods for Optimization," by Luca Bergamaschi and Jacek Gondzio, as chosen by the editorial board of the periodical "Computational Optimization and Applications". History of the authors' development of the research paper; Contributions of the paper to the field of computational optimization.

This article introduces the articles in volume 31, number 3 of the "International Journal of Parallel Programming". The volume is devoted to a collection of papers on the parallel programming API OpenMP. The papers have been selected from the presentations at the second International Workshop on OpenMP: Experiences and Implementations WOMPEI2002, as part of ISHPC-IV International Symposium on High-Performance Computing, that took place in Kansai Science City in Japan. This collection includes 4 papers from some of the active research groups in OpenMP-related issues and its evaluation. It is the author's hope that the papers in the collection will prove to be interesting and useful to readers, and that the issues raised will stimulate many of them to further research on OpenMP.

Slope stability is an important problem in the field of geotechnical engineering. In order to widen the application range of upper bound limit analysis in engineering practice, this paper analyzes layered distribution characteristics of slope soil and establishes horizontal layers slope failure mechanism which satisfies the separation of velocity, then proposes calculation method for external force power and internal energy dissipation power using discrete algorithm. On this basic, this paper prepares cycle flow of slope stability analysis by upper bound limit principle and strength reduction principle, and develops stability analysis system by computer programming technology. Taking typical mine excavation slope as engineering background and calculates stability coefficient corresponding to different slope angles and evaluate analysis results accuracy by combining with limit equilibrium method. The results show that the stability coefficient error rate of two methods is between 3 and 5%, which can satisfy requirements of engineering practice. Moreover, stability coefficient obtained by upper bound limit analysis is an upper limit solution, and calculation errors are easy to eliminate, so it has certain applicability in slope engineering practice. [ABSTRACT FROM AUTHOR]

An introduction to the journal is presented which discusses various reports within the issue on topics including decomposition-based packet classification mechanism, core-distribution scheduler, and parallel multiple approach based on implicitly restarted Arnoldi method.

Research studies in software maintenance are notoriously hard to reproduce due to lack of datasets, tools, implementation details (e.g., parameter values, environmental settings) and other factors. The progress in the field is hindered by the challenge of comparing new techniques against existing ones, as researchers have to devote a large portion of their resources to the tedious and error-prone process of reproducing previously introduced approaches. In this paper, we address the problem of experiment reproducibility in software maintenance and provide a long-term solution towards ensuring that future experiments will be reproducible and extensible. We conducted a preliminary mapping study of a number of representative maintenance techniques and approaches and implemented them as a set of experiments and a library of components that we make publicly available with TraceLab, called the Component Library. The goal of these experiments and components is to create a body of actionable knowledge that would (i) facilitate future research and (ii) allow the research community to contribute to it as well. In addition, to illustrate the process of using and adapting these techniques, we present an example of creating new techniques based on existing ones, in order to produce improved results. [ABSTRACT FROM AUTHOR]

This article introduces the themes of the papers featured in the April 2000 special issue of the "International Journal of Parallel Programming." The first paper describes a loop transformation algorithm. The second paper proposes a new way to develop concurrent programs, called hypersequential programming. The third paper introduces a workstation cluster implementing a distributed shared-memory mechanism. Lastly, the fourth paper discusses issues of multilevel parallelization and how they affect design of parallelizing compilers.

Apart from good instructional design and delivery, effective intervention is another key to strengthen student academic performance. However, intervention has been recognized as a great challenge. Most instructors struggle to identify at-risk students, determine a proper intervention approach, trace and evaluate whether the intervention works. This process requires extensive effort and commitment, which is impractical especially for large classes with few instructors. This paper proposes a platform, namely i-Ntervene, that integrates Learning Management System (LMS) automatic code grader, and learning analytics features which can empower systematic learning intervention for large programming classes. The platform supports instructor-pace courses on both Virtual Learning Environment (VLE) and traditional classroom setting. The platform iteratively assesses student engagement levels through learning activity gaps. It also analyzes subject understanding from programming question practices to identify at-risk students and suggests aspects of intervention based on their lagging in these areas. Students' post-intervention data are traced and evaluated quantitatively to determine effective intervention approaches. This evaluation method aligns with the evidence-based research design. The developed i-Ntervene prototype was tested on a Java programming course with 253 first-year university students during the Covid-19 pandemic in VLE. The result was satisfactory, as the instructors were able to perform and evaluate 12 interventions throughout a semester. For this experimental course, the platform revealed that the approach of sending extrinsic motivation emails had more impact in promoting learning behavior compared to other types of messages. It also showed that providing tutorial sessions was not an effective approach to improving students' subject understanding in complex algorithmic topics. i-Ntervene allows instructors to flexibly trial potential interventions to discover the optimal approach for their course settings which should boost student's learning outcomes in long term. [ABSTRACT FROM AUTHOR]

Metaphors in gesture and speech play a pivotal role in the way that programming concepts are presented in the classroom. However, little is known about the function of teachers' metaphors in practice. This study aims to explore teachers' use of metaphors in gesture and speech in a lecture on programming. Based on video observations of three upper secondary teachers, we employ Metaphor Identification Procedure (MIP) and Metaphor Identification for Gesture Guidelines (MIG-G) as methodological tools for identifying metaphoric speech and gestures related to programming concepts. The results of the study reveal that the gestures of the three teachers mainly function in two ways: (1) to add spatial properties to a programming concept and (2) to provide additional imagery for a programming concept. Consequently, the gestures identified in this study reduce the communicative burden of teachers' speech. Furthermore, the study reveals that teachers' gestures serve as means for making abstract concepts more tangible. For example, gestures concerning the abstract term "data" can generally be related to an object that could be received or moved. Hence, despite its metaphorical origin, data could be considered a graspable aspect of programming. Furthermore, spatial gestures enable the teachers to communicate programming processes in a tangible way, for example assigning programming processes a forward direction. Theoretical implications, potential implications for teaching and future research are discussed in the paper. [ABSTRACT FROM AUTHOR]

Academic advising is inhibited at most of the high schools to help students identify appropriate academic pathways. The choice of a career domain is significantly influenced by the complexity of life and the volatility of the labor market. Thus, high school students feel confused during the shift period from high school to university, especially with the enormous amounts of data available on the Web. In this paper, an extensive comparative study is conducted to investigate five approaches of recommender systems for university study field and career domain guidance. A novel ontology is constructed to include all the needed information for this purpose. The developed approaches considered user-based and item-based collaborative filtering, demographic-based recommendation, knowledge base supported by case-based reasoning, ontology, as well as different hybridizations of them. A case study on Lebanese high school students is analyzed to evaluate the effectiveness and efficiency of the implemented approaches. The experimental results indicate that the knowledge-based hybrid recommender system, combined with the user-based collaborative filtering and braced with case-based reasoning as well as ontology, generated 98% of similar cases, 95% of them are personalized based on the interests of the high school students. The average usefulness feedback and satisfaction level of the students concerning this proposed hybrid approach reached 95% and 92.5% respectively, which could be a solution to similar problems, regardless of the application domain. Besides, the constructed ontology could be reused in other systems in the educational domain. [ABSTRACT FROM AUTHOR]

Excavating a tunnel in a deep and saturated ground affects the short- and long-term hydro-mechanical (H-M) response in the ground surrounding the opening. However, the interactions between transient pore pressure behavior and the corresponding deformation and stresses in the ground ahead of and behind the tunnel face are still not well understood. This paper investigates the transient H-M response of excavating a tunnel in a deep and saturated ground using a two-dimensional axisymmetric coupled model in the computer code Fast Lagrangian Analysis of Continua (FLAC). The tunnel was advanced in a stepwise excavation procedure consisting of undrained excavation and drained consolidation until the final tunnel face was reached. The final excavated face was then left to consolidate toward the steady-state condition. The main results of the paper are as follows: (1) when simulating a tunnel excavation in deep saturated ground using the convergence-confinement method, the unloading factors should be nonlinear and should consists of the mechanical unloading factor in the form of excavation force and the hydraulic unloading factor in the form of excavation pore pressure. These two unloading factors are necessary because the induced H-M response near the tunnel face is a rather transient response instead of an initial or final response. Moreover, it is observed that the pore pressure dissipation is not linear either with time or with distance to the tunnel face, (2) a relationship between the unloading factors and the distance to the tunnel face should then be established. This relationship is vital because it will provide the timing for tunnel support installation, and (3) the extrusion and the convergence of the advance core could be related through the proposed equations capturing the linear relationships between the face extrusion and its convergence as well as between the core extrusion and its pre-convergence. Through these relationships, the tunnel engineer may be able to estimate the magnitude of the deformation ahead of the face, which will subsequently allow control of the deformation behind the face. [ABSTRACT FROM AUTHOR]

This paper provides a reply to articles by Nicola Angius and Guiseppe Primiero responding to our paper 'Software Intensive Science' (Symons and Horner, Philosophy and Technology, ). [ABSTRACT FROM AUTHOR]

Sand control measures in horizontal wells are mainly based on screens. Horizontal wells have a certain length of horizontal displacement and the kick-off section with large curvature. Therefore, it is necessary to evaluate the safety of the screen downhole run before it runs into the hole, in order to minimize the running risk. In this paper, the pipe string is divided into sections, and the equivalent force for each elementary section is analyzed. Then, the axial force and friction resistance of the pipe string are calculated. According to the buckling criterion of the string and the mechanical strength theory, this paper evaluates whether the screen can safely and smoothly run down to the bottom of the well. This analytical method of solving the physical model is feasible and easy to understand and can be implemented using computer programming applications. [ABSTRACT FROM AUTHOR]

Coding is defined as the "process of assigning a code (command/rule)" (http://Techopedia.com) that allows a machine or a person to act or move (McLennan, https://www.naeyc.org/resources/pubs/tyc/feb2017/creating-coding-stories-and-games, 2017). Though machines operated by a coding system are common in children's everyday lives, there has been a lack of resources on how to expose young children to coding in a developmentally appropriate manner. This paper aims to address this gap in the field of early education by providing developmentally appropriate guidelines for teachers of young children to utilize when implementing coding in their classrooms. Specifically, this paper focuses on unplugged coding activities that do not involve computers or computer programming and presents practical examples of tasks with algorithm designs, including a detailed step-by-step instruction set for solving a problem or completing a task (Tynker, https://www.tynker.com/blog/articles/ideas-and-tips/how-to-explain-algorithms-to-kids/, 2019). This paper presents coding practices that involve children's daily lives, incorporating sequential and directional commands and coding grids (coding sheet). [ABSTRACT FROM AUTHOR]

This article introduces the extended versions of selected papers from the refereed proceedings of the 16th International Conference on Runtime Verification (RV 2016) held in Madrid, Spain, in September 2016. Runtime verification encompasses all aspects of monitoring and analysis of hardware, software, and system executions in general. Runtime verification techniques are lightweight dynamic techniques to assess and enforce correctness, reliability, and robustness during system execution. These techniques are significantly more powerful and versatile than conventional testing, and more practical than exhaustive formal verification (at the price of incomplete coverage). [ABSTRACT FROM AUTHOR]

This paper designs and develops a computer programming learning system for total beginners and those who have no programming experience. The traditional computer programming learning systems require prior knowledge about variables, their types, operators for arithmetic calculations and relational calculations etc., for adopting a wide range of representation of program codes, leading to the burden to them. The proposed system focuses on learning the three basic flows of control: sequential, conditional and iterative controls, for not requiring the prior knowledge, and exploits a path-finding task for confining representation of program codes to a specific task, which is a navigation task where students are asked to organize a sequence of orders for an avatar to move from a given start to a given end on a Manhattan grid map. The previous work employs the path-finding task to foster understanding of the sequence of orders by encouraging students to perform self-tracing process while our proposed system employs it to include that property of understanding for the three basic flows of control which are not covered in the previous work. To add high interactivity and tangibility for student motivation and engagement to learning, the proposed system also employs AR capability. An experiment on feasibility of our system for education is conducted and the results show that our system has the potential for improving students' understanding of how to make program codes by decrease of the ratio of program codes' length made by beginners to experts, which is from 2.186 to 1.267, regardless of AR capability such that the ratio decreased from 2.481 to 1.346 without AR capability and it was from 1.974 to 1.206 with it. The results also show that our system significantly leverages their motivation of learning by increase of beginners' score from 5.00 without AR capability to 6.67 with it for interest and it is from 5.67 to 7.00 for amusement, and even if sacrificing a wide range of representation of program codes that the traditional systems take, a certain stress is significantly given on spending time thinking and building up a program code in proportion to its difficulty and complexity. [ABSTRACT FROM AUTHOR]

This present paper is inspired by one of the questions posed by Okeke (Results Math 78(96):1-30, 2023, see Remark 2.10b). In particular, we aim to develop a robust computer code based on the theoretical results obtained in Okeke (2023), which determines the polynomial solutions of the following functional equation, 0.1 ∑ i = 1 n γ i F (a i x + b i y) = ∑ j = 1 m (α j x + β j y) f (c j x + d j y) , for all x , y ∈ R , γ i , α j , β j ∈ R , and a i , b i , c j , d j ∈ Q , and their special forms. The primary motivation for writing such a computer code is that solving even simple equations belonging to class (0.1) needs long and tiresome calculations. Therefore, one of the advantages of such a computer code is that it allows us to solve complicated problems quickly, easily, and efficiently. Additionally, the computer code will significantly improve the level of accuracy in calculations. Along with that, there is also the factor of speed. We point out that the computer code will operate with symbolic calculations provided by the programming language Python, which means that it does not contain any numerical or approximate methods, and it yields the exact solutions of the equations considered. [ABSTRACT FROM AUTHOR]

Nowadays, the improvement of digital learning with Artificial Intelligence has attracted a lot of research, as it provides solutions for individualized education styles which are independent of place and time. This is particularly the case for computer science, as a tutoring domain, which is rapidly growing and changing and as such, learners need frequent update courses. In this paper, we present a thorough evaluation of a fuzzy-based intelligent tutoring system (ITS), that teaches computer programming. The evaluation concerns multiple aspects of the ITS. The evaluation criteria are: (i) context, (ii) effectiveness, (iii) efficiency, (iv) accuracy, (v) usability and satisfaction, and (vi) engagement and motivation. In the evaluation process students of an undergraduate program in Informatics of the University of Piraeus in Greece participated. The evaluation method that was used included questionnaires, analysis of log files and experiments. Also, t-tests were conducted to certify the validity of the evaluation results. Indeed, the evaluation results are very positive and show that the incorporated fuzzy mechanism to the presented ITS enhances the system with Artificial Intelligence and through this, it increases the learners' satisfaction and new knowledge learning and mastering, improves the recommendation accuracy of the system, the efficacy of interactions, and contributes positively to the learners' engagement in the learning process. [ABSTRACT FROM AUTHOR]

The inverse degree index, also called inverse index, first attracted attention through numerous conjectures generated by the computer programme Graffiti. Since then its relationship with other graph invariants has been studied by several authors. In this paper we obtain new inequalities involving the inverse degree index, and we characterize graphs which are extremal with respect to them. Also, a QSPR study of this index and its exponential extension was performed. [ABSTRACT FROM AUTHOR]

Teaching an introductory programming course to first-year students has long been a challenge for many college instructors. The COVID-19 pandemic, which caused unprecedented shifts in learning modality across the globe, has worsened the learning experience of novice programmers. Instructors have to find innovative ways to keep students engaged and learning. Blended or hybrid learning has become a new preferred way of learning during the COVID-19 pandemic. Blended learning is viewed as a combination of both in-person and online instructions. Such a learning environment offers instructors the flexibility to provide learners with an engaging face-to-face learning experience while promoting the well-being and safety of students. Starting Fall 2020, York College (and other CUNY colleges) has since offered several courses in hybrid mode. Two years have passed since the abrupt transition. There were several lessons learned from the experiences. In this paper, I discussed evidence-based pedagogical approaches that were used to teach students in an introductory computer programming class at York College, CUNY, where blended learning was used. Student perceptions of learning experience and obtaining coding skills in both online and in-person environments are also presented. The findings from the survey suggested that students benefited from face-to-face interactions and feedback, while those who preferred an online environment liked the flexibility that online components offer. Through careful design and implementation of pedagogical approaches used in the class, novice programmers could potentially benefit from both face-to-face and online components of blended learning. [ABSTRACT FROM AUTHOR]

This paper discusses a simple heuristic to minimize the total tardiness in a single machine scheduling problem. The problem of minimizing total tardiness in single machine scheduling is a combinatorial problem. Hence, heuristic development for such problems is inevitable. In this paper, an attempt has been made to develop a simple heuristic, alternatively called greedy heuristic, to minimize the total tardiness in a single machine scheduling problem with n independent jobs, each having its processing time and due date. Further, its solution accuracy is compared with the optimal solution of a set of randomly generated problems using an ANOVA experiment. From the ANOVA experiment, it is observed that the solution of the simple heuristic proposed in this paper does not differ significantly from the optimal solution at a significance level of 0.05. [ABSTRACT FROM AUTHOR]

In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into a logic programming framework. We show how to represent varying degrees of complexity in the semantics including attribute uncertainty, structural uncertainty and identity uncertainty. Our approach is similar in spirit to the work in Bayesian Logic Programs (BLPs), and Logical Bayesian Networks (LBNs). However, surprisingly, there are still some important differences in the resulting formalism; for example, we introduce a general notion of aggregates based on the PRM approaches. One of our contributions is that we show how to support richer forms of structural uncertainty in a probabilistic logical language than have been previously described. Our goal in this work is to present a unifying framework that supports all of the types of relational uncertainty yet is based on logic programming formalisms. We also believe that it facilitates understanding the relationship between the frame-based approaches and alternate logic programming approaches, and allows greater transfer of ideas between them. [ABSTRACT FROM AUTHOR]

To improve the hot-pressing process currently employed in laminated object manufacturing (LOM), an innovative heating-and-pressing separation system is proposed, and heat transfer problems of this system are investigated. A thermal model is first established. It is solved numerically by the finite element method (FEM) software ANSYS, and verified by experiments. Based on the numerical solution under various operating conditions, it is found that the operating temperature of an adhesive can be reached quickly when the heater is maintained at a higher temperature, corresponding to a deeper heat-affected zone. This shortcoming can be effectively reduced if the speed of the heater is increased. Hence, a higher heater temperature together with a higher moving speed is suggested to shorten processing time and promote manufacturing efficiency. Through analysis, the appropriate distance between the roller and the heater, so as to obtain finished parts of high quality, is determined. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) is one of the most powerful platforms that incorporates several other technological components within itself. The IoT ecosystem comprises devices, communications, protocols, analytics, cloud, automation, etc. Its magnitude keeps on increasing with the addition of tools and services. While IoT has many advantages like connectivity, efficiency, and convenience, it is a known fact that privacy and security issues are prevalent in the IoT network. To minimize the security and privacy issues, we propose a blockchain-based solution. In this paper, we design policies based on smart contacts, which is a self-enforcing agreement embedded in computer code managed by a blockchain. We propose three different policies: Hardware and Device Security Policies, Access and Authentication policies, and Application security for the IoT network. Since blockchain-based solutions ensure trust and stability, this may be one of the most robust techniques to alleviate the IoT network's security and privacy issues. Also, we calculate the throughput and latency of the IoT enabled blockchain network and compare the power consumption of the IoT device at the time of data request with other proposed systems. [ABSTRACT FROM AUTHOR]

Constructing Markov chains with desired statistical properties is of critical importance for many applications in economics and finance. This paper proposes a moment-matching method for generating finite-state Markov chains with flexible distributions, including empirically-relevant processes with non-zero skewness and excess kurtosis. In our method, we preserve the most appealing features of the existing methods, including full analytical tractability and minimal computational cost. The new method derives the key moments of the Markov chain as closed-form functions of its parameters. It thus offers a simple plug-in procedure requiring neither numerical integration nor optimization. Using the method amounts to plugging the targeted values of mean, standard deviation, serial correlation, skewness, and excess kurtosis into a simple procedure. The proposed method outperforms the existing methods over a wide range of the parameter space, especially for leptokurtic processes with characteristic roots close to unity. The supplementary materials include ready-to-use computer codes of the plug-in procedures and practical guidelines. [ABSTRACT FROM AUTHOR]

Due to the growing demand for information technology skills, programming education has received increasing attention. Predicting students' programming performance helps teachers realize their teaching effect and students' learning status in time to provide support for students. However, few of the existing researches have taken the code that students wrote into consideration. In fact, code is informative and contains lots of attributes. Student programming performance can be better understood and predicted by adding code information into student profiles. This paper proposed a student profiles model to describe students' characteristics, which contains the code information and then was used as the input of a deep neural network to predict the programming performance. By comparing different machine learning techniques and different combinations of dimensions of student profiles, the experimental results show that a four-layer deep neural network fed with all available dimensions of student profiles has achieved the best prediction with RMSE 12.68. [ABSTRACT FROM AUTHOR]

This special issue collects current advances in the ongoing attempt to obtain synergies from the combination of Tests and Proofs. [ABSTRACT FROM AUTHOR]

In this paper, we develop a primal-dual central trajectory interior-point algorithm for symmetric programming problems and establish its complexity analysis. The main contribution of the paper is that it uniquely equips the central trajectory algorithm with various selections of the displacement step while solving symmetric programming. To show the efficiency of the proposed algorithm, these selections of calculating the displacement step are compared in numerical examples for second-order cone programming, which is a special case of symmetric programming. [ABSTRACT FROM AUTHOR]

During a conventional multiple-point statistics simulation, the algorithm may not find a matched neighborhood in the training image for some unsimulated pixels. These pixels are referred to as the dead-end pixels; the existence of the dead-end pixels means that multiple-point statistics simulation is not a simple sequential simulation. In this paper, the multiple-point statistics simulation is cast as a combinatorial optimization problem, and the efficient backtracking algorithm is developed to solve this optimization problem. The efficient backtracking consists of backtracking, forward checking, and conflict-directed backjumping algorithms that are introduced and discussed in this paper. This algorithm is applied to simulate multiple-point statistics properties of some synthetic training images; the results show that no anomalies occurred in any of the produced realizations as opposed to previously published methods for solving the dead-end pixels. In particular, in simulating a channel system, all the channels generated by this method are continuous, which is of paramount importance in fluid flow simulation applications. The results also show that the presence of hard data does not degrade the quality of the generated realizations. The presented method provides a robust algorithmic framework for performing MPS simulation. [ABSTRACT FROM AUTHOR]

This paper presents a tool (iMPAcT) that automates testing of mobile applications based on the presence of recurring behaviour, UI Patterns. It combines reverse engineering, pattern matching and testing. The reverse engineering process is responsible for crawling the application, i.e. analysing the state of the application and interacting with it by firing events. The pattern matching tries to identify the presence of UI patterns based on a catalogue of patterns. When a UI Pattern from the catalogue is detected, a test strategy is applied (testing). These test strategies are called UI Test Patterns. These three phases work in an iterative way: the patterns are identified and tested between firing of events, i.e. the process alternates between exploring the application and testing the UI Patterns. The process is dynamic and fully automatic not requiring any previous knowledge about the application under test. This paper presents the results of an experiment studying the reliability of the results obtained by iMPAcT. The experiment involved 25 applications found on Google Play Store and concludes that iMPAcT is successful in identifying failures in the tested patterns and that the degree of certainty of an identified failure being an actual failure is high. [ABSTRACT FROM AUTHOR]

Presents an introduction to the August 2004 issue of the "International Journal of Parallel Programming," based on the 17th International Conference on Supercomputing, San Francisco, California, during June 21-26, 2003.

An introduction to the journal is presented in which the authors discuss various papers within the issue on topics including significance of computers in practicing interaction designs, use of modern programming in material interaction, and interaction design research methodology.