Pedestrian Dead Reckoning (PDR) is a promising algorithm for indoor positioning. However, the accuracy of PDR degrades due to the accumulated error, especially in multi-floor buildings. This paper introduces a three-dimensional (3D) positioning method based on terrain feature matching to reduce the influence of accumulated error in multi-floor scene. The proposed method involves two steps: motion pattern recognition and position matching calibration. The motion pattern recognition aims to detect different motion states, i.e., taking the stairs or horizontal walking, from the streaming data. Then, stair entrances and corridor corners are matched with transition points of motion states and pedestrian turning points, respectively. After matching, calibration is performed to eliminate the accumulated errors. By carrying out experiments on a two-floor closed-loop path with a walking distance about 145 m, it is shown that this method can effectively reduce the accumulated error of PDR , achieving accurate 3D positioning . The average error is reduced from 6.60 m to 1.83 m.

The extraction of roof feature lines is an important foundation for realizing large-scale and batch 3D modeling. However, the current traditional point cloud segmentation algorithms do not have satisfactory results in extracting roof feature lines of Chinese traditional residential buildings. In this paper, taking Jingping Village in Western Hunan as an example, we propose a method that combines multiple algorithms based on slope segmentation of roof patches to extract feature lines. Firstly, VDVI and CSF algorithms are used to extract the building and roof point cloud based on the MVS point cloud. Secondly, according to roof features, village buildings are classified, and 3D roof point cloud is projected into 2D regular grid data. Finally, the roof slope is segmented via slope direction, and internal and external feature lines are obtained after refinement through Canny edge detection and Hough straight line detection. Results reveal that this method effectively extracts feature lines of low-building roofs in traditional villages, with slope-based roof surface segmentation accuracy surpassing 99.6%. This method significantly outperforms the RANSAC algorithm and region segmentation algorithm.

The task of weakly supervised point cloud semantic segmentation has received widespread attention and also has been widely used in autonomous driving, robotics, and modern industries. Due to the high dimensionality and large volume of point cloud data, many technical difficulties appeal to weakly supervised semantic processing, especially segmentation. However, weakly-supervised schemes usually provide only partial labelling information of the underlying point cloud data and thus need to effectively extract local features, geometric information, and contextual relationships only using these limited labelled data for supervised learning. To improve weakly-supervised semantic segmentation, we propose a novel segmentation network through the boundary-based feature aggregation based on a K-NN algorithm with down-sampling operation, and also introduce the smoothness loss and Siamese loss for effective segmentation. The experiments on public datasets demonstrate that our presented segmentation method exceeds most of the existing fully supervised and weakly-supervised methods in terms of mIoU. Specifically, our network has high segmentation accuracy on the labels of objects with similar geometrical structures, such as ceiling, wall, floor, chair and table, reaching 91.2%, 98.8%, 83.3%, 75.3% and 80.2%, respectively. Extensive experiments also illustrate its robustness, effectiveness, and generalization of the proposed weakly supervised segmentation network.

The research of object classification and part segmentation is a hot topic in computer vision. A considerable number of studies have been carried out about deep learning on 3D point clouds. However,it is challenging to achieve effective feature learning due to sparsity of point clouds. Recently, a variety of Transformers have been adopted to improve point cloud processing and display great potential. Nevertheless, large numbers of Transformer layers tend to incur huge computational and memory costs. PointNet++ is one of the most influential neural architectures for point cloud understanding. Although the accuracy of PointNet++ has been largely surpassed by recent networks, this does not mean that PointNet++ has no potential.Thus, this paper offer two major contributions that significantly improve PointNet++ performance. Firstly, we introduce a novel contextual feature extraction (CFE) block that significantly enhances the feature extraction capabilities of PointNet++ networks. Secondly, to further enhance feature fusion, we seamlessly integrate a mutual learning (ML) block into the network architecture. By embedding these two innovative blocks within each layer of the network, we not only enrich the network's functionality but also impart it with greater robustness and adaptability. The specific experiments were conducted on the S3DIS (6-fold cross-validation) and Modelnet40 datasets with 86.5% and 92.7% accuracy, respectively, which proved that our model is comparable or even better than most existing methods for classification and segmentation tasks.

This paper numerically investigates a 3D mesh independency study of a straight blade horizontal axis tidal turbine modelled using Computational Fluid Dynamics (CFD). The solution was produced by employing two turbulence models, the standard k-ε model and Shear Stress Transport (SST) in ANSYS CFX. Three parameters were investigated: mesh resolution, turbulence model, and power coefficient in the initial CFD, analysis. It was found that the mesh resolution and the turbulence model affect the power coefficient results. The power coefficients obtained from the standard k-ε model are 15% to 20% lower than the accuracy of the SST model. It can also be demonstrated that the torque coefficient increases with the increasing Tip Speed Ratio (TSR), but drops drastically after TSR = 5 and k-ε model failing to capture the non-linearity in the torque coefficient with the increasing TSR.

The development of one technology can be portrayed by common methods like Gartner’s hype cycle or S-curve, however, there is no method to characterize the feature distributions of multiple technologies within a specific domain. This study proposes a big data-based method in terms of four proposed features, namely versatility, significance, commerciality, and disruptiveness, to characterize the technologies within a given domain. The features of technologies are quantitively portrayed using the representative keywords and volumes of returned search results from Google and Google Scholar in two-dimensional analytical spaces of technique and application. We demonstrate the applicability of this method using 452 technologies in the domain of intelligent robotics. The results of our assessment indicate that the versatility values are normally distributed, while the values of significance, commerciality, and disruptiveness follow power-law distributions, in which few technologies possess higher feature values. We also show that significant technologies are more likely to be commercialized or causing potential disruption, as such technologies have higher scores in these features. Further, we validly prove the robustness of our approach via comparing historical trends with literature and characterizing technologies in reduced analytical spaces. Our method can be widely applied in analyzing feature distributions of technologies in different domains, and it can potentially be exploited in decisions like investment, trade, and science policy.

The Circular Bioeconomy (CBE) combines the concepts of bioeconomy and circular economy. As an alternative concept to the current fossil-based, linear economy, it de-scribes an economy based on the efficient valorization of biomass. It is regional in nature and aims to improve sustainability. An analysis of the transition process, by identifying its success criteria and assessing its impacts through the modelling of technology-specific scenarios is necessary to ensure that CBE concepts are sustainable. However, a compre-hensive consideration of regional influences on both is lacking. Based on extensive literature research and an expert survey, we (i) present a compre-hensive catalog of CBE success criteria and discuss their region-specific character and (ii) develop a methodology based on evaluation matrices that enable to match CBE technolo-gies with regions. The matrices support the evaluation of technological and regional characteristics influencing the successful CBE implementation. The results show that the success criteria "biomass resources", "technological", and "social" are perceived as highly important, and that most of the success criteria are both region- and technology-specific, highlighting the relevance of developing matrices to match them. We describe such matrices indicatively for the two broadest and most im-portant success criteria clusters “social acceptance” and “biomass supply chain”. With this, we substantiate the regional nature of CBE and raise the awareness on the importance of considering regional conditions in CBE transition processes. Furthermore, we provide practical guidance on how regional conditions can be reflected in the selection of technologies, e.g. in regional CBE technology scenarios.

The Doppler band compensated by the keystone transform (KT) is limited. Therefore, it needs to be used in conjunction with the Doppler ambiguity compensation function to correct the range migration (RM) caused by maneuvering targets with Doppler ambiguity. However, the KT implemented by sinc interpolation suffers from significant performance loss at boundaries of compensation Doppler bands. Additionally, in a multi-target scenario, KT implementation methods occupy high complexity when the Doppler range of targets spans over two compensation Doppler bands. To address aforementioned issues, this study presents a variable Doppler starting point keystone transform (VDSPKT) method, where a new form of ambiguity compensation function is constructed, turning the Doppler starting point of the compensation band in KT variable. Firstly, the position of the compensation Doppler band is changed from fixed to adjustable as needed, enhancing the flexibility of KT. Crucially, the connection points of the compensation Doppler bands in sinc interpolation are reset, avoiding the performance loss at their boundaries. Also, the compensation band is adjusted to cover the narrow Doppler frequency range caused by targets, significantly improving the computational efficiency. Finally, the simulation results demonstrate that the proposed approach effectively addresses the performance degradation and high computational complexity of KT in the aforementioned scenarios, resulting in a computational load reduced by approximately 50% compared to traditional methods.

In this paper, we present a multi-task model that predicts disparities and confidence levels in deep stereo matching simultaneously. We do this by combining its successful model for each separate task and obtaining a multitask model that can be trained with a proposed loss function. We show the advantages of this model compared to training and predicting disparity and confidence sequentially. This method enables an improvement of 15% to 30% in the area under the curve (AUC) metric when trained parallel rather than sequential. In addition, the effect of weighting the components in the loss function on the stereo and confidence performance is investigated. By improving the confidence estimate, the practicality of stereo estimators for creating distance images is increased.

The prevalence of hepatitis B and delta viruses (HBV/HDV) among people who use drugs (PWUD) remains largely unknown. In the context of one Philadelphia-based harm reduction organization (HRO), this study aimed to assess HBV/HDV prevalence and facilitate linkage to care. Participants completed a demographic HBV/HDV risk factor survey and were screened for HBV and reflexively for HDV if positive for HBV surface antigen or isolated core antibody. Fisher’s exact tests and regression were used to understand relationships between risks and HBV blood markers. Of the 498 participants, 126 (25.3%) were susceptible to HBV, 52.6% had been vaccinated against HBV, and 17.9% had recovered from a past infection. Eleven (2.2%) participants tested positive for isolated HBV core antibody, 10 (2.0%) for HBV surface antigen, and one (0.2%) for HDV antibody. History of incarceration was associated with current HBV infection, while transactional sex and experience of homelessness were predictive of previous exposure. This study found high rates of current and past HBV infection, and a 10% HBV/HDV co-infection rate. Despite availability of vaccine, one quarter of participants remained vulnerable to infection. Findings demonstrate the need to improve low-threshold HBV/HDV screening, vaccination, and linkage to care among PWUD. The study also identified gaps in the HBV/HDV care cascade, including lack of point-of-care diagnostics and lack of support for HROs to provide HBV services.

Extruded polystyrene (XPS) is frequently used in the construction of many different structures. It is therefore necessary to appropriately characterize its mechanical properties to ensure the safety of said structures. Among the available characterization tests, static bending tests are simple and easy to perform; owing to these characteristics, they should be performed more frequently than other tests. However, in static bending tests on XPS, there are several challenges owing to the high flexibility of XPS, and the chosen testing method and sample configuration affect the accuracy of characterization. In this study, three bending properties (Young’s modulus, proportional limit stress, and bending strength) of samples cut from an XPS panel were determined using three-point bending (TPB), four-point bending (FPB), and compression bending (CB) tests with varying sample span/depth ratios, and statistical analyses were performed to determine the relevance of the tests. The experimental results suggest that the TPB and CB tests were more feasible than the FPB test when the span/depth ratio was appropriately determined. However, clear differences were observed in the sample bending properties determined in these tests. In light of these findings, further studies should be conducted to elucidate these differences.

We generalize the point information gain (PIG) and derived quantities, i.e., point information gain entropy (PIE) and point information gain entropy density (PIED), for the case of the Rényi entropy and simulate the behavior of PIG for typical distributions. We also use these methods for the analysis of multidimensional datasets. We demonstrate the main properties of PIE/PIED spectra for the real data on the example of several images, and discuss further possible utilizations in other fields of data processing.

Panel data of our interest consist of a moderate number of panels, while the panels contain a small number of observations. An estimator of common breaks in panel means without a boundary issue for this kind of scenario is proposed. In particular, the novel estimator is able to detect a common break point even when the change happens immediately after the first time point or just before the last observation period. Another advantage of the elaborated change point estimator is that it results in the last observation in situations with no structural breaks. The consistency of the change point estimator in panel data is established. The results are illustrated through a simulation study. As a by-product of the developed estimation technique, a theoretical utilization for correlation structure estimation, hypothesis testing, and bootstrapping in panel data is demonstrated. A practical application to non-life insurance is presented as well.

To enhance the performance of visual SLAM in underwater environments, this paper presents an enhanced front-end method based on visual feature enhancement. The method comprises three modules aimed at optimizing and improving the matching capability of visual features from different perspectives. Firstly, to address issues related to insufficient underwater illumination and uneven distribution of artificial light sources, a brightness consistency recovery method is pro-posed. This method employs an adaptive histogram equalization algorithm to balance the brightness of images. Secondly, a method for denoising underwater suspended particulates is introduced to filter out noise from the images. After image-level processing, a combined underwater acousto-optic feature association method is proposed, which associates acoustic features from sonar with visual features, thereby providing distance information for the visual features. Finally, utilizing the AFRL dataset, the improved system incorporating the proposed enhancement methods is evaluated for performance against the OKVIS framework. The system achieves better trajectory estimation accuracy compared to OKVIS and demonstrates robustness in underwater environments.

This research introduces a hybrid feature extraction approach that combines Linear Discriminant Analysis (LDA) and Multilayer Perceptron (MLP) methods to address the challenges of reducing feature vector dimensionality and accurately classifying smartphone-based human activities. Moreover, to refine activity classification accuracy, Support Vector Machine (SVM) optimization with Stochastic Gradient Descent (SGD) is employed. LDA, a statistical tool, is leveraged to derive a new feature space for data projection, enhancing class separation and test feature label prediction. The proposed approach, named LMSS, was evaluated using the UCI-HAR dataset and compared with state-of-the-art models. The results demonstrate that the proposed approach outperformed the best-performing method over this dataset. It achieved an accuracy rate of 99.52%, precision of 99.55%, recall of 99.53%, and an F1-score of 99.54%, highlighting the effectiveness of the proposed method in accurately classifying the data.

This paper presents a system for identification of wind features, such as gusts and wind shear. These are of particular interest in the context of energy-efficient navigation of Small Unmanned Aerial Systems (UAS). The proposed system generates real-time wind vector estimates and a novel algorithm to generate wind field predictions. Estimations are based on the integration of an off-the-shelf navigation system and airspeed readings in a so-called direct approach. Wind predictions use atmospheric models to characterize the wind field with different statistical analyses. During the prediction stage, the system is able to incorporate, in a big-data approach, wind measurements from previous flights in order to enhance the approximations. Wind estimates are classified and fitted into a Weibull probability density function. A Genetic Algorithm (GA) is utilized to determine the shaping and scale parameters of the distribution, which are employed to determine the most probable wind speed at a certain position. The system uses this information to characterize a wind shear or a discrete gust and also utilizes a Gaussian Process regression to characterize continuous gusts. The knowledge of the wind features is crucial for computing energy-efficient trajectories with low cost and payload. Therefore, the system provides a solution that does not require any additional sensors. The system architecture presents a modular decentralized approach, in which the main parts of the system are separated in modules and the exchange of information is managed by a communication handler to enhance upgradeability and maintainability. Validation is done providing preliminary results of both simulations and Software-In-The-Loop testing. Telemetry data collected from real flights, performed in the Seville Metropolitan Area in Andalusia (Spain), was used for testing. Results show that wind estimation and predictions can be calculated at 1 Hz and a wind map can be updated at 0.4 Hz. Predictions show a convergence time with a 95% confidence interval of approximately 30 s.

Gastric cancer is the fifth most common and fourth deadliest cancer worldwide, with a bleak 5-year survival rate of about 20%. Despite significant research into its pathobiology, prognostic predictability remains insufficient due to pathologists’ heavy workloads and the potential for diagnostic errors. Consequently, there is a pressing need for automated and precise histopathological diagnostic tools. This study leverages Machine Learning and Deep Learning techniques to classify histopathological images into healthy and cancerous categories. By utilizing both handcrafted and deep features and shallow learning classifiers on the GasHisSDB dataset, we conduct a comparative analysis to identify the most effective combinations of features and classifiers for differentiating normal from abnormal histopathological images without employing fine-tuning strategies. Our methodology achieves an accuracy of 95% with the SVM classifier, underscoring the effectiveness of feature fusion strategies. Additionally, cross-magnification experiments produced promising results with accuracies close to 80% and 90% when testing the models on unseen testing images with different resolutions.

Feature selection is predominantly used in machine learning tasks, such as classification and regression. It selects a subset of features (relevant attributes of data points) from a larger set that contributes as optimally as possible to the informativeness of the model. There are exponentially many subsets of a given set, and thus, the exhaustive search is only practical for problems with at most a few dozen features. In the past, there have been attempts to reduce the search space using dynamic programming. However, models that consider similarity in pairs of features besides the quality of individual features do not provide the required optimal substructure. As a result, algorithms, which we will call suboptimal dynamic programming algorithms, find a solution that may deviate significantly from the optimal one. In this paper, we propose a dynamic programming algorithm with an iterative upgrade where the order of feature processing is inverted in each iteration. Such an alternating approach allows for improving the optimization function by using the score from the previous iteration to estimate the contribution of unprocessed features. The iterative process is proven to converge and terminate when the solution does not change in three successive iterations or when the number of iterations reaches the threshold. Results in more than 90 % of tests align with those of the exhaustive search, being competitive and often superior to the reference greedy approach. The validation was done by comparing the scores of output feature subsets and examining the accuracy of different classifiers learned on these features. In the context of feature selection, the proposed algorithm can be characterized as a filter method. However, we expect that the idea of alternating suboptimal optimization will soon be generalized to tasks beyond feature selection.

Hyperspectral images (HSI) contain abundant spectral information. Efficient extraction and utilization of this information for image classification remain prominent research topics. Previously, hyperspectral classification techniques primarily relied on statistical attributes and mathematical models of spectral data. Deep learning classification techniques have recently been extensively utilized for hyperspectral data classification, yielding promising outcomes. This study proposes a deep learning approach that uses polarization feature maps for classification. Initially, the polar coordinate transformation method is employed to convert the spectral information of all pixels in the image into spectral feature maps. Subsequently, the proposed Deep Context Feature Fusion Network (DCFF-NET) is utilized to classify these feature maps. The model is validated using three open-source hyperspectral datasets: Indian Pines, Pavia University, and Salinas. The experimental results indicated that DCFF-NET achieves excellent classification performance. Experimental results on three public HSI datasets demonstrate that the proposed method accurately recognizes different objects with an overall accuracy (OA) of 86.68%, 94.73%, and 95.14% based on the pixel method, and 98.15%, 99.86%, and 99.98% based on the pixel-patch method.

High dimensional datasets are highly likely to have redundant, irrelevant, and noisy features that negatively affect the performance of the classification algorithms. Selecting the most relevant features and reducing the dimensions of datasets by removing the undesired features is a dimensional reduction technique called Feature Selection (FS). In this paper, we propose an FS approach based on the Black Hole Algorithms (BHO) with a mutation technique called MBHO. Generally, BHO contains two major phases. At the exploitation phase, a set of stars are modified based on some rule and according to some objective function, the best star is selected as the black hole which attracts other stars. Furthermore, when a star gets closer to the event horizon, it will be swallowed and a new one will be randomly generated in the search space which thus is the exploration phase. However, randomness may cause the algorithm to fall into the trap of local optima, and to overcome such complications, inversion mutation is used. Furthermore, we modify a widely utilized objective function in most of the proposed works for wrapper feature selection by combining two new terms that are based on the correlation among the selected subset of features and the features and the classification label. We also utilize a transfer function, known as the V2 transfer function, to convert continuous values into discrete ones to enhance search. We assess our approach via extensive evaluation experiments using fourteen benchmark datasets. We benchmark the performance of a wrapper FS approach called Binary Cuckoo Search (BCS), and three filter-based FS approaches (namely Mutual Information Maximisation (MIM), Joint Mutual Information (JMI), and minimum Redundancy Maximum Relevance (mRMR)). Our evaluation has shown that the proposed model is an effective approach for FS, in selecting better features that enhance the performance metrics on the classifiers. Thus, MBHO can be utilized as one alternative to the existing state-of-art-approaches. We release the source codes of our implementation for the community to build on with new methods and datasets.

Aiming at effectively generating safe and reliable motion paths for quadruped robots, a hierar-chical path planning approach driven by dynamic 3D point cloud is proposed in this article. The developed path planning model is essentially constituted of two layers: global path planning layer and local path planning layer. At the global path planning layer, a new method is proposed for calculating terrain potential field based on point cloud height segmentation. Variable step size is employed to improve the path smoothness. At the local path planning layer, a real-time prediction method for potential collision area and a strategy for temporary target point selection is developed. Quadruped robot experiments were carried out in an outdoor complex environment. The experi-mental results verified that, for global path planning, the smoothness of the path is improved and the complexity of the passing ground is reduced. The effective step size is increased by a maxi-mum of 13.4 times, and the number of iterations is decreased by up to 1/6, compared with the traditional fixed step size planning algorithm. For local path planning, the path length is short-ened by 20%, more efficient dynamic obstacle avoidance and more stable velocity planning are achieved by using the improved dynamic window approach (DWA).

Poultry farming in Slovakia has a tradition and an irreplaceable position to ensure rational nutrition for the population. In terms of a nutritional value, poultrymeat (Galliformes) contains a high amount of proteins, essential amino acids, essential unsaturated fatty acids, minerals, vitamins and a low fat content. Poultrymeat production has a relatively short reproductive cycle and thus allows regulating the demand and supply. The poultry market also influences the development of domestic consumption. According to the Statistical Office of the Slovak Republic, the consumption of meat has witnessed a persistent increase over the last 10 years. [1] According to the 2023 AVEC (The Voice of European Meat Sector) annual report, the consumption of poultrymeat in Slovakia was 20.0 kg per person per year. The average consumption in the EU-27 (2021) was 23.4 kg, with the countries with the highest consumption being Portugal (37.8 kg), Ireland (36.0 kg), Hungary (33.5 kg) and Spain (29.9 kg). On the other hand, the countries with the lowest consumption of poultrymeat, apart from Slovakia, also include Austria and Greece with a consumption of 21.5, resp. 21.0 kg [2]. The breeding of broiler chickens, as well as the production and placing on the market of poultrymeat must comply with the requirements laid down by legislation, while the compliance is regularly checked by the competent authorities.

In recent decades, with the ever-growing scale of video data, near-duplicate videos continue to emerge. Data quality issue caused by near-duplicate videos is becoming more and more prominent, which has affected the application of normal videos. Although current studies on near-duplicate video detection can be helpful to uncover data quality issues for videos, they still lack a process of automatic merging for the video data represented by high-dimensional features, which are difficult to automatically clean the near-duplicate videos to improve data quality for video datasets. At present, there are few studies on near-duplicate video data cleaning. The existing studies have the sensitive problems of video data orderliness and clustering initial center under a condition that prior distribution is unknown, which seriously affect the accuracy of near-duplicate video data cleaning. To address the above issues, an automatic near-duplicate video data cleaning method based on a consistent feature hash ring is proposed in this paper. First, a residual network with convolutional block attention modules, a long short-term memory deep network, and an attention model are integrated to construct an RCLA deep network with the multi-headed attention mechanism to extract spatiotemporal features of video data. Then, a consistent feature hash ring is constructed, which can effectively alleviate the sensitivity of video data orderliness while providing a condition of near-duplicate video merging. To reduce the sensitivity of the initial cluster centers to results of near-duplicate video cleansing, an optimized feature distance-means clustering algorithm is constructed by utilizing a mountain peak function on a consistent feature hash ring, which can implement automatic cleaning of near-duplicate video data. Finally, experiments are conducted based on a commonly used dataset named CC_WEB_VIDEO and a coal mining video dataset. Compared with some existing works, simulation results demonstrate that the performance of the proposed method.

We study the problem of matching interior and exterior solutions of Einstein’s equations along a particular hypersuface. We present the main aspects of the C3 matching approach that involves third-order derivatives of the corresponding metric tensors in contrast to the standard matching procedures known in general relativity, which impose conditions on the second-order derivatives only. The C3 alternative approach does not depend on coordinates and allows us to determine the matching surface by using the invariant properties of the eigenvalues of the curvature tensor.

Semi-continuous data are very common in the social science and economics. In this paper, a Bayesian variable selection procedure is developed to assess the influence of exogenous factors including observed and unobserved on the semi-continuous data. Our formulation is based on the two-part latent variable model with polytomous response. We consider two schemes for the penalties of regression coefficients and factor loadings: the Bayesian spike and slab bimodal prior and the Bayesian lasso prior. Within the Bayesian framework, we implement Markov Chains Monte Carlo sampling method to conduct posterior inference. To facilitate posterior sampling, we recast the logistic model in part one as the norm-like mixture model. Gibbs sampler is designed to draw observations from the posterior. Our empirical results show that with suitable hyper-parameters, the spike and slab bimodal method slightly outperforms the Bayesian lasso in the current analysis. Finally, a real example related to the China household finance survey is analyzed to illustrate the application of the methodology.. .

Arabinoxylans (AXs) are non-starch polysaccharides with complex structures naturally occurring in grains (i.e., barley, corn, and others) providing many health benefits, especially as prebiotics. AXs can be classified as water-extractable (WEAX) and water-unextractable (WUAX) based on their solubility, with properties influenced by grain sources and extraction methods. A large body of evidence shows that AXs exert an im-portant health impact, including glucose and lipid metabolism regulation and immune system enhancement, which is induced by the interactions between AXs and the gut microbiota. Recent research underscores the dependence of AX physiological effects on structure, advocating for a deeper understanding of struc-ture-activity relationships. While systematic studies on WEAX are prevalent, knowledge gaps persist re-garding WUAX, despite its higher grain abundance. Thus, this review reports recent data on WUAX struc-tural properties (chemical structure, branching, MW) in cereals under different treatments. It discusses WUAX applications in baking and its benefits deriving from gut fermentation.

Laser-targeted weeding methods further enhance the sustainable development of green agriculture, with one key technology being the improvement of weed localization accuracy. Here, we propose an improved YOLOv8 instance segmentation based on bidirectional feature fusion and deformable convolution (BFFDC-YOLOv8-seg) to address the challenges of insufficient weed localization accuracy in complex environments with resource-limited laser weeding devices. Initially, by training on extensive datasets of plant images, the most appropriate model scale and training weights are determined, facilitating the development of a lightweight network. Subsequently, the introduction of the Bidirectional Feature Pyramid Network (BiFPN) during feature fusion effectively prevents the omission of weeds. Lastly, the use of Dynamic Snake Convolution (DSConv) to replace some convolutional kernels enhances flexibility, benefiting the segmentation of weeds with elongated stems and irregular edges. Experimental results indicate that the BFFDC-YOLOv8-seg model achieves a 4.9% increase in precision, an 8.1% increase in recall rate, and a 2.8% increase in mAP50 value to 98.8% on a vegetable weed dataset compared to the original model. It also shows improved mAP50 over other typical segmentation models such as Mask R-CNN, YOLOv5-seg, and YOLOv7-seg by 10.8%, 13.4%, and 1.8%, respectively. Furthermore, the model achieves a detection speed of 24.8 FPS on the Jetson Orin nano standalone device, with a model size of 6.8MB that balances between size and accuracy. The model meets the requirements for real-time precise weed segmentation, suitable for complex vegetable field environments and resource-limited laser weeding devices.

Artificial intelligence (AI) is increasingly being used to improve the quality control of point-of-care diagnostics. This is caused by a number of factors, including the following: 1. AI can accelerate and improve testing accuracy. In comparison to humans, AI technology can review data more quickly and precisely, reducing errors and improving overall quality assurance. 2. When it comes to improving POC test findings on healthcare issues such as infectious diseases or medical crises such as heart attacks, AI can be used for sophisticated predictive analytics and modeling that aid in better decision-making. 3. Artificial intelligence facilitates process automation, increasing productivity and lowering labor costs in labor-intensive tasks such as testing and analyzing samples collected at point-of-care facilities. 4. The use of AI enables organizations implementing these solutions to gain insights from large volumes of raw diagnostic data generated faster and more accurately, allowing them to build solid frameworks around preventive care initiatives and significantly influence public health outcomes.5. Artificial intelligence (AI) has been demonstrated to be a useful tool for real-time monitoring systems that identify any problems with test results early so that they can be corrected before affected patients receive inaccurate diagnoses or treatment plans based on false information provided by diagnostic tests performed at points of care such as clinics or hospitals.Using these technologies would allow healthcare organizations to spend less on labor while still receiving exact diagnoses and rapid treatment delivery at a fraction of the cost that manual approaches required earlier.

Structures inevitably suffer damages after an earthquake, with their severity ranging from minimal damages to non-structural elements to partial or even total collapse, possibly with loss of human lives. Thus, it is essential for engineers to understand the crucial factors that drive a structure towards suffering higher degrees of damage, so that preventative measures can be taken. In the present study, we focus on three well-known damage thresholds, namely Collapse Limit State, Ultimate Limit State and Serviceability Limit State and analyze which of the features obtained via Rapid Visual Screening, determine whether or not a given structure will cross that threshold. To this end, we use Machine Learning to perform binary classification for each damage threshold, as well as Explainability via SHAP values (acronym for SHapley Additive exPlanations) to quantify the effect of each parameter. The quantitative results obtained demonstrate the potential applicability of ML methods to re-calibrate the computation of structural vulnerability indices using data from recent earthquakes.

We investigate the production of an isolated attosecond pulse (IAP) via the phase-matching gating of high-harmonic generation by intense laser pulses. Our study is based on the integration of the propagation equation for the fundamental and generated fields with nonlinear polarisation found via the numerical solution of the time-dependent Schr\"odinger equation. We study the XUV energy as a function of the propagation distance (or the medium density) and find that the onset of the IAP production corresponds to the change from linear to quadratic dependence of this energy on the propagation distance (or density). Finally, we show that the upper limit of the fundamental pulse duration for which the IAP generation is feasible is defined by the temporal spreading of the fundamental pulse during the propagation. This nonlinear spreading is defined by the difference of the group velocities for the neutral and photoionised medium.

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.

In order to solve the problem of feature extraction of underwater acoustic signals in complex ocean environment, a new method for feature extraction from ship radiated noise is presented based on empirical mode decomposition theory and permutation entropy. It analyzes the separability for permutation entropies of the intrinsic mode functions of three types of ship radiated noise signals, and discusses the permutation entropy of the intrinsic mode function with the highest energy. In this study, ship radiated noise signals measured from three types of ships are decomposed into a set of intrinsic mode functions with empirical mode decomposition method. Then, the permutation entropies of all intrinsic mode functions are calculated with appropriate parameters. The permutation entropies are obviously different in the intrinsic mode functions with the highest energy, thus, the permutation entropy of the intrinsic mode function with the highest energy is regarded as a new characteristic parameter to extract the feature of ship radiated noise. After that, the characteristic parameters, namely, the energy difference between high and low frequency, permutation entropy, and multi-scale permutation entropy, are compared with the permutation entropy of the intrinsic mode function with the highest energy. It is discovered that the four characteristic parameters are at the same level for similar ships, however, there are differences in the parameters for different types of ships. The results demonstrate that the permutation entropy of the intrinsic mode function with the highest energy is better in separability as the characteristic parameter than the other three parameters by comparing their fluctuation ranges and the average values of the four characteristic parameters. Hence, the feature of ship radiated noise can be extracted efficiently with the method.

Ransomware attacks have risen alarmingly, with encryption techniques becoming more complex. This paper introduces a novel detection model tailored for ransomware's distinctive characteristics. The Intel PIN tool extracts Windows API invocation sequences related to file operations. These sequences are used to construct n-grams, forming feature vectors enhanced by a new Class Feature Weighting (CFW) metric to improve malware detection. Preliminary results demonstrate elevated accuracy and precision versus existing methods. The major contributions are: (1) Introducing an innovative deep learning model for few-shot ransomware classification using entropy features and transfer learning. (2) Achieving high weighted F1-score in classifying ransomware variants into families with limited training data. (3) Demonstrating the potential of entropy-based features to capture intricacies lost in image-based approaches, improving detection of new strains.

In this article, ‎we examine an allocation issue faced by European Health Union (EHU)‎. ‎Given this situation, ‎we introduce the issue of vaccine selection. ‎The model proposed in this paper helps to implement vaccination optimally using matching theory. ‎By adopting the mechanism presented in this article, ‎this is done more easily and more quickly, ‎so that mortality in society is lower and public satisfaction is increased. ‎This is similar to the issues analyzed in the literature on the design mechanism of non-perishable goods.

Object detection algorithms for open water aerial images present challenges such as small object size, unsatisfactory detection accuracy, numerous network parameters, and enormous computational demands. Current detection algorithms struggle to meet the accuracy and speed requirements while being deployable on small mobile devices. This paper proposes DFLM-YOLO, a lightweight small-object detection network based on the YOLOv8 algorithm with multiscale feature fusion. Firstly, to solve the class imbalance problem of the SeaDroneSee dataset, we propose a data augmentation algorithm called Small Object Multiplication (SOM). SOM enhance dataset balance by increasing the number of objects in specific categories, thereby improving model accuracy and generalization capabilities. Secondly, we optimize the backbone network structure by implementing Depthwise Separable Convolution (DSConv) and the newly designed FC-C2f, which reduces the model's parameters and inference time. Finally, we design the Lightweight Multiscale Feature Fusion Network (LMFN) to address the challenges of multiscale variations by gradually fusing the four feature layers extracted from the backbone network in three stages. In addition, LMFN incorporates the Dilated Re-param Block structure to increase the effective receptive field and improve the model's classification ability and detection accuracy. Experimental results on the SeaDroneSea dataset indicate that DFLM-YOLO improves mAP by 12.4% compared to the original YOLOv8s, while reducing parameters by 67.2%. This achievement provides a new solution for UAVs to conduct object detection missions in open water efficiently.

For multi-sensor integrated systems, such as a mobile mapping system (MMS), data fusion at sensor-level, i.e., the 2D-3D registration between optical camera and LiDAR, is a prerequisite for higher level fusion and further applications. This paper proposes a line-based registration method for panoramic images and LiDAR point cloud collected by a MMS. We first introduce the system configuration and specification, including the coordinate systems of the MMS, the 3D LiDAR scanners, and the two panoramic camera models. We then establish the line-based transformation model for panoramic camera. Finally, the proposed registration method is evaluated for two types of camera models by visual inspection and quantitative comparison. The results demonstrate that the line-based registration method can significantly improve the alignment of the panoramic image and LiDAR datasets under either the ideal spherical or the rigorous panoramic camera model, though the latter is more reliable.

Polarimetric Synthetic Aperture Radar (PolSAR) images encompass valuable information that can facilitate extensive land cover interpretation and generate diverse output products. Extracting meaningful features from PolSAR data poses challenges distinct from those encountered in optical imagery. Deep Learning (DL) methods offer effective solutions for overcoming these challenges in PolSAR feature extraction. Convolutional Neural Networks (CNNs) play a crucial role in capturing PolSAR image characteristics by leveraging kernel capabilities to consider local information and the complex-valued nature of PolSAR data. In this study, a novel three-branch fusion of complex-valued CNN named Shallow to Deep Feature Fusion Network (SDF2Net) is proposed for PolSAR image classification. To validate the performance of the proposed method, classification results are compared against multiple state-of-the-art approaches using the Airborne Synthetic Aperture Radar (AIRSAR) datasets of Flevoland, San Francisco, and ESAR Oberpfaffenhofen dataset. The results indicate that the proposed approach demonstrates improvements in OA, with 1.3% and 0.8% enhancement for the AIRSAR datasets and 0.5% improvement for the ESAR dataset. The analyses conducted on the Flevoland data underscore the effectiveness of the SDF2Net model, revealing a promising OA of 96.01% even with only 1% sampling ratio.

Aerial image classification has become popular and has attracted extensive research efforts in recent decades. The main challenge lies in its very high spatial resolution but relatively insufficient spectral information. To this end, spatial-spectral feature extraction is a popular strategy for classification. However, parameter determination for that feature extraction is usually time-consuming and depends excessively on experience. In this paper, an automatic spatial feature extraction approach based on image raster and segmental vector data cross-analysis is proposed for the classification of very high spatial resolution (VHSR) aerial imagery. First, multi-resolution segmentation is used to generate strongly homogeneous image objects and extract corresponding vectors. Then, to automatically explore the region of a ground target, two rules, which are derived from Tobler’s First Law of Geography (TFL) and a topological relationship of vector data, are integrated to constrain the extension of a region around a central object. Third, the shape and size of the extended region are described. A final classification map is achieved through a supervised classifier using shape, size, and spectral features. Experiments on three real aerial images of VHSR (0.1 to 0.32 m) are done to evaluate effectiveness and robustness of the proposed approach. Comparisons to state-of-the-art methods demonstrate the superiority of the proposed method in VHSR image classification.

With the development of remote sensing satellite technology for Earth observation, remote sensing stereo images have been used for three-dimensional reconstruction in various fields, such as urban planning and construction. However, remote sensing images often include noise, occluded regions, weakly textured areas and repeated textures, which can lead to reduced accuracy in stereo matching and affect the quality of the 3D reconstruction results. To reduce the impact of complex scenes in remote sensing images on stereo matching and to ensure both speed and accuracy, we propose a new end-to-end stereo matching network based on convolutional neural networks (CNNs). The proposed stereo matching network can learn features at different scales from the original images and construct cost volumes with varying scales to obtain richer scale information. Additionally, when constructing the cost volume, we introduce negative disparity to adapt to the common occurrence of both negative and nonnegative disparities in remote sensing stereo image pairs. For cost aggregation, we employ a 3D convolution-based encoder-decoder structure that allows the network to adaptively aggregate information. Before feature aggregation, we also introduce an attention module to retain more valuable feature information, enhance feature representation, and obtain a higher-quality disparity map. By training on the publicly available US3D dataset, we obtain the accuracy that 1.115 pixel in end-point error (EPE) and 5.32% in the error pixel ratio (D1) on the test dataset, and the inference speed is 92 ms. Comparing our model with existing state-of-the-art models, we achieve higher accuracy, and the network is beneficial for the three-dimensional reconstruction of remote sensing images.

The article explores the task of making higher education more profession-oriented. In this context, we consider the technology of structuring and matching professional activities and content of professional education curricula with the help of ontology. This technology employs intelligent analysis of labor market and educational content matching with the aim to organize educational programs and verify professional competences based on their ontological properties. The article also considers development of a professional training cognitive map that can help design the student’s personalized educational trajectory factoring in the given parameters.

The implementation of teaching interventions in learning needs has received considerable attention, as the provision of the same educational conditions to all students, is pedagogically ineffective. In contrast, more effectively considered the pedagogical strategies that adapt to the real individual skills of the students. An important innovation in this direction is the Adaptive Educational Systems (AES) that support automatic modeling study and adjust the teaching content on educational needs and students' skills. Effective utilization of these educational approaches can be enhanced with Artificial Intelligence (AI) technologies in order to the substantive content of the web acquires structure and the published information is perceived by the search engines. This study proposes a novel Adaptive Educational eLearning System (AEeLS) that has the capacity to gather and analyze data from learning repositories and to adapt these to the educational curriculum according to the student skills and experience. It is a novel hybrid machine learning system that combines a Semi-Supervised Classification method for ontology matching and a Recommendation Mechanism that uses a hybrid method from neighborhood-based collaborative and content-based filtering techniques, in order to provide a personalized educational environment for each student.

One of the most reliable methods of authentication used today is biometric matching. This authentication process, which is done by using biometrics information such as fingerprint, iris, face, etc. is used in many application areas. Authentication at border gates is one of these areas. However, some restrictions have been introduced to storing and using such data, especially with the General Data Protection Regulation (GDPR). The main goal of this work is to find the practical implementation of fully homomorphic encryption-based biometric matching in border controls. In this paper, we propose a biometric authentication system based on hash expansion and fully homomorphic encryption features, considering these restrictions. One of the most significant drawbacks of the homomorphic encryption method is the long execution time. We solved this problem by executing the matching algorithm in parallel manner. The proposed scheme is implemented as proof-of-concept in the SMILE, and its advantages in privacy preservation has been demonstrated.

Improvements in web platforms for data exchange and trading are creating more opportunities for users to obtain data from data providers of different domains. However, the current data exchange platforms are limited to unilateral information provision from data providers to users. In contrast, there are insufficient means for data providers to learn what kinds of data users desire and for what purposes. In this paper, we propose and discuss the description items for sharing users’ call for data as data requests in the data marketplace. We also discuss structural differences in data requests and providable data using variables, as well as possibilities of data matching. In the study, we developed an interactive platform, treasuring every encounter of data affairs (TEEDA), to facilitate matching and interactions between data providers and users. The basic features of TEEDA are described in this paper. From experiments, we found the same distributions of the frequency of variables but different distributions of the number of variables in each piece of data, which are important factors to consider in the discussion of data matching in the data marketplace.

A method for sequencing a protein from a codon sequence is proposed. An unfolded protein molecule is threaded through a nano-sized pore in an electrolytic cell carboxyl end first and held with a voltage such that only the first residue is exposed in the trans chamber of the cell. A tRNA molecule in trans with matching anticodon for the residue binds itself to the latter in the presence of suitable catalysts. It is then cleaved and transferred to an extended electrolytic cell with N pores, 40 ≤ N ≤ 61, in N individual cis chambers and a single trans chamber. Each pore holds an RNA molecule ending in a unique codon that is held exposed in the trans chamber. In the presence of suitable catalysts the anticodon in the transferred tRNA binds with the codon of a matching RNA molecule. By reversing the voltages in the extended cell every RNA molecule except the one to which the transferred tRNA is bound retracts into its cis chamber, this identifies the residue unambiguously. The detected residue in the first cell is cleaved and the process repeated. Unlike in other nanopore-based methods, it suffices to detect the occurrence of a current blockade without having to measure the pore current precisely. A simplified but more time-consuming version that uses only the first cell is also described. In either case no a priori information about the protein is needed so de novo sequencing is possible. A feasibility analysis of the proposed scheme is presented.

Visual signals are the upmost important source for robots, vehicles or machines to achieve human-like intelligence. Human beings heavily depend on binocular vision to understand the dynamically changing world. Similarly, intelligent robots or machines must also have the innate capabilities of perceiving knowledge from visual signals. Until today, one of the biggest challenges faced by intelligent robots or machines is the matching in stereovision. In this paper, we present the details of a new principle toward achieving a robust matching solution which leverages on the use and integration of top-down image sampling strategy, hybrid feature extraction, and RCE neural network for incremental learning (i.e., cognition) as well as robust match-maker (i.e., recognition). A preliminary version of the proposed solution has been implemented and tested with data from Maritime RobotX Challenge (www.robotx.org). The contribution of this paper is to attract more research interest and effort toward this new direction which may eventually lead to the development of robust solutions expected by future stereovision systems in intelligent robots, vehicles and machines.

Purpose: Localization and mapping with LiDAR data is a fundamental building block for autonomous vehicles. Though LiDAR point clouds can often encode the scene depth more accurate and steadier compared with visual information, laser-based Simultaneous Localization And Mapping (SLAM) remains challengeable as the data is usually sparse, density variable and less discriminative. The purpose of this paper is to propose an accurate and reliable laser-based SLAM solution. Design/methodology/approach: The method starts with constructing voxel grids based on the 3D input point cloud. These voxels are then classified into three types to indicate different physical objects according to the spatial distribution of the points contained in each voxel. A global environment model with Partition of Unity (POU) implicit surface is maintained along the process and located voxels are merged into it from stage to stage, through scan-to-model matching implemented by Levenberg-Marquardt method. Findings: We find a laser-based SLAM method. The method uses POU implicit surface representation to build the model and is evaluated on the KITTI odometry benchmark without loop closure. Experimental results indicate that the method achieves accuracy comparable to the state-of-the-art methods. Originality/value: We propose a novel, low-drift SLAM method, which falls into a scan-to-model matching paradigm, operates on point clouds obtained from Velodyne HDL64. The method is of value to researchers developing SLAM systems for autonomous vehicles.

This paper studies the spatial joint evolution of cooperative behavior and a partially assortative matching institution that protects cooperators. We consider cooperation as characterized by a cultural trait transmitted via an endogenous socialization mechanism a la Bisin and Verdier (2001) and we assume that such trait can diffuse randomly in space due to some spatial noise in the socialization mechanism. Using mathematical techniques from reaction-diffusion equations theory, we show that, under some conditions, an initially localized domain of preferences for cooperation can invade the whole population and characterize the asymptotic speed of diffusion. We consider first thecase with exogenous assortativeness, and then endogeneize the degree of social segmentation in matching, assuming that it is collectively set at each point of time and space by the local community. We show how relatively low cost segmenting institutions can appear in new places thanks to the spatial random diffusion of cooperation, helping a localized cultural cluster of cooperation to invade the whole population. The endogenous assortative matching institution follows a life cycle process : appearing, growing and then disappearing once a culture of cooperation is suffciently established in the local population.

Accurate forecasting of icing thickness has a great significance for ensuring the security and stability of power grid. In order to improve the forecasting accuracy, this paper proposes an icing forecasting system based on fireworks algorithm and weighted least square support vector machine (W-LSSVM). The method of fireworks algorithm is employed to select the proper input features with the purpose of eliminating the redundant influence. In addition, the aim of W-LSSVM model is to train and test the historical data-set with the selected features. The capability of this proposed icing forecasting model and framework is tested through the simulation experiments using real-world icing data from monitoring center of key laboratory of anti-ice disaster, Hunan, South China. The results show that the proposed W-LSSVM-FA method has a higher prediction accuracy and it may be a promising alternative for icing thickness forecasting.

Accurate classification of objects in 3D point clouds is a significant problem in several applications, such as autonomous navigation and augmented/virtual reality scenarios, which has become a research hot spot. In this paper, we presented a deep learning strategy for 3D object classification in augmented reality. The proposed approach is a combination of the GRU and LSTM. LSTM networks learn longer dependencies well, but due to the number of gates, it takes longer to train; on the other hand, GRU networks have a weaker performance than LSTM, but their training speed is much higher than GRU, which is The speed is due to its fewer gates. The proposed approach used the combination of speed and accuracy of these two networks. The proposed approach achieved an accuracy of 0.99 in the 4,499,0641 points dataset, which includes eight classes (unlabeled, man-made terrain, natural terrain, high vegetation, low vegetation, buildings, hardscape, scanning artifacts, cars). Meanwhile, the traditional machine learning approaches could achieve a maximum accuracy of 0.9489 in the best case.

In a hyperconnected society, computer networks play a pivotal role in all activities that permeate our daily lives. In the context of smart cities, theses networks play a pivotal role in enhancing urban efficiency and sustainability. The continuous flow of packets in these networks poses security challenges, from personal data leakage to service unavailability. Anomaly-based methods are commonly used to detect network attacks. In this context, Software-Defined Networking (SDN) emerges as a solution for anomaly detection in network traffic, facilitating comprehensive, real-time analyses and dynamic adaptation to changes. This study aims to present a systematic review of feature selection techniques and evaluate the effectiveness of attribute selection with a multi-class classifier in network anomaly detection. The objective of this paper is to inspire future research and identify trade-offs among these techniques for detecting Denial of Service (DoS) attacks. Based on the findings, the analysis of the entire dataset yields superior results in terms of precision (99%), but using the output of OneR, although resulting in a slight loss of precision compared to the complete dataset, presents the highest precision among other studied techniques, indicating a trade-off between precision and processing time efficiency.

This paper reviews several techniques, including analytical theories and real frequency techniques, to design ultra-wideband impedance matching networks for low-power applications. The comparison of solutions obtained using the simplified real frequency technique to the published solution using Chebyshev filter theory is demonstrated.

This study introduces a new procedure for three-component spectral matching of seismic ground acceleration records. The procedure involves preserving the phase angle and varying the Fourier amplitudes to match the spectra of the recorded records with a provided target spectrum that represents the spectral values of ground motions in three orthogonal directions. Several three-component recorded records were matched against two target response spectra to test the method. An accurate convergence was achieved in the velocity and displacement records. In addition, the scales among the components’ magnitude were maintained, creating realistic three-component ground motions. Such ground motion inputs are important to qualify critical structures sensitive to three-component motions. Our proposed procedure is novel because the present practices are mostly created based on one-component ground motions.

Purpose: To compare ab interno trabeculectomy by trabecular meshwork excision to plasma-mediated ablation in primary open-angle glaucoma. Methods: Retrospectively collected data of TrabEx+ (TEx, n=56) and Trabectome (T, n=99) were compared by coarsened exact matching to reduce confounding and matched based on baseline IOP and age. Primary outcomes were IOP and number of glaucoma medications. Complications and need for additional glaucoma surgery were assessed. Patients were followed for up to one year. Results: 53 TEx could be matched to T. Baseline IOP was 16.5±4.6 mmHg in both; age was 73.7±8.8 and 71.5±9.9 years in TEx and T, respectively. TEx were taking more medications than T (p<0.001). IOP was reduced to 14.8±4.3 in TEx and to 13.4±3.4 in T at 6 months, and to 14.9±6.0 (p=0.13) in TEx and to 14.1±3.8 mmHg (all p<0.05) in T at 12 months. Medications were reduced at both 6 and 12 months (p< 0.05). No differences were seen between TEx and T at 6 and 12 months. In TEx, only one serious complication occurred, and two patients required further glaucoma surgery. Conclusion: Although both groups had a baseline IOP considered low for ab-interno trabeculectomy, IOP and medications were reduced further at 6 and 12 months. IOP reduction did not reach significance in TEx at 12 months. The inter-group comparison did not reveal any significant differences. Both had a low complication rate.

The futures market plays a significant role in hedging and speculating by investors. Although various models and instruments are developed for real-time trading, it is difficult to realize profit by processing and trading a vast amount of real-time data. This study proposes a real-time index futures trading strategy that uses the pattern of KOSPI 200 index futures time series data. We construct a pattern matching trading system (PMTS) based on a dynamic time warping algorithm that recognizes patterns of market data movement in the morning and determines the afternoon's clearing strategy. We adopt 13 and 27 representative patterns and conduct simulations with various ranges of parameters to find optimal ones. Our experimental results show that the PMTS provides stable and effective trading strategies with relatively low trading frequencies. Investor communities that have sustained financial markets are able to make more efficient investments by using the PMTS. In this sense, the system developed in this paper is a sustainable investment technique and helps financial markets achieve efficient sustainability.

The wave energy converter (WEC) technology constantly develops new designs and models. To encourage its development within the energy sector, research is required to improve current designs and create durable and effective devices. However, it is also crucial to investigate the suitability of a WEC to a site-specific sea condition as this can impact its optimal power absorption and constructability. This study evaluates and compares the efficiency of a heaving buoy with varied geometries in one of the most energetic places along the Mexican coast. A statistical analysis of the wave climate on the coast of Ensenada during the last 42 years is performed to define the conditions to which the device is subjected. The location of the WEC in shallow waters is chosen using a computational model which solves the modified mild slope equation in its elliptic shape. The heaving buoy floater is studied using three distinct geometries: a semi-sphere, a cylinder, and a proposed rounded semi-rectangle. The hydrodynamic response of the three geometries is then analysed in the frequency and time domain using ANSYS AQWA. The hydrodynamic study involves the assessment of the floating body dynamics, exerted forces, the power absorbed as well as the suitability of the proposed power take-off (PTO) system. Findings reveal that the proposed geometry absorbs the most energy, with an annual power of 135.11 MW, and that the transmission PTO design is appropriate for this type of technology.

The point cloud is a form of three-dimensional data that comprises various detailed features at multiple scales. Due to this characteristic and its irregularity, point cloud analysis based on deep learning is challenging. While previous works utilize the sampling-grouping operation of PointNet++ for feature description and then explore geometry by means of sophisticated feature extractors or deep networks, such operations fail to describe multi-scale features effectively. Additionally, these techniques have led to performance saturation. And it is difficult for standard MLPs to directly "mine" point cloud. To address above problems, we propose the Detail Activation (DA) module, which encodes data based on Fourier transform after sampling and grouping. We activate the channels at different frequency levels from low to high in the DA module to gradually recover finer point cloud details. As training progresses, the proposed Point-MDA can uncover local and global geometries of point cloud progressively. Our experiments show that Point-MDA achieves superior classification accuracy, outperforming PointNet++ by 3.3% and 7.9% in terms of overall accuracy on the ModelNet40 and ScanObjectNN dataset, respectively. Furthermore, it accomplishes this without employing complicated operations, while exploring the full potential of PointNet++.

A software defined radio (SDR) is a communication system that makes use of components that can be configured through software, in contrast to traditional systems where these components are variable through hardware, these radio devices are much more versatile, this article describes the factors that must be considered when implementing a communication system based on Software Defined Radios (SDR), in order to reduce the attenuation factors and thus obtain the maximum distance for a transmission of data effectively in the UHF band. The calculations made for the first Fresnel zone and for the design of the Ground Plane type antennas used in the transmission/reception stages of the x40 bladeRF platforms are also presented. The tests were carried out at the facilities of the Huarangal Nuclear Center of the Peruvian Institute of Nuclear Energy, obtaining favorable results that allow ratifying the versatility and performance of the SDRs.

Hybrid forecasting methods have emerged as a solution surpassing the limitations of both statistical and deep learning approaches. While the first emphasize the significance of variables, they often produce worse forecasting results when compared to newer techniques. In contrast, deep learning models remain enigmatic "black boxes" in terms of interpretability, although achieving better results in forecasting. This article introduces the Comprehensive Cross-Correlation and Lagged Linear Regression Deep Learning (CCLR-DL) framework, designed to harness the best of both approaches, enhancing forecasting accuracy while retaining model interpretability through a feature selection process. CCLR-DL blens cross-correlation analysis, lagged multiple linear regression and granger's causality procedures with deep learning architectures based on LSTM. In a practical demonstration, CCLR-DL was applied to a real database of clinical visits associated to diagnoses in Catalonia, Spain (tracking a population of 6.3 million patients during 10 years). Predicting visits enables the healthcare managers to be ready for future demand shifts. Results demonstrate a consistent and substantial improvement over standalone statistical and deep learning methods when predicting healthcare demand. This hybrid approach not only showcases its efficacy but also offers a promising solution to the challenge of balancing predictive accuracy with model explicability. In this context, this work aims to design and validate a method for feature selection and forecasting of multivariate high dimensional time series datasets not only to improve prediction accuracy but also to model transparency by identifying a subset of variables that improve predictions and G-cause the target variable.

This paper proposes a novel single-stage buck-boost three-Level neutral-point-clamped (NPC) inverter with two independent dc sources coupled for the grid-tied photovoltaic (PV) application, which can effectively solve the unbalanced operational conditions generally appeared between two coupled independent PV sources induced by the unequal irradiation and temperature distribution. The proposed control scheme can simultaneously guarantee the maximum power point (MPP) operation of both PV sources and maintain the output waveform quality. Compared to the traditional two-stage PV inverter, the proposed NPC inverter could reduce the PV array voltage requirement and dc-link capacitors’ voltage rating, meanwhile show the advantage in operational efficiency. MATLAB simulations and the captured experimental results are presented to show the performance of the proposed three-level inverter.

Purpose: To create a highly balanced comparison of ab interno trabeculectomy (Trabectome, AIT) and trabecular bypass stenting (iStent, TBS).Setting: Eye and Ear Institute, Pittsburgh, Ross Eye Institute, Buffalo, and Glaucoma Associates of Texas, Dallas, USA.Design: Retrospective Exact Matching analysis.Methods: AIT and TBS patients were included from three large glaucoma practices. The primary outcome measure was the unmedicated IOP ≤ 21 mmHg at 2-year follow-up visit. A secondary measure was unmedicated IOP reduction ≥ 20% at 2 years. Patients were matched by baseline IOP, the number of glaucoma medications and glaucoma type using Exact Matching and by age using Nearest Neighbor matching. Patients without a close match were excluded. All surgeries were combined with phacoemulsification. Results: 154 AIT and 110 TBS eyes were analyzed. 48 AIT patients were exactly matched to 48 TBS patients. Both groups had a baseline IOP of 15.3±3.1 mmHg. At 24 months, the mean IOP was 13.9±3.3 for AIT versus 16.8±2.8 mmHg for TBS (p=0.04), while the number of medications was 0.7±1.0 for AIT versus 1.7±1.2 for TBS (p=0.04). The proportion of subjects achieving IOP ≤ 21 mmHg without medications at 24 months was 53% in AIT versus 16.6% in TBS (P < 0.05). At 24-month follow up 17.6% of patients in AIT had ≥ 20% IOP reduction without medication versus no patient in TBS. Conclusions: An Exact Matching comparison of AIT and TBS demonstrated greater IOP reduction with fewer medications in AIT.

Interactions between mobile robots and human operators in common areas require a high safety especially in terms of trajectory planning, obstacle avoidance and mutual cooperation. In this connection the crossings of planned trajectories, their uncertainty based on model fluctuations, system noise and sensor noise,play an outstanding role. This paper discusses the calculation of expected areas of interactions du ring human-robot navigation with respect to fuzzy and noisy information. Expected crossing points of possible trajectories are nonlinearily associated with positions and orientations of robot and human. The nonlinear transformation of a noisy system input, such as directions of motion of human and robot, to a system output, the expected area of intersection of their trajectories, is done by two methods: statistical linearization and the sigma-point-transformation. For both approaches fuzzy approximations are presented and the inverse problem is discussed where the input distribution parameters are computed from given output distribution parameters.

The problem of normal impact of a rigid sphere onto a Maxwell viscoelastic solid half-space is considered. The first-order asymptotic solution is constructed in the framework of Hunter’s model of viscoelastic impact [Hunter, S. C., 1957. Energy absorbed by elastic waves during impact. Journal of the Mechanics and Physics of Solids, 5(3), 162–171.]. In particular, simple analytical approximations have been derived for the maximum contact force and the time to achieve it. A linear regression method is suggested for evaluating the instantaneous elastic modulus and the mean relaxation time from a set of experimental data collected for different impactors and impact velocities.

Uncertainties in initial water saturation and early water breakthroughs of un-known sources and paths, which occurred in the low resistivity Lower Haushi sand-stone (LHS) reservoir at the beginning of oil production, imply that the bypassed oil can yet remain in the reservoir. In addition, the upper part of LHS is a tight oil reser-voir, which can still contain a significant amount of unrecovered oil. This opens the opportunity to produce the remaining oil instead of abandoning this reservoir. Low resistivity can exaggerate water saturation, leading to misinterpretation and premature water flooding due to inadequate oil-water contrast. Our analysis revealed a correlation between low resistivity and robust porous network connectivity, along-side elevated formation water salinity in highly porous layers. In regions of high po-rosity, sufficient oil-water contrast facilitates precise water saturation determination, affirming oil presence in all wells. However, within tight oil zones, near-complete wa-ter saturation contradicts actual oil presence. Factors contributing to saturation un-certainty and water breakthroughs were reassessed. Utilizing a 1:1 verti-cal-to-horizontal permeability ratio derived from core data enhanced simulation alignment with water production rates. Investigation into the impact of relative per-meabilities on water production was conducted. Water saturation maps were gener-ated to pinpoint remaining oil reserves. Depletion around wells is evident in lower po-rous regions, while oil persists across the entire tight reservoir, notably in two unex-plored sections.

String matching is an important part in many real world applications. It must robust against variations in string field. In record linkage for two different datasets matching should detect two patients in common in spite of small variations. But it becomes difficult in case of confidential data because sometimes data sharing between organizations become restricted for privacy purposes. Several techniques have been proposed on privacy-preserving approximate string matching such as Secure Hash Encoding etc. Relative to other techniques for approximate string matching Homomorphic encryption is very new. In this paper we have proposed a Homomorphic Encryption based approximate string matching technique for matching multiple attributes. There is no solution currently available for multiple attributes matching using Homomorphic encryption. We have proposed two different methods for multiple attributes matching. Compare to other existing approaches our proposed method offers security guarantees and greater matching accuracy.

This article investigates the effectiveness of feature extraction and selection techniques for enhancing the performance of classifiers accuracy in Type II Diabetes Mellitus (DM) detection using microarray gene data. To address the inherent high dimensionality of the data by employing three Feature Extraction (FE) methods are used namely, Short-Time Fourier Transform (STFT), Ridge Regression (RR), and Pearson Correlation Coefficient (PCC). To further refine the data, meta-heuristic algorithms like Bald Eagle Search Optimization (BESO) and Red Deer Optimization (RDO) are utilized for feature selection. The performance of seven classification techniques such as Non-Linear Regression - NLR, Linear Regression - LR, Gaussian Mixture Model - GMM, Expectation Maximization - EM, Logistic Regression - LoR, Softmax Discriminant Classifier - SDC, and Support Vector Machine with Radial Basis Function kernel - SVM-RBF are evaluated with and without feature selection. The analysis reveals that the combination of PCC with SVM-RBF achieved a promising accuracy of 92.85% even without feature selection. Notably, employing BESO with PCC and SVM-RBF maintained this high accuracy. However, the highest overall accuracy of 97.14% was achieved when RDO was used for feature selection alongside PCC and SVM-RBF. These findings highlight the potential of feature extraction and selection techniques, particularly RDO with PCC, in improving the accuracy of DM detection using microarray gene data.

s: The lack of historical employment data for college graduates, the need to solve the system cold-start problem and the consideration of reciprocity of job recommendation in job recommendation, lead to low recommendation satisfaction and immature application of the existing job recommendation methods. The article presents a new approach to job recommendation using college graduates as the object of study. In the screening stage, a semantic keyword iterative algorithm is applied to compute the similarity between the resume and recruitment texts. This algorithm enhances the intersectionality of keywords in the calculation process, maximizing the utilization of resume information to enhance the accuracy of text similarity calculations. The ranking phase utilizes in-school data to build a social network between college graduates and graduated students, and solves the system's cold-start problem by using the social network to recommend jobs for college graduates where graduated students are employed. Building upon the amalgamation of the semantic keyword iterative algorithm and the social network job recommendation method outlined above, we introduce a dual-dimensional matching approach involving specialty and salary. This enhancement is designed to elevate the reciprocity of job recommendations. The analysis of the results indicates that the average satisfaction rate (AR) and normalized discounted cumulative gain (NDCG) values for the newly proposed job recommendation method surpass those of other methods, demonstrating its superior effectiveness. The method caters to the preferences of graduate job seekers, aligns with job recruitment requirements, and offers extensive job search assistance to a broad spectrum of graduates.

This study assessed the potential of back extensor strength as an alternative marker of frailty. A total of 560 farmers were included. Computed tomography scans measured fat and muscle mass volumes at the mid-L4 vertebral level. Back extensor strength was measured in a seated posture. Multivariate linear regression analyzed the associations between back extensor strength and trunk muscle/fat compositions. The participants were divided into two groups based on back extensor strength. Propensity score matching, multivariate logistic regression, and Extreme Gradient Boosting (XGBoost) were employed to evaluate the relationship between Fried's frailty criteria and back extensor strength. Back extensor strength exhibited positive associations with abdominal muscle volume (r = 1.12) as well as back muscle volume (r = 0.89) (p < 0.05). Lower back extensor strength was linked to more frail status, such as reduced grip strength, walking speed, and fre-quent self-reported exhaustion. Multivariate logistic regression indicated a significant association between lower back extensor strength and higher Fried frailty score (OR, 0.990; p<0.05). XGBoost analysis identified back extensor strength as the most important predictor (gain = 0.502) for frailty, surpassing the significance of age (gain = 0.325). These findings suggested the potential of back extensor strength as an alternative frailty marker.

3D-mapping-aided (3DMA) global navigation satellite system (GNSS) positioning that improves positioning performance in dense urban areas has been under development in the recent years, but it still faces many challenges. This paper details a new algorithm that explores the potential of using building boundary for positioning. Rather than applying complex simulations to analyze and correct signal reflections by buildings, the approach utilizes a convolutional neural network to differentiate between the sky and building in a sky-pointing fisheye image. A new skymask matching algorithm is then proposed to match the segmented fisheye images with skymasks generated from a 3D building model. Each matched skymask holds a latitude and longitude coordinate to determine the precise location of the fisheye image. The results are then compared with the conventional GNSS and advanced 3DMA GNSS positioning methods. The aims of the proposed algorithm are to increase positioning and heading accuracy in a rich urban environment.

Saudi Arabian cities have experienced a rapid expansion of their urban areas - particularly their city centers - over the last four decades. This has resulted to an increase in vehicular usage, which has adversely affected the daily walking experience of the residents. Walkability has several positive effects on people's health as well as the environment in cities. In addition to being a means of transportation, it also helps people create a sense of place, enhancing their image ability to be easily understood as a legible urban structure, and deepen their emotional bond with the city. Using the medium-sized Saudi Arabian city of Onaizah as a case study, this study looks into the feasibility of creating urban walking corridors to encourage users to walk more. According to Saudi Arabia's Vision 2030, which emphasizes the value of sustainable urban development and raising quality of life for residents, the study addresses walkability as a generator to maintain and improve the urban scene of the city center. Geographic Information Systems (GIS) was used to analyze the data and generate the urban corridors in the city center. The results showed the possibility of improving walking in Onaizah through three urban corridors to the city center, measuring 1,401 meters, 1,283 meters, and 1,507 meters, respectively. These corridors represent urban, commercial and heritage corridors, giving an opportunity for planners and decision makers to challenge prioritize pedestrian connectivity and enhance the physical environment, leading to sustainable urban development. This research paper used various criteria analysis methods to provide a comprehensive assessment of various factors to conclude these urban corridors; for example, assessments of land use, transportation and environmental considerations. The study aligns with Saudi Arabia's vision 2030 by promoting walking and enhancing the city's overall walkability while offering Onaizah society by creating and suggesting urban corridors to the city center a sustainable and livable urban environment.

Focusing on the problem of identifying and classifying aero-engine models, this paper measures the infrared spectrum data of aero-engine hot jets using a telemetry Fourier transform infrared spectrometer. Simultaneously, infrared spectral data sets with the six different types of aero-engines are created. For the purpose of classifying and identifying infrared spectral data, a CNN architecture based on the continuous wavelet transform peak seeking attention mechanism (CWT-AM-CNN) is suggested. This method calculates the peak value of middle wave band by continuous wavelet transform, and the peak data is extracted by the statistics of the wave number locations with high frequency. Attention mechanism is used for the peak data, and the attention mechanism is weighted to the feature map of the feature extraction block. The training set, vali-dation set and prediction set are divided in the ratio of 8:1:1 for the infrared spectral data sets. For three different data sets, CWT-AM-CNN proposed in this paper is compared with the classical classifier algorithm based on CO2 feature vector and the popular AE, RNN and LSTM spectral processing networks. The prediction accuracy of the proposed algorithm in the three data sets is as high as 97%, and the lightweight network structure design not only guarantees high precision, but also has a fast running speed, which can realize the rapid and high-precision classification of the infrared spectral data of the aero-engine hot jets.

Recently, significant progress has been made in developing computer-aided diagnosis (CAD) systems for identifying glaucoma abnormalities using fundus images. Despite their drawbacks, methods for extracting features such as wavelets and their variations, along with classifier like support vector machines (SVM), are frequently employed in such systems. This paper introduces a practical and enhanced system for detecting glaucoma in fundus images. This system adresses the chanallages encountered by other existing models in recent litrature. Initially, we have employed contrast limited adaputive histogram equalization (CLAHE) to enhanced the visualization of input fundus inmages. Then, the discrete ripplet-II transform (DR2T) employing a degree of 2 for feature extraction. Subsequently, a golden jackal optimization algorithm (GJO) employed to select the optimal features to reduce the dimension of the extracted feature vector. During the classification stage the least square support vector machine (LS-SVM) with three kernels called as linear, polynomial and radial basis function(RBF), for classifying of fundus images as glaucoma or healthy. The proposed method is validated with the current state-of-the-art models on two standard datasets, namely, G1020 and ORIGA. The results obtained from our experimental result demonstrate that our best suggested approach DR2T+GJO+LS-SVM-RBF obtains better classification accuracy 93.38% and 97.31% for G1020 and ORIGA dataset with less number of features. It establishes a more concise network structure when contrasted with traditional classifiers.

In the context of "dual carbon", with the continuous deepening of the power system reform, the application of high proportion renewable energy is becoming increasingly widespread. All sectors of society have put forward higher requirements for electricity sales packages, which can guide the behavior of power users, promote energy conservation and emission reduction, and finally promote low-carbon operation of the power market economy.Therefore, the requirements of power users and power selling companies for the power selling package are increasing, which puts forward higher requirements to the power selling package recommended by the power selling company . However, the existing recommendation methods are unable to make appropriate recommendations for the users with lack of preference information. Therefore, this paper proposes a two-sided matching decision-making method of electricity sales package based on disappointment theory. First of all, according to the incomplete fuzzy preference relationship provided by the power user and the electricity sales package, the respective priority weight vector is obtained, and then the subjective satisfaction matrix of the power user and the electricity sales package to each other is obtained; Next, the adjusted satisfaction matrix is calculated by adding the influence of the theory of joy and disappointment; Then, based on the adjusted satisfaction matrix, an optimization model aiming at maximizing the total satisfaction of power users and electricity sales packages is established, and the optimal stable matching model of power users and electricity sales packages is obtained; Finally, taking an industrial park in Zhejiang Province as an example, by using the bilateral matching method proposed in this article, the optimal matching schemes for 5 power users and 6 electricity sales packages are obtained, which shows the effectiveness and rationality of the two-sided matching decision-making method of electricity sales package based on the disappointment theory proposed in this paper.

The significance of virtual reality (AR/VR/MR) technology stands out because it can be used in various construction fields such as urban design, construction review, maintenance and education, etc. As to prove this, conglomerates such as Facebook, Google, Sony, Microsoft, and Samsung are increasing their investments to preoccupy the virtual reality market and are competing to dominate the contents and platform market. Virtual reality technology has a concept that collectively refers to VR (Virtual Reality), AR (Augmented Reality), and MR (Mixed Reality), but technically, the two technologies are strictly separated. While VR technology is an immersive virtual environment using computer graphic technology, AR technology is a more advanced technology that combines real data and VR data, and MR technology is a technology that combines both AR and VR. In Korea, Republic of, the use of BIM (Building Information Modeling), a 3D information model, becomes mandatory and based on this, the demand for a new market where VR/AR/MR technologies and advanced sensing equipment are combined increases. This study implemented a building maintenance platform using AR based on 5G, and developed matching technology between BIM of the building maintenance platform and AR equipment. Besides this study implemented the technology to enhance the matching rate of the matching technology and carried out the process to enhance the matching rate empirically through continuous tests. As a result, the initial target of 90% matching rate could be improved to 96%. Based on this, it is expected that effective EV (Optimum Life Cycle Cost) could be achieved at a lower cost compared to the previous one by using it for maintenance monitoring after construction and completion of the building, and can be used as an effective solution in the aspect of building maintenance as well.

Security has become a critical issue in today’s highly distributed and networked systems. Network intrusion detection systems (NIDSs), especially signature-based NIDSs, are being widely deployed in a distributed network environment with the purpose of defending against a variety of network attacks. Most of the commercially available NIDSs are software based and rely on pattern matching to extract the threat from network traffic. The increase in network speed and traffic may make existing algorithms to become a performance bottleneck. Therefore it is very necessary to develop faster and more efficient pattern matching algorithm in order to overcome the troubles on performance of NIDSs. Therefore, we propose a multi fusion pattern matching algorithm for Network Intrusion Detection Systems. The results obtained in percentages from the proposed fusion algorithm given better values in terms processing time in milliseconds than the existing algorithms when data English text are applied to evaluate the fusion performances.

Crowd density estimation is an important task for crowd monitoring. Many efforts have been done to automate the process of estimating crowd density from images and videos. Despite series of efforts, it remains a challenging task. In this paper, we proposes a new texture feature-based approach for the estimation of crowd density based on Completed Local Binary Pattern (CLBP). We first divide the image into blocks and then re-divide the blocks into cells. For each cell, we compute CLBP and then concatenate them to describe the texture of the corresponding block. We then train a multi-class Support Vector Machine (SVM) classifier, which classifies each block of image into one of four categories, i.e. Very Low, Low, Medium, and High. We evaluate our technique on the PETS 2009 dataset, and from the experiments, we show to achieve 95% accuracy for the proposed descriptor. We also compare other state-of-the-art texture descriptors and from the experimental results, we show that our proposed method outperforms other state-of-the-art methods.

We investigate the impact of aging on exchangeable inter-arrival times in mixed renewal processes, exploring its implications for reliability and survival analysis. In this study, first, we revisit the definition of renewal point processes, where inter-event time intervals are considered as exchangeable non-negative random variables. Then, we define the concept of statistical aging as latency in the observational process of event counting. Latency affects event detection but preserves exchangeability. However, it may alter the statistical properties of inter-event time intervals. Our analytical and numerical assessments highlight the significance of aging in exchangeable lifetimes, offering insights into key metrics such as the failure survival function, renewal function, and hazard rate function. Through archetypal examples and empirical findings, we illustrate the implications of aging on renewal processes. In particular, employing a Bayesian perspective, we analyze high-frequency currency exchange rate data to assess the impact of aging on volatility risk evaluation. This study contributes novel insights to the literature of renewal theory and survival analysis, emphasizing the role of latency aging in stochastic point processes under exchangeability assumption.

We consider a Cauchy problem for differential equations in a Hilbert space $X$. The problem is stated in a time interval $I$, which can be finite or infinite. Weuse a fixed point argument for history-dependent operators to prove the unique solvability of the problem. Then, we state and prove convergence criteria for both a general fixed point problem and thecorresponding Cauchy problem. These criteria provide necessary and sufficient conditions on a sequence $\{u_n\}$ which guarantee its convergence to the solution of the corresponding problem, in the space of both continuous and continuously differentiable functions. We then specify our results in the study of a particular differential equation governed by two nonlinear operators. Finally, we provide an application in viscoelasticity and give a mechanical interpretation of the corresponding convergence result.

First came the digital banks without offices, and then the “fintech” companies that combined technology and finance to achieve greater efficiency and new business models. Later was the turn of transport and logistics, understood as the sector whose economic activities derived from the transport of people and goods, while on the one hand, it has had a new spring thanks to factors such as online sales. Then, perhaps catalyzed by the pandemic scenario, the turn has reached education, where years ago was only a complement of traditional education, now is a central part with multiple modern methodologies. Numerous studies exist about using or implementing these e-learning procedures, but technical analysis is barely found in references. This work aims to analyze the digital transformation of the main sectors of our society, including finances, transport, and education, together with several examples of how technology was helping to fight the pandemic scenario.

Lymphedema is a chronic and debilitating disease that affects up to 250 million patients worldwide. Recent advances in understanding its pathophysiology, along with improved diagnosis and microsurgical techniques, have enhanced our ability to cope with the challenging task of treating this disease. This review provides an overview of the disease from a surgeon's point of view, including existing imaging modalities used for preoperative assessment, as well as surgical procedures used in its treatment. Advantages and drawbacks of various existing modalities used for pre or intraoperative assessment of lymphatic vessels are discussed. Lymphedema treatment has shifted from palliative debulking procedures (liposuction and direct excision) to those aimed at restoring lymphatic flow and countering the pathophysiology of the disease (lymphaticovenous anastomosis and vascularized lymph node transfer). A combination of both approaches can result in a synergistic benefit for patients and are discussed in this review. Despite recent advances, some controversies persist, and further studies are needed to better define surgical treatment algorithms.

The paradigm of leveraging code as a dataset has recently gained traction, offering innovative solutions in domains such as automated commit message generation, pull request description automation, and program repair mechanisms. Consider the challenge in generating commit messages: traditional methods treat source code as a mere token sequence, applying neural machine translation models. This approach, however, overlooks the critical syntactic structures inherent in programming languages, which could offer deeper insights and improved accuracy. Building upon prior research, specifically the Code2Seq framework, which utilized Abstract Syntax Tree (AST) structural data for source code representation to automate method name generation, this paper extends and refines this concept. We introduce "CSR", a novel methodology adapted to represent code edits effectively. This paper investigates the impact of employing syntactic structure, focusing on the classification of code edits. Drawing inspiration from Code2Seq, "CSR" utilizes AST's structural properties, particularly the paths connecting leaf nodes, to enhance the task of code edit classification. This approach is rigorously evaluated on two distinct datasets, comprising fine-grained syntactic edits. Our comprehensive experiments reveal that incorporating syntactic structures does not significantly outperform simpler methodologies. While methods like Code2Seq and our proposed "CSR" show potential, our findings highlight that there is considerable scope for improvement and refinement before such techniques can be universally applied for learning representations of code edits. We anticipate that our findings will spark further research in this field, paving the way for more effective use of syntactic structures in code representation.

Face swapping is an intriguing and intricate task in the field of computer vision. Currently, most mainstream face swapping methods employ face recognition models to extract identity features and inject them into the generation process. Nonetheless, such methods often struggle to effectively transfer identity information, result in generated results failing to achieve a high identity similarity with the source face. Furthermore, if we can accurately disentangle identity information, we can achieve controllable face swapping, thereby providing more choices to users. In pursuit of this goal, we propose a new face swapping framework (ControlFace) based on the disentanglement of identity information. We disentangle the structure and texture of the source face, encoding and characterizing them in the form of feature embeddings separately. According to the semantic level of each feature representation, we inject them into the corresponding feature mapper and fuse them adequately in the latent space of StyleGAN. Owing to such disentanglement of structure and texture, we are able to controllablely transfer parts of the identity features. Extensive experiments and comparisons with state-of-the-art face swapping methods demonstrate the superiority of our face swapping framework in terms of transferring identity information, producing high-quality face images and controllable face swapping.

Motivation: The visualization of biological data is a fundamental technique that enables researchers to understand and explain biology. Some of these visualizations have become iconic, for instance: tree views for taxonomy, cartoon rendering of 3D protein structures, or tracks to represent features in a gene or protein, for instance in a genome browser. Nightingale provides visualizations in the context of proteins and protein features. Results: Nightingale is a library of re-usable data visualization web components that are currently used by UniProt and InterPro, among other projects. The components can be used to display protein sequence features, variants, interaction data, 3D structure, etc. These components are flexible, allowing users to easily view multiple data sources within the same context, as well as compose these components to create a customized view. Availability: Nightingale examples and documentation are freely available at https://ebi-webcomponents.github.io/nightingale/. It is distributed under the MIT license, and its source code can be found at https://github.com/ebi-webcomponents/nightingale.

Aiming at the problems that are poor generalization performance, low retrieval accuracy and large time consumption of existing content-based image retrieval system, the hierarchical image retrieval method based on multi feature fusion is proposed in this paper. The retrieval accuracy rates on Corel5K, UKbeach and Holidays are 68.23(Top 1), 3.73(N-S) and 88.20(mAp), respectively. The experimental results show that the method proposed in this paper can effectively improve the deficiency of single feature retrieval and save time significantly in the premise of a small amount of loss of accuracy.

Biologists seek to identify a small number of significant features that are important, non-redundant, and relevant from diverse omics data. For example, statistical methods like LIMMA and DEseq distinguish differentially expressed genes between a case and control group from the transcript profile. Researchers also apply various column subset selection algorithms on genomics datasets for a similar purpose. Unfortunately, genes selected by such statistical or machine learning methods are often highly co-regulated, making their performance inconsistent. Here, we introduce a novel feature selection algorithm that selects highly disease-related and non-redundant features from a diverse set of omics datasets. We successfully applied this algorithm to three different biological problems: a) disease to normal sample classification, b) multiclass classification of different disease samples, and c) disease subtypes detection. Considering classification ROC-AUC, False-positive, and False-negative rates, our algorithm outperformed other gene selection and differential expression (DE) methods for all six types of cancer datasets from TCGA considered here for binary and multiclass classification problems. Moreover, genes picked by our algorithm improved the disease subtyping accuracy for four different cancer types over the state-of-the-art methods. Hence, we posit that our proposed feature reduction method can support the community to solve various problems, including the selection of disease-specific biomarkers, precision medicine design, and disease sub-type detection.

Evidence regarding the role of oral antibiotics (oA) alone or combined with mechanical bowel preparation (MoABP) for elective colorectal surgery remains controversial. A prospective database of 8,359 colorectal resections gathered over a 32-month period in 78 Italian surgical units (the iCral 2 and 3 studies), reporting patient-, disease-, and procedure-related variables together with 60-day adverse events, was re-analyzed to identify a subgroup of 1,013 cases (12.1%) that received either oA or MoABP. This dataset was analyzed using a 1:1 propensity score-matching model including 20 covariates. Two well-balanced groups of 243 patients each were obtained: group A (oA), and group B (MoABP). The primary endpoints were anastomotic leakage (AL) and surgical site infections (SSIs) rates. Group A vs. group B showed a significantly higher AL risk [14 (5.8%) vs 6 (2.5%) events; OR 3.77; 95%CI 1.22-11.67; p = .021], while no significant difference was recorded between the two groups regarding SSIs. These results strongly support the use of MoABP for elective colorectal resections.

Background: Early rehabilitation is an important strategy for the treatment of severe diseases. The study aimed to assess the efficacy of early rehabilitation of patients with mild-to-moderate COVID-19. Methods: The retrospective single-center study with propensity score matching. Results: 180 patients (54 (44 - 62.3) yo) divided into three equal groups: 1 - physical exercises; 2 - physical exercises and chest massage in an electrostatic field; 3 - no rehabilitation. The length of stay (LOS) in the hospital in group 1 was 14 (11-15) days, group 2 - 13 (11-15) days, group 3 - 15 (13-18) days, p=0.0026. Physical exercises for patients with CT-1 improved the quality of life, assessed by the EQ-5D questionnaire, by reducing the level of anxiety and depression. The Hazard Ratio (HR) for desaturation (<93%) was 2.34 (95% Confidence Interval (CI) 1.18-4.63) for group 2, p=0.001. The HR for C-reactive protein level above 50 mg/l in patients with CT-2 was 2.33 (95% CI 1.56-3.47), p=0.0001. Conclusions: Rehabilitation programs are safe for СOVID-19-patients; reduce hospital LOS; improve the quality of life. Continuous monitoring of a patient's condition during rehabilitation is essential. ClinicalTrials.gov ID: NCT0580836

Protein translational modifications (PTMs) generate an enormous, but as yet undetermined, expansion of the expressed proteoforms. In this Viewpoint, we firstly differentiate the concepts of proteoform and peptidoform by reviewing and discussing previous literature. We show that the current PTM biological investigation and annotation largely follow a PTM site-specific rather than proteoform-specific approach. We further illustrate a potentially useful matching strategy in which a particular “modified peptidoform” is matched to the corresponding “unmodified peptidoform” as a reference for the quantitative analysis between samples and conditions. We suggest this strategy could provide directly relevant information for learning the PTM site-specific biological functions. Accordingly, we advocate for the wider use of the nomenclature “peptidoform” in the future bottom-up proteomic studies.

This article investigates the information matching efficiency of the sponsored auction mechanism of search engine platform by implementing consumer purchase strategy. Then we examine the incentive mechanism for sellers to report product quality truthfully under information asymmetry and the reason how product quality signal could improve information matching efficiency of the sponsored auction mechanism. Using the data collected from Baidu search engine, we empirically test the theoretical research results. Our main research finding: under information asymmetry and without product quality signal mechanism, the equilibrium of bidding rank cannot match the consumer purchase strategy at all, causing the consumer welfare to suffer double losses due to the adverse selection of sellers. In the contrast, the search engine could improve partially the information matching efficiency of the sponsored search auction mechanism by identifying the product quality signal brought by the sellers with the highest product quality. However, the search engine has no incentive to design product quality signal for sellers.

Schizoaffective disorder and its classification have always been a topic of discrepancy among researchers. The overlapping presentations of schizoaffective disorder, schizophrenia and psychotic bipolar disorder makes it difficult to classify and diagnose. This study is a narrative review of literatures and genetic and epidemiological research evidences, done to determine the similarities and differences between schizoaffective and psychotic bipolar disorder. Beginning from the introduction of schizoaffective disorder as "schizoaffective psychosis" by Kasanin in 1933, various researchers have proposed different views regarding the diagnosis and classifications for schizoaffective disorder. DSM-III considered schizoaffective disorder as a diagnosis of exclusion as it fails to fit the definite diagnostic criteria of schizophrenia, major affective disorders, or schizophreniform disorder. DSM-V updated the criteria of schizoaffective disorder and stated it as a life time illness rather than being an episodic disorder as in DSM-IV and hence is more reliable. However, some studies show that schizoaffective disorder patients are more like schizophrenia than mood disorder. It still remains unclear whether schizoaffective disorder is a heterogenous disease, a form of schizophrenia, a form of mood disorder or a midpoint in the continuation spectrum of schizophrenia and psychotic bipolar disease.

3D object detection is essential for an accurate and reliable autonomous driving system. Currently, the methods used by the state-of-the-art two-stage detectors are not flexible enough and their fea-ture extraction capabilities are very limited to cope effectively with the disorder and irregularity of point clouds. In this paper, we combine the advantages of both PV-RCNN and PAConv (Position Adaptive Convolution) to create a completely new network, FANet, in order to overcome the ir-regularity and disorder of point clouds. The convolution in our network builds convolutional ker-nels from a basic weight matrix, whose combined coefficients are learned adaptively by LearnNet from relative points. This network allows for flexible modeling of complex spatial variations and geometric structures in the 3D point cloud, enabling better extraction of point cloud features and producing high-quality 3D proposal boxes. Compared to other methods, FANet is superior in terms of 3D object detection accuracy. Extensive experiments on the KITTI dataset have shown a signif-icant improvement in our approach.

In this paper, we present the idea of Self Supervised learning on the Shape Completion and Classification of point clouds. Most 3D shape completion pipelines utilize autoencoders to extract features from point clouds used in downstream tasks such as Classification, Segmentation, Detection, and other related applications. Our idea is to add Contrastive Learning into Auto-Encoders to learn both global and local feature representations of point clouds. We use a combination of Triplet Loss and Chamfer distance to learn global and local feature representations. To evaluate the performance of embeddings for Classification, we utilize the PointNet classifier. We also extend the number of classes to evaluate our model from 4 to 10 to show the generalization ability of learned features. Based on our results, embedding generated from the Contrastive autoencoder enhances Shape Completion and Classification performance from 84.2% to 84.9% of point clouds achieving the state-of-the-art results with 10 classes.

Vienna Atomic Line Database (VALD) contains data on atomic and molecular energy levels and parameters of spectral lines required for stellar spectra analysis. Hundreds of millions lines for fine spectral synthesis and for opacity calculations are collected in present version of VALD (VALD3). Critical evaluation of the data and the diversity of extraction tools support high popularity of VALD among users. The data model of VALD3 incorporates obligatory links to the bibliography making our database more attractive as publishing platform for data producers. The VALD data quality and completeness are constantly improving allowing better reproduction of stellar spectra. To illustrate continuous evolution of the data content we present a comparative analysis of the recent experimental and theoretical atomic data for Fe-group elements, which will be included in the next VALD release. This release will also include a possibility for extracting the line data with full isotopic and hyperfine structures.

This work focuses on identifying the most effective machine learning techniques and supervised learning models to precisely estimate power output from Photovoltaic (PV) plants. The performance of various regression models is analyzed by harnessing experimental data, including Random Forest, Support Vector Regression (SVR), Multi-layer Perceptron (MLP), Linear Regressor (LR), Gradient Boosting, and k-Nearest Neighbors (KNN). The methodology applied starts with meticulous data preprocessing steps aimed at ensuring dataset integrity. Following the preprocessing phase, which entails eliminating missing values and outliers using Isolation Feature selection based on a correlation threshold, is performed to identify relevant parameters for accurate prediction in PV systems. Subsequently, Isolation Forest is employed for outlier detection, followed by model training and evaluation using key performance metrics such as Root Mean Squared Error (RMSE), Normalized Root Mean Squared Error (NRMSE), Mean Absolute Error (MAE), and R-squared (R2). Among the array of models evaluated, Random Forest emerges as the top performer, highlighting promising results with an RMSE of 19.413, NRMSE of 0.048% and an R2 score of 0.968. Furthermore, the best-performing model is integrated into a MATLAB application for real-time predictions, thereby enhancing usability and accessibility for a wide range of applications in renewable energy.

Like traditional single label learning, multi-label learning is also faced with the problem of dimensional disaster.Feature selection is an effective technique for dimensionality reduction and learning efficiency improvement of high-dimensional data. In this paper, Logistic regression, manifold learning and sparse regularization were combined to construct a joint framework for multi-label feature selection (LMFS). Firstly, the sparsity of the eigenweight matrix is constrained by the $L_{2,1}$-norm. Secondly, the feature manifold and label manifold can constrain the feature weight matrix to make it fit the data information and label information better. An iterative updating algorithm is designed and the convergence of the algorithm is proved.Finally, the LMFS algorithm is compared with DRMFS, SCLS and other algorithms on eight classical multi-label data sets. The experimental results show the effectiveness of LMFS algorithm.

Finding an optimal combination of features and classifier is still an open problem in the development of automatic heartbeat classification systems, especially when applications that involve resource-constrained devices are considered. In this paper, a novel study of the selection of informative features and the use of a random forest classifier while following the recommendations of the Association for the Advancement of Medical Instrumentation (AAMI) and an inter-patient division of datasets is presented. Features were selected using a filter method based on the mutual information ranking criterion on the training set. Results showed that normalized R-R intervals and features relative to the width of the QRS complex are the most discriminative among those considered. The best results achieved on the MIT-BIH Arrhythmia Database were an overall accuracy of 96.14% and F1-scores of 97.97%, 73.06%, and 90.85% in the classification of normal beats, supraventricular ectopic beats, and ventricular ectopic beats respectively. In comparison with other state of the art approaches tested under similar constraints, this work represents one of the highest performances reported to date while relying on a very small feature vector.

(1) Background: Considering highly selected patients with ductal carcinoma in situ (DCIS), active surveillance is a valid alternative to surgery. Our study is aimed at showing the reliability of post-biopsy complete lesion removal, documented by mammogram, as additional criterion to select these patients. (2) Methods: 2173 Vacuum Assisted Breast Biopsies (VABB) documented as DCIS have been reviewed. Surgery has been performed in all cases. We retrospectively collected the reports of post-VABB complete lesion removal and the histological results of the biopsy and surgery. We calculated the rate of upgrade of DCIS identified on VABB upon excision for patients with post-biopsy complete lesion removal and for those showing residual lesion. (3) Results: We observed 2173 cases of DCIS: 408 classified as low grade; 1262 as intermediate grade; 503 as high grade. The overall upgrading rate to invasive carcinoma was 15.2% (330/2173). The upgrade rate was significantly lower (8.2%) when considering patients showing mammographically documented complete removal of the lesion. (4) Conclusion: The absence of mammographically documented residual lesion following VABB is associated to a lower upgrading rate of DCIS to invasive carcinoma on surgical excision and should be considered when deciding the proper management DCIS diagnosis.

Hyperspectral anomaly detection is to recognize anomalies from complex scene in an unsupervised way. Currently, many spectral-spatial detection methods have been proposed with a cascaded manner. However, they often neglect complementary characteristics between spectral and spatial dimensions, which easily leads to yield high false alarm rate. To alleviate this issue, a spectral-spatial information fusion (SSIF) method is designed for hyperspectral anomaly detection. First, an isolation forest is exploited to obtain spectral anomaly map, in which the object-level feature is constructed with entropy rate segmentation algorithm. Then, a local spatial saliency detection scheme is proposed to produce spatial anomaly result. Finally, the spectral and spatial anomaly scores are integrated together followed by a domain transform recursive filtering to generate the final detection result. Experiments on five hyperspectral datasets prove that the proposed SSIF produces superior detection result over other state-of-the-art detection techniques.

The port environments have some structures that still need regular control. However, the nature of these environments presents a number of challenges in determining an accurate vehicle position and consequently performing successful image similarity detection. These scenarios, however, can have poor visibility conditions and are highly dynamic, making place recognition difficult because the appearance of a place can change over time. Under these operational conditions, imaging sonars are a promising solution. There are some factors that affect the quality of the captured images, but the fact that they do not suffer from haze is a plus. Therefore, in this paper, a purely acoustic similarity detection method based on forward-looking sonar (FLS) data is proposed to overcome the inherent perceptual problems in a port scenario. Considering the lack of available data in this context and to facilitate the variation of environmental parameters and sensor configurations, a port scenario was simulated using the Stonefish simulator. Experiments were conducted on predefined trajectories near structures. The place recognition approach performs better compared to the results obtained with optical imagery. In general, it provides a good compromise in terms of distinctiveness and achieves a performance of 87.5% when appropriate constraints and assumptions are made.

This paper presents a new algorithm for semi-supervised action recognition using adaptive feature analysis. We model the samples of the same action as the same manifold and those of different actions as different manifolds, and integrate feature correlation mining and visual similarity mining into a joint framework. By maximizing the separability between different classes based on the labeled data, the proposed algorithm learns multiple features from labeled data and utilizes the intrinsic geometric structure of the data distribution between labeled and unlabeled data to boost the recognition. We introduce Projected Barzilai-Borwein (PBB) to train a subspace projection matrix as classifier. Extensive experiments on three benchmark datasets demonstrate that our algorithm outperforms the existing semi-supervised action recognition algorithms when there are a few labeled training samples.

Pedestrian multi-target tracking technology plays an important role in artificial intelligence, driverless, virtual reality and other fields. The pedestrian multi-target tracking algorithm DeepSORT based on detection is widely used in industry. It mainly tracks multiple pedestrian targets continuously and keeps their ID unchanged. In order to improve the applicability and tracking accuracy of DeepSORT algorithm, this paper improved the IOU distance measurement in the matching process. At the same time, ResNet50 is used as the feature extraction backbone network, and combined with FPN (Feature Pyramid Network), the appearance features of multi-layer pedestrians are fused to improve the tracking accuracy of DeepSORT algorithm. The proposed algorithm is verified on the public data set MOT-16 and it’s tracking accuracy is enhanced to 4.1%.