Search

The article discusses two computer science research papers concerning artificial intelligence (AI). Topics explored include the susceptibility of deep convolutional neural networks to input pertubations acknowledged in the 2013 study "Intriguing Properties of Neural Networks," by Christian Szegedy and colleagues, and the capability of sequence-to-sequence language models to execute short computer programs reported in the 2014 study "Learning to Execute," by Wojciech Zaremba and Ilya Sutskever.

Over the past two decades, digital flashcards – that is, computer programmes, smartphone apps, and online services that mimic, and potentially improve upon, the capabilities of traditional paper flashcards – have grown in variety and popularity. Many digital flashcard platforms allow learners to make or use flashcards from a variety of sources and customise the way in which flashcards are used. Yet relatively little is known about why and how students actually use digital flashcards during self-regulated learning, and whether such uses are supported by research from the science of learning. To address these questions, we conducted a large survey of undergraduate students (n = 901) at a major U.S. university. The survey revealed insights into the popularity, acquisition, and usage of digital flashcards, beliefs about how digital flashcards are to be used during self-regulated learning, and differences in uses of paper versus digital flashcards, all of which have implications for the optimisation of student learning. Overall, our results suggest that college students commonly use digital flashcards in a manner that only partially reflects evidence-based learning principles, and as such, the pedagogical potential of digital flashcards remains to be fully realised. [ABSTRACT FROM AUTHOR]

The existence of AI application examples is by itself an admirable achievement of engineers and professionals working on them, and certainly there is an interest to move forward to design AI algorithms to make it write proficiently with originality. Artificial Intelligence (AI) has become a trendy topic through advertisements, notes and even warnings about it, claiming that it can be used to answer almost any kind of question. Generating new content requires that AI conduct research work starting from, in principle, human proposed hypothesis, and then getting analyzable results to formulate conclusions. [Extracted from the article]

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]

This article presents the results of a research in the classroom in the subject Programming I, initial course of computer programming in Systems Engineering and Computing. The research pretend to approach the impact of two methodologies of problem solving based on programming logic and the use of programming languages for its implementation. We use a qualitative perspective, as far as the students' performance as programmers, and quantitative, in what corresponds to the qualification of the written evaluations. It has been used to structure two parallel courses, using different methodologies for solving programming problems. With the first group, a methodology was implemented based on the conceptual resolution of these problems using solutions on paper and with the other one we use resolution of problems based on the intensive use of the computer. The results show a very interesting trend that allows us to make some important inferences regarding the promotion of logic and the approach of solutions in the paper against the use of the computer and the deepening in the purely technological knowledge. Conclusions leave open doors of the discussion about the different and possible ways that the students of programming to appropriate, assimilate and apply the own knowledge of this area. [ABSTRACT FROM AUTHOR]

Nowadays, academic research relies not only on sharing with the academic community the scientific results obtained by research groups while studying certain phenomena but also on sharing computer codes developed within the community. In the field of atomistic modeling, these were software packages for classical atomistic modeling, and later for quantum-mechanical modeling; currently, with the fast growth of the field of machine-learning potentials, the packages implement such potentials. In this paper, we present the MLIP-3 package for constructing moment tensor potentials and performing their active training. This package builds on the MLIP-2 package [Novikov et al., "The MLIP package: moment tensor potentials with MPI and active learning," Mach. Learn.: Sci. Technol., 2(2), 025002 (2020)], however, with a number of improvements, including active learning on atomic neighborhoods of a possibly large atomistic simulation. [ABSTRACT FROM AUTHOR]

Whereas hackathons are widespread within and outside academia and have been argued to be a valid pedagogical method for teaching interdisciplinarity, no detailed frameworks or methods are available for conceptualizing and organizing educational hackathons, i.e., hackathons dedicated to best achieving pedagogic objectives. This paper is dedicated to introducing EDUCational Hackathons for learning how to solve Interdisciplinary Challenges (EDUCHIC) through: (1) defining the fundamental principles for framing an activity as an EDUCHIC, integrating principles from pedagogical methods, hackathon organization, and interdisciplinarity processes; (2) describing general properties that EDUCHIC possess as a consequence of the interaction of the fundamental principles; (3) developing operational guidelines for streamlining the practical organization of EDUCHIC, including an exhaustive end‐to‐end process covering all the steps for organizing EDUCHIC and practical frames for carrying the key decisions to be made in this process; and (4) a demonstration of these guidelines through illustrating their application for organizing a concrete EDUCHIC. [ABSTRACT FROM AUTHOR]

Hackathon has been growing and taking various industries by storm thanks to its flexibility and ability to fit into them. It has been proven successful and helpful in solving different IT and non-IT challenges. They also serve as an intriguing educational and networking tool, encouraging people to pursue innovative studies and activities. However, a hackathon is like a two-edged sword with its downsides – it requires significant investment and can fail if mismanaged. It is critical to recruit and gather participants suitable to face a particular technological or non-technological challenge and to motivate a group to perform innovative action and benefit from the learning-by-doing approach. This paper identifies 21 reasons to attend hackathons backed by existing research and presents a study conducted on 109 hackathon participants that help to score, rank and explain those attributes. Results have proven the importance of challenge and networking over monetary prizes and glory. [ABSTRACT FROM AUTHOR]

Computer programming and municipal engineering (ME) students' specialised knowledge are still poorly integrated, leading to limited improvement of students' programming abilities. This paper describes an effective attempt in ME at Xi'an University of Architecture and Technology (XAUAT). Students were divided into several teams and required to develop software tools for ME design problems using Visual C++ 6.0. In this teaching approach, students need to identify the solutions by integrating knowledge in mathematics, physics, chemistry, basic engineering science, and ME. Moreover, students should develop programmes with friendly interfaces, essential prompts, and reliable results. The example programmes, positive feedback from the survey, and better performance in the final examination proved that the students' abilities of knowledge application and problem-solving had been developed, and their motivation in learning programming had been improved. [ABSTRACT FROM AUTHOR]

Construction project delays can stem from a myriad of factors and pose significant challenges for owners and contractors. While numerous methods for analyzing delays exist, the majority are designed for network scheduling, lack contemporaneous tracking (i.e., do not allow for identifying and tracking delays as they occur), and struggle with attributing delays to specific stakeholders. Therefore, this paper introduces a novel graphical approach to monitor delays by comparing as-planned and as-built schedules at the activity level. Distinguished by its contemporaneous nature, the new method allows real-time tracking and quantification of delays. This facilitates identifying their origin and potential causes. Rules for constructing the graphs of various delay scenarios are demonstrated for typical activity combinations. The effectiveness of the proposed method is validated via a case study that showcases its practical application. Implementing it is straightforward, and while the method could be applied to network schedules, its relevance lies in linear and repetitive schedules. The cyclic nature of tasks in such schedules underscores the importance of contemporaneous delay tracking to facilitate swift remedial actions and pinpoint liability. Practical Applications: In this study, the authors present a new way to track delay using graphs by comparing starts, productivities, and finishes of as-planned and as-built schedules at the activity level. Because it is contemporaneous, the new approach tracks and measures delays in real time, currently manually, but easily implemented as computer code. This method makes it easier to find the source and possible causes of activity and project delays. Detailed rules are derived for common activity scenarios and interactions on how to create the respective graphs. A real-world study demonstrates how the proposed method can be used to substantiate its potential value to practitioners in industry. The proposed approach is practical, and while it could be used for network schedules, it is especially useful for linear and repetitive schedules. [ABSTRACT FROM AUTHOR]

Cirques are often the most representative and numerous landforms in alpine glaciated watersheds. The readily mappable and measurable nature of cirques (especially aspects and floor elevations) may yield information about the climatic, geologic, and topographic conditions that created them. These ubiquitous landforms are the foci of an alpine glacial geomorphology exercise in an intermediate-level, university geomorphology course. The exercise involves a step-by-step approach using topographic maps and remotely sensed imagery to identify and map cirques, measure cirque aspects and floor elevations, and plot and analyze the resulting data. Students interpret their mapping and analysis results in the context of published literature, ultimately incorporating all into a research paper. Student comments and self-evaluations over time show that the exercise is an effective tool for learning glacial geomorphology, topographic map, and remotely sensed image analysis, data analysis, and report writing. [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]

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 work studied in detail for the first time the bending of laminated composite plates subjected t mechanical variations by new theory Trigonometric and Trigonometric-Hyperbolic functions of shear deformation. From the Euler-Lagrange hypothesis and the equations of the shear deformation theory, we will develop a present method. One of the most important problems of composite plates is the analysis of their bending behavior. The correct approach used to study their bending behavior includes two trigonometric and trigonometric-hyperbolic functions satisfying the null shear stress condition at the free edges. In this paper the bending problem is solved analytically by developing a computational code and numerically solved by Finite Element Method. In order to simplify the study of the bending behavior, an approach taking into consideration the effect of the transverse shear deformation without the shear coefficient of correction with only four unknowns has been developed while requiring five or more unknowns for other theories. Convergence analysis has been carried and the results are compared to open literature available for plate bending analysis. The approach proves to be simple and useful in analyzing the bending behavior of composite layered plates. [ABSTRACT FROM AUTHOR]

This work is primarily the product of the first listed author, who completed it as a student under the direction of the second and third listed authors. In this paper we analyze three progressive betting strategies, each applied to three casino games. The betting strategies considered are Martingale, Paroli, and Fibonacci, each applied to the casino games blackjack, craps, and roulette. The aim of this analysis is to try to identify optimal betting strategies for each game with a given or maximum number of bets placed that pay 1:1. The purpose of this work is not to try to discover methods for “beating the house,” which are already known to not exist, but rather to search for methods for advancing gameplay through a given or maximum number of bets while retaining the possibility of earning a profit. Programming in the computer algebra system Maple, more specifically through the use of a Maplet, which is like an applet but uses (and requires) Maple’s engine, will be used for calculations. [ABSTRACT FROM AUTHOR]

Background: With the development of computational literacy, there has been a surge in both research and practice application of text‐based and block‐based modalities within the field of computer programming education. Despite this trend, little work has actually examined how learners engaging in programming process when utilizing these two major programming modalities, especially in the context of secondary education settings. Objectives: To further compare programming effects between and within text‐based and block‐based modalities, this research conducted a quasi‐experimental research in China's secondary school. Methods: An online programming platform, Code4all, was developed to allow learners to program in text‐based and block‐based modalities. This research collected multimodal data sources, including programming platform data, process data, and performance data. This research further utilized multiple learning analytics approaches (i.e., clustering analysis, click stream analysis, lag‐sequential analysis and statistics) to compare learners' programming features, behavioural patterns and knowledge gains under two modalities. Results and Conclusions: The results indicated that learners in text‐based modality tended to write longer lines of code, encountered more syntactical errors, and took longer to attempt debugging. In contrast, learners in block‐based modality spent more time operating blocks and attempt debugging, achieving better programming knowledge performances compared to their counterparts. Further analysis of five clusters from the two modalities revealed discrepancies in programming behavioural patterns. Implications: Three major pedagogical implications were proposed based on empirical research results. Furthermore, this research contributed to the learning analytics literature by integrating process‐oriented and summative analysis to reveal learners' programming learning quality. Lay Description: What is currently known about the subject matter: Programming has the potential to improve learners' higher‐order thinking skills.Block‐based and text‐based modalities are two major instructional methods.There has been a growing interest to understand how learning occurs in two modes.Most previous work has evaluated two modalities based on learners' knowledge, skills, and attitudes. What this paper adds: Code4all allows learners to programming in text‐based and block‐based modalities.Quasi‐experimental research was conducted to examine block‐based and text‐based programming modalities.Multimodal learning analytics were used to compare programming under two modalities.Learners' programming features, behaviouralbehavioral patterns, and knowledge gains were identified under two modalities. The implications of study findings for practitioners: Instructors should integrate text‐based and block‐based modalities into programming courses.Process‐oriented assessment should be integrated with summative assessment. Adaptive, timely scaffoldings should be provided with the external support (this should be marked like above two points). [ABSTRACT FROM AUTHOR]

There is rapidly developing interest in legal coding, the development of machine-consumable code representations of legal rules. However, interpretive ambiguities inherent in legal rules make it challenging to directly translate law into code. Interpretive ambiguities pose challenges for legal coders, who must determine the extent to which they disambiguate rules, as well as the interpretive methods applied. Similar interpretive issues have been historically addressed in the field of legal translation. This paper argues that a legal translation framework, known as the principle of fidelity, can be used to better understand and resolve interpretive ambiguities inherent in the legal coding process. Three models of fidelity prominently discussed in legal translation literature are adapted and applied to legal coding. Accordingly, the application of fidelity models to the legal coding process could provide new understanding and methods to address complex interpretive ambiguities. [ABSTRACT FROM AUTHOR]

The corrosion problem of the tank floor of the oil depot tank area becomes more and more serious with the extension of the operation time. At present, how to determine the potential distribution of the storage tank floor and how to judge the cathodic protection effect of the storage tank floor is the bottleneck of technological development. In this paper, by constructing a mathematical model of cathodic protection in the tank area, influence of deep well anode on potential distribution of tank bottom is calculated by boundary element method (BEM) with computer programming, to study the potential distribution of the tank floor under different anode parameters. The results show that the calculated results are in good agreement with the field measured results, which verifies the accuracy and reliability of the calculation. [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]

Summary: Software complexity is the very essence of computer programming. As the complexity increases, the potential risks and defects of software systems will increase. This makes the software correctness analysis and the software quality improvement more difficult. In this paper, we present a quantitative metric to describe the complexity of a hierarchical software and a Complexity‐oriented Software Architecture Refactoring (CoSSR) approach to reduce the complexity. The main idea is to identify and then reassemble subcomponents into one hierarchical component, which achieves minimum complexity in terms of the solution algorithm. Moreover, our algorithm can be improved by introducing partition constraint, heuristic search strategy, and spectral clustering. We implement the proposed method as an automated refactoring tool and demonstrate our algorithm through a case study of battery management system (BMS). The results show that our approach is more efficient and effective to reduce the complexity of hierarchical software system. [ABSTRACT FROM AUTHOR]

Analog computing is often considered to be an outdated technology only to be found and cared for in museums but not as the basis of modern cutting edge computing. Nothing could be further from reality. Together with quantum computers, analog computers complement today's stored program digital computers, acting as co-processors for certain types of computationally intensive tasks. They are highly energy efficient and exhibit a degree of parallelism that by far surpasses classic digital computers. In contrast to quantum computers, analog computers do not require exotic technologies, no intricate cooling systems, no elaborate shielding systems, etc. In addition to this there already exists a plethora of proven programs for analog computers to solve a wide variety of problems. This paper describes the necessity of analog computing for the twenty-first century, gives a short introduction to the structure and programming of analog computers, before discussing future application areas. Analog computing will drastically alter the way we think about computing in the years to come as it will become an integral part of every high performance computer. It will be an indispensable technology for future AI systems, it will revolutionize many medical applications, it might even replace or at least complement, certain types of quantum computers, etc. [ABSTRACT FROM AUTHOR]

The purpose of this article is to present grassroots concepts and ideas about "the algorithm" in the religious context. The power and causality of algorithms are based on lines of computer code, making a society influenced by "black boxes" or "enigmatic technologies" (as they are incomprehensible to most people). On the other hand, the power of algorithms lies in the meanings that we attribute to them. The extent of the power, agency, and control that algorithms have over us depends on how much power, agency, and control we are willing to give to algorithms and artificial intelligence, which involves building the idea of their omnipotence. The key question is about the meanings and the ideas about algorithms that are circulating in society. This paper is focused on the analysis of "vernacular/folk" theories on algorithms, reconstructed based on posts made by the users of Polish Catholic forums. The qualitative analysis of online discourse makes it possible to point out several themes, i.e., according to the linguistic concept, "algorithm" is the source domain used in explanations of religious issues (God as the creator of the algorithm, the soul as the algorithm); algorithms and the effects of their work are combined with the individualization and personalization of religion; algorithms are perceived as ideological machines. [ABSTRACT FROM AUTHOR]

Punched paper tape readers, frequently used for machine control and computer input, are readily adaptable for the purposes of presenting extremely complex signal sequences such as those used in psychophysiology. A description of basic operating principles is given together with an explanation of the minor modifications necessary to adapt this instrument to signal control. Complete schematics are presented of an instrument with seven channel control capacity. [ABSTRACT FROM AUTHOR]

Information about several papers discussed at the International Exascale Software Project (IESP) workshop on computer software and hardware related subject is presented. White papers addressing topics, that includes programming models, system software and parallel programming, were submitted by different groups. Information about development in exascale and high speed computing system as discussed in the workshop is also presented.

An alternator is a network of concurrent nodes, which satisfies the following conditions: (i) if one node enters its critical section, no neighboring nodes could enter their critical sections at the same computing phase; (ii) along any infinite computing phases, each node enters its critical section infinitely often. An alternator is said to exhibit strong fairness if condition (ii) is changed to: between any two consecutive critical steps of a node, all neighbors enter their critical sections exactly once. In this paper, we propose a state-optimal alternator algorithm for uniform rings with n nodes, where n is any positive integer greater than one. The proposed algorithm operates correctly for synchronous mode. Every node maintains only a two-state variable. The proposed algorithm has the snap property that the system always satisfies condition (i) of the alternator even if some transient fault occurs. The stabilization time of the proposed alternator algorithm is O(n) phases. After stabilization, the system satisfies the strong fairness property and achieves the maximal performance. We say that an alternator achieves the maximal performance if a node is allowed to enter its critical section when both its neighbors do not enter their critical sections. In the worst case, the proposed algorithm allows each node to enter its critical section every three phases. [ABSTRACT FROM AUTHOR]

Although sorting techniques (e.g. card sorts) are widely used in knowledge acquisition and requirements acquisition, they have received little formal attention compared to related techniques such as repertory grids and laddering. This paper briefly describes the main sorting techniques, and then provides a detailed tutorial on one variety (repeated single-criterion sorts), using a worked example. Guidelines for choice and sequencing of techniques are given, both in relation to varieties of sorting technique and in relation to other techniques. It is concluded that the sorting techniques are a valuable part of the elicitor's methodological toolkit. [ABSTRACT FROM AUTHOR]

Each programming language needs a mechanism of translating source code into code understood by the computer, i.e., machine code or assembly. This is done by a compiler. A compiler is thus a fundamental tool for software development. Lexical analysis, as the first step of compilation, has an important role and should be performed in an optimal way. But not only compilers rely on lexical analysis. Its role lies nowadays also in pattern recognition or natural language processing. In this paper, we present some of the main aspects of lexical analysis and how to efficiently perform it. Our aim is to offer some guidelines in constructing a modern and efficient scanner (lexer), outlining the criteria, which should be considered, presenting some pitfalls, and comparing existent tools for compiler construction. The main contribution of the paper is to offer practical guidelines and recommendations, especially to graduate students and programmers, in constructing an efficient scanner (lexer), considering also the proper tools currently available. [ABSTRACT FROM AUTHOR]

Our aim is to present a methodology that integrates all phases of software¡s production beginning from the specification phase, through the phase of programming and finally the phase of verification of program against its specification. The theoretical background of the methodology is algorithmic logic [8]. The environment for practical activities of this software project is a plugin SpecVer [11] extending the Eclipse development platform [2]. [ABSTRACT FROM AUTHOR]

The emergence of online teaching has brought new opportunities to computer coding education. In this paper, we examine how the move online is generating a new kind of dynamic within computer programming classes on an online EdTech platform in South Korea. As the platform seeks to solve some old problems within large-scale programming classes, such as machine dependency and labor-intensive operation, its online classes face unique challenges arising from temporal and spatial separation. The new environment requires that class participants coordinate their actions and relationships with other members, which means technical adjustments and human adaptations. Instructors, students, and managers form a distinctive three-party relationship as they respond to the tricky problems of online teaching, such as the time delay between audio and video transmission. The automation of evaluation labor by the platform also influences the human relationship as well as educational efficiency. Our study suggests that the most challenging task in online EdTech experiments would not be to move classes online completely, but to rearrange roles, identities, and relationships within the class. [ABSTRACT FROM AUTHOR]

This paper presents a new method of reducing the inrush current and improving the starting performance of a line-start permanent-magnet synchronous motor (LSPMSM). The novelty of the proposed method relies on the selection of the time instant of the connection of the stator winding to the grid, for which the smallest values of the amplitudes of inrush currents are obtained. To confirm the effectiveness of the developed method of limiting the inrush current, simulations and experimental studies were carried out. The algorithm and dedicated computer code developed by the authors for the analysis of transient coupled phenomena in the LSPMSM were used to study the impact of the time instant of connection of the winding to the grid on the motor start-up process. The algorithm was based on a field model of coupled electromagnetic and thermal phenomena in the studied motor. To verify the developed model of the phenomena and the proposed method, experimental research was carried out on a purpose-built computerised test stand. Good concordance between the results of the experiments and simulations confirmed the high reliability of the proposed model, as well as the effectiveness of the developed approach in limiting the inrush current and improving the starting performance of LSPMSMs. [ABSTRACT FROM AUTHOR]

The present paper explains the performance of a production process of finite capacity for two classes of customers who may exhibit impatience. The arrivals can be found in terms of batches and will be picked for service in FIFO mode. The production requests can come in two ways (i) on immediate demand, (ii) for future stock purposes. Taking this point, we have taken two-class customers with different arrival rates. Also assumed state-dependent service with which process has to be triggered to avoid congestion. A computer programme has been executed for the R-K method to solve the transient equations for transient probabilities with the given input values of arrival rates of two-class customer orders, service rates and system capacity. System performance indices have been computed and shown numerical illustrations to assess the influence input parameters on performance indices. [ABSTRACT FROM AUTHOR]

In this paper, several research topics are presented that provide productive avenues of exploration for students in an undergraduate cryptography course. The topics are intended for a variety of skill levels and interests. In some cases, a student might be inspired to try to solve the proposed problem or write computer code. Other topics might motivate them to learn new mathematics or algorithms, or research a historical event or person. In all cases, a short description of the topic is given along with several references that can be used as a starting point for student research. The author also describes some challenges and recommendations when teaching a course where a project is a main component. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to present an easier and more efficient method for the determination of the geometry of a bevelled gear tooth. Based on a method that provides an easier way for the rack generation of involute helical gears, the mathematical model of a beveloid gear is studied. The mathematical procedure for developing two-dimensional cross-sections has been extended to three-dimensional gear models. A computer programme is developed to obtain generating and generated surfaces. The proposed algorithm is compared with the previous studies for verification and validation. The results demonstrate that the coordinates obtained from the given method are nearly the same on the start and end points of the main gear parts, such as the involute and root fillets regions. Also, between the limits, the values can be considered acceptable. A coordinate deviation of the gear profile has been observed in the mathematical model, because of the profile shift. Modifications have been developed in the equations to eliminate these cases. The main advantage of the proposed method is to obtain mathematical models without carrying out some of the calculation steps used in previous studies. Eventually, this feature will provide an easier and faster method to develop computer-aided models of the beveloid gear types. [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. In particular, we obtain several inequalities relating the inverse degree index with the first and second Zagreb indices, the general first and second Zagreb indices, the Forgotten index, the general sum-connectivity index, the Sombor index and the misbalance indeg index, and several parameters of the molecular graph as the number of vertices, the number of edges, the minimum degree and the maximum degree. Also, we compute the inverse degree index for some classes of chemical graphs. Furthermore, some applications are given to the study of the physicochemical properties of three classes of compounds: polyaromatic hydrocarbons, polychlorobiphenyls, and octane isomers. [ABSTRACT FROM AUTHOR]

In this paper, a novel methodology is presented for the construction of ab initio effective rotation–vibration spectroscopic models from potential energy and dipole moment surfaces. Non-empirical effective Hamiltonians are obtained via the block-diagonalization of selected variationally computed eigenvector matrices. For the first time, the derivation of an effective dipole moment is carried out in a systematic way. This general approach can be implemented quite easily in most of the variational computer codes and turns out to be a clear alternative to the rather involved Van Vleck perturbation method. Symmetry is exploited at all stages to translate first-principles calculations into a set of spectroscopic parameters to be further refined on experiment. We demonstrate on H2CO, PH3, CH4, C2H4, and SF6 that the proposed effective model can provide crucial information to spectroscopists within a very short time compared to empirical spectroscopic models. This approach brings a new insight into high-resolution spectrum analysis of polyatomic molecules and will be also of great help in the modeling of hot atmospheres where completeness is important. [ABSTRACT FROM AUTHOR]

The inclusion of 'consciousness' in Michael Bonnett's paper signals to me that the right place for examination of the ongoing and deepening environmental disasters that humans face is human consciousness itself: the way we think, perceive, and feel, which flows into the way we relate to and act towards nature. Against the still prevailing way of thinking about environmental disaster and crisis, namely locating these problems out there in the environment, I, like Bonnett, and a growing number of others, point to the problematic 'metaphysics' of how we humans conceive and perceive nature. Our current 'environmental problems' are metaphysical. In support of Bonnett's paper, I examine the problematic metaphysics (namely, The Mechanical Universe), trace its psycho-neurobiological origin to the authoritarian structure that disempowers human beings to play out domination-submission programming, and suggest learning the way of mutual participation and collaboration characteristic of our immersive experience in nature. In further support of Bonnett's characterization of nature as 'self-arising,' which incidentally is the literal meaning of nature in Chinese (自然), I introduce the Way of Zen as practice of 'interbeing.' Interbeing, when practiced, would lead us to experiencing awe and wonder, as in our encounter with nature, restoring a sense of immediacy, presence, and non-discursivity: all central to Zen experience. [ABSTRACT FROM AUTHOR]

Reproducibility, the ability to reproduce the results of published papers or studies using their computer code and data, is a cornerstone of reliable scientific methodology. Studies where results cannot be reproduced by the scientific community should be treated with caution. Over the past decade, the importance of reproducible research has been frequently stressed in a wide range of scientific journals such as Nature and Science and international magazines such as The Economist. However, multiple studies have demonstrated that scientific results are often not reproducible across research areas such as psychology and medicine. Statistics, the science concerned with developing and studying methods for collecting, analyzing, interpreting and presenting empirical data, prides itself on its openness when it comes to sharing both computer code and data. In this article, we examine reproducibility in the field of statistics by attempting to reproduce the results in 93 published papers in prominent journals using functional magnetic resonance imaging (fMRI) data during the 2010–2021 period. Overall, from both the computer code and the data perspective, among all the 93 examined papers, we could only reproduce the results in 14 (15.1%) papers, that is, the papers provide both executable computer code (or software) with the real fMRI data, and our results matched the results in the paper. Finally, we conclude with some author-specific and journal-specific recommendations to improve the research reproducibility in statistics. [ABSTRACT FROM AUTHOR]

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]