Table detection is a preliminary step in extracting reliable information from tables in scanned document images. We present CasTabDetectoRS, a novel end-to-end trainable table detection framework that operates on Cascade Mask R-CNN, including Recursive Feature Pyramid network and Switchable Atrous Convolution in the existing backbone architecture. By utilizing a comparatively lightweight backbone of ResNet-50, this paper demonstrates that superior results are attainable without relying on pre and post-processing methods, heavier backbone networks (ResNet-101, ResNeXt-152), and memory-intensive deformable convolutions. We evaluate the proposed approach on five different publicly available table detection datasets. Our CasTabDetectoRS outperforms the previous state-of-the-art results on four datasets (ICDAR-19, TableBank, UNLV, and Marmot) and accomplishes comparable results on ICDAR-17 POD. Upon comparing with previous state-of-the-art results, we obtain a significant relative error reduction of 56.36%, 20%, 4.5%, and 3.5% on the datasets of ICDAR-19, TableBank, UNLV, and Marmot, respectively. Furthermore, this paper sets a new benchmark by performing exhaustive cross-datasets evaluations to exhibit the generalization capabilities of the proposed method.

Over the years, the need for autonomous systems such as drones, also known as unmanned aerial vehicles (UAVs), has significantly increased in popularity across several industries, including the military. The Internet of Battlefield Things (IoBT) represents a modern technological advancement that significantly enhances the operational efficacy of defense systems. It establishes an integrated military force by connecting individuals to intelligent technology in drones, radios, equipment, antennas and ground stations. This is achieved through the utilization of cloud and edge computing, sensors, mobile devices, embedded systems, and IoT-based systems. However, IoBT security is significantly compromised by enemies that exploit the vulnerabilities and malicious intrusions that specifically target the external environment or to obtain sensitive data. In addition, a comprehensive understanding of cyberattacks and countermeasures is essential for assuring the security of IoBT. On the other hand, as cyber threats get more complicated, trust becomes increasingly important for the security of digital systems. Within this context, the zero trust architecture contends that the security of a complex network is inherently vulnerable to internal and external threats. In defense, UAV security system applications, for example, the primary purpose of the zero trust architecture is to limit the vulnerability of military UAV systems to cyberattacks, hence reducing the possibility of data breaches and illegal entry. This study conducts a systematic review aimed at identifying different aspects of cybersecurity strategies for protecting UAV systems within the IoBT domain. Furthermore, zero trust architecture is presented in the study as an effective prospective solution to the security issues that develop in defense UAV systems.

Pipeline conflicts arising from data dependencies are a common issue encountered in the hardware implementation of layered QC-LDPC decoders. This paper proposes an efficient layered decoding architecture to reduce pipeline conflicts without introducing stall cycles, by reordering the processing order offline and using the patch method based on variable-to-check message. The experimental results on the LDPC code of the IEEE802.16 standard in the OFDM-PON system demonstrate that the proposed architecture has a sensitivity improvement of 0.125 dBm and 0.375 dBm, respectively, compared with our previous work and the method described in the other work.

Throughout the evolution of machine learning, the size of models has steadily increased as researchers strive for higher accuracy by adding more layers. This escalation in model complexity necessitates enhanced hardware capabilities. Today, state-of-the-art machine learning models have become so large that effectively training them requires substantial hardware resources, which may be readily available to large companies but not to students or independent researchers. To make the research on machine learning models more accessible, this study introduces a size reduction technique that leverages stages in Pyramid Training and Similarity Comparison. Our results demonstrate that pyramid training can reduce model complexity while maintaining accuracy of conventional full-sized models, offering a scalable and resource-efficient solution for researchers and practitioners in hardware-constrained environments.

The decarbonization of the built environment, both in new construction and renovation, is crucial to mitigate its relevant impact on climate change and achieve the Paris agreement goals. This study presents a systematic LCA-based methodology to assess the whole life carbon emissions of buildings, applied to a proposal for the regeneration of one of Milan’s disused railway yards. As an entry for the 2020 Reinventing Cities competition, Scalo Lambrate is a project for a mainly residential neighborhood with a public park. Strategies to reduce carbon emissions deriving both from the operational energy and construction and maintenance were evaluated and their effects compared to a reference scenario over a time horizon of 100 years. The results show that, while the opportunities to reduce carbon emissions during the use phase are somehow limited due to the already stringent performance requirements for new builds, the use of fast-growing biogenic materials for construction materials, even if mixed with more traditional ones, can provide a significant reduction of the global warming potential over the whole life cycle, with a reduction of 70% over the baseline. The remaining emissions can be offset with afforestation initiatives that, however, must be assessed against land use issues.

Reservoir computers (RCs) are a biology inspired computational framework for signal processing typically implemented using recurrent neural networks. Recent work has shown that Boolean networks (BN) can also be used as reservoirs. We analyze the performance of BN RCs, measuring their flexibility and identifying factors that determine effective approximation of Boolean functions that are applied in a sliding-window fashion over a binary signal, either non-recursively or recursively. We train and test BN RCs of different sizes, signal connectivity, and in-degree to approximate 3-bit, 5-bit and 3-bit recursive binary functions. We analyze how BN RC parameters and function average sensitivity, a measure of function smoothness, affect approximation accuracy as well as the spread of accuracies for a single reservoir. We found that approximation accuracy and reservoir flexibility are highly dependent on RC parameters. Overall, our results indicate that not all reservoirs are equally flexible and RC instantiation and training can be more efficient if this is taken into account. The optimum range of RC parameters opens up an angle of exploration for understanding how biological systems might be tuned to balance system restraints with processing capacity.

The use of Hyperspectral (HS) and LiDAR acquisitions has a great potential to enhance mapping and monitoring practices of endangered grasslands habitats, beyond conventional botanical field surveys. In this study we assess the potentiality of Recursive Feature Elimination (RFE) in combination with Random Forest (RF) classification in extracting the main HS and LiDAR features needed to map selected Natura 2000 grasslands along Polish lowland river valleys, in particular alluvial meadows 6440, lowland hay meadows 6510 and xeric and calcareous grasslands 6120. We developed an automated RFE-RF system capable to combine the potentials of both techniques and applied it to multiple acquisitions. Several LiDAR-based products and different Spectral Indexes (SI) were computed and used as input in the system, with the aim of shedding light on the best-to-use features. Results showed a remarkable increase in classification accuracy when LiDAR and SI products are added to the HS dataset, strengthening in particular the importance of employing LiDAR in combination with HS. Using only the 24 optimal features selection generalized over the three study areas, strongly linked to the highly heterogeneous characteristics of the habitats and landscapes investigated, it was possible to achieve rather high classification results (K around 0.7-0.77 and habitats F1 accuracy around 0.8-0.85), indicating that the selected Natura 2000 meadows and dry grasslands habitats can be automatically mapped by airborne HS and LiDAR data. Similar approaches might be considered for future monitoring activities in the context of habitats protection and conservation

Generative AI has gained enormous interest nowadays due to new applications like chatGPT, DALL E, Stable Difussion and Deep Fake. Particularly DALL E, Stable Difussion and others (Adobe Firefly, ImagineArt...) are able to create images from a text prompt and are also able to recreate real photographs. Due to this fact, intense research has arisen to create new image forensics applications able to distinguish between real captured images and videos and artificial ones. Detecting forgeries made with Deep Fake is one of the most researched issues. This paper is about another kind of forgery detection. The purpose of this research aims to detect photo realistic AI created images versus real photos coming from a physical camera. For this purpose, techniques that perform a pixel level feature extraction are used. First one is Photo Response Non-Uniformity (PRNU). PRNU is a special noise due to imperfections on the camera sensor that is used for source camera identification. The underlying idea is that AI images will have a different PRNU pattern. Second one is Error level analysis (ELA). This is other type of feature extraction traditionally used for detecting image editions. In fact, ELA is being used nowadays by photographers to detect manually AI created images. Both kinds of features are used to train Convolutional Neural Networks to differentiate between AI images and real photographs. Good results are obtained achieving accuracy rates over 95%. Both extraction methods are carefully assessed by computing precision/recall and F1-score measurements.

Feature selection is a crucial step to overcome the curse of dimensionality problem in data mining. This work proposes Recursive k-means Silhouette Elimination (RkSE) as a new unsupervised feature selection algorithm to reduce dimensionality in univariate and multivariate time-series datasets. Where k-means clustering is applied recursively to select the cluster representative features, following a unique application of silhouette measure for each cluster and a user-defined threshold as the feature selection or elimination criteria. The proposed method is evaluated on a hydraulic test rig, multi sensor readings in two different fashions: (1) Reduce the dimensionality in a multivariate classification problem using various classifiers of different functionalities. (2) Classification of univariate data in a sliding window scenario, where RkSE is used as a window compression method, to reduce the window dimensionality by selecting the best time points in a sliding window. Moreover, the results are validated using 10-fold cross validation technique. As well as, compared to the results when the classification is pulled directly with no feature selection applied. Additionally, a new taxonomy for k-means based feature selection methods is proposed. The experimental results and observations in the two comprehensive experiments demonstrated in this work reveal the capabilities and accuracy of the proposed method.

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.

State-of-the-art remote sensing scene classification methods employ different Convolutional Neural Network architectures for achieving very high classification performance. A trait shared by the majority of these methods is that the class associated with each example is ascertained by examining the activations of the last fully connected layer, and the networks are trained to minimize the cross-entropy between predictions extracted from this layer and ground-truth annotations. In this work, we extend this paradigm by introducing an additional output branch which maps the inputs to low dimensional representations, effectively extracting additional feature representations of the inputs. The proposed model imposes additional distance constrains on these representations with respect to identified class representatives, in addition to the traditional categorical cross-entropy between predictions and ground-truth. By extending the typical cross-entropy loss function with a distance learning function, our proposed approach achieves significant gains across a wide set of benchmark datasets in terms of classification, while providing additional evidence related to class membership and classification confidence.

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.

In this paper, I introduce a new concept of representing numbers in base ; in other words, I have found new series for any number similar to series that could be written according to the collatz sequence which is called zi(n) in this article. These series need to end with 1. Then, we use two sets of rules to make a diagram which then proves the existence of such series for any number.In this diagram, by branching numbers into different branches in accordance to the modularity of 4 and continuing branching to the point that their numbers have enough common terms in their collatz series, we could reduce zi(n) to zi(k) so that k<n in any branch by Rule Number One. This diagram shows that zi(n) exists for every number, in other words, this proves the theorem (A) or zi-existence theorem. The proof of zi-existence theorem leads to a proof of the collatz conjecture because the collatz series could be written as a linear combination of such series that all of them end with 1, so the collatz series for any number ends with 1.

Abstract: Author attribution refers to identifying the author of a document by distinguishing between texts written by various authors. Since the author’s writing style is a straightforward concept of his writing habits, an author’s attribution can be used in various sections of society, including legal work, court cases, and plagiarism. This paper studies and compares a deep architecture that automatically identifies Persian writers through their writing styles. For this purpose, since there were no existing datasets suitable for author identification in Persian, the first step was to collect three different datasets: Novels, News, and Twitter. Afterward, the Word2Vec algorithm is trained on many Persian datasets and used as word embedding. To have syntactic features besides semantic ones, Part Of Speech (POS) embedding has also been used. In the next step, an attention mechanism and Long Short-Term Memory (LSTM) are coupled with residual connections. Thus, the current layer input becomes the output of all previous layers rather than the top one. The model implemented is superior in performance for all three types of data compared to earlier models in text classification and author attribution. Absolute accuracies of 90.22%, 85.10%, and 71.39% were achieved among the three Novels, News, and Tweets datasets.

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.

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.

Due to the broadening of services from industrial enterprises to customers, the industrial network has gained more significance than what is really thought. As a part of this revolution, this paper tried to introduce the best suitable routing option for the healthcare, banking and internet services industries to optimize the routing department of their enterprises. RIP is not associated with this study, being out of favor in the industries due to hop count limitation. The idea behind doing such a thing is to avoid improper implantation of routing inside the enterprises which causes lack of optimization in routing department. The method which is selected for this paper is qualitative case study of banking, healthcare and internet services industries with unstructured interviews of IT experts of the respected industries in an open-ended questions fashion. The results were illustrated based on the stories and the discussion of the stories is the main contributor to the result of the study. The evaluation results of the stories have illustrated, that EIGRP is a suitable routing option for health care and banking, while OSPF can be suitable for the internet services industry. The implication of the study can be optimized network of industries such as healthcare, banking and internet services and it introduces the best suitable routing option for the demanded industries with the case study method and narrative analysis of the stories, which start from load balancing type and ends to demanded routing protocol, while reaching to demanded routing protocol, it introduces the best suitable routing option of that industry

Diabetes mellitus is a popular life-threatening disease and patients may gradually have started suffering from other diabetes-causing diseases such as heart attacks, stroke, hypertension, blurry vision, blindness, foot ulcer, amputation, kidney damage and other organ failures before diagnosis. Early detection can help reduce the fatality of this disease. Deep learning models have proven very useful in disease detection and computer-aided diagnosis. In this work, we proposed a deep unsupervised machine learning model for early detection of diabetes using voting ensemble feature selection and deep belief neural networks (DBN). Dataset was obtained from an online repository containing responses of prediagnosed patients to direct questionnaires administered in Sylhet Diabetes Hospital in Sylhet, Bangladesh. The dataset was preprocessed and preprocessed. Features were reduced using the ensemble feature selector. The DBN model was pretrained and tuned to obtain optimal performance. The model was also compared with other models with no multiple hidden layers. The DBN performed at its relative best with F1-measure, precision and recall of 1.00, 0.92 and 1.00 respectively. We conclude that DBN is a useful tool for an unsupervised early prediction of Type II diabetes mellitus.

A model of a single-server queuing-inventory system (QIS) with catastrophes and a finite waiting room for consumer customers (c-customers) has been developed. When a catastrophe occurs, all inventory in the system's warehouse is destroyed, but c-customers in the system are still waiting for restocking. In addition to c-customers, negative customers (n-customers) are also taken into account, which displaces one c-customers (if any). The policy (?, ?) is used to replenish stocks. If upon arrival of the c-customer the inventory level is zero, then according to Bernoulli’s scheme this c-customer is either lost or joining the queue. The mathematical model of the studied QIS is constructed in the form of a two-dimensional continuous-time Markov chain (2D CTMC). Exact and approximate methods for calculating the steady-state probabilities of constructed 2D CTMCs are developed and closed-form expressions are derived for calculating the performance measures. The results of numerical experiments are presented, demonstrating the high accuracy of the developed approximate formulas, as well as the behavior of performance indicators depending on the reorder point. In addition, an optimization problem is solved to obtain the optimal reorder point to minimize the expected total cost.

Collatz conjecture (3x+1 problem) is a natural phenomenon in set theory that may be reconstructed using known combinatorics and order theory. Construction begins by selecting a specific order isomorphism with a bijectional order-embedding. Mapping by 3x+1 induces a unique property to only members of the mapped embedding. Under selective congruence from recursive division by two, that complex controls sequence behavior. This demonstration uses an order isomorphism consisting of two linear orders: the (1) odd positive integers and the always odd (2) Rule 50 Jacobsthal numbers, as the embedding. The argument proceeds by cardinality. When the order isomorphism is mapped under 3x+1, all Rule 50 Jacobsthal numbers are mapped to all the powers of four. This one-to-one correspondence guarantees that every odd integer is assigned to a Rule 50 Jacobsthal number, and subsequently, to a power of four. To align this construction with the conjecture, expand the set to all positive integers by showing that: (1) the powers of four embed the powers of two, in a natural way, and (2) the unique factorization of any positive even integer, not congruent to a power of two, is simply an odd integer, once the factorized power of two is divided out. In other words, if the initial choice for a positive integer is not congruent to a power of two, then recursion continues until a Rule 50 Jacobsthal number (guaranteed by cardinality) is attained. Since this value mapped by 3x+1 is always a power of four, repeated division by two will always send the sequence to one. Because this same process occurs for any choice of positive integer, Collatz conjecture is true.

This work is developed over the question ”How to automatically create a good clustering on spatial dataset with high different local densities?” opened by previus work of Berzi [5]. To answer the main question, this work describe a approach of recursive clustering process based on a technique of finding ”vague-solution”, where the output is an hierarchical clustering of initial dataset. In particularly the the approach is developed and tested on DBSCAN algorithm [11] with large dataset gathered by Google Place in Metropolitan Area of Milan. The core solutions developed in this algorithm are condensed in the capacity of generation a Hierarchical Clustering with a recursive select the best solutions in according tothe our goals, previously dfined by some sets of rules. The algorithm described here, and developed in my Master Thesis, rosolve two problem: - When we use an algorithm of clustering that can create a set of differents clustering, but equally valid and don’t know exctly what we must have as good solution, we areled to ask ourselves: ”What are the better?” This obviously depends by our goals, sonow the question is: ”What are our goals?”; - The second problem is condensed in the sentence ”Not all clusters can be found in one-shot clustering process, more often we must reapply the process to some part of datataset”, so there we have a second question that this paper answering: ”How to create clustering of data with ad-hoc processing for each different part of input dataset?”; These questions are resolved by the approaches named in this work as: Space of Solutions, Vague-Solution, Vague-Solution finding Method and finaly Recursive Clustering. All of these approaches was drafted and tested in mine Master Thesis titled ”Geospatial data analysis for Urban informatics applications: the case of the Google Place of the City of Milan” [25].

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.. .

The business practices and the vast academic research on the field have shown that even in the years of the great economic recession, there CSR and Ethics in business environment are still on the spotlight. The current study is conducted in Greece and is a cross-sector analysis. The study aims to evaluate if the concept of Carroll’s pyramid (1991) is still applied nowadays. This model expresses the business priorities, admitting that the rational business prioritizes profit as the base of the pyramid, followed by a legal way of operating, followed by ethical and philanthropic responsibilities. However, the growing interest on CSR and ethical issues may set this model on question. Baden (2016) has developed a critical evaluation that showing that the priorities have been changed. We employ a similar methodology to evaluate these priorities within the Greek business environment. A sample of 950 participants has been employed. The sample is consisted of various business hierarchy employees, from various Greek cities. The results show that despite the bad economic situation of the country, the economic responsibilities are not ranked on highest position: legal and ethical responsibilities are prioritized against economic responsibilities. These results confirm the findings of Baden (2016) and contribute on the relevant literature considering the necessity of CSR and Ethical issues in business environment nowadays.

Input reconstruction problem is usually encountered in the areas such as virtual sensing, image restoration, sensor linearization, and communications. The input reconstruction problem can be seen as an inverse problem. Given a nominal system, two types of approaches are commonly used for solving the inverse problem. The first one is to directly invert the nominal system, and the second one is to derive an inversion of the nominal system in an indirect way. However, for the first type of approaches, system inversion cannot be directly conducted under some conditions such as there exist nonminimum-phase zeros in the nominal system, while for the second type of approaches, simultaneously guaranteeing stability and causality of the obtained inversion is still not solved well. In order to avoid the drawbacks existing in the two types of approaches, an alternative approach is proposed for input reconstruction. In this approach, the input signal is first modeled as the output of a state-space model, afterwards two Kalman filters for the model resulted by combining the input signal model and the nominal system model are implemented alternatively such that the input signal can be sequentially reconstructed in an infinite horizon. The proposed input reconstruction approach is applied in two examples, and simulation results can illustrate the effectiveness of the proposed approach.

Here we present a fast and highly scalable community structure preserving network module detection that recursively integrates graph sparsification and clustering. Our algorithm, called SparseClust, participated in the most recent DREAM community challenge on disease module identification, an open competition to comprehensively assess module identification methods across a wide range of biological networks.

In the paper, the authors find two explicit formulas and recover a recursive formula for the generalized Motzkin numbers. Consequently, the authors deduce two explicit formulas and a recursive formula for the Motzkin numbers, the Catalan numbers, and the restricted hexagonal numbers respectively.

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.

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.

The Active Distribution Networks (ADNs) are Multi-Input Multi-Output (MIMO) systems with coupled dynamics which cause interactions among the control loops of the Distributed Energy Resources (DERs). This undesired effect lead to performance degradation in the voltage control. To mitigate the effects of these unavoidable coupling, the present paper proposes a systematic design procedure based on the analysis of the interaction's sources. In details, each DER is equipped with a double loop PI to control the active and reactive powers output by the Voltage Source Converter (VSC) which connects the DER to the network's node. Furthermore, to guarantee Ancillary Services (ASs), the two loops are coupled by a simple mechanism of cooperation of the active power to voltage regulation realized by a filtered droop law. To achieve voltage regulation with reduced loop interactions, the PI parameters and the filter's pulse are designed according to a two sequential steps procedure based on the (Internal Model Control) IMC technique. Simulation studies are finally presented to demonstrate that the proposed design method achieves both reduction of the loop interaction and robust voltage control in presence of model parameter uncertainty in the MIMO model.

Due to the influence of background conditions, lighting conditions, occlusion issues and the image resolution, how to extract robust person features is one of the difficulties in ReID research. Vision in Transformers (ViT) has achieved significant results in the field of computer vision. However, the existing problems still limit its application in ReID due to slow extraction of person features and difficulty in utilizing local features of people. To solve the mentioned problems, we utilize Pyramid Vision Transformer (PVT) as the backbone of feature extraction and propose a PVT-based ReID method in conjunction with other studies. Firstly, some improvements suitable for ReID are used on the PVT backbone, and we establish a basic model by using powerful methods verified on CNN-based ReID. Secondly, in an effort to further promote the robustness of the person features extracted by the PVT backbone, two new modules are designed. (1) The local feature clustering (LFC) is recommend to enhance the robustness of person features by calculating the distance between local features and global feature to select the most discrete local features and clustering them. (2) The side information embeddings (SIE) are used to encode non-visual information and send it into the network for training to reduce its impact on person features. Finally, the experiments show that PVTReID has achieved excellent results in ReID datasets and are 20% faster on average than CNN-based ReID methods.

Giant plasmonic surface enhancement has been observed in gold coated micron sized inverse pyramids entrapping a gold nanoparticle. The amplification of both surface enhanced Raman and photoluminescence signals was found to be dependent on the diameter of trapped gold nanoparticle and around 50-fold enhancement was detected for 250nm diameter sample relatively to the 50nm one. Finite differential time domain simulations, performed to determine the near-field distribution in the structure, showed that when the nanoparticle protrudes into the hotspot zone of the void, coupling of electromagnetic field occurs and the plasmon-related near-field enhancement is concentrated into the close vicinity of the nanoparticle, mainly into the close gaps around the tangential points of the curved sphere and the flat pyramid surface. This results in a more than 15 times increase of the near-field intensity, compared to the empty void.

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.

Proteomics research has become one of the most important topics in the fields of life science and natural science. At present, research on protein–protein interaction networks (PPINs) mainly focuses on detecting protein complexes or function modules. However, existing approaches are either ineffective or incomplete. In this paper, we investigate function module detection mechanisms in PPIN, including open databases, existing detection algorithms and recent solutions. After that, we describe the proposed solution based on simplified swarm optimization (SSO) algorithm and gene ontology knowledge. The proposed solution implements SSO algorithm for clustering proteins with similar function, and imports biological gene ontology knowledge for further identifying function complexes and improving detection accuracy. Furthermore, we use four different categories of species dataset for experiment: Fruitfly, Mouse, Scere, and Human. The testing and analysis result show that the proposed solution is feasible, efficient and could achieve a higher accuracy of prediction than existing approaches.

Image stitching is a crucial aspect of image processing. However, factors like perspective and environment often lead to irregular shapes in stitched images. Cropping or completion methods typically result in substantial loss of information. This paper proposes a method for rectifying irregularly images into rectangles using deformable meshes and residual networks. The method utilizes a convolutional neural network to quantify rigid structures of images. Choosing the most suitable mesh structure based on the extraction results, offering options such as triangular, rectangular, and hexagonal. Subsequently, the irregularly image, predefined mesh structure, and predicted mesh structure are input into a wide residual neural network for regression. The loss function comprises local and global, aimed at minimizing the loss of image information within the mesh and global target. This method not only significantly reduces information loss during rectification but also adapting to different images with various rigid structures. Validation on the DIR-D dataset shows this method outperforms state-of-the-art methods in image rectification.

In mathematics, one always aims to obtain new frameworks from specific ones. This also stratified to the regality of graphs, where one can produce numerous new graphs from a specific set of graphs. In this work we define some classes of pyramid graphs created by a gear graph and we derive straightforward formulas of the complexity of these graphs, using linear algebra matrix analysis techniques and employing knowledges of Chebyshev polynomials.

This paper proposed an optimal tracking control scheme through adaptive dynamic programming(ADP) for a class of partially unknown discrete-time nonlinear systems based on radial basis function neural network(RBF-NN). In order to acquire the unknown system dynamics, we use two RBF-NNs, the one is used to construct the identifier, and the another is used to directly approximate the steady-state control input, where a novel adaptive law is proposed to update neural network weights. While the optimal feedback control and the cost function are derived via feedforward neural networks approximating, it is proposed to regulate the tracking error, the critic network and the actor network are then trained online to obtain the solution of the associated Hamilton–Jacobi–Bellman (HJB) equation being built under the ADP framework. Simulations verify the effectiveness of the optimal tracking control technique using the neural networks.

With the integrated development of the Internet, wireless sensor technology, cloud computing, and mobile Internet, there has been a lot of attention given to research about and applications of the Internet of Things. A Wireless Sensor Network (WSN) is one of the important information technologies in the Internet of Things; it integrates multi-technology to detect and gather information in a network environment by mutual cooperation, using a variety of methods to process and analyze data, implement awareness, and perform tests. This paper mainly researches the localization algorithm of sensor nodes in a wireless sensor network. Firstly, a multi-granularity region partition is proposed to divide the location region. In the range-based method, the RSSI (Received Signal Strength indicator, RSSI) is used to estimate distance. The optimal RSSI value is computed by the Gaussian fitting method. Furthermore, a Voronoi diagram is characterized by the use of dividing region. Rach anchor node is regarded as the center of each region; the whole position region is divided into several regions and the sub-region of neighboring nodes is combined into triangles while the unknown node is locked in the ultimate area. Secondly, the multi-granularity regional division and Lagrange multiplier method are used to calculate the final coordinates. Because nodes are influenced by many factors in the practical application, two kinds of positioning methods are designed: the unknown node is in the positioning unit or not. When the unknown node is on the side of the positioning unit, we use the method of vector similarity. Moreover, we use the centroid algorithm to calculate the ultimate coordinates of unknown node. When the unknown node is not on the side of the positioning unit, we establish a Lagrange equation containing the constraint condition to calculate the first coordinates. Furthermore, we use the Taylor expansion formula to correct the coordinates of the unknown node. In addition, this localization method has been validated by establishing the real environment.

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.

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.

Image segmentation is the process of partitioning an image into multiple segments where the goal is to simplify the representation of the image and make the image more meaningful and easier to analyze. In particular, semantic segmentation is an approach of detecting the classes of objects, based on each pixel. In the past, most semantic segmentation models were for only one single style, such as urban street views, medical images, or even Manga. In this paper, we proposed a semantic segmentation model called Dual-Pyramid Wide Residual Network (DPWRN) to solve the segmentation for cross-style datasets, which is suitable for diverse segmentation applications. The DPWRN integrated the Pyramid of Kernel paralleled with Dilation (PKD) and Multi-Feature Fusion (MFF) to improve the accuracy of segmentation. To evaluate the generalization of the DPWRN and its superiority over most state-of-the-art models, three datasets with completely different styles are tested in the experiments. Finally, the DPWRN verified its generalization and also showed its superiority over most state-of-the-art models.

In Sub-Saharan Africa, despite poverty, chronic hunger and food insecurity, traditional eating has been related to positive health outcomes and sustainability. There is little health research on diet quality based on what African people consume. The defining characteristics of the traditional African cuisine are the richness in herbs and spices, fermented foods and beverages, and healthy and whole ingredients used. However, as countries in this region become more economically developed, there is a shift to “modern” occidental foods rich in saturated fats, sugar and sweeteners. As a result, there are increased incidences of previously unreported ailments due to unbalanced diet. The regular practice of infinite international aid to the region to curb food insecurity has been unsustainable, ineffective and with no end in sight. Local increase in production and productivity is imperative. Protein rich foods in dietary guidelines enhance only those of animal or plant sources while rich protein sources such of mushroom, has been absent in these charts. This article considers the valorisation of traditional African foods and the importance of establishing an African Food-Based Dietary Guidelines (AFBDGs), an unprecedented Food Pyramid, along with the added emphasis on the potential of African mushrooms, which may play a role in shielding Sub-Saharan Africans against the side-effects of a western stylish diet and promote health. It enhances the preventive role of mushrooms in viral diseases and other disorders.

Underwater Sensor Networks (UWSNs) can enable a broad range of applications such as resource monitoring, disaster prevention, and navigation-assisted. It is especially relevant for sensor nodes location in UWSNs. Global Positioning System (GPS) is not suitable for using in UWSNs because of the underwater propagation problems. Hence some localization algorithms based on the precise time synchronization between sensor nodes have been proposed which are not feasible for UWSNs. In this paper, we propose a localization algorithm called Two-Phase Time Synchronization-Free Localization Algorithm (TP-TSFLA). TP-TSFLA contains two phases, namely, range-based estimation phase and range-free evaluation phase. In the first phase, we address a time synchronization-free localization scheme base on the Particle Swarm Optimization (PSO) algorithm to decrease the localization error. In the second phase, we propose a Circle-based Range-Free Localization Algorithm (CRFLA) to locate the unlocalized sensor nodes which cannot obtain the location information through the first phase. In the second phase, sensor nodes which are localized in the first phase act as the new anchor nodes to help realize localization. Hence in this algorithm, we use a small number of mobile beacons to help achieve location without any other anchor nodes. Besides, to improve the precision of the range-free method, an extension of CRFLA by designing a coordinate adjustment scheme is updated. The simulation results show that TP-TSFLA can achieve a relative high localization ratio without time synchronization.

Nowadays the dynamism induced by the constant change of strategic decisions on the markets produces an extra difficulty in the management of an organization. The strategic decisions made by managers can become obsolete in a short period of time. One of the major difficulties in managing a commercial organization is to predict, with some precision degree, the impact some strategic decisions have on the financial results. Business Intelligence (BI) is an area widely used to help managers to make strategic decisions. But the methods used, behind the scenes, to achieve the conclusions are kept secret by BI company-based services. Modelling the environment can be a good option to study the impact of an action, provided by a strategic decision, in a real environment. A good model should give an approximate result of an action applied to a previous state of the environment. Artificial Neural Networks (ANNs) are proven to be excellent in modeling environments with some level of data noise. The same strategic action can have different results in different organizations. A tool that allows an evaluation of a strategic action applied to an environment should have a major importance in the management scope. Modeling the environment should save time and money for the organization to improve the performance of the strategic plan. If one evaluates the state of the environment after a strategic action being applied, it can be possible to mitigate the risk of failure of the strategic plan. As we will be able to verify, it is possible to use ANNs to model strategic environments that should allow the prediction of sales and operating results by the used strategies with some precision, although the level of success will be directly related with the user’s necessity.

Amid escalating urbanization, devising rational commercial space layouts is a critical challenge. Leveraging machine learning, this study uses a Back-propagation (BP) neural network to optimize commercial spaces in Weinan City's central urban area. The results indicate an increased number of commercial facilities with a trend of multi-centered agglomeration and outward expansion. Based on these findings, we propose a strategic framework for rational commercial space development emphasizing aggregation centers, development axes, and spatial guidelines. This strategy provides valuable insights for urban planners in small and medium-sized cities in the Yellow River Basin and metropolitan areas, ultimately showcasing the power of machine learning in enhancing urban planning.

In recent years, different deep learning frameworks were introduced for hyperspectral image (HSI) classification. However, the proposed network models have a higher model complexity and do not provide high classification accuracy if few-shot learning is used. This paper pre-sents an HSI classification method that combines random patches network (RPNet) and re-cursive filtering (RF) to obtain informative deep features. The proposed method first convolves image bands with random patches to extract multi-level deep RPNet features. Thereafter, the RPNet feature set is subjected to dimension reduction through principal component analysis (PCA) and the extracted components are filtered using the RF procedure. Finally, HSI spectral features and the obtained RPNet-RF features are combined to classify the HSI using a support vector machine (SVM) classifier. In order to test the performance of the proposed RPNet-RF method, some experiments were performed on three widely known datasets using a few training samples for each class and classification results were compared with those obtained by other advanced HSI classification methods adopted for small training samples. The comparison showed that the RPNet-RF classification is characterized by higher values of such evaluation metrics as overall accuracy and Kappa coefficient (https://github.com/UchaevD/RPNet-RF).

The paper studies some cases in physics such as Galilean inertia motion and etc., and presents a logical schema of recursive abduction, from which we can derive the universality of physical laws in an effective logical path without requiring infinite inductions. Recursive abduction provides an effective logical framework to connect a universal physical law with finite empirical observations based on both quasi-law tautologies and suitable recursive dimensions, two new concepts introduced in this paper. Under the viewpoint of recursive abduction, the historical difficulty from Hume’s problem naturally vanishes. In Hume’s problem one always misunderstood a time-recursive issue as an infinitely inductive problem and, thus, sank into an inescapable quagmire. With this new effective logical schema, the paper gives a concluding discussion to Hume’s problem and justifies the validity of probability argument for natural laws.

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.

One of the industries with the fastest rate of growth is healthcare, and this industry's enormous data requires extensive cloud storage. The cloud may offer some protection, but there is no assurance that data owners can rely on it for refuge and privacy amenities. Therefore, it is essential to offer security and privacy protection. Increased customer satisfaction with security and privacy preservation is crucial since healthcare big data and its sources are stored in the cloud and contain increasingly private and sensitive information. However, maintaining privacy and security in an untrusted green cloud environment is difficult, thus the data owner should have complete data control. A new work SecPri-BGMPOP(security and privacy of Boost graph Convolutional Network -Pinpointing-Optimization Performance) is suggested that can offer a solution that involves several different steps in order to handle the numerous problems relating to security and protecting privacy. Initially Boost Graph Convolutional Network Clustering (BGCNC) algorithm, which reduces computational complexity in terms of time and memory measurements, is first applied to the input dataset to begin the clustering process. Second, enlarge by employing a piece of the magnifying bit string to generate a safe key, pinpointing based encryption avoids amplify leakage even if a rival or attacker decrypts the key or asymmetric encryption. Finally, to determine the accuracy of the method, an optimal key was created using a meta-heuristic algorithmic framework called Hybrid fragment horde bland lobo Optimization (HFHBLO). Our proposed method currently kept in a cloud environment, allowing analytics users to utilize it without risking their privacy or security.

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.

Previous high throughput screening studies indicated trans-eQTLs tend to be tissue specific. In this study, I probed if this feature can be used to identify tissue-specific gene regulatory networks. eQTL data (P<5e-8) for 16,259 genes were identified and their summary association statistics were obtained from the eQTLGene database. Next, eQTLs that display both cis and trans regulatory effects were selected and the association between their corresponding genes were examined using Mendelian randomization. A total of 169 genes that exerted trans-regulatory impacts on 692 genes were identified. 90% of the genes (N=749) aggregated into a gene regulatory network significantly enriched in hemo-immune processes. The robustness of finding was confirmed through simulation. The identified network displayed the scale-free topology. This provided the reason to examine the association of the network’s hub genes with the phenome. The outcome of analyses revealed GSDMB and ORMDL3 impact several disorders of immune origin and ALDH2 overexpression contributes to obesity. This study reports trans-eQTLs can be used to identify tissue-specific gene regulatory networks and describes a workflow to achieve this purpose. The network identified in this study showed scale-free topology indicating the hub genes of a GRN could be targeted to prevent disease outcomes.

Machine learning models are increasingly being used in critical domains, but their complexity, lack of transparency, and poor interpretability remain problematic. Decision trees (DTs) and rule-based approaches are well-known examples of interpretable models, and numerous studies have investigated techniques for approximating tree ensembles using DTs or rule sets; however, tree ensemble approximators do not consider interpretability. These methods are known to generate three main types of rule sets: DT-based, unordered-based, and decision list-based. However, no known metric has been devised to distinguish and compare these rule sets. Therefore, the present study proposes an interpretability metric to allow comparisons of interpretability between different rule sets, such as decision list- and DT-based rule sets, and investigates the interpretability of the rules generated by the tree ensemble approximators. To provide new insights into the reasons why decision list-based and inspired classifiers do not work well for categorical datasets consisting of mainly nominal attributes, we compare objective metrics and rule sets generated by the tree ensemble approximators and the \textit{Recursive-Rule eXtraction algorithm (Re-RX) with J48graft}. The results indicated that \textit{Re-RX with J48graft} can handle categorical and numerical attributes separately, has simple rules, and achieves high interpretability, even when the number of rules is large.

In tele-monitoring, wireless body area networks (WBANs), sleep analysis and other applications involving electroencephalogram (EEG) signal, due to the high number of EEG recording channels, long recording time and several repetition of recordings to reach the highest signal-to-noise ratio, the amount of acquired data by the sensors is too large, demanding use of some compression procedure. Compressed sensing can be considered as one of the most effective compression methods in terms of compression ratio, which needs the underlying signal be sparse or have sparse representation in an appropriate domain. EEG signal is not sparse in time domain, therefore, in this paper correlation based weighted recursive least squares dictionary learning algorithm (CBW-RLS) is proposed that uses between-channel correlations to sparsify EEG signals. Due to the low-rank structure of EEG signals, exploiting between-channel correlations increase the sparsity level of the model while reducing the computational cost of dictionary learning procedure. This is done by merely updating the dictionary atoms which are involved in the sparse model of the previous data, reducing the total number of data used at each iteration and speeding up the dictionary learning algorithm. The simulation results show that the proposed method has better performance in terms of both quality of the EEG reconstruction and the computational cost compared to the other methods.

System-of-systems (SoS) evolution is a complex and unpredictable process. Although various principles to facilitate collaborative SoS evolution have been proposed, there is a lack of experimental data validating their effectiveness. To address these issues, we present an Agent-Based Model (ABM) for SoS evolution in the Internet of Vehicles (IoV) , serving as a quantitative analysis tool for SoS research. By integrating multiple complex and rational behaviors of individuals, we aim to simulate real-world scenarios as accurately as possible. To simulate the SoS evolution process, our model employs multiple agents with autonomous interactions and incorporates external environmental variables. Furthermore, we propose three evaluation metrics: evolutionary time, degree of variation, and evolutionary cost, to assess the performance of SoS evolution. Our study demonstrates that enhanced information transparency significantly improves the evolutionary performance of distributed SoS. Conversely, the adoption of uniform standards only brings limited performance enhancement to distributed SoSs. Although our proposed model has limitations, it stands out from other approaches that utilize Agent-Based Modeling to analyze SoS theories. Our model focuses on realistic problem contexts and simulates realistic interaction behaviors. This study enhances the comprehension of SoS evolution processes and provides valuable insights for the formulation of effective evolutionary strategies.

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.

Signal preprocessing and feature extraction are two important and necessary steps of data analysis. In signal analysis, typically these two steps are implemented through multiple algorithms. Moreover, the significant parameters in most algorithms are set empirically. We have developed an algorithm that can preserve and highlight characteristic waveforms while attenuating non-feature waveforms. The parameters in the algorithm are set through difference analysis. We have conducted experiments on both clinical and open-source ECG data, obtaining effective test results.

Parkinson’s Disease (PD) is a neurodegenerative and progressive disease that impacts the nerve cells in the brain and varies from person to person. The exact cause of PD is still unknown, and the diagnosis of PD does not include a specific objective test with certainty. Although deep learning has made great progress in medical neuroimaging analysis, these methods are very susceptible to biases present in neuroimaging datasets. An innovative decorrelated deep learning technique is introduced to mitigate class bias and scanner bias while simultaneously focusing on finding distinguishing characteristics in resting-state functional MRI (rs-fMRI) data, which assist in recognizing the PD with good accuracy. The decorrelation function reduces the non-linear correlation between features and bias in order to learn bias-invariant features. The Parkinson’s Progression Markers Initiative (PPMI) dataset, referred to as a single scanner imbalanced dataset in this study used to validate our method. The imbalanced dataset problem affects the performance of the deep learning framework by overfitting to the majority class. To resolve this problem, we propose a new Decorrelated Convolutional Neural Networks (DcCNN) framework by applying decorrelation-based optimization to Convolutional Neural Networks(CNN). An analysis of evaluation metrics comparisons shows that integrating the decorrelation function boosts the performance of PD recognition by removing class bias. Specifically, our DcCNN model performs significantly better than existing traditional approaches to tackle the imbalance problem. Finally, the same framework can be extended to create scanner invariant features without significantly impacting the performance of a model. The obtained dataset is a multi-scanner dataset which leads to scanner bias due to the differences in acquisition protocols and scanners. The multi-scanner dataset is a combination of two datasets, namely PPMI and FTLDNI - frontotemporal lobar degeneration neuroimaging initiative (NIFD) dataset. The results of t-distributed stochastic neighbor embedding (t-SNE) and scanner classification accuracy of our proposed Feature Extraction-DcCNN (FE-DcCNN) model validated the effective removal of scanner bias. Our method achieves an average accuracy of 77.80% on a multi-scanner dataset for differentiating PD from healthy control, which is superior to the DcCNN model trained on a single scanner imbalanced dataset.

In China, environmental pollution generated via industrialization as well as the profound changes in the social structure and gradual maturation of the social hierarchy have jointly contributed to the Chinese people's increased environmental consciousness and appeals for environmental justice (EJ). Because of the absence of an EJ theory and a lack of empirical research focused on China, this paper proposes a ‘Pyramid Model’ for China’s EJ research that involves the following three factors: basic demographic and socioeconomic factors, U.S.-based EJ principles, and Chinese characteristics. A nationwide pilot analysis of environmental inequity at the prefecture level is conducted by empirically studying the association of demographics and socioeconomic status with sources of industrial pollution in China. The prefecture-based results are shown to be robust and indicate that areas inhabited by ethnic minorities and western regions in China carry disproportionate environmental burdens. However, a different picture for migrants is presented, revealing that Chinese migrants are not currently exposed to greater levels of industrial pollution, and relevant interpretations of these findings are provided. The results also show that environmental inequality associated with income level, which is observed in the U.S., does not occur in China.

Firstly, we present a more explicit formulation of the complete system $D(N)$ of representatives of Manin's symbols over $\mathbb{Q}$, which was initially given by Shimura. Then we establish a bijection between $D(M)\times D(N)$ and $D(MN)$ for $(M,N)=1$, which reveals a recursive structure between Manin's symbols of different levels. Based on Manin's complete system $\Pi (N)$ of representatives of cusps on $X_0(N)$ and Cremona's characterization of the equivalence between cusps, we establish a bijection between a subset $C(N)$ of $D(N)$ and $\Pi (N)$, and then establish a bijection between $C(M)\times C(N)$ and $C(MN)$ for $(M,N)=1$. We also provide a recursive structure for elliptical points on $X_0(N)$. Based on these recursive structures, we obtain recursive algorithms for constructing Manin symbols over $\mathbb{Q}$, cusps and elliptical points on $X_0(N)$. This gives rise to a more efficient algorithms for modular elliptic curve. As direct corollaries of these recursive structures, we present a recursive version of the genus formula and an elementary proof of formulas of the numbers of $D(N)$, cusps and elliptical points on $X_0(N)$.

In recent years, the emergence of spatiotemporal big data has made the transition of functional identification from the physical dimension to socioeconomic or human activities becoming more common. In the identification of urban functional areas, most studies considered only a single data source and a single division scale, the research results have problems such as low update frequency or incomplete information in a single data set, and overfitting or underfitting in a single spatial resolution. Using taxi trajectory data and point of interest (POI) data as the main data source, this study proposes a multi-scale recursive identification method for urban functional areas based on cross-validation. First, used the dynamic time warping (DTW) algorithm generates a time series similarity matrix, the CA-RFM model combines the clustering algorithm and random forest model is constructed, the model uses a clustering algorithm (K-MEDOIDS) to extract sig-nificant feature regions as input, which are imported into the random forest model for UFZ identification. Then, to overcome the shortcomings of single scale in expressing urban structural characteristics, a recursive model of different levels of urban road networks is established to classify multi-scale functional areas. Finally, cross-validation using the CA-RFM model and POI quantitative identification method, obtains the final identification results of urban functional areas. This paper selects Shenzhen as the study area for the case study, the results show that the com-bination of clustering algorithm and random forest model greatly reduces the error of manual selection of training samples. In addition, the research shows the superiority of the multi-scale recursive identification method that fuses multi-source data and performs cross-validation from two aspects, that is, the division speed of urban functional area identification results is accelerated and the accuracy is improved.

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.

Wireless Powered Communication Networks (WPCN), which has attracted much attention of researchers, also been recently recommended in 5^th generation (5G) wireless networks. With the help of the WPCN, the reliability and battery life of wireless low-power devices can be improved. In this paper, we investigate throughput and ergodic capacity in WPCN-assisted amplify-and-forward (AF) relaying system, considering two transmission modes including delay-tolerant and delay-limited. As important achievement, we propose symmetric energy harvesting protocol, namely time power switching relaying (TPSR) in order to find maximal throughput. In particular, both time switching and power switching coefficients in this schemes are considered. Unlike most of the previous works, we further focus on impact of outdated channel state information (CSI) in this WPCN. In order to evaluate information processing efficiency, the performance can be substantially improved by optimally harvesting time and power coefficients of the received signal at relay node for energy and information extraction, and by deploying several scenarios. By deploying Monte Carlo simulation, it is confirmed that the system performance is more sensitive to CSI estimation error, noise variance, signal-to-noise ratio (SNR) and resulting in other reasonable computations of TPSR need be deployed to obtain QoS requirement.

Conceived and developed by Christopher Alexander through his life’s work: The Nature of Order, wholeness is defined as a mathematical structure of physical space in our surroundings. Yet, there was no mathematics, as Alexander admitted then, that was powerful enough to capture his notion of wholeness. Recently, a mathematical model of wholeness, together with its topological representation, has been developed that is capable of addressing not only why a space is good, but also how much goodness the space has. This paper develops a structural perspective on goodness of space – both large- and small-scale – in order to bridge two basic concepts of space and place through the very concept of wholeness. The wholeness provides a de facto recursive definition of goodness of space from a holistic and organic point of view. A space is good, genuinely and objectively, if its adjacent spaces are good, the larger space to which it belongs is good, and what is contained in the space is also good. Eventually, goodness of space – sustainability of space – is considered a matter of fact rather than of opinion under the new view of space: space is neither lifeless nor neutral, but a living structure capable of being more living or less living, or more sustainable or less sustainable. Under the new view of space, geography or architecture will become part of complexity science, not only for understanding complexity, but also for making and remaking complex or living structures.

The intense motion of a ship can greatly impacts the comfort of crew members and the safety of the vessel. Therefore, accurately estimating and predicting ship attitudes has become an important issue. This paper introduces the latest development in functional deep learning model called DeepOnet. It takes wave height as input and ship motion as output, using a cause-to-result prediction approach. The modeling data used in this study is sourced from publicly available experimental data from the Iowa Institute of Hydraulic Research. Firstly, parameters system tuning was conducted for the neural network's hyperparameters to determine the appropriate combination of parameters. Secondly, the DeepOnet model for wave height and multi-degree-of-freedom motion was established, and the influence of increasing time steps on prediction accuracy was examined. Finally, a comparison was made between the DeepOnet model and the classical time series model LSTM. It was found that the DeepOnet model had a 10-fold improvement in accuracy for roll and heave attitudes. Moreover, as the forecast duration increased, the advantage of DeepOnet showed a trend of strengthening. As a functional prediction model, DeepOnet provides a new promising tool for very short-term prediction of ship motion.

This paper presents a new method for the design of separable denominators 2-D IIR filters with nearly linear phase in the passband. The design method is based on a balanced-realization model reduction technique. The nearly linear-phase 2-D IIR filter is designed using 2-D model reduction from a linear-phase 2-D FIR filter, which serves as the initial filter. The structured controllability and observability Gramians $P^s$ and $Q^s$ serve as the foundation for this technique. These Gramians are block diagonal positive-definite matrices that satisfy 2-D Lyapunov equations. An efficient method is used to compute these Gramians by minimizing the traces of $P^s$ and $Q^s$ under linear matrix inequalities (LMI) constraints. The use of these Gramians ensures that the resulting 2-D IIR filter preserves stability and can be implemented using a separable denominator 2-D filter with fewer coefficients than the original 2-D FIR filter. Numerical examples show that the proposed method compares favorably with existing techniques.

Antimony (Sb) has gained significance as a critical raw material (CRM) within the European Union (EU) due to its strategic importance in various industrial sectors, particularly in the textile industry for flame retardants and as a component of Sb-based semiconductor materials. Moreover, Sb is emerging as a potential alternative for anodes used in lithium-ion batteries, a key element in the Energy transition. This study focused on exploring the feasibility of identifying and quantifying Sb mineralizations through the spectral signature of soils using reflectance spectroscopy, a non-invasive remote sensing technique, and by employing deep learning algorithms such as Convolutional Neural Networks (CNNs). Common signal preprocessing techniques were applied to the spectral data, and the soils were analyzed by Inductively Coupled Plasma Mass Spectrometry (ICP-MS). Despite achieving high R-squared values, the study faces a significant challenge of generalization of the model to new data. Despite the limitations, this study provides valuable insights into potential strategies for future research in this field.

Day by day, the share of renewable energy-based power plants such as offshore wind farms and photovoltaic power plants, in the present-day power systems is escalating. Nevertheless, most of these power-producing facilities have been located quite far away from the load centers. At this stage, HVDC power systems provide satisfactory options due to qualities such as reduced line losses, substantial controllability, and environmental advantages. Nevertheless, unique converter designs are required to combine asynchronous HVDC networks with each other and with already existing high voltage alternating current (HVAC) networks. In this study, based on the above special cases, a unique DC-DC modular multilevel converter (MMC) architecture is presented that provides an excellent solution for both integrating modern asynchronous HVDC networks and integrating these modern HVDC power systems with existing asynchronous HVAC power systems. The mathematical analysis of the recommended DC-DC MMC design has been examined in detail and the power transfer between two asynchronous power grids has been realized in a simulation environment. Efficient bilateral power transmission has been made achievable by the control system. The recommended DC-DC MMC topology has shown to be a highly successful approach, in the interconnection of HVDC power systems, according to the simulation results.

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.

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.

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.

Optical artificial neural networks (ONNs) — analog computing hardware tailored for machine learning [1,2] — have significant potential for ultra-high computing speed and energy efficiency [3]. We propose a new approach to architectures for ONNs based on integrated Kerr micro-comb sources [4] that is programmable, highly scalable and capable of reaching ultra-high speeds. We experimentally demonstrate the building block of the ONN — a single neuron perceptron — by mapping synapses onto 49 wavelengths of a micro-comb to achieve a high single-unit throughput of 11.9 Giga-FLOPS at 8 bits per FLOP, corresponding to 95.2 Gbps. We test the perceptron on simple standard benchmark datasets — handwritten-digit recognition and cancer-cell detection — achieving over 90% and 85% accuracy, respectively. This performance is a direct result of the record small wavelength spacing (49GHz) for a coherent integrated microcomb source, which results in an unprecedented number of wavelengths for neuromorphic optics. Finally, we propose an approach to scaling the perceptron to a deep learning network using the same single micro-comb device and standard off-the-shelf telecommunications technology, for high-throughput operation involving full matrix multiplication for applications such as real-time massive data processing for unmanned vehicle and aircraft tracking.

A problem with synthetic aperture radar (SAR) is that, due to the poor penetrating action of electromagnetic waves inside solid bodies, the capability to observe inside distributed targets is precluded. Under these conditions, imaging action is provided only on the surface of distributed targets. The present work describes an imaging method based on the analysis of micro-movements on the Khnum-Khufu Pyramid, which are usually generated by background seismic waves. The results obtained prove to be very promising, as high-resolution full 3D tomographic imaging of the pyramid's interior and subsurface was achieved. Khnum-Khufu becomes transparent like a crystal when observed in the micro-movement domain. Based on this novelty, we have completely reconstructed internal objects, observing and measuring structures that have never been discovered before. The experimental results are estimated by processing series of SAR images from the second-generation Italian COSMO-SkyMed satellite system, demonstrating the effectiveness of the proposed method.

The massive amount of human biological, imaging and clinical data produced by multiple and diverse sources, necessitates integrative modeling approaches able to summarize all this information into answers to specific clinical questions. In this paper, we present a hypermodeling scheme able to combine models of diverse cancer aspects regardless of their underlying method or scale. Describing tissue-scale cancer cell proliferation, biomechanical tumor growth, nutrient transport, genomic-scale aberrant cancer cell metabolism, and cell signaling pathways that regulate the cellular response to therapy, the hypermodel integrates mutation, miRNA expression, imaging, and clinical data. The constituting hypomodels as well as their orchestration and links are described. Two specific cancer types, Wilms tumor (nephroblastoma) and non-small cell lung cancer, are addressed as proof of concept study cases. Personalized simulations over the actual anatomy of a patient have been carried out. The hypermodel has also applied to predict tumor control after radiotherapy and the relationship between tumor proliferative activity and response to neoadjuvant chemotherapy. Our innovative hypermodel holds promise as a digital twin based clinical decision support system and the core of future in silico trial platforms, although additional retrospective adaptation and validation is necessary.

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.

Change Detection (CD) of aerial images refers to identifying and analyzing changes between two or more aerial images of the same location taken at different times. The CD is a highly challenging task due to the need to distinguish relevant changes, such as urban expansion, deforestation, or post-disaster damage assessment, from irrelevant ones, such as light conditions, shadows, and seasonal variations. Many CD papers have recently been published, where most of the papers that proposed a new model contained a comparison between their proposed and state-of-the-art (SOTA) models. While many recent studies propose new deep learning (DL) models for improving CD performance, their comparative analyses are often restricted, lacking comprehensive insights into the proposed models' real-world generalizability, robustness, and performance trade-offs across diverse change characteristics. This paper presents a novel generic framework to systematically benchmark and assess DL-based CD models through three parallel pipelines: 1) cross-testing models on diverse benchmark datasets to evaluate generalization, 2) robustness analysis against different image corruptions, and 3) multi-faceted contour-level analytics evaluating detection sensitivity to change size/complexity. The framework is applied to comparatively evaluate five state-of-the-art DL-based CD models - Changeformer, BIT, Tiny, SNUNet, and CSA-CDGAN. Extensive experiments unveil each model's strengths, limitations and biases, highlighting their relative proficiencies in generalizing across data distributions, resilience to noise corruption, and discriminative capabilities for changes of varying characteristics. The proposed benchmarking framework demonstrates significant potential for guiding the selection of suitable CD models tailored to specific application requirements by comprehensively evaluating their generalizability, robustness, and detection capabilities across diverse real-world scenarios. This systematic evaluation approach can drive future research into developing more robust and versatile CD solutions aligned with practical needs.

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.

Optical networks offer a wide range of benefits to the telecommunication sector world- wide with its provision of higher bandwidth which leads to faster data speed, longer transmission distance, and improved latency. Currently, the complexity associated with advancements in optical networks poses problems to network flexibility, reliability, and quality of service. Over the years, many reviews and proposals have been implemented by several literatures to provide solutions for optical networks using software-defined networks and network service orchestrators. This paper reviews the significant challenges in current optical network applications, the various solutions rendered by software-defined networks as well as network service orchestration, the impediments, and gaps in these software – defined networks. This paper will go a step further to look into the various improvements and implementations of software-defined networks tailored to solve specific optical network problems. This paper further proposes a flexible orchestration architecture for software-defined networks for solving flexibility and scalability problems in optical networks. This proposal uses Open Network System (ONOS) SDN controller, leveraging on dockerisation as well as kubernetes clusterisation and orchestration. This solution presents a more flexible, reliable, customable, and higher quality of service which is an improvement upon current solutions in literature.

The main purpose of this article is to identify brain diseases such as Alzheimer's and Parkinson's in an intelligent way using Python software and processing the function of neurons in the neural network areas of the brain, which are classified into different components, and the data is based on the information obtained from FMRI images using algorithms artificial intelligence can intelligently diagnose the type of disease. Therefore, by using spatial clustering based on the deep learning method with noise algorithm (DBSCAN), fMRI brain image and fMRI brain surface complexity are classified, and then image preprocessing will be applied to fMRI images by using artificial intelligence neural networks (ANN) algorithm. became. Then, by using the ANN algorithm and Deep CNN topology of the brain neural network, the type of disease in the brain can be diagnosed by simulating the performance of an artificial neural network (ANN) in Python software. Deep machine learning-based methods, especially algorithms based on neural networks, have shown great success in medical image analysis for various tasks including brain tumor detection, segmentation, and classification, and Alzheimer's and epilepsy. In this research, we propose an integrated model based on a convolutional neural network for simultaneous recognition and classification of brain diseases for intelligent diagnosis of tumors and epilepsy. The average accuracy obtained from our proposed model is 97.89 percent accuracy and 91.66 percent specificity.

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%.

Abstract: We present a technological analysis of the architectonic complex associated with a firing structure (locally named fogón) on top of the Pirámide Mayor, the largest pyramid in Caral. This Archaic Period society flourished between ca 2,700 and 2,000 cal B.C. and was located near the Pacific Ocean on the north-central coast of present-day Peru. All approaches employed in this study demonstrated that the corridor with antechamber and duct on top of Pirámide Mayor of Caral was a sophisticated ventilation system capable of providing between 3,000 and 18,000 liters of air per minute for combustion in the attached fogón. The analysis indicates that ventilating the fogón must have been a major consideration in deciding a) the construction of the pyramid, b) locating the structure at the edge of a natural alluvial terrace, and c) orientating the pyramid towards the then contemporary prevailing winds. Results from the analysis of this fogón support practical decisions made by the builders and challenge the assumption that religion or politics were the only considerations in American pyramid building. It also indicates that a complex device, capable to delivering the considerable airflows reported in this study was within the reach of an archaic society in ancient Peru. The application of this structure to the production of a remarkably high thermal output and its implications on the knowledge of ancient Americans will be discussed in a following companion article.

With the widespread use of new equipment such as distributed photovoltaics, distributed energy storage, electric vehicles, and distributed wind power, the control of low-voltage distribution networks (LVDNs) has become increasingly complex. Acquiring the most recent topological structure is essential for conducting accurate analysis and real-time control of LVDNs. The signal-injection-based topology identification algorithm is favored for its speed and efficiency. This study proposes a new signal-injection-based topology identification algorithm aimed at solving the issues of reduced completeness and correctness of identification caused by missing feature signal records (FSRs). By analyzing the correlations between FSRs of different positions, the algorithm employs vertical and horizontal completion methods to effectively address missing data, combined with inclusion detection algorithms, to identify the topology of LVDNs. Based on the study of actual LVDN data, the results indicate that the algorithm not only significantly improves the completeness and correctness of topology identification for LVDNs but can also increase the number of devices in operation by evaluating the status of topological equipment, further enhancing the topology identification performance.

In the realm of educational technology, Data Analytics (DA) is reshaping teaching and learning. This paper investigates the impact of DA on education, specifically comparing Student Information Systems (SIS) and Learning Management Systems (LMS). Data-driven insights from SIS and LMS platforms enable educators to tailor instructional strategies to individual student needs effectively. While SIS manages student data for administrative tasks, LMS offers tools for content delivery and collaboration. Using the strengths of SIS and LMS, educators can optimise teaching and learning experiences, tracking student progress, and fostering collaboration. The comparison emphasises their distinct roles: SIS manages administrative tasks, while LMS focusses on content delivery and collaboration. Using both systems, educators improve the teaching and learning experience, leveraging DA for continuous improvement. In summary, this paper underscores the transformative role of DA in education, framed within the context of comparing the SIS and LMS functionalities. By examining the intersection of data-driven decision making and educational technology, educators are equipped with the tools and knowledge to harness the power of data for meaningful and impactful teaching and learning.

Accurately estimating the pose of spacecraft is indispensable for space applications. However, such targets are generally non-cooperative, i.e., no markers are mounted on it and no parts for operation. Therefore, the detection and measurement of a non-cooperative target is very challenging. Stereovision sensors are important solutions in the near field. In this paper, a rectangular natural feature recognition and pose measurement method for non-cooperative spacecraft is proposed. Solar panels or the bodies of spacecraft are selected as detection objects and their image features are captured by stereo vision. These rectangle features are then reconstructed in 3D Cartesian space through parallelogram fitting on the image planes of two cameras. The vertexes are used to calculate the center position of the rectangle and the direction of the fixed coordinate system to solve the pose and attitude of the non-cooperative target. An experimental system is built to validate the effectiveness of the algorithm. The experimental results show that the average position measurement error of the algorithm is about 10mm and the average attitude measurement error is less than 1°. The results show that the proposed method has high accuracy and efficiency.

Due to the advantages of low latency, low power consumption and high flexibility of FPGA-based acceleration technology, it has been more and more widely studied and applied in the field of computer vision in recent years. An FPGA-based feature extraction and tracking accelerator for real-time visual odometry (VO) and visual simultaneous localization and mapping (V-SLAM) is proposed, which can realize the complete acceleration processing capability of the image front-end and directly output the feature point ID and coordinates to the backend. The accelerator consists of image preprocessing, pyramid processing, optical flow processing, and feature extraction and tracking modules. For the first time, it implements a hardware solution that combines features from accelerated segment test (FAST) corners with Gunnar Farneback (GF) dense optical flow, to achieve better feature tracking performance and provide more flexible technical route selection. In order to solve the scale invariance and rotation invariance lacking problem of FAST features, an efficient pyramid module with a five-layer thumbnail structure is designed and implemented. The accelerator is implemented on a modern Xilinx Zynq FPGA. The evaluation result shows that the accelerator can achieve stable tracking of features of violently shaking images, and is consistent with the results of MATLAB code running on PC. When operating at 100MHz, the accelerator can process 108 frames per second for 720P images and 48 frames per second for 1080P images. Compared to PC CPUs that consume seconds of time, the processing latency is greatly reduced to the order of milliseconds, making GF dense optical flow an efficient and practical technical solution on the edge side.

Skin cancer is an exquisite disease globally nowadays. Because of the poor contrast and apparent resemblance between skin and lesions, automatic identification of skin cancer is complicated. The rate of human death can be massively reduced if melanoma skin cancer can be detected quickly using dermoscopy images. In this research, an anisotropic diffusion filtering method is used on dermoscopy images to remove multiplicative speckle noise and the fast-bounding box (FBB) method is applied to segment the skin cancer region. Furthermore, the paper consists of two feature extractor parts. One of the two features extractor parts is the hybrid feature extractor (HFE) part and another is the convolutional neural network VGG19 based CNN feature extractor part. The HFE portion combines three feature extraction approaches into a single fused feature vector: Histogram-Oriented Gradient (HOG), Local Binary Pattern (LBP), and Speed Up Robust Feature (SURF). The CNN method also is used to extract additional features from test and training datasets. This two-feature vector is fused to design the classification model. This classifier performs the classification of dermoscopy images whether it is melanoma or non-melanoma skin cancer. The proposed methodology is performed on two ordinary datasets and achieved the accuracy 99.85%, sensitivity 91.65%, and specificity 95.70%, which makes it more successful than previous machine learning algorithms.

Background: Lung cancer is one of the common causes of death worldwide. Although the incidence rate of lung cancer in Western countries is decreasing, it presents a growing trend in developed countries. Since there is no accurate enough information about the epidemiological and Histopathologic features of lung cancer in central Iran, Isfahan, we were motivated to conduct this research. Materials and Methods: This was a descriptive, cross-sectional study carried out in central Iran, Isfahan. All demographic, histopathological and clinical data of the lung cancer patients registered in MACSA, a referral charity-based cancer center in central Iran, was analyzed within 2012-2018 using SPSS v.22 software. Results: Altogether 260 patients with lung cancer were included in this study from 6127 cancer patients registered within 2012-2018 (4.2%). Out of them, 66.2% were men, and 18.8 % of the patients were alive at the time of the study. The mean age of the patients at diagnosis was 61.56 (SD=14.11, range: 9-93). Altogether, 63.1% of patients had metastasis of whom 57.6% were in stage IV at diagnosis. The Frequency of different types of lung cancer was 36.9% adenocarcinomas, 14.2% squamous cell carcinoma, 9.6% bronchogenic carcinoma and 8.1% small cell lung cancer, respectively. Altogether, 128 cases were smokers with an average 35.45 ± 14 pack- years. Only in 36.2% of the patients, the diagnostic and therapeutic biomarkers had been checked, and CK7 was positive in 88.9% of the cases in which the biomarker had been checked. Conclusion: Despite to similar Iranian studies, the most common histopathologic type of lung cancer among the patients was adenocarcinoma that it may be attributed to the lower consumption of smoking in our population and their different genetic context. Molecular biomarkers had been checked in a small portion of the patients. More education of the clinicians along with the development of cancer molecular testing may lead to promote the personalized-based approach.

In recent years, governments applied intelligent transportation system (ITS) technique to provide several convenience services (e.g., garbage truck app) for residents. This study proposes a garbage truck fleet management system (GTFMS) and data feature selection and data clustering methods for travel time prediction. A GTFMS includes mobile devices (MD), on-board units, fleet management server, and data analysis server (DAS). When user uses MD to request the arrival time of garbage truck, DAS can perform the procedure of data feature selection and data clustering methods to analyses travel time of garbage truck. The proposed methods can cluster the records of travel time and reduce variation for the improvement of travel time prediction. After predicting travel time and arrival time, the predicted information can be sent to user’s MD. In experimental environment, the results showed that the accuracies of previous method and proposed method are 16.73% and 85.97%, respectively. Therefore, the proposed data feature selection and data clustering methods can be used to predict stop-to-stop travel time of garbage truck.

Containing hundreds of spectral bands (features), hyperspectral images (HSIs) have high ability in discrimination of land cover classes. Traditional HSIs data processing methods consider the same importance for all bands in the original feature space (OFS), while different spectral bands play different roles in identification of samples of different classes. In order to explore the relative importance of each feature, we learn a weighting matrix and obtain the relative weighted feature space (RWFS) as an enriched feature space for HSIs data analysis in this paper. To overcome the difficulty of limited labeled samples which is common case in HSIs data analysis, we extend our method to semisupervised framework. To transfer available knowledge to unlabeled samples, we employ graph based clustering where low rank representation (LRR) is used to define the similarity function for graph. After construction the RWFS, any arbitrary dimension reduction method and classification algorithm can be employed in RWFS. The experimental results on two well-known HSIs data set show that some dimension reduction algorithms have better performance in the new weighted feature space.

Social networks have captured the attention of many people worldwide. However, these services have also attracted a considerable number of malicious users whose purpose is to compromise digital assets of other members by using messages as an attack vector to execute different variants of cyberattacks against them. Therefore, this work presents an approach based on Natural Language Processing tools and a Convolutional Neural Network architecture to detect and classify, on social network messages, four types of cyberattacks, such as malware, phishing, spam, and even one whose purpose is deceiving the user into spreading malicious messages to other users, which in this work is identified as bot attacks. One notable feature of this work is that it analyzes textual content without depending on any characteristics from a specific social network, making its analysis independent from particular data sources. Finally, this work was tested on real data, demonstrating its results in two stages. The first detects the existence of any of the four cyberattacks within the message, obtaining an accuracy value of 0.91. After detecting a message as a cyberattack, the next stage is to classify it into one of the four types of cyberattack, achieving an accuracy value of 0.82.

In this paper we derive a unified perspective for Optimal Transport (OT) theory and Mean Field Control (MFC) theory to analyse the learning process for Neural Networks algorithms in a high-dimensional framework. We consider Mean Field Neural Networks in the context of MFC theory, specifically the mean field formulation of OT theory that allows the development of highly efficient algorithms while providing a powerful tool in the context of explainable Artificial Intelligence.

The human microbiome is an extremely complex ecosystem considering the amount of bacterial species, their interactions, and its variability over time. Here we untangle the complexity of the human microbiome for the Irritable Bowel Syndrome (IBS) that is the most prevalent functional gastrointestinal disorder in human populations. Based on a novel information theoretic network inference model we detect species interaction networks that are functionally and structurally different for healthy and unhealthy individuals. Healthy networks are characterized by a neutral symmetrical pattern of species interactions and scale-free topology versus random unhealthy networks. We detect an inverse scaling relationship between species total outgoing information flow, meaningful of node interactivity, and relative species abundance (RSA). The top ten interacting species are also the least relatively abundant for the healthy microbiome and the most detrimental. These findings support the idea about the diminishing role of network hubs and hubs should be defined considering the total outgoing information flow rather than the node degree. Macroecologically, the healthy microbiome is characterized by the highest total species diversity growth rate, the lowest species turnover, and the smallest variability of RSA for all species. This result challenges current views that posit a universal association between healthy states and the highest absolute species diversity in ecosystems. Additionally, we show how the transitory microbiome is unstable and microbiome criticality is not at the phase transition between healthy and unhealthy states. We stress out the importance of considering interacting pairs versus single node dynamics when characterizing the microbiome and of ranking these pairs in terms of their dynamics. Interactions (i.e. species collective behavior) shape transition from healthy to unhealthy states.\\ The macroecological characterization of the microbiome is useful for diagnostic purposes and disease etiognosis, while species-specific analyses can detect species that are more beneficial leading to personalized design of pre- and pro-biotic treatments and microbiome engineering.

In this paper, we examine two strategies for boosting the performance of ensembles of Siamese networks (SNNs) for image classification using two loss functions (Triplet and Binary Cross Entropy) and two methods for building the dissimilarity spaces (FULLY and DEEPER). With FULLY, the distance between a pattern and a prototype is calculated by comparing two images using the fully connected layer of the Siamese network. With DEEPER, each pattern is described using a deeper layer combined with dimensionality reduction. The basic design of the SNNs takes advantage of supervised k-means clustering for building the dissimilarity spaces that train a set of support vector machines, which are then combined by sum rule for a final decision. The robustness and versatility of this approach are demonstrated on several cross-domain image data sets, including a portrait data set, two bioimage and two animal vocalization data sets. Results show that the strategies employed in this work to increase the performance of dissimilarity image classification using SNN is closing the gap with standalone CNNs. Moreover, when our best system is combined with an ensemble of CNNs, the resulting performance is superior to an ensemble of CNNs, demonstrating that our new strategy is extracting additional information.