Room temperature superconductivity has recently been reported for a carbonaceous sulfur hydride (CSH) under high pressure by Snider et al [1]. The paper reports sharp drops in magnetic susceptibility as a function of temperature for five different pressures, that are interpreted as signaling a superconducting transition. Here I question the validity and faithfulness of the magnetic susceptibility data presented in the paper by comparison with the measured raw data reported by two of the authors of ref. [2]. This invalidates the assertion of the paper [1] that the susceptibility measurements support the case for superconductivity in this compound.

The paper presents a modeling framework to analyze the effect of episodic rainfall supply on groundwater dynamics in the Ionian coastal plain multilayered aquifer. The focus is essentially on the short-term behavior of the shallowest layer, with a specific analysis on episodic rainfall events. In the studied aquifer, groundwater level responds sensitively to rainfall events, highlighting the presence of preferential recharge zones. The hydraulic head peak is a function of groundwater level antecedent to the rainfall event. A kinematic dispersion wave model was used to model infiltration processes via preferential pathways. A one-dimensional and non-linear particle based numerical model was developed. Particles with constant water volume travel according to celerity and hydraulic dispersion to simulate the infiltration rate wave through the vadose zone. The flow rate that reaches the water table represents the input function to determine groundwater level fluctuations along groundwater flow direction and according to the lithological features of the surficial levels of the multilayered aquifer, its storage capacity changes passing from unconfined to confined conditions. The model was validated with high time resolution time series of precipitation and groundwater level coming from Terra Montonata meteo-climatic and groundwater level monitoring station. The developed model represents a basis for evaluating and predicting groundwater discharge of the shallowest layers of the Ionian coastal multilayered aquifer under natural conditions including episodic rainfall.

Although the Slicing Method (SM) is effective for calculating the volume of point cloud objects (PCOs), it is restricted in terms of applicability and practicability because of a certain contingency and directional defects. The Co-Opposite-Direction Slicing Method (CODSM) proposed in this paper is an improved method for calculating PCO volume by increasing parallel (co-opposite-direction) observation and considering the two-way mean as the result. This method takes full advantage of the mutual offsetting of random errors and the compensation of systematic directional errors, which can effectively overcome (or mitigate) the effect of random errors and reduce the effect of systematic errors in SM. In this paper, two typical objects, a cone model and a stone lion base, are the examples for calculating PCO volume using CODSM. The results show that CODSM has all the inherent advantages of SM and effectively weakens the volatility of random errors and the directionality of systematic errors from SM. Therefore, CODSM is a robust configuration upgrade of SM.

Research within the field of hydrology often focuses on comparing stochastic to machine learning (ML) forecasting methods. The comparisons performed are all based on case studies, while an extensive study aiming to provide generalized results on the subject is missing. Herein, we compare 11 stochastic and 9 ML methods regarding their multi-step ahead forecasting properties by conducting 12 large-scale computational experiments based on simulations. Each of these experiments uses 2 000 time series generated by linear stationary stochastic processes. We conduct each simulation experiment twice; the first time using time series of 100 values and the second time using time series of 300 values. Additionally, we conduct a real-world experiment using 405 mean annual river discharge time series of 100 values. We quantify the performance of the methods using 18 metrics. The results indicate that stochastic and ML methods perform equally well.

It is strongly desirable to accurately detect the clouds in hyperspectral images onboard before compression. However, conventional onboard cloud detection methods are not appropriate to all situation such as shadowed cloud or darken snow covered surfaces which are not identified properly in the NDSI test. In this paper, we propose a new spectral–spatial classification strategy to enhance the orbiting cloud screen performances obtained on hyperspectral images by integrating threshold exponential spectral angle map (TESAM), adaptive Markov random field (aMRF) and dynamic stochastic resonance (DSR). TESAM is performed to classify the cloud pixels coarsely based on spectral information. Then aMRF is performed to do optimal process by using spatial information, which improved the classification performance significantly. Some misclassification points still exist after aMRF processing because of the noisy data in the onboard environment. DSR is used to eliminate misclassification points in binary labeling image after aMRF. Taking level 0.5 data from hyperion as dataset, the average overall accuracy of the proposed algorithm is 96.28% after test. The method can provide cloud mask for the on-going EO-1 images and related satellites with the same spectral settings without manual intervention. The experiment indicate that the proposed method reveals better performance than the classical onboard cloud detection or current state-of-the-art hyperspectral classification methods.

Electrolysis stands as a pivotal method for environmentally sustainable hydrogen production. However, the formation of gas bubbles during the electrolysis process poses significant challenges by impeding the electrochemical reactions, diminishing cell efficiency, and dramatically increasing energy consumption. Furthermore, the inherent difficulty in detecting these bubbles arises from the non-transparency of the wall of electrolysis cells. Additionally, these gas bubbles induce alterations in the conductivity of the electrolyte, leading to corresponding fluctuations in the magnetic flux density outside of the electrolysis cell, which can be measured by externally placed magnetic sensors. By solving the inverse problem of the Biot-Savart Law, we can estimate the conductivity distribution as well as the void fraction within the cell. In this work, we study different approaches to solve the inverse problem including Invertible Neural Networks (INNs) and Tikhonov regularization. Our experiments demonstrate that INNs are much more robust to solving the inverse problem than Tikhonov regularization when the level of noise in the magnetic flux density measurements is not known or changes over space and time.

We extend Ziv and Lempel's model of finite-state encoders to the realm of lossy compression of individual sequences. In particular, the model of the encoder includes a finite-state reconstruction codebook followed by an information lossless finite-state encoder that compresses the reconstruction codeword with no additional distortion. We first derive two different lower bounds to the compression ratio that depend on the number of states of the lossless encoder. Both bounds are asymptotically achievable by conceptually simple coding schemes. We then show that when the number of states of the lossless encoder is large enough in terms of the reconstruction block-length, the performance can be improved, sometimes significantly so. In particular, the improved performance is achievable using a random-coding ensemble that is universal, not only in terms of the source sequence, but also in terms of the distortion measure.

Digital twins are gaining in popularity for simulating complex natural and urban environments. In this context, accurate segmentation of objects within 3D urban environments is of crucial importance. The aim of this project is to develop a methodology for extracting buildings from textured 3D meshes. To this end, PicassoNet-II, a semantic segmentation architecture is employed. The methodology also incorporates Markov field-based contextual analysis to assess post-segmentation features. In addition, building instantiation is performed using cluster analysis algorithms. Training this model to fit various datasets requires a large amount of annotated data, both from Quebec City, Canada, and from simulated data. Experimental results show that the use of simulated data improves segmentation accuracy, and the DBScan algorithm proves effective in extracting isolated buildings. This project paves the way for improved applications in 3D urban modeling, offering opportunities in fields ranging from urban planning to resource management. The positive results with simulated data reinforce the impact of this research on improving digital models of our ever-changing urban environments.

Post-training quantization is pivotal in deploying convolutional neural networks for mobile applications. Block-wise reconstruction with adaptive rounding, as employed in prior works like BrecQ and Qdrop, facilitates acceptable 4-bit quantization accuracy. However, adaptive rounding is time-intensive, and its constraint on weight optimization space curtails the potential for quantization performance. The optimality of block-wise reconstruction hinges on the quantization status of subsequent network blocks. In this investigation, we delve into the theoretical underpinnings of the limitations inherent in adaptive rounding and block-wise reconstruction. Our exploration leads to the development of a post-training quantization methodology, designated as AE-Qdrop. This algorithm operates in two distinct phases: block-wise reconstruction and global fine-tuning. The block-wise reconstruction phase introduces a progressive optimization strategy, superseding adaptive rounding, which not only augments quantization precision but also significantly improves quantization efficiency. To mitigate the risk of overfitting, we introduce a random weighted quantized activation mechanism. During the global fine-tuning phase, we account for interdependencies among quantized network blocks. The weight of each network block will be corrected with logit matching and feature matching. Extensive experiments validate that AE-Qdrop achieves high-precision and efficient quantization. For instance, in the case of 2-bit MobileNetV2, AE-Qdrop outperforms Qdrop by achieving a 6.26% enhancement in quantization accuracy and quintupling the quantization efficiency.

In recent years, computer-aided analysis techniques have emerged as valuable tools in assisting dermatologists by providing objective and efficient analysis of skin cancer images. This paper utilizes the combination of the Contourlet Transform (CT) and Local Binary Pattern (LBP) techniques for accurately recognizing borders, contrast changes, and shapes of skin cancer images. These results often contain many features, leading to high computational costs and potential over-fitting issues. Hence, we applied Particle Swarm Optimization (PSO) to select the most informative and discriminating features, reducing the dimensionality while retaining important information for accurate classification. After reducing the feature set with PSO, we applied these sets to Machine learning classification algorithms: Support Vector Machine (SVM), Random Forest (RF), and Neural Networks (NN). The results show that SVM has the lowest time complexity of 0.0458 seconds, followed by the Neural Network at 0.08730 seconds, and the Random Forest model has the highest time complexity of 0.1622 seconds. The SVM and Neural Network models are faster to train than the Random Forest model, making them more suitable for real-time or latency-sensitive applications. We also compared our proposed model with the state-of-the-art models and obtained the accuracy of 86.9%, which is the highest among the models.

Wearable devices have become ubiquitous, collecting rich temporal data that offers valuable insights into human activities, health monitoring, and behavior analysis. Leveraging this data, researchers have developed innovative approaches to classify and predict time-based patterns and events in human life. Time-based techniques allow the capture of intricate temporal dependencies, which is the nature of the data coming from wearable devices. This paper focuses on predicting well-being factors, such as stress, anxiety, positive and negative affect, on the Tesserae dataset collected from office workers. We examine the performance of different methodologies, including deep learning architectures, LSTM, ensemble techniques, Random Forest (RF) and XGBoost and compare their performances for time-based and non-time-based versions. In time-based versions, we investigate the effect of previous records of well-being factors on the upcoming ones. The overall results show that time-based LSTM performs the best among conventional (non-time-based) RF, XGBoost, and LSTM. The performance even increases when we consider a more extended previous period, in this case, 3 past-days rather than 1 past-day to predict the next day. Furthermore, we explore the corresponding biomarkers for each well-being factor using feature ranking. The obtained rankings are compatible with the psychological literature. In this work, we validated them based on device measurements rather than subjective survey responses.

Downward short-wave (SW) solar radiation is the only essential energy source powering the atmospheric dynamics, ocean dynamics, biochemical processes, etc. on our planet. Clouds are the main factor limiting the SW flux over the land and the Ocean. For the accurate meteorological measurements of the SW flux one needs expensive equipment - pyranometers. For some cases where one does not need golden-standard quality of measurements, we propose estimating incoming SW radiation flux using all-sky optical RGB imagery which is assumed to incapsulate the whole information about the SW flux. We used DASIO all-sky imagery dataset with corresponding SW downward radiation flux measurements registered by an accurate pyranometer. The dataset has been collected in various regions of the World Ocean during several marine campaigns from 2014 to 2022, and it will be updated. We demonstrate the capabilities of several machine learning models in this problem, which are multilinear regression, Random Forests, Gradient Boosting and convolutional neural networks (CNN). We also applied the inverse target frequency (ITF) re-weighting of the training subset and the approach of pre-classification in order to raise the SW flux approximation quality. We found that the CNN is capable of approximating downward SW solar radiation with higher accuracy compared to existing empiric parameterizations. We also found that the ITF reweighting of the training subset increases the approximation quality substantially. The estimates of the SW radiation flux using all-sky imagery may be of particular use in case of the need for the fast radiative budgets assessment of a site.

We construct admissible circulant Laplacian matrix functions as generators for strictly increasing random walks on the integer line. These Laplacian matrix functions refer to a certain class of Bernstein functions. The approach has connections with biased walks on digraphs. Within this framework, we introduce a space-time generalization of the Poisson process as a strictly increasing walk with discrete Mittag-Leffler jumps subordinated to a (continuous-time) fractional Poisson process. We call this process ‘space-time Mittag-Leffler process’. We derive explicit formulae for the state probabilities which solve a Cauchy problem with a Kolmogorov-Feller (forward) difference-differential equation of general fractional type. We analyze a “well-scaled” diffusion limit and obtain a Cauchy problem with a space-time convolution equation involving Mittag-Leffler densities. We deduce in this limit the ‘state density kernel’ solving this Cauchy problem. It turns out that the diffusion limit exhibits connections to Prabhakar general fractional calculus. We also analyze in this way a generalization of the space-time fractional Mittag-Leffler process. The approach of construction of good Laplacian generator functions has a large potential in applications of space-time generalizations of the Poisson process and in the field of continuous-time random walks on digraphs.

Exponential increase in mobile video delivery will continue with the demand for higher resolution, multi-view and large-scale multicast video services. Novel fifth generation (5G) 3GPP New Radio (NR) standard will bring a number of new opportunities for optimizing video delivery across both 5G core and radio access network. One of the promising approaches for video quality adaptation, throughput enhancement and erasure protection is the use of packet-level random linear network coding (RLNC). In this work, we discuss the integration of RLNC into the 5G NR standard, building upon the ideas and opportunities identified in 4G LTE. We explicitly identify and discuss in detail novel 5G NR features that provide support for RLNC-based video delivery in 5G, thus pointing out to the promising avenues for future research.

Urban sprawl propelled by rapid population growth leads to the shrinkage of productive agricultural lands and pristine forests in the suburban areas and, in turn, substantially alters ecosystem services. Hence, the quantification of urban sprawl is crucial for effective urban planning, and environmental and ecosystem management. Like many megacities in fast growing developing countries, Chennai, the capital of Tamilnadu and one of the business hubs in India, has experienced extensive urban sprawl triggered by the doubling of total population over the past three decades. We employed the Random Forest (RF) classification on Landsat imageries from 1991, 2003, and 2016, and computed spatial metrics to quantify the extent of urban sprawl within a 10km suburban buffer of Chennai. The rate of urban sprawl was quantified using Renyi’s entropy, and the urban extent was predicted for 2027 using land-use and land-cover change modeling. A 70.35% increase in urban areas was observed for the suburban periphery of Chennai between 1991 and 2016. The Renyi’s entropy value for year 2016 was ≥ 0.9, exhibiting a two-fold rate of urban sprawl. The spatial metrics values indicate that the existing urban areas of Chennai became denser and the suburban agricultural, forests and barren lands were transformed into fragmented urban settlements. The forecasted urban growth for 2027 predicts a conversion of 13670.33ha (16.57 % of the total landscape) of existing forests and agricultural lands into urban areas with an associated increase in the entropy value of 1.7. Our findings are relevant for urban planning and environmental management in Chennai and provide quantitative measures for addressing the social-ecological consequences of urban sprawl and the protection of ecosystem services.

Non-Linear Simulation by Harmonic Balance Techniques of Load Modulated Power Amplifier Driven by Random Modulated Signals. Comparison with measured results.

A random variable X that is base b Benford will not in general be base c Benford when c is not equal to b. This paper builds on two of my earlier papers and is an attempt to cast some light on the issue of base dependence. Following some introductory material, the “Benford spectrum” of a positive random variable is introduced and known analytic results about Benford spectra are summarized. Some standard machinery for a “Benford analysis” is introduced and combined with my method of “seed functions” to yield tools to analyze the base c Benford properties of a base b Benford random variable. Examples are generated by applying these general methods to several families of Benford random variables. Berger and Hill's concept of “base-invariant significant digits” is discussed. Some potential extensions are sketched.

Polymers in highly confined geometries can display complex morphologies including ordered phases. A basic component of a theoretical analysis of their phase behavior in confined geometries is the knowledge of the number of possible single-chain conformations compatible with the geometrical restrictions and the established crystalline morphology. While the statistical properties of unrestricted self-avoiding random walks (SAWs) both on and off-lattice are very well known, the same is not true for SAWs in confined geometries. The purpose of this contribution is a) to enumerate the number of SAWs on the simple cubic (SC) and face-centered cubic (FCC) lattices under confinement for moderate SAW lengths, and b) to obtain an approximate expression for their behavior as a function of chain length, type of lattice, and degree of confinement. This information is an essential requirement for the understanding and prediction of entropy-driven phase transitions of model polymer chains under confinement. In addition, a simple geometric argument is presented that explains, to first order, the dependence of the number of restricted SAWs on the type of SAW origin.

The ever-evolving ways attacker continues to im prove their phishing techniques to bypass existing state-of-the-art phishing detection methods pose a mountain of challenges to researchers in both industry and academia research due to the inability of current approaches to detect complex phishing attack. Thus, current anti-phishing methods remain vulnerable to complex phishing because of the increasingly sophistication tactics adopted by attacker coupled with the rate at which new tactics are being developed to evade detection. In this research, we proposed an adaptable framework that combines Deep learning and Randon Forest to read images, synthesize speech from deep-fake videos, and natural language processing at various predictions layered to significantly increase the performance of machine learning models for phishing attack detection.

This study aims to clarify the influence of photographic environments under different light sources on image-based SPAD value prediction. Radish leaf patches of 1.5 cm diameter were photographed under halogen or LED light. The input variables for the SPAD value prediction using random forests were RGB values, HSL values, and HSV values. Additionally, the light color temperature (LCT) and illuminance (ILL) were used as the input variables. Model performance was assessed using Pearson’s correlation coefficient (COR), Nash-Sutcliffe efficiency (NSE), and root mean squared error (RMSE). SPAD value prediction resulted in high accuracy in a stable light environment; CORRGB+ILL+LCT and CORHSL+ILL+LCT were 0.929 and 0.922, respectively. Image-based SPAD value prediction was effective under halogen light with a similar color temperature at dusk; CORRGB+ILL and CORHSL+ILL were 0.895 and 0.876, respectively. The HSL value under LED could be used to predict the SPAD value with high accuracy; COR, NSE, and RMSE were 0.972, 0.944, and 2.07, respectively. The partial dependence plots of the H value indicate a change from blue to green with increasing SPAD values. Further studies are required to examine this method under outdoor conditions in spatiotemporally dynamic light environments.

Human-to-human communication via the computer is mainly done using a keyboard or microphone. In the field of Virtual Reality (VR), where the most immersive experience possible is desired, the use of a keyboard contradicts this goal, while the use of a microphone is not always desirable (e.g. silent commands during task force training) or simply not possible (e.g. if the user has a hearing loss). Data gloves help to increase immersion within the VR as they correspond to our natural interaction. At the same time, they offer the possibility to accurately capture hand shapes, such as those used in non-verbal communication (e.g. thumbs up, okay gesture, ...) and in sign language. In this paper, we present a hand shape recognition system using Manus Prime X data gloves, including data acquisition, data preprocessing, and data classification to enable nonverbal communication within VR. We investigate the impact on accuracy and classification time of using an Outlier Detection and a Feature Selection approach in our data preprocessing. To obtain a more generalized approach, we also studied the impact of artificial Data Augmentation, i.e., we create new artificial data from the recorded and filtered data to augment the training dataset. With our approach, 56 different hand shapes could be distinguished with an accuracy of up to 93.28%. With a reduced number of 27 hand shapes, an accuracy of up to 95.55% could be achieved. Voting Meta-Classifier (VL2) has proven to be the most accurate, albeit slowest, classifier. A good alternative is Random Forest (RF), which was even able to achieve better accuracy values in a few cases and was generally somewhat faster. Outlier Detection has proven to be a effective approach, especially in improving classification time. Overall, we have shown that our hand shape recognition system using data gloves is suitable for communication within VR.

As renewable energy generation prediction systems have been introduced into the energy trading market, accurate prediction of solar photovoltaic (PV) energy generation has become a crucial challenge for ensuring stable trade of variable energy. Therefore, it is essential to quantitatively investigate and analyze current prediction technology and develop more advanced prediction systems. In this study, three models for predicting PV energy generation were investigated. Multiple regression, random forest, and gradient boosting machine (GBM) models were con-structed for 15 utility-scale power plants throughout South Korea. Model performance was evaluated in terms of root mean square error (RMSE) and mean absolute error (MAE). The multiple regression-based model had an RMSE of 12.00% and MAE of 9.06%. The random forest model had an RMSE of 11.69% and MAE of 8.61%. The GBM model had an RMSE of 11.34% and MAE of 8.18%, indicating its superior accuracy among the three models in predicting PV energy generation. These findings provide valuable insights that may contribute to the development of advanced PV energy generation models and their application in grid operations.

This article introduces a novel approach, termed the Asymmetric Probabilistic Tsetlin (APT) Machine, which incorporates the Stochastic Point Location (SPL) algorithm with the Asymmetric Steps technique into the Tsetlin Machine (TM). APT introduces stochasticity into the state transitions of Tsetlin Automata (TA) by leveraging the SPL algorithm, thereby enhancing pattern recognition capabilities. To enhance random search processes, we introduced a decaying normal distribution into the procedure. Meanwhile, the Asymmetric Steps approach biases state transition probabilities towards specific input patterns, further elevating operational efficiency. The efficacy of the proposed approach is assessed across diverse benchmark datasets for classification tasks. The performance of APT is compared with traditional machine learning algorithms and other Tsetlin Machine models, including the Asymmetric Tsetlin (AT) Machine, characterized by deterministic rules for Asymmetric transitions, and the Classical Tsetlin (CT) Machine, employing deterministic rules for symmetric transitions. Strikingly, the introduced APT methodology demonstrates highly competitive outcomes compared to established machine learning methods. Notably, both APT and AT exhibit state-of-the-art performance, surpassing the Classical Tsetlin Machine, emphasizing the efficacy of asymmetric models for achieving superior outcomes. Remarkably, APT exhibits even better performance than AT, particularly in handling complex datasets.

The article obtains large deviation asymptotic for sub-critical communication networks modelled as signal-interference-noise-ratio(SINR) random networks. To achieve this, we define the empirical power measure and the empirical connectivity measure, as well as prove joint large deviation principles(LDPs) for the two empirical measures on two different scales. Using the joint LDPs, we prove an Asymptotic equipartition property(AEP) for wireless telecommunication Networks modelled as the subcritical SINR random networks. Further, we prove a Local Large deviation principle(LLDP) for the sub-critical SINR random network. From the LLDPs, we prove the large deviation principle, and a classical McMillan Theorem for the stochastic SINR model processes. Note that, the LDPs for the empirical measures of this stochastic SINR random network model were derived on spaces of measures equipped with the $\tau-$ topology, and the LLDPs were deduced in the space of SINR model process without any topological limitations. We motivate the study by describing a possible anomaly detection test for SINR random networks.

In this work we identify combinations of technological activities that signal the presence local capabilities in a country to successfully export a product. We use country-level patent and trade data to generate a multi-layer network, and we apply maximization of entropy to generate synthetic data to effectively divide signal from noise. We show that in several sectors the signal far exceed the noise. Our exercise provides robust evidence of the presence of synergies between technologies to explain trade performances in specific markets. This can be highly useful for policy makers, to inform industrial and innovation policies.

Keywords: Electrical power systems, Support vector machines, Random Forest, Machine learning, Wavelet transform, Transmission lines fault, Electrical power quality, Short circuit, Classification of faults, Localization of faults, Decision trees, Ensemble learning, K-nearest neighbors.

Several factors impact the durability of concrete bridge decks, including traffic loads, fatigue, temperature changes, environmental stress, and maintenance activities. Detecting problems such as corrosion, delamination, or concrete degradation early on can lower maintenance costs. Nondestructive evaluation (NDE) techniques can detect these issues at early stages. Each NDE method, meanwhile, has limitations that reduce the accuracy of the assessment. In this study, multiple NDE technologies were combined with machine learning algorithms to improve the interpretation of half-cell potential (HCP) and electrical resistivity (ER) measurements. A parametric study was performed to analyze the influence of five parameters on HCP and ER measurements, such as degree of saturation, corrosion length, delamination depth, concrete cover, and moisture condition of delamination. The results were obtained through finite element simulations and used to build two machine learning algorithms, a classification algorithm and a regression algorithm, based on the Random Forest methodology. The algorithms were tested using data collected from a bridge deck in the BEAST® facility. Both machine learning algorithms were effective in improving the interpretation of ER and HCP measurements using data from multiple NDE technologies.

Wireless Sensor Networks (WSN) are the core of Internet of Things and require cryptographic protection due to the increase number of attacks. Cryptographic methods for WSN should be fast and consume low power as these networks consist of battery-powered devices and constrained microcontrollers. NTRU, the fastest and secure public key cryptosystem, uses high degree polynomials, and is susceptible to the lattice basis reduction attack (LBRA). CPKC, proposed by NTRU authors, works on integers modulo $q$ and is easily attackable by LBRA since it uses small numbers for the sake of the correct decryption. Herein, RCPKC, a random congruential public key cryptosystem working on integers modulo $q$ is proposed, such that the norm of a two-dimensional vector formed by its private key is greater than $\sqrt{q}$. RCPKC works similar to NTRU, and it is a secure version of insecure CPKC. RCPKC specifies a range from which the random numbers shall be selected, and it provides correct decryption for valid users and incorrect decryption for an attacker using LBRA by Gaussian lattice reduction. Because of its resistance to LBRA, RCPKC is more secure. Simultaneously, due to the use of big numbers instead of high degree polynomials, RCPKC is about 24 (7) times faster in encryption (decryption) than NTRU. Also, RCPKC is more three times faster than the most effective known NTRU variant, BQTRU. Compared to NTRU, RCPKC reduces energy consumption at least seven times that allows increasing life-time of unattended WSN more than seven times.

Tree species composition is an important key element for biodiversity and sustainable forest management, and hyperspectral data provide detailed spectral information, which can be used for tree species classification. There are two main challenges for using hyperspectral imagery: a) Hughes phenomena, meaning by increasing the number of bands in hyperspectral imagery, the number of required classification samples would increase exponentially, and b) in a more complex environment, such as riparian mixed forest, focusing on spectral variability per pixel may not be adequate for definability of tree species. Therefore, the focus of this study is to assess spectral-spatial dimensionality reduction of airborne hyperspectral imagery by using minim noise fraction (MNF) transformation, and object-based image analysis (OBIA). An airborne prism experiment (APEX) hyperspectral imagery was used. A study area was a riparian mixed forest located along the Salzach river, and six tree species including Picea abies, Populus (canadensis and balsamifera), Fraxinus excelsior, Alnus incana, and Salix alba were selected. A machine learning algorithm random forest (RF) was used to train and apply a prediction model for classification. Using a spectral dimensionality reduced APEX, a pixel-level classification was also done. According to a confusion matrix, the object-level classification of MNF-derived components achieved the overall accuracy of 85 %, and kappa coefficient of 0.805. The performance of classes according to producer’s accuracy varied between 80% for Fraxinus excelsior, Alnus incana, and Populus canadensis to 90% for Salix alba and Picea abies. Comparison the results to a pixel-level classification, showed a better performance of object-level classification (an overall accuracy of 63% and Kappa coefficient of 0.559 were achieved for pixel-level classification). The performance of classes using pixel-based classification varied 45 % for Alnus incana to 80% for Picea abies. In general, Spectral-spatial complexity reduction using MNF transformation and object-level classification yielded a statistically satisfactory results.

Quaking aspen (Populus tremuloides Michx.) is an important deciduous species in western U.S. forests. Existing maps of aspen distribution are based on Landsat imagery and often miss small stands (<0.09 ha or 30 m²), which rapidly regrow when managed or following disturbance. In this study, we present methods for deriving a new regional map of aspen forests using one year of Sentinel-1 (S1) and Sentinel-2 (S2) imagery in Google Earth Engine. We assessed the annual phenology of aspen in the Southern Rockies and leveraged the frequent temporal resolution of S1 and S2 to create ecologically relevant seasonal composites. Additionally, we derived spectral indices and radar textural features targeting the canopy structure, moisture, and chlorophyll content. Using spatial block cross-validation and Random Forests, we assessed the accuracy of different scenarios and selected the best performing set of features for classification. Comparisons were then made with existing landcover products across the study region. The resulting map improves on existing landcover products in both accuracy (average F1-score = 93.1%) and detection of smaller forest patches. These methods enable accurate mapping at spatial and temporal scales relevant to forest management for one of the most widely distributed tree species in North America.

Gravity played an important role in the development of life on earth. The effect of gravity on a living organisms can be investigated by controlling the magnitude of gravity. Most reduced gravity experiments are conducted on the lower earth orbit (LEO) in the International Space Station (ISS). However, running experiments in ISS face challenges such as high cost, extreme condition, lack of direct accessibility, and long waiting period. Therefore, researchers have developed various ground-based devices and methods to perform reduced gravity experiments. However, the search for life outside the earth requires more intensive research. Advancements in conventional methods and the development of new tools are required for this purpose. The advantages of Lab-on-a-Chip (LOC) devices make them an attractive option for simulating microgravity. This paper briefly reviews the advancement of LOC technologies for simulating microgravity in a earth-based laboratory.

Abstract: Although experimental attempts to measure a single molecule/particle at room temperature or under physiological conditions without immobilization, for example on a surface, or without hydrodynamic flow have so far failed, this failure has given impetus to the underlying theory of Brownian motion towards its stochastic due to diffusion. Quantifying the thermodynamic jitter of molecules/particles inspires many and forms the theoretical basis of single-molecule/single-particle biophysics and biochemistry. For the first time, our simulation results for a live cell (cytoplasm) show that the tracks of individual single molecules are localized in Brownian motion, while there is fanning out in fractal diffusion (anomalous diffusion).

To minimise environmental impact, avoid regulatory penalties, and improve competitiveness, energy-intensive manufacturing firms require accurate forecasts of their energy consumption so that precautionary and mitigation measures can be taken. Deep learning is widely touted as a superior analytical technique to traditional artificial neural networks, machine learning, and other classical time series models due to its high dimensionality and problem solving capabilities. Despite this, research on its application in demand-side energy forecasting is limited. We compare two benchmarks (Autoregressive Integrated Moving Average (ARIMA), and an existing manual technique used at the case site) against three deep learning models (simple Recurrent Neural Networks (RNN), Long Short-Term Memory (LSTM), and Gated Recurrent Unit (GRU)) and three machine learning models (Support Vector Regression (SVM), Random Forest, and K-Nearest Neighbors (KNN)) for short term load forecasting (STLF) using data from a Brazilian thermoplastic resin manufacturing plant. We use the grid search method to identify the best configurations for each model, and then use Diebold-Mariano testing to confirm the results. Results suggests that the legacy approach used at the case site is the worst performing, and that the GRU model outperformed all other models tested.

Compressive sensing (CS) is a technique that allows a signal vector to be reconstructed with a number of linear measurements far fewer than its size. In this study, optical hybrid cryptography with simultaneous compressive sensing based on orthogonal matching pursuit (OMP) is proposed as an alternative solution to the two important problems in communications, namely, effective / efficient / signal processing and secure encryption/decrypton. The whole system is able to both compress and encrypt data with attack immunity.

L\'evy walks represent important modeling tools for variety of real life processes. Their natural scaling limits are known to be described by the so-called material fractional derivatives. So far these scaling limits were derived for spatially homogeneous walks, where Fourier and Laplace transforms represent natural tools of analysis. Here we derive the corresponding limiting equations in the case of position depending times and velocities of walks, where Fourier transforms cannot be effectively applied. In fact, we derive three different limits (specified by the way the process is stopped at an attempt to cross the boundary), leading to three different multi-dimensional versions of Caputo-Dzherbashian derivatives, which correspond to different boundary conditions for the generators of the related Feller semigroups and processes. Some other extensions and generalisations are analysed.

This study presents a method for the rapid and accurate generation of two-dimensional (2D) orthomosaic maps using selected image data collected by drone-captured video. The focus is on developing a real-time method capable of creating maps more quickly than image selection. The scale-invariant feature transform (SIFT) algorithm is applied to drone images to extract features in various scale regions. For feature point matching, a matching method based on the fast library for approximate nearest neighbors (FLANN) was adopted. A comparison of the computational speed of the FLANN with that of the k-nearest neighbors (KNN) and brute force matcher during the matching process revealed FLANN's superior capability for real-time data processing. The random sample consensus (RANSAC) algorithm was employed to enhance the accuracy of the matching by removing outliers, effectively identifying and eliminating mismatches, and reinforcing the reliability of feature point matching. The combination of SIFT, FLANN, and RANSAC algorithms demonstrates the capacity to process drone-captured image data in real time, facilitating the generation of precise 2D orthomosaic maps. The proposed method was assessed and validated using imagery obtained as the drone executed curvilinear and straight flight paths, confirming its accuracy and operational efficiency concurrently with the image capture process.

Commercial buildings are a significant consumer of energy worldwide. Logistics facilities, and specifically warehouses, are a common building type yet under-researched in the demand-side energy forecasting literature. Warehouses have an idiosyncratic profile when compared to other commercial and industrial buildings with a significant reliance on a small number of energy systems. As such, warehouse owners and operators are increasingly entering in to energy performance contracts with energy service companies (ESCOs) to minimise environmental impact, reduce costs, and improve competitiveness. ESCOs and warehouse owners and operators require accurate forecasts of their energy consumption so that precautionary and mitigation measures can be taken. This paper explores the performance of three machine learning models (Support Vector Regression (SVR), Random Forest, and Extreme Gradient Boosting (XGBoost)), three deep learning models (Recurrent Neural Networks (RNN), Long Short-Term Memory (LSTM), and Gated Recurrent Unit (GRU)), and a classical time series model, Autoregressive Integrated Moving Average (ARIMA) for predicting daily energy consumption. The dataset comprises 8,040 records generated over an 11-month period from January to November 2020 from a non-refrigerated logistics facility located in Ireland. The grid search method was used to identify the best configurations for each model. The proposed XGBoost models outperform other models for both very short load forecasting (VSTLF) and short term load forecasting (STLF); the ARIMA model performed the worst.

Software project estimating (SPE) is a powerful but necessary step in the production of projects for software. Software project estimating includes several components, estimating software time, software resources, software costs, and software effort estimation (SEE). SEE seeks to estimate the number of "hours-person" and "months-person" of work required for developing or managing a software program. During the initial phase of the development of software, future efforts are impossible to predict. To estimate effort, many deep learning (DL) and machine learning (ML) models were previously created. For estimate, single-model techniques and ensemble methods were investigated in this research. Ensemble methods involve a combination of multiple separate models. Bagging, boosting, and voting were the ensemble methods looked into for estimation. Datasets considered for estimation were COCOMO81, COCOMONasa I, COCOMONasa II, Albrecht, Maxwell, China, Desharnais, Desharnais_1_1, Kitchenham, Boehm, and Belady. The evaluation criteria used MAE, RAE, RMSE, RRSE, and CC. The result from previous studies is that the total size of the set of data utilized is small in predicting the effort, as the largest size of the set of data used is the China dataset containing only 499 projects. So, in this study, the dataset has been merged to increase the total size of the set of data and increase the accuracy of prediction. The results indicated that the suggested merged dataset increased effort estimation accuracy.

Stroke constitutes a significant public health concern due to its impact on mortality and morbidity. This study investigates the utility of machine learning algorithms in predicting stroke and identifying key risk factors using data from the Suita study, comprising 7,389 participants and 53 variables. Initially, unsupervised K-prototype clustering categorized participants into risk clusters, while five supervised models including Logistic Regression (LR), Random Forest (RF), Support Vector Machine (SVM), eXtreme Gradient Boosting (XGBoost), and Light Gradient Boosted Machine (Light-GBM) were employed to predict stroke outcomes. Stroke incidence disparities among identified risk clusters using the unsupervised K-prototype clustering method are substantial, according to the findings. Supervised learning, particularly RF was a preferable option because of the higher levels of performance metrics. The Shapley Additive Explanations (SHAP) method identified age, systolic blood pressure, hypertension, estimated glomerular filtration rate, metabolic syndrome, and blood glucose level as key predictors of stroke, aligning with findings from the unsupervised clustering approach in high-risk groups. Additionally, previously unidentified risk factors such as elbow joint thickness, fructosamine, hemoglobin, and calcium level demonstrate potential for stroke prediction. In conclusion, machine learning facilitated accurate stroke risk predictions and highlighted potential biomarkers, offering a data-driven framework for risk assessment and biomarker discovery.

In this work, several random Boolean networks (RBN) are generated and analyzed from two characteristics: their time evolution diagram and their transition diagram. To do this, its randomness is estimated using three metrics, of which algorithmic complexity is the only one capable of revealing both transitions towards the chaotic regime and the algorithmic contribution of certain states to the transition diagram and their relationship with the order they occupy in the temporal evolution of the respective RBN.