Search Results (38)

As a core support for the integration of new energy and smart grids, Vehicle-to-Grid (V2G) networks face a core contradiction between user privacy protection and transaction security traceability—a dilemma that is further exacerbated by issues such as the quantum computing vulnerability of traditional cryptography, cumbersome key management in stateful ring signatures, and conflicts between revocation mechanisms and privacy protection. To address these problems, this paper proposes a post-quantum revocable linkable ring signature scheme based on SPHINCS+, with the following core innovations: First, the scheme seamlessly integrates the pure hash-based architecture of SPHINCS+ with a stateless design, incorporating WOTS+, FORS, and XMSS technologies, which inherently resists quantum attacks and eliminates the need to track signature states, thus completely resolving the state management dilemma of traditional stateful schemes; second, the scheme introduces an innovative “real signature + pseudo-signature polynomially indistinguishable” mechanism, and by calibrating the authentication path structure and hash distribution of pseudo-signatures (satisfying the Kolmogorov–Smirnov test with $D\le 0.05$), it ensures signer anonymity and mitigates the potential risk of distinguishable pseudo-signatures; third, the scheme designs a KEK (Key Encryption Key)-sharded collaborative revocation mechanism, encrypting and storing the $(I,pk,RID)$ mapping table in fragmented form, with KEK split into $KE{K}_1$ (held by the Trusted Authority, TA) and $KE{K}_2$ (held by the regulatory node), with collaborative decryption by both parties required to locate malicious users, thereby resolving the core conflict of privacy leakage in traditional revocation mechanisms; fourth, the scheme generates forward-secure linkable tags based on one-way private key updates and one-time random factors, ensuring that past transactions cannot be traced even if the current private key is compromised; and fifth, the scheme adopts hash commitments instead of complex cryptographic commitments, simplifying computations while efficiently binding transaction amounts to signers—an approach consistent with the pure hash-based design philosophy of SPHINCS+. Security analysis demonstrates that the scheme satisfies the following six core properties: post-quantum security, unforgeability, anonymity, linkability, unframeability, and forward secrecy, thereby providing technical support for secure and anonymous payments in V2G networks in the quantum era. Full article

This paper develops a unified synchronization framework for octonion-valued fractional-order neural networks (FOOVNNs) subject to mixed delays, Lévy disturbances, and topology switching. A fractional sliding surface is constructed by combining $I^{1-\mu }{e}_g$ with integral terms in powers of $|e_g|$. The controller includes a nonsingular term $-{\rho }_{2g}{s}_g^{c_2}\mathrm{sign}\left(s_g\right)$, a disturbance-compensation term $-{\widehat{\theta }}_g\mathrm{sign}\left(s_g\right)$, and a delay-feedback term $-{\lambda }_g{e}_g(t-\tau )$, while dimension-aware adaptive laws ${\phantom{,}}^C{D}_t^{\mu }{\rho }_g=k_{1g}N{\parallel s_g\parallel }^{c_2}$ and ${\phantom{,}}^C{D}_t^{\mu }{\widehat{\theta }}_g=k_{2g}N\parallel s_g\parallel$ ensure scalability with network size. Fixed-time convergence is established via a fractional stochastic Lyapunov method, and predefined-time convergence follows by a time-scaling of the control channel. Markovian switching is treated through a mode-dependent Lyapunov construction and linear matrix inequality (LMI) conditions; non-Gaussian perturbations are handled using fractional Itô tools. The architecture admits observer-based variants and is implementation-friendly. Numerical results corroborate the theory: (i) Two-Node Baseline: The fixed-time design drives ${\parallel e\left(t\right)\parallel }_1$ to $\mathcal{O}\left({10}^{-4}\right)$ by $t\approx 0.94\mathrm{s}$, while the predefined-time variant meets a user-set $T_p=0.5\mathrm{s}$ with convergence at $t\approx 0.42\mathrm{s}$. (ii) Eight-Node Scalability: Sliding surfaces settle in an $\mathcal{O}\left(1\right)$ band, and adaptive parameter means saturate well below their ceilings. (iii) Hyperspectral (Synthetic): Reconstruction under Lévy contamination achieves a competitive PSNR consistent with hypercomplex modeling and fractional learning. (iv) Switching Robustness: under four modes and twelve random switches, the error satisfies ${max}_t{\parallel e\left(t\right)\parallel }_1\le 0.15$. The results support octonion-valued, fractionally damped controllers as practical, scalable mechanisms for robust synchronization under non-Gaussian noise, delays, and time-varying topologies. Full article

The adaptability of the supervisory control strategy of plug-in hybrid electric buses (PHEBs) to different driving styles determines the energy-saving performance. This paper proposes a driver-oriented adaptive equivalent consumption minimization strategy (ECMS) for PHEBs. The strategy aims to improve the fuel economy of PHEBs as much as possible by adapting to different driving styles while satisfying the physical constraints of the hybrid power system. Firstly, an online driving style recognition algorithm based on the Fuzzy K-means (FKM) algorithm and the random forest (RF) method is devised, in which the FKM algorithm is used to preprocess the feature parameters related to driving styles and the RF method is utilized to identify the driver’s driving style. Secondly, the driving style recognition results are introduced into the ECMS framework to form a driver-oriented energy management strategy. Finally, the proposed control strategy is verified using both Matlab/Simulink and Hardware-in-the-Loop. The verification results demonstrate that the proposed control strategy improves the fuel economy of PHEBs. Full article

Currently, supermarket-run shopping centers, known as “Big Marts,” monitor sales information for every single item in order to predict potential customer demand and update inventory management. Anomalies and general trends are commonly discovered through data warehouse mining using a range of machine learning techniques, and businesses such as Big Marts can use the obtained data to forecast future sales volumes. Compared to other research publications, this one forecasted sales with higher accuracy using machine learning models including KNN (K Nearest Neighbors), Naïve Bayes, and Random Forest. To adapt the proposed business model to anticipated outcomes, the sales forecast is based on Big Mart sales for various stores. Using different machine learning methods, the data that is produced may then be used to predict potential sales volumes for retailers such as Big Marts. The projected cost of the suggested system includes the following identifiers: price, outlet, and outlet location. In order to facilitate data-driven decision-making in retail operations and help Big Marts optimize their business models and effectively satisfy anticipated demand, this study emphasizes the importance of incorporating cutting-edge machine learning approaches. Full article

Peptide therapeutics often fall outside classical small-molecule heuristics, such as Lipinski’s Rule of Five (Ro5), motivating the development of adapted filters and data-driven approaches to early drug-likeness assessment. We curated >300 k drug (small and peptide) and non-drug molecules from PubChem, extracted key molecular descriptors with RDKit, and generated three rule-violation counters for Ro5, the peptide-oriented beyond-Ro5 (bRo5) extension, and Muegge’s criteria. Random Forest (RF) classifier and regressor models (with 10, 20, and 30 trees) were trained and evaluated. Predictions for 26 peptide test molecules were compared with those from SwissADME, Molinspiration, and manual calculations. Model metrics were uniformly high (Ro5 accuracy/precision/recall = 1.0; Muegge ≈ 0.99), indicating effective learning. Ro5 violation counts matched reference values for 23/26 peptides; the remaining cases differed by +1 violation, reflecting larger structures and platform limits. bRo5 predictions showed near-complete agreement with manual values; minor discrepancies occurred in isolated peptides. Muegge’s predictions were internally consistent but tended to underestimate SwissADME by ~1 violation in several molecules. Four peptides (ML13–16) satisfied bRo5 boundaries; three also fully met Ro5. RF models thus provide fast and reliable in silico filters for peptide drug-likeness and can support the prioritisation of orally developable candidates. Full article

Optimizing the power allocation and capacity configuration of hybrid energy storage systems (HESS) is crucial for enhancing grid stability, power quality and renewable energy utilization in wind–solar complementary microgrids. However, the conventional configuration methods exhibit inaccuracy and low reliability. To achieve the optimal capacity configuration of HESS in wind–solar complementary microgrids, a power allocation strategy and a capacity optimization configuration model for HESS consisting of vanadium redox flow batteries (VRBs) and supercapacitors (SCs) were proposed based on parameter-optimized variational mode decomposition (VMD). Firstly, the number of mode decomposition (K) and the penalty factor (α) of VMD were optimized using the random walk grey wolf optimizer (RW-GWO) algorithm, and the HESS power signal was decomposed by RW-GWO-VMD. Secondly, an optimal capacity configuration model was formulated, taking into account the whole life cycle cost of HESS, and particle swarm optimization (PSO) algorithm was applied to optimize HESS capacity while satisfying operational constraints on charge/discharge power, state of charge (SOC) range, and permissible rates of load deficit and energy loss. Thirdly, the optimal capacity allocation was obtained by minimizing the whole life cycle cost of HESS, with the frequency division threshold N serving as the optimization parameter. Finally, comprehensive comparison and analysis of proposed methods were conducted through simulation experiments. The results demonstrated that the whole life cycle cost of RW-GWO-VMD was 7.44% lower than that of EMD, 1.00% lower than that of PSO-VMD, 0.72% lower than that of AOA-VMD, and 0.27% lower than that of GWO-VMD. Full article

This paper explores the implications of modifying the canonical Heisenberg commutation relations over two simple systems, such as the free particle and the tunnel effect generated by a step-like potential. The modified commutation relations include position-dependent and momentum-dependent terms analyzed separately. For the position deformation case, the corresponding free wave functions are sinusoidal functions with a variable wave vector $k(x)$. In the momentum deformation case, the wave function has the usual sinusoidal behavior, but the energy spectrum becomes non-symmetric in terms of momentum. Tunneling probabilities depend on the deformation strength for both cases. Also, surprisingly, the quantum mechanical model generated by these modified commutation relations is related to the Black–Scholes model in finance. In fact, by taking a particular form of a linear position deformation, one can derive a Black–Scholes equation for the wave function when an external electromagnetic potential is acting on the particle. In this way, the Scholes model can be interpreted as a quantum-deformed model. Furthermore, by identifying the position coordinate x in quantum mechanics with the underlying asset S, which in finance satisfies stochastic dynamics, this analogy implies that the Black–Scholes equation becomes a quantum mechanical system defined over a random spatial geometry. If the spatial coordinate oscillates randomly about its mean value, the quantum particle’s mass would correspond to the inverse of the variance of this stochastic coordinate. Further, because this random geometry is nothing more than gravity at the microscopic level, the Black–Scholes equation becomes a possible simple model for understanding quantum gravity. Full article

U-statistics are fundamental in modeling statistical measures that involve responses from multiple subjects. They generalize the concept of the empirical mean of a random variable X to include summations over each m-tuple of distinct observations of X. W. Stute introduced conditional U-statistics, extending the Nadaraya–Watson estimates for regression functions. Stute demonstrated their strong pointwise consistency with the conditional expectation $r^{\left(m\right)}(\phi ,\mathbf{t})$, defined as $\mathbb{E}\left[\phi (Y_1,\dots ,Y_m)\right|(X_1,\dots ,X_m)=\mathbf{t}]$ for $\mathbf{t}\in {\mathcal{X}}^m$. This paper focuses on estimating functional single index (FSI) conditional U-processes for regular time series data. We propose a novel, automatic, and location-adaptive procedure for estimating these processes based on k-Nearest Neighbor (kNN) principles. Our asymptotic analysis includes data-driven neighbor selection, making the method highly practical. The local nature of the kNN approach improves predictive power compared to traditional kernel estimates. Additionally, we establish new uniform results in bandwidth selection for kernel estimates in FSI conditional U-processes, including almost complete convergence rates and weak convergence under general conditions. These results apply to both bounded and unbounded function classes, satisfying certain moment conditions, and are proven under standard Vapnik–Chervonenkis structural conditions and mild model assumptions. Furthermore, we demonstrate uniform consistency for the nonparametric inverse probability of censoring weighted (I.P.C.W.) estimators of the regression function under random censorship. This result is independently valuable and has potential applications in areas such as set-indexed conditional U-statistics, the Kendall rank correlation coefficient, and discrimination problems. Full article

We propose a secure user pairing (UP) and power allocation (PA) strategy for a downlink Non-Orthogonal Multiple Access (NOMA) system when there exists an external eavesdropper. The secure transmission of data through the downlink is constructed to optimize both UP and PA. This optimization aims to maximize the achievable sum secrecy rate (ASSR) while adhering to a limit on the rate for each user. However, this poses a challenge as it involves a mixed integer nonlinear programming (MINLP) problem, which cannot be efficiently solved through direct search methods due to its complexity. To handle this gracefully, we first divide the original problem into two smaller issues, i.e., an optimal PA problem for two paired users and an optimal UP problem. Next, we obtain the closed-form optimal solution for PA between two users and UP in a simplified NOMA system involving four users. Finally, the result is extended to a general $2K$-user NOMA system. The proposed UP and PA method satisfies the minimum rate constraints with an optimal ASSR as shown theoretically and as validated by numerical simulations. According to the results, the proposed method outperforms random UP and that in a standard OMA system in terms of the ASSR and the average ASSR. It is also interesting to find that increasing the number of user pairs will bring more performance gain in terms of the average ASSR. Full article

Heart and blood vessel disorders are referred to as cardiovascular diseases (CVDs). It is one of the leading global causes of death and consists of many disorders that harm the cardiovascular system. The World Health Organization (WHO) estimates that in 2019, 18 million deaths worldwide were caused by CVDs, accounting for about 32% of all deaths. Therefore, the early detection and prediction of cardiovascular disease can be beneficial in identifying high-risk individuals and enabling timely interventions to reduce the disease’s impact and improve patient outcomes. This study provides a machine learning (ML)-based framework CVD detection to satisfy this criterion. The proposed model includes data preprocessing, hyperparameter optimization using GridSearchCV, and classification using supervised learning approaches, such as support vector machine (SVM), K-nearest neighbors (KNN), XGBoost, random forest (RF), LightBoost (LB), and stochastic gradient descent (SGD). All these models are carried out on the publicly accessed database, namely Kaggle. The experimental results demonstrate that the suggested ML technique has attained a 92.76% detection rate with the SGD classifier on the 80:20 training/testing ratios, which is superior to the well-received approaches. Full article

Polymer composites are a class of material that are gaining a lot of attention in demanding tribological applications due to the ability of manipulating their performance by changing various factors, such as processing parameters, types of fillers, and operational parameters. Hence, a number of samples under different conditions need to be repeatedly produced and tested in order to satisfy the requirements of an application. However, with the advent of a new field of triboinformatics, which is a scientific discipline involving computer technology to collect, store, analyze, and evaluate tribological properties, we presently have access to a variety of high-end tools, such as various machine learning (ML) techniques, which can significantly aid in efficiently gauging the polymer’s characteristics without the need to invest time and money in a physical experimentation. The development of an accurate model specifically for predicting the properties of the composite would not only cheapen the process of product testing, but also bolster the production rates of a very strong polymer combination. Hence, in the current study, the performance of five different machine learning (ML) techniques is evaluated for accurately predicting the tribological properties of ultrahigh molecular-weight polyethylene (UHMWPE) polymer composites reinforced with silicon carbide (SiC) nanoparticles. Three input parameters, namely, the applied pressure, holding time, and the concentration of SiCs, are considered with the specific wear rate (SWR) and coefficient of friction (COF) as the two output parameters. The five techniques used are support vector machines (SVMs), decision trees (DTs), random forests (RFs), k-nearest neighbors (KNNs), and artificial neural networks (ANNs). Three evaluation statistical metrics, namely, the coefficient of determination (R²-value), mean absolute error (MAE), and root mean square error (RMSE), are used to evaluate and compare the performances of the different ML techniques. Based upon the experimental dataset, the SVM technique was observed to yield the lowest error rates—with the RMSE being 2.09 × 10⁻⁴ and MAE being 2 × 10⁻⁴ for COF and for SWR, an RMSE of 2 × 10⁻⁴ and MAE of 1.6 × 10⁻⁴ were obtained—and highest R²-values of 0.9999 for COF and 0.9998 for SWR. The observed performance metrics shows the SVM as the most reliable technique in predicting the tribological properties—with an accuracy of 99.99% for COF and 99.98% for SWR—of the polymer composites. Full article

In order to reduce the pumping threshold and achieve a short-cavity single-mode transmission with a narrow-linewidth random fiber laser, we propose a tunable random fiber laser based on the combination of random grating and highly reflective fiber Bragg grating (FBG). Theoretical modeling of a random refractive index-modulated fiber grating was carried out. Random grating is regarded as a linear combination of uniform fiber gratings with different periods. Simulation calculations were performed using the transfer matrix method to determine the preparation parameters. Under the premise of satisfying light localization, a point-by-point method was used to write a random grating in a single-mode fiber using a femtosecond laser according to the simulated parameters. We constructed a random fiber laser with a linewidth of 1.68 kHz and a threshold of 29.2 mW using a random grating and a highly reflective FBG combined with an erbium-doped fiber. Due to the broad scattered wavelength range of the random grating, by changing the central wavelength of the high-reflection FBG, the tunable wavelength of the output laser was realized, and the tunable range was 0.847 nm (1549.110–1549.957 nm). Moreover, the laser’s central wavelength and output power are stable for a long time. Compared with other lasers, the proposed laser has the advantages of a lower threshold, shorter cavity length, narrower linewidth, and a relatively simple structure. Full article

Water availability is a key factor in territorial sustainable development. Moreover, groundwater constitutes the survival element of human life and ecosystems in arid oasis areas. Therefore, groundwater potential (GWP) identification represents a crucial step for its management and sustainable development. This study aimed to map the GWP using ten algorithms, i.e., shallow models comprising: multilayer perceptron, k-nearest neighbor, decision tree, and support vector machine algorithms; hybrid models comprising: voting, random forest, adaptive boosting, gradient boosting (GraB), and extreme gradient boosting; and the deep learning neural network. The GWP inventory map was prepared using 884 binary data, with “1” indicating a high GWP and “0” indicating an extremely low GWP. Twenty-three GWP-influencing factors have been classified into numerical data using the frequency ration method. Afterwards, they were selected based on their importance and multi-collinearity tests. The predicted GWP maps show that, on average, only 11% of the total area was predicted as a very high GWP zone and 17% and 51% were estimated as low and very low GWP zones, respectively. The performance analyses demonstrate that the applied algorithms have satisfied the validation standards for both training and validation tests with an average area under curve of 0.89 for the receiver operating characteristic. Furthermore, the models’ prioritization has selected the GraB model as the outperforming algorithm for GWP mapping. This study provides decision support tools for sustainable development in an oasis area. Full article

Recently, a variety of non-systematic satisfiability studies on Discrete Hopfield Neural Networks have been introduced to overcome a lack of interpretation. Although a flexible structure was established to assist in the generation of a wide range of spatial solutions that converge on global minima, the fundamental problem is that the existing logic completely ignores the probability dataset’s distribution and features, as well as the literal status distribution. Thus, this study considers a new type of non-systematic logic termed S-type Random k Satisfiability, which employs a creative layer of a Discrete Hopfield Neural Network, and which plays a significant role in the identification of the prevailing attribute likelihood of a binomial distribution dataset. The goal of the probability logic phase is to establish the logical structure and assign negative literals based on two given statistical parameters. The performance of the proposed logic structure was investigated using the comparison of a proposed metric to current state-of-the-art logical rules; consequently, was found that the models have a high value in two parameters that efficiently introduce a logical structure in the probability logic phase. Additionally, by implementing a Discrete Hopfield Neural Network, it has been observed that the cost function experiences a reduction. A new form of synaptic weight assessment via statistical methods was applied to investigate the effect of the two proposed parameters in the logic structure. Overall, the investigation demonstrated that controlling the two proposed parameters has a good effect on synaptic weight management and the generation of global minima solutions. Full article

The common feature for a nontrivial hard problem is the existence of nontrivial topological structures, non-planarity graphs, nonlocalities, or long-range spin entanglements in a model system with randomness. For instance, the Boolean satisfiability (K-SAT) problems for K ≥ 3 ${\mathrm{M}}_{\mathrm{SAT}}^{\mathrm{K}\ge 3}$ are nontrivial, due to the existence of non-planarity graphs, nonlocalities, and the randomness. In this work, the relation between a spin-glass three-dimensional (3D) Ising model ${ \mathrm{M}}_{\mathrm{SGI}}^{3\mathrm{D}}$ with the lattice size N = mnl and the K-SAT problems is investigated in detail. With the Clifford algebra representation, it is easy to reveal the existence of the long-range entanglements between Ising spins in the spin-glass 3D Ising lattice. The internal factors in the transfer matrices of the spin-glass 3D Ising model lead to the nontrivial topological structures and the nonlocalities. At first, we prove that the absolute minimum core (AMC) model ${\mathrm{M}}_{\mathrm{AMC}}^{3\mathrm{D}}$ exists in the spin-glass 3D Ising model, which is defined as a spin-glass 2D Ising model interacting with its nearest neighboring plane. Any algorithms, which use any approximations and/or break the long-range spin entanglements of the AMC model, cannot result in the exact solution of the spin-glass 3D Ising model. Second, we prove that the dual transformation between the spin-glass 3D Ising model and the spin-glass 3D Z₂ lattice gauge model shows that it can be mapped to a K-SAT problem for K ≥ 4 also in the consideration of random interactions and frustrations. Third, we prove that the AMC model is equivalent to the K-SAT problem for K = 3. Because the lower bound of the computational complexity of the spin-glass 3D Ising model ${\mathrm{C}}_{\mathrm{L}}\left({\mathrm{M}}_{\mathrm{SGI}}^{3\mathrm{D}}\right)$ is the computational complexity by brute force search of the AMC model ${\mathrm{C}}^{\mathrm{U}}\left({\mathrm{M}}_{\mathrm{AMC}}^{3\mathrm{D}}\right)$, the lower bound of the computational complexity of the K-SAT problem for K ≥ 4 ${\mathrm{C}}_{\mathrm{L}}\left({\mathrm{M}}_{\mathrm{SAT}}^{\mathrm{K}\ge 4}\right)$ is the computational complexity by brute force search of the K-SAT problem for K = 3 ${ \mathrm{C}}^{\mathrm{U}}\left({\mathrm{M}}_{\mathrm{SAT}}^{\mathrm{K}=3}\right)$. Namely, ${\mathrm{C}}_{\mathrm{L}}\left({\mathrm{M}}_{\mathrm{SAT}}^{\mathrm{K}\ge 4}\right)={\mathrm{C}}_{\mathrm{L}}\left({\mathrm{M}}_{\mathrm{SGI}}^{3\mathrm{D}}\right)\ge {\mathrm{C}}^{\mathrm{U}}\left({\mathrm{M}}_{\mathrm{AMC}}^{3\mathrm{D}}\right)={\mathrm{C}}^{\mathrm{U}}\left({\mathrm{M}}_{\mathrm{SAT}}^{\mathrm{K}=3}\right)$. All of them are in subexponential and superpolynomial. Therefore, the computational complexity of the K-SAT problem for K ≥ 4 cannot be reduced to that of the K-SAT problem for K < 3. Full article