Search

This paper focuses on the pricing problem of binary options under stochastic interest rates, stochastic volatility, and a mixed exponential jump diffusion model. Considering the negative interest rates in the market in recent years, this paper assumes that the stochastic interest rate follows the Hull–White (HW) model. In addition, we assume that the stochastic volatility follows the Heston volatility model, and the price of the underlying asset follows the jump diffusion model in which the jumps follow the mixed exponential jump model. Considering these factors comprehensively, the mixed exponential jump diffusion of the Heston–HW (abbreviated as MEJ-Heston–HW) model is established. Using the idea of measure transformation, the pricing formula of binary call options is derived by the martingale method, eigenfunction, and Fourier transform. Finally, the effects of the volatility term and the parameters of the mixed-exponential jump diffusion model on the option price in the O-U process are analyzed. In the numerical simulation, compared with the double exponential jump Heston–HW (abbreviated as DEJ-Heston–HW) model and the Heston–HW model, the mixed exponential jump model is an extension of the double exponential jump model, which can approximate any distribution in the sense of weak convergence, including arbitrary discrete distributions, normal distributions, and various thick-tailed distributions. Therefore, the MEJ-Heston–HW model adopted in this paper can better describe the price of the underlying asset. [ABSTRACT FROM AUTHOR]

Modeling of various phenomena in engineering work is always a kind of simplification of real processes, aiming at a model where a certain level of mathematical theory and computational procedures is sufficient. If the complexity of the required theory corresponds to the general mathematical competence of engineers, then technical problems can be treated separately in engineering (or physical) models without regard to the mathematical background. However, in some advanced engineering fields, the harmonized development of engineering and mathematical models and toolboxes is necessary to find efficient solutions. For example, modeling variable structure systems in ideal sliding mode requires a mathematical toolbox that goes far beyond general engineering competence through the theory of discontinuous right-hand-side differential equations. Although sliding mode control is popular in practice and the concept of sliding mode allows a significant reduction of model complexity, its exact mathematical description is rarely encountered. The problem of friction compensation of a micro-telemanipulator using sliding mode control demonstrates a harmonized application of the mathematical and engineering approaches. Based on Filippov's theory, the ideal sliding mode can be discussed. Although an ideal system cannot be implemented in reality, the real systems can be kept close enough to it; therefore, the discussion of the solution of the ideal model is important for practical applications. Although several elements of the topic are available in the literature, in this paper a unique complex approach is given for users of sliding mode control with experimental considerations, different engineering models, and codes. The paper concludes that sliding mode control is a case where engineering and mathematical modeling are inseparable and requires the competence of both fields. [ABSTRACT FROM AUTHOR]

Production rescheduling involves re-optimizing production schedules in response to disruptions that render the initial schedule inefficient or unfeasible. This process requires simultaneous consideration of multiple objectives to develop new schedules that are both efficient and stable. However, existing review papers have paid limited attention to the multi-objective optimization techniques employed in this context. To address this gap, this paper presents a systematic literature review on multi-objective production rescheduling, examining diverse shop-floor environments. Adhering to the PRISMA guidelines, a total of 291 papers were identified. From this pool, studies meeting the inclusion criteria were selected and analyzed to provide a comprehensive overview of the problems tackled, dynamic events managed, objectives considered, and optimization approaches discussed in the literature. This review highlights the primary multi-objective optimization methods used in relation to rescheduling strategies and the dynamic disruptive events studied. Findings reveal a growing interest in this research area, with "a priori" and "a posteriori" optimization methods being the most commonly implemented and a notable rise in the use of the latter. Hybridized algorithms have shown superior performance compared to standalone algorithms by leveraging combined strengths and mitigating individual weaknesses. Additionally, "interactive" and "Pareto pruning" methods, as well as the consideration of human factors in flexible production systems, remain under-explored. [ABSTRACT FROM AUTHOR]

Dynamic simulation is widely applied in the real-time and realistic physical simulation field. How to achieve natural dynamic simulation results in real-time with small data sizes is an important and long-standing topic. In this paper, we propose a dynamic reconstruction and interpolation method grounded in physical principles for simulating dynamic deformations. This method replaces the deformation forces of the widely used eXtended Position-Based Dynamics (XPBD), which are traditionally derived from the gradient of the energy potential defined by the constraint function, with the elastic beam bending forces to more accurately represent the underlying deformation physics. By doing so, it establishes a mathematical model based on dynamic partial differential equations (PDE) for reconstruction, which are the differential equations involving both the parametric variable u and the time variable t. This model also considers the inertia forces caused by acceleration. The analytical solution to this model is then integrated with the XPBD framework, built upon Newton's equations of motion. This integration reduces the number of design variables and data sizes, enhances simulation efficiency, achieves good reconstruction accuracy, and makes deformation simulation more capable. The experiment carried out in this paper demonstrates that deformed shapes at about half of the keyframes simulated by XPBD can be reconstructed by the proposed PDE-based dynamic reconstruction algorithm quickly and accurately with a compact and analytical representation, which outperforms static B-spline-based representation and interpolation, greatly shortens the XPBD simulation time, and represents deformed shapes with much smaller data sizes while maintaining good accuracy. Furthermore, the proposed PDE-based dynamic reconstruction algorithm can generate continuous deformation shapes, which cannot be generated by XPBD, to raise the capacity of deformation simulation. [ABSTRACT FROM AUTHOR]

In September 2024, the Fashion-MNIST dataset will be 7 years old. Proposed as a replacement for the well-known MNIST dataset, it continues to be used to evaluate machine learning model architectures. This paper describes new results achieved with the Fashion-MNIST dataset using classical machine learning models and a relatively simple convolutional network. We present the state-of-the-art results obtained using the CNN-3-128 convolutional network and data augmentation. The developed CNN-3-128 model containing three convolutional layers achieved an accuracy of 99.65% in the Fashion-MNIST test image set. In addition, this paper presents the results of computational experiments demonstrating the dependence between the number of adjustable parameters of the convolutional network and the maximum acceptable classification quality, which allows us to optimise the computational cost of model training. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the relationships among point transitivity, topological transitivity, Li–Yorke chaos, and the existence of irregular vectors for a linear semiflow { T t } t ∈ Δ indexed with a complex sector. We reveal the equivalence between topological transitivity and point transitivity for a linear semiflow { T t } t ∈ Δ , especially in case the range of some operator T t , t ∈ Δ is not dense. We also prove that Li–Yorke chaos is equivalent to the existence of a semi-irregular vector and that point transitivity is stronger than the existence of an irregular vector for any linear semiflow T t t ∈ Δ . At last, unlike the conclusion for traditional linear dynamical systems, we show that there exists a Li–Yorke chaotic C 0 -semigroup T t t ∈ Δ without irregular vectors. The results and proof methods presented in this paper demonstrate the differences in the dynamical behavior between linear semiflows { T t } t ∈ Δ and traditional linear systems with the acting semigroup S = Z + and S = R + . [ABSTRACT FROM AUTHOR]

Driver distraction detection not only effectively prevents traffic accidents but also promotes the development of intelligent transportation systems. In recent years, thanks to the powerful feature learning capabilities of deep learning algorithms, driver distraction detection methods based on deep learning have increased significantly. However, for resource-constrained onboard devices, real-time lightweight models are crucial. Most existing methods tend to focus solely on lightweight model design, neglecting the loss in detection performance for small targets. To achieve a balance between detection accuracy and network lightweighting, this paper proposes a driver distraction detection method that combines enhancement and global saliency optimization. The method mainly consists of three modules: context fusion enhancement module (CFEM), channel optimization feedback module (COFM), and channel saliency distillation module (CSDM). In the CFEM module, one-dimensional convolution is used to capture information between distant pixels, and an injection mechanism is adopted to further integrate high-level semantic information with low-level detail information, enhancing feature fusion capabilities. The COFM module incorporates a feedback mechanism to consider the impact of inter-layer and intra-layer channel relationships on model compression performance, achieving joint pruning of global channels. The CSDM module guides the student network to learn the salient feature information from the teacher network, effectively balancing the model's real-time performance and accuracy. Experimental results show that this method outperforms the state-of-the-art methods in driver distraction detection tasks, demonstrating good performance and potential application prospects. [ABSTRACT FROM AUTHOR]

The topological Dehn twists have several applications in mathematical sciences as well as in physical sciences. The interplay between homotopy theory and Dehn twists exposes a rich set of properties. This paper generalizes the Dehn twists by proposing the notion of pre-twisted space, orientations of twists and the formation of pointed based space under a homeomorphic continuous function. It is shown that the Dehn twisted homotopy under non-retraction admits a left lifting property (LLP) through the local homeomorphism. The LLP extends the principles of Hurewicz fibration by avoiding pullback. Moreover, this paper illustrates that the Dehn twisted homotopy up to a base point in a based space can be formed by considering retraction. As a result, two disjoint continuous functions become point-wise continuous at the base point under retracted homotopy twists. Interestingly, the oriented Dehn twists of a pre-twisted space under homotopy retraction mutually commute in a contractible space. [ABSTRACT FROM AUTHOR]

Convolutional neural networks (CNNs) offer unrivaled performance in profiling side-channel analysis. This claim is corroborated by numerous results where CNNs break targets protected with masking and hiding countermeasures. One hiding countermeasure commonly investigated in related works is desynchronization (misalignment). The conclusions usually state that CNNs can break desynchronization as they are shift-invariant. This paper investigates that claim in more detail and reveals that the situation is more complex. While CNNs have certain shift-invariance, it is insufficient for commonly encountered scenarios in deep learning-based side-channel analysis. We investigate data augmentation to improve the shift-invariance and, in a more powerful version, ensembles of data augmentation. Our results show that the proposed techniques work very well and improve the attack significantly, even for an order of magnitude. [ABSTRACT FROM AUTHOR]

In this paper, we study the asymptotic properties of slowly varying functions of one real variable in the sense of Karamata. We establish analogs of fundamental theorems on uniform convergence and integral representation for slowly varying functions with a remainder depending on the types of remainder. We also prove several important theorems on the asymptotic representation of integrals of Karamata functions. Under certain conditions, we observe a "narrowing" of classes of slowly varying functions concerning the types of remainder. At the end of the paper, we discuss the possibilities of the application of slowly varying functions in the theory of stochastic branching systems. In particular, under the condition of the finiteness of the moment of the type E x ln x for the particle transformation intensity, it is established that the property of slow variation with a remainder is implicitly present in the asymptotic structure of a non-critical Markov branching random system. [ABSTRACT FROM AUTHOR]

Market competitiveness drives the electric motors industry, which in turn necessitates the selection of optimal production scenarios, particularly in the context of packaging. This is crucial for maintaining competitiveness and meeting the rigorous quality and logistical demands that are characteristic of this industry. This paper presents a systematic analysis of the packaging production chain for electric motors, employing the SAPEVO-M method as a decision aid tool. The study examines various strategic options, including outsourcing and internalizing processes, with a particular focus on their impacts on logistics, quality control, and overall supply-chain efficiency. The research conducts a comprehensive evaluation of these strategies to ascertain the most effective approach for managing the complexities of packaging production. The SAPEVO-M method facilitated a structured decision-making process, allowing for the aggregation and prioritization of diverse criteria such as cost, quality, flexibility, environmental impact, and supply risk. A sensitivity analysis was performed to validate the robustness of the decision-making outcomes under varying alternatives. The findings highlight the benefits of internalizing certain processes, particularly the assembly (with a score of 43.27%), to gain direct control over production variables, leading to enhanced operational efficiency and product competitiveness. This paper contributes to the literature by demonstrating the application of MCDA in enhancing strategic decisions within the electric motors industry, providing insights for analyzing other manufacturing factors in the improvement of supply-chain processes. [ABSTRACT FROM AUTHOR]

In the present paper, we introduce the concept of idempotent-aided factorization (I.-A. factorization) of a regular element of a semigroup, which can be understood as a semigroup-theoretical extension of full-rank factorization of matrices over a field. I.-A. factorization of a regular element d is defined by means of an idempotent e from its Green's D -class as decomposition into the product d = u v , so that the element u belongs to the Green's R -class of the element d and the Green's L -class of the idempotent e, while the element v belongs to the Green's L -class of the element d and the Green's R -class of the idempotent e. The main result of the paper is a theorem which states that each regular element of a semigroup possesses an I.-A. factorization with respect to each idempotent from its Green's D -class. In addition, we prove that when one of the factors is given, then the other factor is uniquely determined. I.-A. factorizations are then used to provide new existence conditions and characterizations of group inverses and (b , c) -inverses in a semigroup. In our further research, these factorizations will be applied to matrices with entries in a field, and efficient algorithms for realization of such factorizations will be provided. [ABSTRACT FROM AUTHOR]

This study leverages explainable artificial intelligence (XAI) techniques to analyze public sentiment towards Environmental, Social, and Governance (ESG) factors, climate change, and green finance. It does so by developing a novel multi-task learning framework combining aspect-based sentiment analysis, co-reference resolution, and contrastive learning to extract nuanced insights from a large corpus of social media data. Our approach integrates state-of-the-art models, including the SenticNet API, for sentiment analysis and implements multiple XAI methods such as LIME, SHAP, and Permutation Importance to enhance interpretability. Results reveal predominantly positive sentiment towards environmental topics, with notable variations across ESG categories. The contrastive learning visualization demonstrates clear sentiment clustering while highlighting areas of uncertainty. This research contributes to the field by providing an interpretable, trustworthy AI system for ESG sentiment analysis, offering valuable insights for policymakers and business stakeholders navigating the complex landscape of sustainable finance and climate action. The methodology proposed in this paper advances the current state of AI in ESG and green finance in several ways. By combining aspect-based sentiment analysis, co-reference resolution, and contrastive learning, our approach provides a more comprehensive understanding of public sentiment towards ESG factors than traditional methods. The integration of multiple XAI techniques (LIME, SHAP, and Permutation Importance) offers a transparent view of the subtlety of the model's decision-making process, which is crucial for building trust in AI-driven ESG assessments. Our approach enables a more accurate representation of public opinion, essential for informed decision-making in sustainable finance. This paper paves the way for more transparent and explainable AI applications in critical domains like ESG. [ABSTRACT FROM AUTHOR]

The determination of the capital structure is a critical component of a company's financial decision-making process. The question of how to optimize a firm's capital structure to increase its value has been a significant topic of interest within the financial community. The employee stock ownership plan (ESOP) has developed rapidly in China's capital market over the past decade, providing a suitable context for studying the impact of employee equity incentives on capital structure decisions. This paper employs cross-sectional ordinary least squares regression models and unbalanced panel fixed effect models to investigate the impact of employee stock ownership plans (ESOPs) on firms' capital structure decisions. The analysis is conducted on a sample of Chinese A-share listed companies on the Shanghai and Shenzhen Stock Exchanges. The research considers both static capital structure choice and dynamic capital structure adjustment. We find that the implementation of an ESOP reduces the level of corporate debt and accelerates the dynamic adjustment of capital structure, suggesting that employee equity incentives play a role in optimizing firms' capital structure decisions. We also find that the impact of ESOPs on the dynamic adjustment of capital structure is asymmetric. Specifically, the implementation of ESOPs markedly accelerates the downward adjustment of capital structure, yet has no impact on the upward adjustment of capital structure. Further analysis demonstrates that the impact of ESOPs on capital structure decisions is contingent upon the macroeconomic environment, industry characteristics, corporate governance, and ESOP contract designs. First, the optimization of ESOPs on capital structure decisions is more pronounced in an economic boom environment, in a poor market climate, or in competitive industries. Second, the reduction effect of ESOPs on corporate debt is more pronounced in non-state-owned companies, high-tech companies and those with lower ownership concentration. In contrast, the acceleration effect of ESOPs on capital structure adjustment is more pronounced in state-owned companies, non-high-tech companies and those with higher ownership concentration. Ultimately, ESOPs financed by loans from a firm's major shareholders—or with a longer lock-up period, smaller shareholding size or executive subscription ratio—demonstrate a more pronounced optimization effect on capital structure decisions. This paper not only contributes to the existing literature on the relationship between equity incentives and capital structure decisions, but also provides guidance for listed companies on the reasonable design of their ESOPs and the optimization of their capital structure decisions. [ABSTRACT FROM AUTHOR]

The data envelopment analysis (DEA) models have been widely recognized and applied in various fields. However, these models have limitations, such as their inability to globally rank DMUs, the efficiency values are definite numerical values, they are unable to reflect potential efficiency changes, and they fail to adequately reflect the degree of the decision maker's preference. In order to address these shortcomings, this paper combines possibility theory with self-interest and non-self-interest principles to improve the DEA model to provide a more detailed reflection of the differences between DMUs. First, the self-interest and non-self-interest principles are employed to establish the DEA evaluation model, and the determined numerical efficiency is transformed into efficiency intervals. Second, an attitude function is added to the common possible-degree formula to reflect the decision maker's preference, and a more reasonable method for solving the attitude function is presented. Finally, the improved possible-degree formula proposed in this paper is used to rank and compare the interval efficiencies. This improved method not only provides more comprehensive ranking information but also better captures the decision maker's preferences. This model takes preference issues into account and has improved stability and accuracy compared with existing models. The application of the improved model in airlines shows that the model proposed in this paper effectively achieved a full ranking. From a developmental perspective, the efficiency levels of Chinese airlines were generally comparable. Joyair and One Two Three performed poorly, exhibiting significant gaps compared with other airlines. [ABSTRACT FROM AUTHOR]

Featured Application: This article mainly utilizes the advantages and characteristics of evolutionary game theory and based on the ideas and methods of evolutionary game theory, investigates the spontaneous formation of the relationships among the local governments, power grid enterprises, and market regulators based on low-carbon trading mechanisms during long-term carbon emission reduction. This tripartite evolution game is described as a learning progressive evolution system, focusing on the evolution process of the relationship between various stakeholders and the influencing factors of evolutionary stability in the electricity market and carbon emission market. It provides a reasonable explanation for the spontaneous formation of interest equilibrium states within the local government, power grid enterprises, and market regulators, and also provides theoretical reference and policy suggestions for government regulation to the electricity market and carbon emission market. In the context of increasing global efforts to mitigate climate change, effective carbon emission reduction is a pressing issue. Governments and power companies are key stakeholders in implementing low-carbon strategies, but their interactions require careful management to ensure optimal outcomes for both economic development and environmental protection. This paper addresses this real-world challenge by utilizing evolutionary game theory (EGT) to model the strategic interactions between these stakeholders under a low-carbon trading mechanism. Unlike classical game theory, which assumes complete rationality and perfect information, EGT allows for bounded rationality and learning over time, making it particularly suitable for modeling long-term interactions in complex systems like carbon markets. This study builds an evolutionary game model between the government and power companies to explore how different strategies in carbon emission reduction evolve over time. Using payoff matrices and replicator dynamics equations, we determine the evolutionarily stable equilibrium (ESE) points and analyze their stability through dynamic simulations. The findings show that in the absence of a third-party regulator, neither party achieves an ideal ESE. To address this, a third-party regulatory body is introduced into the model, leading to the formulation of a tripartite evolutionary game. The results highlight the importance of regulatory oversight in achieving stable and optimal low-carbon strategies. This paper offers practical policy recommendations based on the simulation outcomes, providing a robust theoretical framework for government intervention in carbon markets and guiding enterprises towards sustainable practices. [ABSTRACT FROM AUTHOR]

Satellites adopt a single-task observation mode in traditional patterns. Although this mode boasts high imaging accuracy, it is accompanied by a limited number of observed tasks and a low utilization rate of satellite resources. This limitation becomes particularly pronounced when dealing with extensive and densely populated observation task sets because the inherent mobility of satellites often leads to conflicts among numerous tasks. To address this issue, this paper introduces a novel multi-task merging mechanism aimed at enhancing the observation rate of satellites by resolving task conflicts. Initially, this paper presents a task merging method based on the proposed multitask merging mechanism, referred to as the constrained graph (CG) task merging approach. This method can merge tasks while adhering to the minimal requirements specified by users. Subsequently, a multi-satellite merging scheduling model is established based on the combined task set. Considering the satellite combined-task scheduling problem (SCTSP), an enhanced fireworks algorithm (EFWA) is proposed that incorporates the CG task synthesis mechanism. This algorithm incorporates local search strategies and a population disturbance mechanism to enhance both the solution quality and convergence speed. Finally, the efficacy of the CG algorithm was validated through a multitude of simulation experiments. Moreover, the effectiveness of the EFWA is confirmed via extensive comparisons with other algorithms, including the basic ant colony optimization (ACO) algorithm, enhanced ant colony optimization (EACO) algorithm, fireworks algorithm (FWA), and EFWA. When the number of tasks in the observation area are dense, such as in the case where the number of tasks is 700, the CG + EFWA (CG is adopted in the task merging stage and EFWA is adopted in the satellite combined-task scheduling stage) method improves observation benefits by 70.35% (compared to CG + EACO, CG is adopted in the task merging stage and EACO is adopted in the satellite combined-task scheduling stage), 78.93% (compared to MS + EFWA, MS is adopted in the task merging stage and EFWA is adopted in the satellite combined-task scheduling stage), and 39.03% (compared to MS + EACO, MS is adopted in the task merging stage and EACO is adopted in the satellite combined-task scheduling stage). [ABSTRACT FROM AUTHOR]

Nonlinear control theory applied to unmanned aeronautical vehicles is an engineering topic that has received higher and higher popularity during the last decade. Model-based control approaches have shown increased performance in flight control accuracy and robustness compared to model-free proposals based on parameter adaptation and estimation. However, model-based structures need more computational efforts in terms of spatial and temporal variables. To avoid these constraints, the latest drone flight controls are based on quaternion models, ensuring more advanced computational performances. To this aim, this paper deals with a flight control algorithm of a quadrotor, in which the mathematics model of the plant is defined in terms of quaternions. Additionally, when aerial vehicles are used in specific applications such as slung load transportation and agriculture fields, among others, the variation of the mass receives high importance since it could make the entire system unstable. In the same line of ideas, this paper presents a H ∞ strategy, combined with a Super-Twisting Sliding-Mode Control, ensuring the control objective of the mass variations identification, and trajectory tracking, to be solved. The stability analysis of the proposed control approach is also discussed, and the quality and performances of the presented control strategy are tested by simulations, in an interesting case in which mass variations and external perturbations cannot be negligible. [ABSTRACT FROM AUTHOR]

Surface blending is an important topic in geometric modelling and is widely applied in computer-aided design and creative industries to create smooth transition surfaces. Among various surface blending methods, partial differential equation (PDE)-based surface blending has the advantages of effective shape control and exact satisfaction of blending boundary constraints. However, it is not easy to solve partial differential equations subjected to blending boundary constraints. In this paper, we investigate how to solve PDEs analytically and develop an analytical PDE-based method to achieve surface blending with C 2 continuity. Taking advantage of elementary functions identified from blending boundary constraints, our proposed method first changes blending boundary constraints into a linear combination of the identified elementary functions. Accordingly, the functions for blending surfaces are constructed from these elementary functions, which transform sixth-order partial differential equations for C 2 surface blending into sixth-order ordinary differential equations (ODEs). We investigate the analytical solutions of the transformed sixth-order ordinary differential equations subjected to corresponding blending boundary constraints. With the developed analytical PDE-based method, we solve C 2 continuous surface blending problems. The surface blending example presented in this paper indicates that the developed method is simple and easy to use. It can be used to effectively control the shape of blending surfaces and at the same time exactly satisfy C 2 continuous blending boundary constraints. [ABSTRACT FROM AUTHOR]

In this paper, we investigate constraint qualifications and optimality conditions for multiobjective mathematical programming problems with vanishing constraints (MOMPVC) on Hadamard manifolds. The MOMPVC-tailored generalized Guignard constraint qualification (MOMPVC-GGCQ) for MOMPVC is introduced in the setting of Hadamard manifolds. By employing MOMPVC-GGCQ and the intrinsic properties of Hadamard manifolds, we establish Karush–Kuhn–Tucker (KKT)-type necessary Pareto efficiency criteria for MOMPVC. Moreover, we introduce several MOMPVC-tailored constraint qualifications and develop interrelations among them. In particular, we establish that the MOMPVC-tailored constraint qualifications introduced in this paper turn out to be sufficient conditions for MOMPVC-GGCQ. Suitable illustrative examples are furnished in the framework of well-known Hadamard manifolds to validate and demonstrate the importance and significance of the derived results. To the best of our knowledge, this is the first time that constraint qualifications, their interrelations, and optimality criteria for MOMPVC have been explored in the framework of Hadamard manifolds. [ABSTRACT FROM AUTHOR]

In this paper, a new analytic expression for the frequency of vibration of a strong nonlinear polynomial-type oscillator is introduced. The method for frequency calculation is based on the transformation of the nonlinear oscillators into linear ones using the equality of their amplitudes and periods of vibration. The frequency of the linear oscillator is assumed to be the sum of frequencies corresponding to each nonlinearity in the original oscillator separately, i.e., the sum of frequencies of truly nonlinear oscillators. The obtained frequency is a complex function of amplitude, coefficient and order of nonlinearity. For simplification, the frequencies of the truly nonlinear oscillators are modified as power order functions of the exact frequency of the cubic oscillator which is linearly dependent on the amplitude of vibration. In this paper, the approximate frequency expression is developed for the harmonic any-order nonlinear oscillator and oscillators with the sum of polynomial nonlinearities. The accuracy of the obtained frequencies is tested on the examples of non-integer order nonlinear oscillators and also on a quadratic-cubic oscillator. The difference between the analytical and exact, numerically obtained results is negligible. The suggested approximate frequency expression has a simple algebraic form and is suitable for application by engineers and technicians. [ABSTRACT FROM AUTHOR]

Composition formula is one of the most important research topics in functional analysis theory. Various relationships can be obtained using the composition formula. Since the generalized Brownian motion process used in this paper has a non-zero mean function, there are many restrictions on obtaining a composition formula for the modified analytic function space Fourier–Feynman transform. This paper contains an idea of how the composition Formula (9) below is established for the modified analytic function space Fourier–Feynman transform on function space. Using this idea, we are able to solve a problem that had never been solved before. [ABSTRACT FROM AUTHOR]

Based on the project portfolio selection and scheduling problem (PPSS), the development of a systematic and scientific project scheduling plan necessitates comprehensive consideration of individual preferences and multiple realistic constraints, rendering it an NP-hard problem. Simultaneously, accurately and swiftly evaluating the value of projects as a complex entity poses a challenging issue that requires urgent attention. This paper introduces a novel qualitative evaluation-based project value assessment process that significantly reduces the cost and complexity of project value assessment, upon which a preference-based deep reinforcement learning method is presented for computing and solving project subsets and time scheduling plans. This paper first determines the key parameter values of the algorithm through specific examples. Then, using the method of controlling variables, it explores the sensitivity of the algorithm to changes in problem size and dimensionality. Finally, the proposed algorithm is compared with two classical algorithms and two heuristic algorithms across different instances. The experimental results demonstrate that the proposed algorithm exhibits higher effectiveness and accuracy. [ABSTRACT FROM AUTHOR]

In the context of flight test planning, numerous uncertainties exist, encompassing aircraft status, number of flights, and weather conditions, among others. These uncertainties ultimately manifest significantly in the actual number of flight sorties executed, rendering high significance to engineering problems related to the execution of flight test missions. However, there is a dearth of research in this specific aspect. To address this gap, this paper proposes an opportunity-constrained integer programming model tailored to the unique characteristics of the problem. To handle the uncertainties, Sample Average Approximation (SAA) is employed to perform oversampling of the uncertain parameters, followed by the Adaptive Large Neighborhood Search (ALNS) algorithm to solve for the optimal solution and objective function value. Results from numerical experiments conducted at varying scales and validated with diverse sampling distributions demonstrate the effectiveness and robustness of the proposed methodology. By decoding the generated execution sequences, comprehensive mission planning schemes can be derived. This approach yields sequences that exhibit commendable feasibility and robustness for the flight test planning problem with sorties uncertainty (FTPPSU), offering valuable support for the efficient execution of future flight test missions. [ABSTRACT FROM AUTHOR]

In vector-controlled Permanent Magnet Synchronous Motors (PMSMs), measuring the motor flux angle, particularly the rotor position, is essential. If a pulse error occurs during motor control using an encoder, it becomes impossible to accurately estimate the rotor position, leading to incorrect position angle information being used in the coordinate transformation. This mismatch causes discrepancies between the commanded three-phase stator current and the actual current applied to the motor. As a result, the motor and inverter output and efficiency decrease, and the control performance deteriorates. Therefore, research is necessary to compensate for such errors. This paper proposes an algorithm that detects pulse errors occurring in incremental encoders and automatically switches to the Hall sensor control mode to compensate for the encoder pulse errors. The proposed algorithm, based on Hall sensors, has the advantage of not significantly affecting control delays, which could be problematic in high-speed operating ranges; thus, effective control is maintained even in such situations. [ABSTRACT FROM AUTHOR]

In various applications, observed variables are missing some information that was intended to be collected. The estimations of both loading and path coefficients could be biased when ignoring the missing data. Inverse probability weighting (IPW) is one of the well-known methods helping to reduce bias in regressions, while belonging to a promising but new category in structural equation models. The paper proposes both parametric and nonparametric IPW estimation methods for dynamic structural equation models, in which both loading and path coefficients are developed into functions of a random variable and of the quantile level. To improve the computational efficiency, modified parametric IPW and modified nonparametric IPW are developed through reducing inverse probability computations but making fuller use of completely observed information. All the above IPW estimation methods are compared to existing complete case analysis through simulation investigations. Finally, the paper illustrates the proposed model and estimation methods by an empirical study on digital new-quality productivity. [ABSTRACT FROM AUTHOR]

The shortest path problem is fundamental in graph theory and has been studied extensively due to its practical importance. Despite this aspect, finding the shortest path between two nodes remains a significant challenge in many applications, as it often becomes complex and time consuming. This complexity becomes even more challenging when constraints make the problem non-additive, thereby increasing the difficulty of finding the optimal path. The objective of this paper is to present a broad perspective on the conventional shortest path problem. It introduces a new method to classify cost functions associated with graphs by defining distinct sets of cost functions. This classification facilitates the exploration of line graphs and an understanding of the upper bounds on the transformation sizes for these types of graphs. Based on these foundations, the paper proposes a practical methodology for solving non-additive shortest path problems. It also provides a proof of optimality and establishes an upper bound on the algorithmic cost of the proposed methodology. This study not only expands the scope of traditional shortest path problems but also highlights their computational complexity and potential solutions. [ABSTRACT FROM AUTHOR]

This paper proposes a highly secure image encryption technique based on chaotic synchronization. Firstly, through the design of a synchronization controller, we ensure that the master–slave chaotic extremum-coded random number generators (ECRNGs) embedded in separated transmitters and receivers are fully synchronized to provide synchronized dynamic random sequences for image encryption applications. Next, combining these synchronized chaotic sequences with the AES encryption algorithm, we propose an image segmentation and multi-encryption method to enhance the security of encrypted images and realize a secure image transmission system. Notably, in the design of the synchronization controller, the transient time before complete synchronization between the master and slave ECRNGs is effectively controlled by specifying the eigenvalues of the matrix in the synchronization error dynamics. Research results in this paper also show that complete synchronization of ECRNGs can be achieved within a single sampling time, which significantly contributes to the time efficiency of the image transmission system. As for the image encryption technique, we propose the method of image segmentation and use the synchronized dynamic random sequences generated by the ECRNGs to produce the keys and initialization vectors (IVs) required for AES-CBC image encryption, greatly enhancing the security of the encrypted images. To highlight the contribution of the proposed segmented image encryption, statistical analyses are conducted on the encrypted images, including histogram analysis (HA), information entropy (IE), correlation coefficient analysis (CCA), number of pixels change rate (NPCR), and unified average changing intensity (UACI), and compared with existing literature. The comparative results fully demonstrate that the proposed encryption method significantly enhances image encryption performance. Finally, under the network transmission control protocol (TCP), the synchronization of ECRNGs, dynamic keys, and IVs is implemented as well as segmented image encryption and transmission, and a highly secure image transmission system is realized to validate the practicality and feasibility of our design. [ABSTRACT FROM AUTHOR]

This paper presents a comprehensive framework for implementing digital twins in aircraft lifecycle management, with a focus on using data-driven models to enhance decision-making and operational efficiency. The proposed framework integrates cutting-edge technologies such as IoT sensors, big data analytics, machine learning, 6G communication, and cloud computing to create a robust digital twin ecosystem. This paper explores the key components of the framework, including lifecycle phases, new technologies, and models for digital twins. It discusses the challenges of creating accurate digital twins during aircraft operation and maintenance and proposes solutions using emerging technologies. The framework incorporates physics-based, data-driven, and hybrid models to simulate and predict aircraft behavior. Supporting components like data management, federated learning, and analytics tools enable seamless integration and operation. This paper also examines decision-making models, a knowledge-driven approach, limitations of current implementations, and future research directions. This holistic framework aims to transform fragmented aircraft data into comprehensive, real-time digital representations that can enhance safety, efficiency, and sustainability throughout the aircraft lifecycle. [ABSTRACT FROM AUTHOR]

This paper explores the challenges of finding robust shortest paths in multimodal transportation networks. With the increasing complexity and uncertainties in modern transportation systems, developing efficient and reliable routing strategies that can adapt to various disruptions and modal changes is essential. By incorporating practical constraints in parameter uncertainty, this paper establishes a robust shortest path mixed-integer programming model based on a multimodal transportation network under transportation time uncertainty. To solve robust shortest path problems with multimodal transportation, we propose a modified Dijkstra algorithm that integrates parameter uncertainty with multimodal transportation. The effectiveness of the proposed multimodal transportation shortest path algorithm is verified using empirical experiments on test sets of different scales and a comparison of the runtime using a commercial solver. The experimental results on the multimodal transportation networks demonstrate the effectiveness of our approach in providing robust and efficient routing solutions. The results demonstrate that the proposed method can generate optimal solutions to the robust shortest path problem in multimodal transportation under time uncertainty and has practical significance. [ABSTRACT FROM AUTHOR]

The proliferation of GPS-enabled devices and advances in positioning technologies have greatly facilitated the collection of user location data, making them valuable across various domains. One of the most common and practical uses of these location datasets is to recommend the most probable route between two locations to users. Traditional algorithms for route recommendation rely on true trajectory data collected from users, which raises significant privacy concerns due to the personal information often contained in location data. Therefore, in this paper, we propose a novel framework for computing optimal routes using location data collected through differential privacy (DP)-based privacy-preserving methods. The proposed framework introduces a method for accurately extracting transitional probabilities from perturbed trajectory datasets, addressing the challenge of low data utility caused by DP-based methods. Specifically, to effectively compute transitional probabilities, we present a density-adjusted sampling method that enables the collection of representative data across all areas. In addition, we introduce an effective scheme to approximately estimate transitional probabilities based on sampled datasets. Experimental results on real-world data demonstrate the practical applicability and effectiveness of our framework in computing optimal routes while preserving user privacy. [ABSTRACT FROM AUTHOR]

This paper focuses on event-triggered state estimation and control of positive complex networks. An event-triggered condition is provided for discrete-time complex networks by which an event-based state estimator and an estimator-based controller are designed through matrix decomposition technology. Thus, the system is converted to an interval uncertain system. The positivity and the L 1 -gain stability of complex networks are ensured by resorting to a co-positive Lyapunov function. All conditions are solvable in terms of linear programming. Finally, the effectiveness of the proposed state estimator and controller are verified by a numerical example. The main contributions of this paper are as follows: (i) A positive complex network framework is constructed based on an event-triggered strategy, (ii) a new state estimator and an estimator-based controller are proposed, and (iii) a simple analysis and design approach consisting of a co-positive Lyapunov function and linear programming is presented for positive complex networks. [ABSTRACT FROM AUTHOR]

The paper considers a bidimensional continuous-time risk model with subexponential claims and Brownian perturbations, in which the price processes of the investment portfolio of the two lines of business are two geometric Lévy processes and the two lines of business share a common claim-number process, which is a renewal counting process. The paper mainly considers the claims of each line of business having a dependence structure. When the claims have subexponential distributions, the asymptotics of the finite-time ruin probabilities ψ a n d (x 1 , x 2 ; T) and ψ s i m (x 1 , x 2 ; T) have been obtained. When the distributions of claims belong to the intersection of long-tailed and dominatedly varying-tailed distribution classes, the asymptotics of the finite-time ruin probability ψ o r (x 1 , x 2 ; T) is given. [ABSTRACT FROM AUTHOR]

This paper presents an estimation of the launching points of unmanned aerial vehicles (UAVs) equipped with boosters. When UAVs are detected and tracked by sensors such as radars, the fast identification of vehicle launching points is needed for air traffic control and defense systems. When UAVs in a boosting phase are controlled by first-order pitch programming, this paper leverages inverse first-order pitch programming to analytically solve launching points. Furthermore, a two-point robust measurement selection (T-RMS) scheme is developed to reduce errors such as random noise and bias by utilizing multiple moving average filters. The proposed work is verified by various simulation results. [ABSTRACT FROM AUTHOR]

With the continuous improvement of the performance of artificial intelligence and neural networks, a new type of computing architecture-edge computing, came into being. However, when the scale of hybrid intelligent edge systems expands, there are redundant communications between the node and the parameter server; the cost of these redundant communications cannot be ignored. This paper proposes a reputation-based asynchronous model update scheme and formulates the federated learning scheme as an optimization problem. First, the explainable reputation consensus mechanism for hybrid intelligent labeling systems communication is proposed. Then, during the process of local intelligent data annotation, significant challenges in consistency, personalization, and privacy protection posed by the federated recommendation system prompted the development of a novel federated recommendation framework utilizing a graph neural network. Additionally, the method of information interaction model fusion was adopted to address data heterogeneity and enhance the uniformity of distributed intelligent annotation. Furthermore, to mitigate communication delays and overhead, an asynchronous federated learning mechanism was devised based on the proposed reputation consensus mechanism. This mechanism leverages deep reinforcement learning to optimize the selection of participating nodes, aiming to maximize system utility and streamline data sharing efficiency. Lastly, integrating the learned models into blockchain technology and conducting validation ensures the reliability and security of shared data. Numerical findings underscore that the proposed federated learning scheme achieves higher learning accuracy and enhances communication efficiency. [ABSTRACT FROM AUTHOR]

Since SQL injection allows attackers to interact with the database of applications, it is regarded as a significant security problem. By applying machine learning algorithms, SQL injection attacks can be identified. Problem: In the training stage of machine learning methods, effective features are used to develop an optimal classifier that is highly accurate. The specification of the features with the highest efficacy is considered to be an NP-complete combinatorial optimization challenge. Selecting the most effective features refers to the procedure of identifying the smallest and most effective features in the dataset. The rationale behind this paper is to optimize the accuracy, precision, and sensitivity parameters of the SQL injection attack detection method. Method: In this paper, a method for identifying SQL injection attacks was suggested. In the first step, a particular training dataset that included 13 features was developed. In the second step, to specify the best features of the dataset, a specific binary variety of the Olympiad optimization algorithm was developed. Various machine learning algorithms were used to create the optimal attack detector. Results: Based on the experiments carried out, the suggested SQL injection detector using an artificial neural network and the feature selector can achieve 99.35% accuracy, 100% precision, and 100% sensitivity. Owing to selecting about 30% of the effective features, the proposed method enhanced the efficacy of SQL injection detectors. [ABSTRACT FROM AUTHOR]

In some settings, systems may not fail completely but instead undergo performance degradation, leading to reduced efficiency. A significant concern arises when a system transitions into a degraded state without immediate detection, with the degradation only becoming apparent after an unpredictable period. Undetected degradation can result in failures with significant consequences. For instance, a minor crack in an oil pipeline might go unnoticed, eventually leading to a major leak, environmental harm, and costly cleanup efforts. Similarly, in the nuclear industry, undetected degradation in reactor cooling systems could cause overheating and potentially catastrophic failure. This paper focuses on reliability modeling for systems experiencing degradation, accounting for time delays associated with undetected degraded states, self-repair mechanisms, and varying operating environments. The paper presents a reliability model for degraded, time-dependent systems, incorporating various aspects of degradation. It first discusses the model assumptions and formulation, followed by numerical results obtained from system modeling using the developed program. Various scenarios are illustrated, incorporating time delays and different parameter values. Through computational analysis of these complex systems, we observe that the probability of the system being in the undetected degraded state tends to stabilize shortly after the initial degradation begins. The model is valuable for predicting and establishing an upper bound on the probability of the undetected, degraded state and the system's overall reliability. Finally, the paper outlines potential avenues for future research. [ABSTRACT FROM AUTHOR]

This paper explores the properties of projective vector fields on semi-Riemannian manifolds. The main result establishes that if a projective vector field P on such a manifold is also a conformal vector field with potential function ψ and the vector field ζ dual to d ψ does not change its causal character, then P is homothetic, or ζ is a light-like vector field. Additionally, it is shown that a complete Riemannian manifold admits a projective vector field that is also conformal and non-Killing if and only if it is locally Euclidean. The paper also presents other results related to the characterization of Killing and parallel vector fields using the Ricci curvature and the Hessian of the function given by the inner product of the vector field. [ABSTRACT FROM AUTHOR]

This paper presents a comprehensive study of the linguistic Z-graph, which is a novel framework designed to analyze linguistic structures within social networks. By integrating concepts from graph theory and linguistics, the linguistic Z-graph provides a detailed understanding of language dynamics in online communities. This study highlights the practical applications of linguistic Z-graphs in identifying central nodes within social networks, which are crucial for online businesses in market capture and information dissemination. Traditional methods for identifying central nodes rely on direct connections, but social network connections often exhibit uncertainty. This paper focuses on using fuzzy theory, particularly linguistic Z-graphs, to address this uncertainty, offering more detailed insights compared to fuzzy graphs. Our study introduces a new centrality measure using linguistic Z-graphs, enhancing our understanding of social network structures. [ABSTRACT FROM AUTHOR]

Single-machine due-window assignment scheduling with delivery times and variable processing times is investigated, where the variable processing time of a job means that the processing time is a function of its position in a sequence and its resource allocation. Currently, there are multiple optimization objectives for the due-window assignment problem, and there is a small amount of research on optimization problems where the window starting time, the rejected cost and the optimal scheduling are jointly required. The goal of this paper is to minimize the weighed sum of scheduling cost, resource consumption cost and outsourcing measure under the optional job outsourcing (rejection). Under two resource allocation models (i.e., linear and convex resource allocation models), the scheduling cost is the weighted sum of the number of early–tardy jobs, earliness–tardiness penalties and due-window starting time and size, where the weights are positional-dependent. The main contributions of this paper include the study and data simulation of single-machine scheduling with learning effects, delivery times and outsourcing cost. For the weighed sum of scheduling cost, resource consumption cost and outsourcing measure, we prove the polynomial solvability of the problem. Under the common and slack due-window assignments, through the theoretical analysis of the optimal solution, we reveal that four problems can be solved in O (n 6) time, where n is the number of jobs. [ABSTRACT FROM AUTHOR]

This paper presents a new numerical scheme for a class of linear impulsive neutral differential equations with constant coefficients based on the Euler method. We rigorously establish the first-order convergence of the proposed numerical approach. Additionally, the asymptotical stability of the exact solutions and numerical solutions of impulsive neutral differential equations are studied. To substantiate our findings, two illustrative examples are provided, demonstrating the theoretical conclusions of this paper. [ABSTRACT FROM AUTHOR]

In the e-commerce last-mile delivery process, the asset operators (logistics service providers who own parcel locker facilities) support their delivery service with parcel lockers, while the non-asset operators (logistics service providers without parcel lockers) perform door-to-door delivery. Due to demand fluctuation, asset operators' parcel-locker slots may be left vacant, while non-asset operators are stuck with the high-cost door-to-door service. The exclusiveness of parcel-locker usage reduces resource utilization and service efficiency in last-mile delivery. Therefore, this paper proposes a parcel-locker-sharing model in which these two parties share the parcel-locker capacity in last-mile delivery. The asset operator rents the unused parcel lockers to the non-asset operator by charging a rental fee,while the non-asset operator rents the parcel lockers for delivery to save logistics costs. The motivation of this alliance is to increase the profits of both parties and that of the total supply chain. This study establishes the supply-chain profit model for the parcel-locker-sharing framework and finds that the profit or loss depends on the comparison of the operation cost savings and delivery-cost savings. A numerical analysis is conducted to validate the final result. The research further suggests the optimal rental quantity and price interval. This paper is the first to study the operational mechanism of sharing the parcel locker between two distinct types of logistics service providers and to offer recommendations for industrial application. [ABSTRACT FROM AUTHOR]

The notion of Roman { 2 } -domination was introduced in 2016 as a variant of Roman domination, a concept inspired by a defending strategy used by the emperor Constantine (272–337 AD) to protect the Roman Empire. Since then, a considerable number of papers on Roman { 2 } -domination and its variants have been published. In this paper, we survey published results on Roman { 2 } -domination as well as the main findings on Roman { 2 } -domination variants found in the literature. A list of open problems related to this notion and its variants are also given. [ABSTRACT FROM AUTHOR]

Traditional machine learning-based entity extraction methods rely heavily on feature engineering by experts, and the generalization ability of the model is poor. Prototype networks, on the other hand, can effectively use a small amount of labeled data to train models while using category prototypes to enhance the generalization ability of the models. Therefore, this paper proposes a prototype network-based named entity recognition (NER) method, namely the FSPN-NER model, to solve the problem of difficult recognition of sensitive data in data-sparse text. The model utilizes the positional coding model (PCM) to pre-train the data and perform feature extraction, then computes the prototype vectors to achieve entity matching, and finally introduces a boundary detection module to enhance the performance of the prototype network in the named entity recognition task. The model in this paper is compared with LSTM, BiLSTM, CRF, Transformer and their combination models, and the experimental results on the test dataset show that the model outperforms the comparative models with an accuracy of 84.8%, a recall of 85.8% and an F1 value of 0.853. [ABSTRACT FROM AUTHOR]

This paper explores secure communication systems with a chaotic carrier. The use of chaotic oscillations instead of regular van der Pol oscillators as a signal carrier is a promising and active research area, providing not only communication systems with new protection principles and organization but also high steganographic efficiency when transmitting short messages. The problem is to select methods and techniques for mixing a useful signal into a chaotic one and its recovery on the receiver side, featuring a set of properties acceptable for implementation and real-world application. We demonstrate application of synergetic control theory (SCT), which provides advanced observer-basing methods for nonlinear dynamic systems as well as explore example of data transmission system consisting of a Genesio–Tesi chaotic oscillator, data signal transmission with a method of nonlinear modulation, and recovering with a single-channel synergetic observer at the receiver side. The paper presents a nonlinear state observer modeling procedure followed by building a MATLAB/Simulink simulation model of the data transmission system for the PC-platform along with software implementation for the Raspberry Pi platform, with simulation and experimental run results showing data transmission rates seem to be acceptable for the considered practical applications. Practical applications and limitations issues are discussed. Future research will be universal modeling procedures for different classes of chaotic generators and whole system experimental hardware implementation. The obtained results can be primarily used in short messages and/or encryption keys secure transmission systems, cyber-physical system component command communications, as well as chaotic carrier system R&D competitive studies and other applications. [ABSTRACT FROM AUTHOR]

With the advent of big data, the swift advancement of diverse algorithmic technologies has enhanced the transaction efficiency of the e-commerce business. Nevertheless, it is crucial to acknowledge that e-commerce platforms might employ algorithmic technology to enforce differential pricing for various consumers with the aim of maximizing profits, thus infringing upon the lawful rights and interests of consumers. This paper focuses on the algorithmic price discrimination commonly observed on e-commerce platforms. To effectively regulate this behavior, the paper utilizes evolutionary game theory (EGT) to analyze the strategies employed by e-commerce platforms, consumers, and market regulators to achieve stability. This research employs a real-life situation and utilizes parametric simulation to visualize and analyze the process and outcomes of the three-party evolutionary game. The results demonstrate the credibility and feasibility of the article's findings. Based on our research, we have reached the following findings: During the process of evolution, the strategic decisions made by the game participants from the three parties will mutually impact each other, and various elements exert varying degrees of influence on the strategic choices made by the game participants from each party. Collaborative governance can enable consumers and market regulators to regulate the discriminatory pricing behavior of e-commerce platforms effectively. This article offers valuable insights into the governance of violations in the e-commerce sector based on robust data and model research. [ABSTRACT FROM AUTHOR]

This paper presents the topological derivative of the first eigenvalue for the free vibration model of plane structures. We conduct a topological asymptotic analysis to account for perturbations in the domain caused by inserting a small inclusion. The paper includes a rigorous derivation of the topological derivative for the eigenvalue problem along with a proof of its existence. Additionally, we provide numerical examples that illustrate the application of the proposed methodology for maximizing the first eigenvalue in plane structures. The results demonstrate that multiple eigenvalues were not encountered. [ABSTRACT FROM AUTHOR]

Aiming to provide solutions for problems proposed by the inaccurate segmentation of long objects and information loss of small objects in real-time semantic segmentation algorithms, this paper proposes a lightweight multi-branch real-time semantic segmentation network based on BiseNetV2. The new auxiliary branch makes full use of spatial details and context information to cover the long object in the field of view. Meanwhile, in order to ensure the inference speed of the model, the asymmetric convolution is used in each stage of the auxiliary branch to design a structure with low computational complexity. In the multi-branch fusion stage, the alignment-and-fusion module is designed to provide guidance information for deep and shallow feature mapping, so as to make up for the problem of feature misalignment in the fusion of information at different scales, and thus reduce the loss of small target information. In order to further improve the model's awareness of key information, a global context module is designed to capture the most important features in the input data. The proposed network uses an NVIDIA GeForce RTX 3080 Laptop GPU experiment on the road street view Cityscapes and CamVid datasets, with the average simultaneously occurring ratios reaching 77.1% and 77.4%, respectively, and the running speeds reaching 127 frames/s and 112 frames/s, respectively. The experimental results show that the proposed algorithm can achieve a real-time segmentation and improve the accuracy significantly, showing good semantic segmentation performance. [ABSTRACT FROM AUTHOR]

This paper presents a multiple step-stress accelerated life test using type II censoring. Assuming that the lifetimes of the test item follow the gamma distribution, the maximum likelihood estimation and Bayesian approaches are used to estimate the distribution parameters. In the Bayesian approach, new parametrizations can lead to new prior distributions and can be a useful technique to improve the efficiency and effectiveness of Bayesian modeling, particularly when dealing with complex or high-dimensional models. Therefore, in this paper, we present two sets of prior distributions for the parameters of the accelerated test where one of them is based on the reparametrization of the other. The performance of the proposed prior distributions and maximum likelihood approach are investigated and compared by examining the summaries and frequentist coverage probabilities of intervals. We introduce the Markov Chain Monte Carlo (MCMC) algorithms to generate samples from the posterior distributions in order to evaluate the estimators and intervals. Numerical simulations are conducted to examine the approach's performance and one-sample lifetime data are presented to illustrate the proposed methodology. [ABSTRACT FROM AUTHOR]

Moran's I is a spatial autocorrelation measure of univariate spatial data. Therefore, even if p spatial data exist, we can only obtain p values for Moran's I. In other words, Moran's I cannot measure the degree of spatial autocorrelation of multivariate spatial data as a single value. This paper addresses this issue. That is, we extend Moran's I so that it can measure the degree of spatial autocorrelation of multivariate spatial data as a single value. In addition, since the local version of Moran's I has the same problem, we extend it as well. Then, we establish their properties, which are fundamental for applied work. Numerical illustrations of the theoretical results obtained in the paper are also provided. [ABSTRACT FROM AUTHOR]