Search

We investigated the influence of mental imagery expertise in 15 pen and paper role-players as an expert group compared to the gender-matched control group of computer role-players in the difficult Vandenberg and Kuse mental rotation task. In this task, the participants have to decide which two of four rotated figures match the target figure. The dependent measures were performance speed and accuracy. In our exploratory investigation, we further examined midline frontal theta band activation, parietal alpha band activation, and parietal alpha band asymmetry in EEG as indicator for the chosen rotation strategy. Additionally, we explored the gender influence on performance and EEG activation, although a very small female sample section was given. The expected gender difference concerning performance accuracy was negated by expertise in pen and paper role-playing women, while the gender-specific difference in performance speed was preserved. Moreover, gender differences concerning electro-cortical measures revealed differences in rotation strategy, with women using top-down strategies compared to men, who were using top-down strategies and active inhibition of associative cortical areas. These strategy uses were further moderated by expertise, with higher expertise leading to more pronounced activation patters, especially during successful performance. However, due to the very limited sample size, the findings of this explorative study have to be interpreted cautiously.

Paper waste in the mockups design with regular, irregular, and amorphous patterns is a critical problem in digital printing presses. Paper waste reduction directly impacts production costs, generating business and environmental benefits. This problem can be mapped to the two-dimensional irregular bin-packing problem. In this paper, an iterated local search algorithm using a novel neighborhood structure to detect overlaps between amorphous shapes is introduced. This algorithm is used to solve the paper waste problem, modeled as one 2D irregular bin-packing problem. The experimental results show that this approach works efficiently and effectively to detect and correct the overlaps between regular, irregular, and amorphous figures.

The administration of A/B exams usually involves the use of items. Issues arise when the pre-establishment of a question bank is necessary and the inconsistency in the knowledge points to be tested (in the two exams) reduces the exams &lsquo, fairness&rsquo, These are critical for a large multi-teacher course wherein the teachers are changed such that the course and examination content are altered every few years. However, a fair test with randomly participating students should still be a guaranteed subject with no item pool. Through data-driven decision-making, this study collected data related to a term test for a compulsory general course for empirical assessments, pre-processed the data and used item response theory to statistically estimate the difficulty, discrimination and lower asymptotic for each item in the two exam papers. Binary goal programing was finally used to analyze and balance the fairness of A/B exams without an item pool. As a result, pairs of associated questions in the two exam papers were optimized in terms of their overall balance in three dimensions (as the goals) through the paired exchanges of items. These exam papers guarantee their consistency (in the tested knowledge points) and also ensure the fairness of the term test (a key psychological factor that motivates continued studies). Such an application is novel as the teacher(s) did not have a pre-set question bank and could formulate the fairest strategy for the A/B exam papers. The model can be employed to address similar teaching practice issues.

This editorial is a short review of papers accepted in the Mathematics and Symmetry/Asymmetry section in 2020–2021 about the symmetry methods [...]

This issue of featured papers from 2020 is related to the study of symmetry phenomena in various different fields, but mainly in theoretical physics [...]

This Special issue contains top-tier physics-related and mathematical research, among other topics, written by scholars who are well-known in their field [...]

The International Institute of Knowledge Innovation and Invention (IIKII) is an institute that promotes the exchange of innovations and inventions, and establishes a communication platform for international innovations and researches. In 2019, IIKII cooperated with the Institute of Electrical and Electronics Engineers (IEEE) Tainan Section Sensors Council to hold IEEE conferences such as IEEE ICIASE 2019, IEEE ECBIOS 2019, IEEE ICKII 2019, ICUSA-GAME 2019, and IEEE ECICE 2019. This Special Issue entitled “Selected Papers from IIKII 2019 conferences” aims to select excellent papers from IIKII 2019 conferences, including symmetry in physics, chemistry, biology, mathematics, and computer science, etc. It selected 21 excellent papers from 750 papers presented in IIKII 2019 conferences on the topic of symmetry. The main goals of this Special Issue are to encourage scientists to publish their experimental and theoretical results in as much detail as possible, and to discover new scientific knowledge relevant to the topic of symmetry.

This comment is devoted to the paper “Lie Symmetry Analysis, Explicit Solutions, and Conservation Laws of a Spatially Two-Dimensional Burgers–Huxley Equation” (Symmery, 2020, vol.12, 170), in which several results are either incorrect, or incomplete, or misleading.

This paper examines the added value of a digital tool that constitutes a new model to introduce students to multiplication. Drawing on the theory of semiotic mediation, the semiotic potential of this new model is analysed with respect to the same task that can be solved in two different settings (the digital tool and pencil and paper). The analysis shows that the task solutions undergo significant changes depending on to the technological settings. Even though the end product of the model–task dyads might look the same in both settings, the product emerges from the different processes that would mediate quite different meanings for multiplication. This suggests that while designing tasks that involve mathematical models, rather than focusing only on the end product, considering the whole process would reveal the extensive potential meanings the model–task dyad can mediate.

In order to recognize outstanding papers that have been published in Symmetry, the Editorial Board established an annual “Symmetry Best Paper Award”. We are pleased to announce the first “Symmetry Best Paper Award” for 2015. Nominations were selected by the Editorial Board Office, with all research articles published in 2013 and 2014 eligible for consideration. Following review and voting by the Symmetry Best Paper Award Committee, the following three papers have won Symmetry Best Paper Awards for 2015

This short paper concerns the analysis of the M/M/k queueing system with customer abandonment. In this system, service managers provide a finite buffer space, which is a waiting area that prevents customers from abandoning the system. Abandonment of the system can occur from reneging (exiting from the queue while waiting), and/or balking (leaving the system without waiting). We derive an analytical expression to represent the impact of the buffer space capacity on the delay probability and the abandonment probability for a system with deferred abandonment. The result indicates the provision of the buffer space in a large system could only increase the delay probability while the abandonment probability remains unchanged. Despite the benevolent intentions of service managers, providing a buffer space may exacerbate the performance of larger systems.

The class of log-elliptical distributions is well used and studied in risk measurement and actuarial science. The reason is that risks are often skewed and positive when they describe pure risks, i.e., risks in which there is no possibility of profit. In practice, risk managers confront a system of mutually dependent risks, not only one risk. Thus, it is important to measure risks while capturing their dependence structure. In this short paper, we compute the multivariate risk measures, multivariate tail conditional expectation, and multivariate tail covariance measure for the family of log-elliptical distributions, which captures the dependence structure of the risks while focusing on the tail of their distributions, i.e., on extreme loss events. We then study our result and examine special cases, as well as the optimal portfolio selection using such measures. Finally, we show how the given multivariate tail moments can also be computed for log-skew elliptical models based on similar approaches given for the log-elliptical case.

Recently, various types of single valued neutrosophic (SVN) rough set models were presented based on the same inclusion relation. However, there is another SVN inclusion relation in SVN sets. In this paper, we propose a new type of SVN covering rough set model based on the new inclusion relation. Furthermore, the graph and matrix representations of the new SVN covering approximation operators are presented. Firstly, the notion of SVN β 2 -covering approximation space is proposed, which is decided by the new inclusion relation. Then, a type of SVN covering rough set model under the SVN β 2 -covering approximation space is presented. Moreover, there is a corresponding SVN relation rough set model based on a SVN relation induced by the SVN β 2 -covering, and two conditions under which the SVN β 2 -covering can induce a symmetric SVN relation are presented. Thirdly, the graph and matrix representations of the new SVN covering rough set model are investigated. Finally, we propose a novel method for decision making (DM) problems in paper defect diagnosis under the new SVN covering rough set model.

The research is supported by Ministry of Science, Innovation and Universities (Spain) who finances the research project PGC2018-095765-B-I00 (PROFESTEM)., To the University of Granada for the funding of the bridging grant-contract awarded to David Aguilera to complete his post-doctoral training. Further, to the Ministry of Science, Innovation and Universities for funding project PGC2018-095765-B-I00 (PROFESTEM) and to the Scientific Unit for Excellence in Teacher Training and Professional Development., The emergence of STEM (Science, Technology, Engineering, and Mathematics) in research and the practice of science, technology, engineering, and mathematics education is today an unquestionable fact at international level. Despite the importance attached to STEM education, there is a lack of synthesized approaches to teaching the interdisciplinarity of STEM. This lack of synthesis can hinder a strong theoretical foundation for STEM education and possible new contributions. The purpose of this position paper is to contribute a theoretical framework for STEM education that enables the unification of criteria regarding disciplinary integration and associated teaching methods. The authors discuss disciplinary integration in STEM activities, the implication of STEM literacy, educational stage, and teaching method, and provide suggestions for future research., Ministry of Science, Innovation and Universities (Spain) PGC2018-095765-B-I00

Resident combustion of solid fuel has been widely acknowledged as a high potential for pollutant reduction. However, there is a marked asymmetry between more pollutant emission and less burned volatiles of biomass and coal in the combustion process. To study the solid fuel optimum combustion form in a household stove, both the pollution reduction and energy efficient utilization of crop straws and coals were investigated. Taking the molding pressure and clay addition ratio as variable process conditions, the research of bio-coal briquette (made from the mixture of anthracite and biomass) was implemented in the range of 15~35 MP and 5~15%, respectively. Biomass and coal work complementarily for each other’s combustion property development. In particular, the pyrolysis gas produced by biomass low-temperature devolatilization is featured with low ignition point and is distributed in the bio-coal briquette. Its own combustion provides energy for anthracite particle combustion. Consequently, a positive effect was identified when bio-coal briquettes were used as residential fuel, and further improvement manifested in reducing more than 90% of particle matter (PM) and achieving about twice the thermal efficiencies (TEs) compared with the mass-weighted average values of coal briquettes and biomass briquettes. 88.8 ± 11.8%, 136.7 ± 13.7% and 81.4 ± 17.7% more TEs were provided by wheat straw–coal briquettes, rice straw–coal briquettes and maize straw–coal briquettes. 93.3 ± 3.1% (wheat straw–coal), 97.6 ± 0.2% (rice straw–coal) and 90.4 ± 2.2% (maize straw–coal) in terms of PM2.5 emission factors (EFs) was reduced. For bio-coal briquette, a 25 MPa and 10% addition were determined as the optimum molding pressure and clay addition ratio. Bio-coal briquettes with higher TEs and lower PM EFs will bring about substantial benefits for air quality promotion, human health and energy saving.

Over the past four decades, the prophecy from computer pundits and prognosticators pointed to the looming arrival of the paperless office era. However, forty years later, physical paper documents are still playing a significant role due to the ease of use, superior readability, and availability. The drawbacks of paper sheets are that they are hard to modify and retrieve, have limited space, and are environmentally unfriendly. Augmenting paper documents with digital information from mobile devices extends the two-dimensional space of physical paper documents. Various camera-based recognition and detection devices have been proposed to augment paper documents with digital information. However, there are still some limitations that exist in these systems. This paper presents a novel, low cost, spatially aware, mobile system called Ultrasonic PhoneLens. The Ultrasonic PhoneLens adopts two-dimensional dynamic image presentation and ultrasonic sound positioning techniques. It consists of two ultrasonic sound sensors, one Arduino mini-controller board, and one android mobile device. Based on the location of the mobile device over the physical paper, Ultrasonic PhoneLens can retrieve pre-saved digital information from a mobile database for the object (such as a text, a paragraph, or an image) in a paper document. An empirical study was conducted to evaluate the system performance. The results indicate that our system has a better performance in tasks such as browsing multivalent documents and sharing digital information than the Wiimote PhoneLens system.

Microorganisms such as bacteria, fungi, and microalgae have been used to produce bioflocculants with various structures. These polymers are active substances that are biodegradable, environmentally harmless, and have flocculation characteristics. Most of the developed microbial bioflocculants displayed significant flocculating activity (FA > 70–90%) depending on the strain used and on the operating parameters. These biopolymers have been investigated and successfully used for wastewater depollution in the laboratory. In various cases, selected efficient microbial flocculants could reduce significantly suspended solids (SS), turbidity, chemical oxygen demand (COD), total nitrogen (Nt), dye, and heavy metals, with removal percentages exceeding 90% depending on the bioflocculating materials and on the wastewater characteristics. Moreover, bioflocculants showed acceptable results for sludge conditioning (accepted levels of dry solids, specific resistance to filtration, moisture, etc.) compared to chemicals. This paper explores various bioflocculants produced by numerous microbial strains. Their production procedures and flocculating performance will be included. Furthermore, their efficiency in the depollution of wastewater will be discussed.

We present three types of polyhedral surfaces, which are continuously flexible and have not only an initial pose, where all faces are coplanar, but pass during their self-motion through another pose with coplanar faces (“flat pose”). These surfaces are examples of so-called rigid origami, since we only admit exact flexions, i.e., each face remains rigid during the motion, only the dihedral angles vary. We analyze the geometry behind Miura-ori and address Kokotsakis’ example of a flexible tessellation with the particular case of a cyclic quadrangle. Finally, we recall Bricard’s octahedra of Type 3 and their relation to strophoids.

Fuzzy random option pricing in continuous time (FROPCT) has emerged as an active research field over the past two decades; thus, there is a need for a comprehensive review that provides a broad perspective on the literature and identifies research gaps. In this regard, we conducted a structure review of the literature by using the WoS and SCOPUS databases while following the PRISMA criteria. With this review, we outline the primary research streams, publication outlets, and notable authors in this domain. Furthermore, the literature review revealed a lack of advancements for the equilibrium models of the yield curve. This finding serves as a primary motivation for the second contribution of this paper, which involves an extension of Vasicek’s yield curve equilibrium model. Specifically, we introduce the existence of fuzzy uncertainty in the parameters governing interest rate movements, including the speed of reversion, equilibrium short-term interest rate, and volatility. By incorporating fuzzy uncertainty, we enhance the model’s ability to capture the complexities of real-world interest rate dynamics. Moreover, this paper presents an empirical application of the proposed extension to the term structure of fixed-income public bonds in European Union. The empirical analysis suggests the suitability of the proposed extension of Vasicek’s model for practical applications.

In this paper, we consider parallel-machine scheduling with release times and submodular penalties (P|rj,reject|Cmax+π(R)), in which each job can be accepted and processed on one of m identical parallel machines or rejected, but a penalty must paid if a job is rejected. Each job has a release time and a processing time, and the job can not be processed before its release time. The objective of P|rj,reject|Cmax+π(R) is to minimize the makespan of the accepted jobs plus the penalty of the rejected jobs, where the penalty is determined by a submodular function. This problem generalizes a multiprocessor scheduling problem with rejection, the parallel-machine scheduling with submodular penalties, and the single machine scheduling problem with release dates and submodular rejection penalties. In this paper, inspired by the primal-dual method, we present a combinatorial 2-approximation algorithm to P|rj,reject|Cmax+π(R). This ratio coincides with the best known ratio for the parallel-machine scheduling with submodular penalties and the single machine scheduling problem with release dates and submodular rejection penalties.

Swirling has a significant effect on the main characteristics of flow and can lead to its fundamental restructuring. On the flow axis, a stagnation point with zero velocity is possible, behind which a return flow zone is formed. The apparent instability leads to the formation of secondary vortex motions and can also be the cause of vortex breakdown. In the paper, a swirling flow with a velocity profile of the Batchelor vortex type has been studied on the basis of the linear hydrodynamic stability theory. An effective numerical method for solving the spectral problem has been developed. This method includes the asymptotic solutions at artificial and irregular singular points. The stability of flows was considered for the values of the Reynolds number in the range 10≤Re≤5×106. The calculations were carried out for the value of the azimuthal wavenumber parameter n=−1. As a result of the analysis of the solutions, the existence of up to eight simultaneously occurring unstable modes has been shown. The paper presents a classification of the detected modes. The critical parameters are calculated for each mode. For fixed values of the Reynolds numbers 60≤Re≤5000, the curves of neutral stability are plotted. Branching points of unstable modes are found. The maximum growth rates for each mode are determined. A new viscous instability mode is found. The performed calculations reveal the instability of the Batchelor vortex at large values of the swirl parameter for long-wave disturbances.

LetN be the class of functions that convex in one direction and M denote the class of functions zf′(z), where f∈N. In the paper, the third-order Hankel determinants for these classes are estimated. The estimates of H3,1(f) obtained in the paper are improved.

Non-fungible tokens (NFTs) are individual tokens with valuable information stored inside them over blockchain technology. They can be purchased and sold like other physical and virtual art pieces because their worth is mostly determined by the market and demand. The unique data of NFTs render it simple to verify and authenticate their ownership and transfer of tokens between owners. However, in Pakistan, developers cannot acquire different licences to accomplish their projects not because they cannot afford it, but because they cannot invest in every piece of software to accomplish each new sensitive task. Rather, they can render the product platform independent. Considering this technology, this paper provides IT professionals with a new NFT approach and business policies that solely belong to the information technology domain. In addition, this paper also introduces how NFT tokens can hold software applications. Since we can store files, we can let NFTs also store complete applications to help developers in further utilising virtuality and having the metaverse at their fingertips. Whenever they succeed in a project, they never receive rewards, and their skills only pay the bills. In a nutshell, this paper presents a prototype of NFTs that would be further polished to save and utilise applications in a decentralised manner while rewarding the developers.

It has been a challenge to quantify the credibility of the accelerated storage model until now. This paper introduces a quantitative measurement named the CMADT (Creditability Metric of Accelerated Degradation Test), which quantifies the credibility of the accelerated aging model based on available data. The relevant criterion data are obtained from the natural storage test. CMADT is a credibility metric obtained by measuring the difference in the metric area between the probability distribution of the accelerated storage model and its criterion data. In addition, the accelerated aging model might include multiple parameters resulting in several single-parameter CMADTs. This paper proposes a method that integrates several single-parameter CMADT metrics into a single metric to assess the overall credibility of the accelerated storage model. Moreover, CMADT is universal for different scales of sample data. The cases addressed in this paper show that CMADT helps designers and decision-makers judge the credibility of the result obtained by the accelerated storage model intuitively and makes it easier to compare various products horizontally.

In this paper, bound choices are made after summarizing a finite number of alternatives. This means that each choice is always the barycenter of masses distributed over a finite set of alternatives. More than two marginal goods at a time are not handled. This is because a quadratic metric is used. In our models, two marginal goods give rise to a joint good, so aggregate bound choices are shown. The variability of choice for two marginal goods that are the components of a multiple good is studied. The weak axiom of revealed preference is checked and mean quadratic differences connected with multiple goods are proposed. In this paper, many differences from vast majority of current research about choices and preferences appear. First of all, conditions of certainty are viewed to be as an extreme simplification. In fact, in almost all circumstances, and at all times, we all find ourselves in a state of uncertainty. Secondly, the two notions, probability and utility, on which the correct criterion of decision-making depends, are treated inside linear spaces over R having a different dimension in accordance with the pure subjectivistic point of view.

Consider the n-dimensional projective space PG(n,q) over a finite field with q elements. A spread in PG(n,q) is a set of lines which partition the point set. A parallelism is a partition of the set of lines by spreads. A deficiency one parallelism is a partial parallelism with one spread less than the parallelism. A transitive deficiency one parallelism corresponds to a parallelism possessing an automorphism group which fixes one spread and is transitive on the remaining spreads. Such parallelisms have been considered in many papers. As a result, an infinite family of transitive deficiency one parallelisms of PG(n,q) has been constructed for odd q, and it has been proved that the deficiency spread of a transitive deficiency one parallelism must be regular, and its automorphism group should contain an elation subgroup of order q2. In the present paper we construct parallelisms of PG(3,7) invariant under an elation group of order 49 with some additional properties, and thus we succeed to obtain all (46) transitive deficiency one parallelisms of PG(3,7). The three parallelisms from the known infinite family are among them. As a by-product, we also construct a much bigger number (55,022) of parallelisms which have the same spread structure, but are not transitive deficiency one.

Power flow analysis is critical for power systems due to the development of multiple energy supplies. For safety, stability, and real-time response in grid operation, grid planning, and analysis of power systems, it requires designing high-performance computing methods, accelerating power flow calculation, obtaining the voltage magnitude and phase angle of buses inside the power system, and coping with the increasingly complex large-scale power system. This paper provides an overview of the available parallel methods to fix the issues. Specifically, these methods can be classified into three categories from a hardware perspective: multi-cores, hybrid CPU-GPU architecture, and FPGA. In addition, from the perspective of numerical computation, the power flow algorithm is generally classified into iterative and direct methods. This review paper introduces models of power flow and hardware computing architectures and then compares their performance in parallel power flow calculations depending on parallel numerical methods on different computing platforms. Furthermore, this paper analyzes the challenges and pros and cons of these methods and provides guidance on how to exploit the parallelism of future power flow applications.

Subdivision schemes are equipped with some rules that take a polygon as an input and produce smooth curves or surfaces as an output. This presents the issue of how accurately the polygon approximates the limit curve and surface. What number of iterations/levels would be necessary to achieve the required shape at a user-specified error tolerance? In fact, several methods have been introduced in the case of stationary schemes to address the issue in terms of the error bounds (distance between polygon/polyhedron and limiting shape) and subdivision depth (the number of iterations required to obtain the result at a user-specified error tolerance). However, in the case of non-stationary schemes, this topic needs to be further studied to meet the requirements of new practical applications. This paper highlights a new approach based on a convolution technique to estimate error bounds and subdivision depth for non-stationary schemes. The given technique is independent of any condition on the coefficient of the non-stationary subdivision schemes, and it also produces the best results with the least amount of computational effort. In this paper, we first associated constants with the vectors generated by the given non-stationary schemes, then formulated an expression for the convolution product. This expression gives real values, which monotonically decrease with the increase in the order of the convolution in both the curve and surface cases. This convolution feature plays an important role in obtaining the user-defined error tolerance with fewer iterations. It achieves a trade-off between the number of iterations and user-specified errors. In practice, more iterations are needed to achieve a lower error rate, but we achieved this goal by using fewer iterations.

This paper discusses high-baryon-density quarkyonic matter in the context of recent observations concerning neutron stars and the qualitative reasons why quarkyonic matter explains certain features of the equation of state that arises from these observations. The paper then provides a qualitative discussion of the quarkyonic hypotheses, and the essential features of quarkyonic matter that explain the outstanding features of the equation of state.

In this paper, operating room planning and scheduling problems have been studied. In operating room planning, the allocation of patients to operating rooms and their sequencing are critical in determining the performance of operating rooms. In this paper, three surgery scheduling decisions are considered, including the number of operating rooms to open, the allocation of surgeries to operating rooms, and the sequencing of surgeries in allocated operating rooms. All the surgeries under consideration are elective, and surgery durations are considered deterministic. Further, it is considered that the surgeries have different specialties, and each operating room can accommodate a particular specialty of surgeries, i.e., heterogeneous operating rooms are considered in the current study. Before performing a surgery, setup time is required for operating room turnover and sterilization, and it is considered sequence dependent. A mixed integer nonlinear programming (MINLP) model is developed to minimize the overtime costs of operating rooms for allocation and surgery sequencing with sequence dependent setup times. An outer approximation (OA) method is proposed to solve the problem near optimally. Experiments are conducted to compare the performance of the proposed OA method with the standard mixed integer nonlinear programming model. Computational results show the efficiency of the proposed OA method. Later, a case data from a case hospital is collected and a case study is solved.

This paper deals with p-location problem solving processes based on a decomposition, which separates the creation of a uniformly deployed set of p-location problems from the solution of the p-location problem for that specific instance. The research presented in this paper is focused on methods of construction of uniformly deployed sets of solutions and the examination of their impact on the efficiency of subsequent optimization algorithms. The approaches to the construction are used for the constitution of predetermined families of uniformly deployed sets of p-location problem solutions, which have standard sizes. We introduce two methods of uniformly deployed set construction: the first one is based on composition, followed by an enlargement process; and the second one makes use of voltage graphs. The construction approaches are completed by an algorithm, which adjusts the set of solutions to the sizes of a solved instance. The influence of a set construction approach on solving process efficiency is studied on real-world benchmarks, which include both the p-median objective function and the generalized disutility function. The solving process is performed alternatively using the swap or path-relinking based methods. Results of the computational study obtained by all combinations of the mentioned approaches are presented and evaluated in the concluding part of the paper to make the studied characteristics visible.

This study aims to understand the development trends and research structure of articles on artificial intelligence (AI) and information processing in the past 10 years. In particular, this study analyzed 13,294 papers published from 2012 to 2021 in the Web of Science, used the bibliometric analysis method to visualize the data of the papers, and drew a scientific knowledge map. By exploring the development of mainstream journals, author and country rankings, keyword evolution, and research field rankings in the past 10 years, this study uncovered key trends affecting AI progress and information processing that provide insights and serve as an important reference for future AI research and information processing. The results revealed a gradual increase in publications over the past decade, with explosive growth after 2020. The most prolific researchers in this field were Xu, Z.S.; Pedrycz, W.; Herrera-Viedma, E.; the major contributing countries were China, the USA, and Spain. In the AI and information processing research, keywords including “Deep learning”, “Machine learning”, and “Feature extraction” are components that play a crucial role. Additionally, the most representative research areas were “Engineering”, “Operations Research and Management Science”, and “Automation Control Systems”. Overall, this study used bibliometric analysis to provide an overview of the latest trends in artificial intelligence and information processing. Although AI and information processing have been applied to various research areas, many other sub-topics can be further applied. Based on the findings, this study presented research insights and proposed suggestions for future research directions on AI and information processing.

In special relativity, the time dilation formula has been obtained by particles propagation in a straight line trajectory relative to an observer in motion. Up to now, there are no available formulas for other possible trajectories of particles. However, this paper obtains formulas of time dilation for several trajectories of particle such as parabolic, elliptic, and circular and finds a relatively accurate trajectory. The obtained formulas are employed in order to analyze the time dilation of the muon particles decay. In this paper, it is found that the time dilation of the parabolic and the elliptical trajectories exceed the corresponding results utilizing the standard Lorentz-Einstein time dilation formula. Consequently, if we are able to control the trajectory of unstable particles by some external forces, then their life-times might be increased. Probably, the increase in lifetime via a curved trajectory occurs at lower relative velocity & acceleration energy if compared to the straight line trajectory. In addition, the circular trajectory leads to multiple values of time dilation at certain velocities of an observer in motion, which may give an interpretation of fluctuations of time dilation in quantum mechanics. The result arises from the present relatively accurate formula of time dilation that is very close to the experimental data of muon decay (CERN experiment) when it is compared to the result obtained by the Lorentz-Einstein formula. Finally, it may be concluded that the time dilation not only depends on relative velocity and acceleration energy of particles but also on curved trajectories. The present work may attract other researchers to study different trajectories.

The assignment of tasks for unmanned aerial vehicles (UAVs) during forest fire reconnaissance is a highly complex and large-scale problem. Current task allocation methods struggle to strike a balance between solution speed and effectiveness. In this paper, a two-phase centralized UAV task assignment model based on expectation maximization (EM) clustering and the multidimensional knapsack model (MKP) is proposed for the forest fire reconnaissance task assignment. The fire situation information is acquired using the sensors carried by satellites at first. Then, the EM algorithm based on the Gaussian mixture model (GMM) is applied to get the initial position of every UAV. In the end, the MKP is applied for UAV task assignment based on the initial positions of the UAVs. An improved genetic algorithm (GA) based on the fireworks algorithm (FWA) is proposed for faster iteration speed. A simulation was carried out against the background of forest fires in Liangshan Prefecture, Sichuan Province, and the simulation’s results demonstrate that the task assignment model can quickly and effectively address task allocation problems on a large scale. In addition, the FW–GA hybrid algorithm has great advantages over the traditional GA, particularly in solving time, iteration convergence speed, and solution effectiveness. It can reduce up to 556% of the iteration time and increase objective function value by 1.7% compared to the standard GA. Furthermore, compared to the GA–SA algorithm, its solving time is up to 60 times lower. This paper provides a new idea for future large-scale UAV task assignment problems.

The class of H-matrices, also known as Generalized Diagonally Dominant (GDD) matrices, plays an important role in many areas of applied linear algebra, as well as in a wide range of applications, such as in dynamical analysis of complex networks that arise in ecology, epidemiology, infectology, neurology, engineering, economy, opinion dynamics, and many other fields. To conclude that the particular dynamical system is (locally) stable, it is sufficient to prove that the corresponding (Jacobian) matrix is an H-matrix with negative diagonal entries. In practice, however, it is very difficult to determine whether a matrix is a non-singular H-matrix or not, so it is valuable to investigate subclasses of H-matrices which are defined by relatively simple and practical criteria. Many subclasses of H-matrices have recently been discussed in detail demonstrating the many benefits they can provide, though one particular subclass has not been fully exploited until now. The aim of this paper is to attract attention to this class and discuss its relation with other more investigated classes, while showing its main advantage, based on its simplicity and elegance. This new approach, which we are presenting in this paper, will be compared with the existing ones, in three possible areas of applications, spectrum localization; maximum norm estimation of the inverse matrix in the point, as well as the block case; and error estimation for LCP problems. The main conclusion is that the importance of our approach grows with the matrix dimension.

Collaborative problem-solving is a crucial skill to be developed in education. With the development of information technology, collaborative problem-solving in online environments has received increasing attention in recent years. There has been some foundation of research on computer-supported collaborative learning (CSCL) and collaborative problem-solving (CPS). They both have a focus, but there is a trend to combine them. Further understanding of the current state of research on online collaborative problem-solving is much needed. This study reviews 528 relevant papers from the last decade. The researchers summarized the current state of research and hotspots in online collaborative problem-solving based on the visual analysis of CiteSpace. It was found that the number of papers on online collaborative problem-solving is on the rise, with CPS and CSCL as the main research content and ‘feature extraction’, ‘task analysis’, and ‘computation modeling’ as the hot research topics in the past three years. The current research power on CPS and CSCL is mainly distributed in China and the United States, but the inter-institutional collaboration is little. Based on the research results, this paper proposes four future directions to improve the research in online collaborative problem-solving: identity awareness in online collaborative problem-solving, interdisciplinary online collaborative problem-solving, online collaborative problem-solving for teachers, and online collaborative problem-solving and ICT skills.

This paper studies the numerical algorithm of stochastic control problems in investment optimization. Investors choose the optimal investment to maximize the expected return under uncertainty. The optimality condition, the Hamilton–Jacobi–Bellman (HJB) equation, satisfied by the value function and obtained by the dynamic programming method, is a partial differential equation coupled with optimization. One of the major computational difficulties is the irregular boundary conditions presented in the HJB equation. In this paper, two mesh-free algorithms are proposed to solve two different cases of HJB equations with regular and irregular boundary conditions. The model of optimal investment under uncertainty developed by Abel is used to study the efficacy of the proposed algorithms. Extensive numerical studies are conducted to test the impact of the key parameters on the numerical efficacy. By comparing the numerical solution with the exact solution, the proposed numerical algorithms are validated.

In this paper, we propose methods for analyzing the synchronization stability of stochastic linearly coupled differential equation systems, with signal-dependent noise perturbation. We consider signal-dependent noise, which is common in many fields, to discuss the stability of the synchronization manifold of multiagent systems and linearly coupled nonlinear dynamical systems under sufficient conditions. Numerical simulations are performed in the paper, and the results show the effectiveness of our theorems.

Aimed at the difficulty of path planning resulting from the variable configuration of the wheel-legged robot for future deep space explorations, this paper proposes a path planning algorithm based on the Theta* algorithm and Timed Elastic Band (TEB) algorithm. Firstly, the structure of the wheel-legged robot is briefly introduced, and the workspace of a single leg is analyzed. Secondly, a method to judge complete obstacles and incomplete obstacles according to the height of the obstacles is proposed alongside a method to search for virtual obstacles, to generate a grid map of the wheel and a grid map of the body, respectively. By dividing obstacles into complete obstacles and incomplete obstacles, the path planning of the wheel-legged robot is split into the planning of the body path and the planning of the wheel path. The body can be still simplified as a point by searching for the virtual obstacle, which avoids the difficulty of a planning path of a variable shape. Then, we proposed hierarchical planning and multiple optimization algorithms for the body path and wheel path based on the Theta* algorithm and TEB algorithm. The path can be optimized and smoothed effectively to obtain a shorter length and higher safety. On that basis, the proposed algorithm is simulated by Matlab. The results of simulations show that the algorithm proposed in this paper can effectively plan the path of the wheel-legged robot by using variable configurations for different types of obstacles. The path-planning algorithm of the wheel-legged robot proposed in this paper has a broad prospect for deep space exploration.

Substitution boxes are the key factor in symmetric-key cryptosystems that determines their ability to resist various cryptanalytic attacks. Creating strong substitution boxes that have multiple strong cryptographic properties at the same time is a challenging task for cryptographers. A significant amount of research has been conducted on S-boxes in the past few decades, but the resulting S-boxes have been found to be vulnerable to various cyberattacks. This paper proposes a new method for creating robust S-boxes that exhibit superior performance and possess high scores in multiple cryptographic properties. The hybrid S-box method presented in this paper is based on Chua’s circuit chaotic map, two-dimensional cellular automata, and an algebraic permutation group structure. The proposed 16×16 S-box has an excellent performance in terms of security parameters, including a minimum nonlinearity of 102, the absence of fixed points, the satisfaction of bit independence and strict avalanche criteria, a low differential uniformity of 5, a low linear approximation probability of 0.0603, and an auto-correlation function of 28. The analysis of the performance comparison indicates that the proposed S-box outperforms other state-of-the-art S-box techniques in several aspects. It possesses better attributes, such as a higher degree of inherent security and resilience, which make it more secure and less vulnerable to potential attacks.

In 2006, together with D. Butnariu, we showed that if all iterates of a nonexpansive self-mapping of a complete metric space converge, then all its inexact iterates with summable computational errors converge too. In a recent paper of ours, we have extended this result to uniformly locally nonexpansive self-mappings of a complete metric space. In the present paper, we establish analogous results for uniformly locally nonexpansive mappings which take a nonempty closed subset of a complete metric space into the space. In the particular case of a Banach space, if the operator is symmetric, then the set of all limit points of its iterates is also symmetric.

This paper aims to solve the asymmetric problem of sample classification recognition in extreme class imbalance. Inspired by Krawczyk (2016)’s improvement direction of extreme sample imbalance classification, this paper adopts the AdaBoost model framework to optimize the sample weight update function in each iteration. This weight update not only takes into account the sampling weights of misclassified samples, but also pays more attention to the classification effect of misclassified minority sample classes. Thus, it makes the model more adaptable to imbalanced sample class distribution and the situation of extreme imbalance and make the weight adjustment in hard classification samples more adaptive as well as to generate a symmetry between the minority and majority samples in the imbalanced datasets by adjusting class distribution of the datasets. Based on this, the imbalance boosting model, the Imbalance AdaBoost (ImAdaBoost) model is constructed. In the experimental design stage, ImAdaBoost model is compared with the original model and the mainstream imbalance classification model based on imbalanced datasets with different ratio, including extreme imbalanced dataset. The results show that the ImAdaBoost model has good minority class recognition recall ability in the weakly extreme and general class imbalance sets. In addition, the average recall rate of minority class of the mainstream imbalance classification models is 7% lower than that of ImAdaBoost model in the weakly extreme imbalance set. The ImAdaBoost model ensures that the recall rate of the minority class is at the middle level of the comparison model, and the F1-score comprehensive index performs well, demonstrating the strong stability of the minority class classification in extreme imbalanced dataset.

Simpson’s rule is a numerical method used for approximating the definite integral of a function. In this paper, by utilizing mappings whose second derivatives are bounded, we acquire the upper and lower bounds for the Simpson-type inequalities by means of Riemann–Liouville fractional integral operators. We also study special cases of our main results. Furthermore, we give some examples with graphs to illustrate the main results. This study on fractional Simpson’s inequalities is the first paper in the literature as a method.

The Rafflesia Optimization Algorithm (ROA) is a new swarm intelligence optimization algorithm inspired by Rafflesia’s biological laws. It has the advantages of high efficiency and fast convergence speed, and it effectively avoids falling into local optimum. It has been used in logistics distribution center location problems, and its superiority has been demonstrated. It is applied to solve the problem of continuity, but there are many binary problems to be solved in the actual situation. Thus, we designed a binary version of ROA. We used transfer functions to change continuous values into binary values, and binary values are used to symmetrically represent the meaning of physical problems. In this paper, four transfer functions are implemented to binarize ROA so as to improve the original transfer function for the overall performance of the algorithm. In addition, on the basis of the algorithm, we further improve the algorithm by adopting a parallel strategy, which improves the convergence speed and global exploration ability of the algorithm. The algorithm is verified on 23 benchmark functions, and the parallel binary ROA has a better performance than some other existing algorithms. In the aspect of the application, this paper adopts the datasets on UCI for feature selection. The improved algorithm has higher accuracy and selects fewer features.

Accurate sky identification is one of the most important functions of an automated telescope mount. The more accurately the robotic telescope is navigated to the investigated part of the sky, the better the observations and discoveries made. In this paper, we present mathematical methods for accurate sky identification (celestial coordinates determination). They include the automatic selection of the reference stars, preliminary and full sky identification, as well as an interaction with international databases, which are a part of the astrometric calibration. All described methods help to receive accurately calculated astrometric data and use it for the positional calibration and better navigation of the automated telescope mount. The developed methods were successfully implemented in the Collection Light Technology (CoLiTec) software. Through its use, more than 1600 small solar system objects were discovered. It has been used in more than 700,000 observations and successful sky identifications, during which, five comets were discovered. Additionally, the accuracy indicators of the processing results of the CoLiTec software are provided in the paper, which shows benefits of the CoLiTec software and lower standard deviation of the sky identification in the case of low signal-to-noise ratios.

The ongoing research in the field of decision-making can be analyzed from different perspectives. Research trends indicate that multi-attribute decision-making (MADM) methods have a significant impact on engineering and management scientific areas. Since many of the problems existing in the mentioned areas are associated with a certain level of uncertainty, type 2 fuzzy sets represent a common solution for the enhancement of conventional MADM methods. In this way, the decision-makers are encouraged to use linguistic expressions for the assessment of attributes’ relative importance and their values. The purpose of this paper is to review a determination of attributes’ relative importance, and their values, as well as the extension of ranking methods with type 2 fuzzy sets. The papers are systematically adjoined to groups consisting of hybrid models with the following characteristics: (1) indicating the procedure for modeling attribute relative importance and their values, (2) determining the extension of MADM methods with type 2 fuzzy sets to determine attributes’ vector weights, and (3) the extension of MADM for attributes ranking with type 2 fuzzy sets. This study reviewed a total of 42 papers in the domain of engineering and management published from 2013 to 2023 in different journals indexed by the Springer, Science Direct, Emerald, Wiley, ProQuest, Taylor, and Francis research platforms.

In this paper, we consider the adjacent vertex distinguishing proper edge coloring (for short, AVDPEC) and the adjacent vertex distinguishing total coloring (for short, AVDTC) of a fuzzy graph. Firstly, this paper describes the development process, the application areas, and the existing review research of fuzzy graphs and adjacent vertex distinguishing coloring of crisp graphs. Secondly, we briefly introduce the coloring theory of crisp graphs and the related theoretical basis of fuzzy graphs, and add some new classes of fuzzy graphs. Then, based on the α-cuts of fuzzy graphs and distance functions, we give two definitions of the AVDPEC of fuzzy graphs, respectively. A lower bound on the chromatic number of the AVDPEC of a fuzzy graph is obtained. With examples, we show that some results of the AVDPEC of a crisp graph do not carry over to our set up; the adjacent vertex distinguishing chromatic number of the fuzzy graph is different from the general chromatic number of a fuzzy graph. We also give a simple algorithm to construct a (d,f)-extended AVDPEC for fuzzy graphs. After that, in a similar way, two definitions of the AVDTC of fuzzy graphs are discussed. Finally, the future research directions of distinguishing coloring of fuzzy graphs are given.

Environmental sound classification (ESC) tasks are attracting more and more attention. Due to the complexity of the scene and personnel mobility, there are some difficulties in understanding and generating environmental sound models for ESC tasks. To address these key issues, this paper proposes an audio classification framework based on L-mHP features and the SE-ResNet50 model and improves a dual-channel data enhancement scheme based on a symmetric structure for model training. Firstly, this paper proposes the L-mHP feature to characterize environmental sound. The L-mHP feature is a three-channel feature consisting of a Log-Mel spectrogram, a harmonic spectrogram, and a percussive spectrogram. The harmonic spectrogram and percussive spectrogram can be obtained by harmonic percussive source separation (HPSS) of a Log-Mel spectrogram. Then, an improved audio classification model SE-ResNet50 is proposed based on the ResNet-50 model. In this paper, a dual-channel data enhancement scheme based on a symmetric structure is promoted, which not only makes the audio variants more diversified, but also makes the model focus on learning the time–frequency mode in the acoustic features during the training process, so as to improve the generalization performance of the model. Finally, the audio classification experiment of the framework is carried out on public datasets. An experimental accuracy of 94.92%, 99.67%, and 90.75% was obtained on ESC-50, ESC-10 and UrbanSound8K datasest, respectively. In order to simulate the classification performance of the framework in the actual environment, the framework was also evaluated on a self-made sound dataset with different signal-to-noise ratios. The experimental results show that the proposed audio classification framework has good robustness and feasibility.

Using higher order delta derivatives on time scales, we demonstrated a few dynamic inequalities of the Opial type in this paper. Our findings expanded upon and generalised earlier findings in the literature. Furthermore, we give the discrete and continuous inequalities as special cases. At the end of this paper, we apply our results to study the behaviour of the solution of an initial value problem. In selecting the best ways to solve dynamic inequalities, symmetry is crucial.

There is a significant and supported trend toward the achievement of ensuring continuous door-to-door travel in the pan-European transport network. Many innovative programs are dedicated to this topic through assigned projects. This paper is based on the concrete partial results of the H2020 project Shift2Rail IP4 to support the deployment of mobility as a service (IP4MaaS). Attitudes towards travel for demonstration sites were assessed based on the outputs of a sample of respondents from two countries. Cooperation in working on the IP4MaaS project was also provided by a partner from Slovakia (UNIZA) and the Czech Republic (OLTIS). Mathematical statistical tools were used to evaluate the available data to find a connection with promoting mobility as a service. This paper aims to identify differences in travelers’ needs with a focus on using applications using two-step cluster analysis. The research resulted in the identification of differences in traffic behavior within MaaS activities when comparing different clusters reflecting preferences for using a website or mobile application.