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

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.

Multi-step ahead streamflow forecasting is of practical interest for the operation of hydropower reservoirs. We provide generalized results on the error evolution in multi-step ahead forecasting by conducting several large-scale experiments based on simulations. We also present a multiple-case study using monthly time series of streamflow. Our findings suggest that some forecasting methods are more useful than others. However, the errors computed at each time step of a forecast horizon within a specific case study strongly depend on the case examined and can be either small or large, regardless of the forecasting method used and the time step of interest.

Toby Walsh in “The Singularity May Never Be Near” gives six arguments to support his point of view that technological singularity may happen but that it is unlikely. In this paper, we provide analysis of each one of his arguments and arrive at similar conclusions, but with more weight given to the “likely to happen” probability.

Nutrient regulation in aquaponic environments has been the topic of research for many years. Most have focused on appropriate control of nutrients in an aquaponic set-up, but very little research has been done on commercial scale applications. In our model, the input data was sourced on a weekly basis from three commercial aquaponic farms in South-East Texas over the course of a year. Due to limited number of data points, dimensionality reduction techniques like pair-wise correlation matrix was used to remove the highly correlated predictors. Feature selection techniques like the XGBoost classifier and Recursive Feature Elimination with ExtraTreesClassifier were used to rank the features in order of their relative importance. Ammonium and calcium were found to be the top two nutrient predictors and based on the months in which lettuce was cultivated, the median of these nutrient values from the historical dataset served as the optimal concentrations to be maintained in the aquaponic solution. To accomplish this, Vernier sensors were used to measure the nutrient values and actuator systems were built to dispense the appropriate nutrient into the ecosystem via a closed loop.

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.

This manuscript compares deterministic artificial intelligence to model following control applied to DC motor control, including evaluation of the threshold computation rate to let unmanned underwater vehicles correctly follow the challenging discontinuous square wave command signal. The approaches presented in the main text are validated in MATLAB®, where the motor process is discretized at multiple step sizes, which is inversely proportional to the computation rate. The performance is evaluated by the error mean and standard deviation. With a large step size, discrete deterministic artificial intelligence shows a larger error mean than the model-following self-turning regulator approach (benchmark selection). However, the performance gets optimized with the step size decreased. The error mean is close to the continuous deterministic artificial intelligence when the step size is reduced to 0.2 seconds, which means that the computation rate and the sampling period restrict discrete deterministic artificial intelligence. In that case, the continuous deterministic artificial intelligence is the most feasible and reliable selection for future applications on unmanned underwater vehicles since it is superior to all the approaches with multiple computation rates.

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.

Goals: To use visual logistics for interpreting COVID-19 molecular and rapid antigen test (RAgT) performance, determine prevalence boundaries where risk exceeds expectations, and evaluate benefits of recursive testing along home, community, and emergency spatial care paths. Methods: Mathematica/open access software helped graph relationships, compare performance patterns, and perform recursive computations. Results: Tiered sensitivity/specificity comprise: T1) 90%/95%; T2) 95%/97.5%; and T3) 100%/≥99%, respectively. In emergency medicine, median RAgT performance peaks at 13.2% prevalence, then falls below T1, generating risky prevalence boundaries. RAgTs in pediatric ERs/EDs parallel this pattern with asymptomatic worse than symptomatic performance. In communities, RAgTs display large uncertainty with median prevalence boundary of 14.8% for 1/20 missed diagnoses, and at prevalence >33.3-36.9% risk 10% false omissions for symptomatic subjects. Recursive testing improves home RAgT performance. Home molecular tests elevate performance above T1, but lack adequate validation. Conclusions: Widespread RAgT availability encourages self-testing. Asymptomatic RAgT and PCR-based saliva testing present the highest chance of missed diagnoses. Home testing twice, once just before mingling, and molecular-based self-testing help avoid false omissions. Community and ER/ED RAgTs can identify contagiousness in low prevalence (<22%). Real-world trials of performance, cost-effectiveness, and public health impact could identify home molecular diagnostics as the optimal diagnostic portal.

The Van der Pol oscillator is a chaotic non-linear system. Small perturbations in initial conditions may result in wildly different trajectories. Because of its chaotic nature, controlling, or forcing, the behavior of a Van der Pol oscillator is difficult to achieve through traditional adaptive control methods. Connecting two Van der Pol oscillators together where the output of one oscillator, the driver, drives the behavior of its partner, the responder, is a proven technique for controlling the Van der Pol oscillator. Deterministic AI (DAI) is an adaptive feedback control method that leverages the known physics of the Van der Pol system to learn optimal system parameters for the forcing function. We assessed the performance of DAI employing three different online parameter estimation algorithms. Our evaluation criteria include mean absolute error (MAE) between the target trajectory and the response oscillator trajectory over time. RLS with exponential forgetting (RLS-EF) had the lowest MAE overall, with a 2.46% reduction in error. However, another method was notable. Least Mean Squares with normalized gradient adaptation (LMS-NG) had worse initial error in the first 10% of the simulation, but after that point had consistently better performance. We found that over the last 90% of the simulation, DAI with LMS-NG had a 48.7% reduction in MAE compared to feedforward alone.