Numerical Solution of Linear Volterra Integral Equation Systems of Second Kind by Radial Basis Functions

In this paper we propose an approximation method for solving second kind Volterra integral equation systems by radial basis functions. It is based on the minimization of a suitable functional in a discrete space generated by compactly supported radial basis functions of Wendland type. We prove two convergence results, and we highlight this because most recent published papers in the literature do not include any. We present some numerical examples in order to show and justify the validity of the proposed method. Our proposed technique gives an acceptable accuracy with small use of the data, resulting also in a low computational cost.

Structural time series: computational efficiency in estimating economic parameters in industry

A growing field is related to automatized Time Series analysis, through complicated due to the dependence of observed and hidden dimensions often presented in these data types. In this report the problem is motivated by a Brazilian financial company interested in unraveling relation structure explanation of the Japanese' CPI ex-fresh Food \& Energy across 157 economical exogenous variables, with very limiting data. The problem becomes more complex when considering that each variable can enter the model with lags of 0 to 8 periods, as well as an additional restriction of admitting only a positive relationship. This report discusses three possible treatments involving models for structured time series, the most relevant approach found in this study is a Dynamic Regression Model combined with a Stepwise algorithm, which allows the most relevant variables, as well as their respective lags, to be found and inserted in the model with low computational cost.

Circumcentering approximate reflections for solving the convex feasibility problem

The circumcentered-reflection method (CRM) has been applied for solving convex feasibility problems. CRM iterates by computing a circumcenter upon a composition of reflections with respect to convex sets. Since reflections are based on exact projections, their computation might be costly. In this regard, we introduce the circumcentered approximate-reflection method (CARM), whose reflections rely on outer-approximate projections. The appeal of CARM is that, in rather general situations, the approximate projections we employ are available under low computational cost. We derive convergence of CARM and linear convergence under an error bound condition. We also present successful theoretical and numerical comparisons of CARM to the original CRM, to the classical method of alternating projections (MAP), and to a correspondent outer-approximate version of MAP, referred to as MAAP. Along with our results and numerical experiments, we present a couple of illustrative examples.

The revised FLORIDyn model: Implementation of heterogeneous flow and the Gaussian wake

In this paper a new version of the FLOw Redirection and Induction Dynamics (FLORIDyn) model is presented. The new model uses the three-dimensional parametric Gaussian FLORIS model and can provide dynamic wind farm simulations at low computational cost under heterogeneous and changing wind conditions. Both FLORIS and FLORIDyn are parametric models which can be used to simulate wind farms, evaluate controller performance and can serve as a control-oriented model. One central element in which they differ is in their representation of flow dynamics: FLORIS neglects these and provides a computationally very cheap approximation of the mean wind farm flow. FLORIDyn defines a framework which utilizes this low computational cost of FLORIS to simulate basic wake dynamics: this is achieved by creating so called Observation Points (OPs) at each time step at the rotor plane which inherit the turbine state. In this work, we develop the initial FLORIDyn framework further considering multiple aspects. The underlying FLORIS wake model is replaced by a Gaussian wake model. The distribution and characteristics of the OPs are adapted to account for the new parametric model, but also to take complex flow conditions into account. To achieve this, a mathematical approach is developed to combine the parametric model and the changing, heterogeneous world conditions and link them with each OP. We also present a computational lightweight wind field model to allow for a simulation environment in which heterogeneous flow conditions are possible. FLORIDyn is compared to SOWFA simulations in three- and nine-turbine cases under static and changing environmental conditions.The results show a good agreement with the timing of the impact of upstream state changes on downstream turbines. They also show a good agreement in terms of how wakes are displaced by wind direction changes and when the resulting velocity deficit is experienced by downstream turbines. A good fit of the mean generated power is ensured by the underlying FLORIS model. In the three turbine case, FLORIDyn simulates 4 s simulation time in 24.49 ms computational time. The resulting new FLORIDyn model proves to be a computationally attractive and capable tool for model based dynamic wind farm control.

Multiscale modeling of ferroelectrics with stochastic grain size distribution

Macroscopic properties of ferroelectrics are controlled by processes on the microscale, in particular the switching of crystal unit cells and the movement of domain walls, respectively. Besides these microscopic levels, the grains of a polycrystalline material constitute the mesoscopic scale. Interactions of grains with statistically distributed orientations, as a consequence of mechanical and electrostatic mismatch, give rise to for example, residual stress which in turn affects domain switching. A multiscale modeling thus has to incorporate at least three interacting scales. In this context, the condensed method has recently been elaborated as an efficient tool with low computational cost and effort of implementation. It is extended toward statistical distributions of grain sizes in a representative material volume element and amended with regard to the modeling of domain evolution. Each of the few parameters of the constitutive approach has a unique physical meaning and is adapted to available experimental values of macroscopic quantities of barium titanate taken from various sources.

Designing Compact Convolutional Filters for Lightweight Human Pose Estimation

Existing methods for human pose estimation usually use a large intermediate tensor, leading to a high computational load, which is detrimental to resource-limited devices. To solve this problem, we propose a low computational cost pose estimation network, MobilePoseNet, which includes encoder, decoder, and parallel nonmaximum suppression operation. Specifically, we design a lightweight upsampling block instead of transposing the convolution as the decoder and use the lightweight network as our downsampling part. Then, we choose the high-resolution features as the input for upsampling to reduce the number of model parameters. Finally, we propose a parallel OKS-NMS, which significantly outperforms the conventional NMS in terms of accuracy and speed. Experimental results on the benchmark datasets show that MobilePoseNet obtains almost comparable results to state-of-the-art methods with a low compilation load. Compared to SimpleBaseline, the parameter of MobilePoseNet is only 4%, while the estimation accuracy reaches 98%.

Towards Countering the Insider Reconnaissance Using a Combination of Shuffling and Diversity Moving Target Defense Techniques

Moving Target Defense (MTD) has recently emerged as a significant cybersecurity technique. Software-Defined Networking (SDN) has the capability to design efficient network architecture due to its programmability and centralized control management. In this paper, a mechanism for the protection against insider reconnaissance has been proposed using a combination of diversity and a shuffling-based approach of MTD. In order to implement the shuffling technique, IP shuffling is used in the insider network. The IP addresses of internal hosts are mapped via real to virtual IP mapping through random IP generation from a pseudo-random mechanism. For the diversity, a multiple servers’ platform is incorporated for different critical LAN services like Domain Name System (DNS), internal web services, etc. This combined diversity and shuffling approach significantly counters the insider reconnaissance targeting critical LAN services. The proposed scheme also exploited open-source IDS to block insider reconnaissance. The proposed solution was implemented using ONOS SDN controller, Mininet simulator, Snort IDS systems. The experimental results substantiate effective protection against insider network reconnaissance at a low computational cost.

Viscous transfer of momentum across a shallow laminar flow

In a shallow channel, the flow transfers most of its momentum vertically. Based on this observation, one often neglects the momentum that is transferred across the stream – the core assumption of the shallow-water theory. In the context of viscous flows, this approximation is referred to as the ‘lubrication theory’, in which one assumes that the shear stress exerted by the fluid on the substrate over which it flows is proportional to its velocity. Here, we revise this theory to account for the momentum that viscosity transfers across a shallow laminar flow, while keeping the problem low-dimensional. We then test the revised lubrication theory against analytical and numerical solutions of the exact problem. We find that, at a low computational cost, the present theory represents the actual flow more accurately than the classical lubrication approximation. This theoretical improvement, devised with laboratory rivers in mind, should also apply to other geophysical contexts, such as ice flows or forming lava domes.

Small-Scale Depthwise Separable Convolutional Neural Networks for Bacteria Classification

Bacterial recognition and classification play a vital role in diagnosing disease by determining the presence of large bacteria in the specimens and the symptoms. Artificial intelligence and computer vision widely applied in the medical domain enable improving accuracy and reducing the bacterial recognition and classification time, which aids in making clinical decisions and choosing the proper treatment. This paper aims to provide an approach of 33 bacteria strains’ automated classification from the Digital Images of Bacteria Species (DIBaS) dataset based on small-scale depthwise separable convolutional neural networks. Our five-layer architecture has significant advantages due to the compact model, low computational cost, and reliable recognition accuracy. The experimental results proved that the proposed design reached the highest accuracy of 96.28% with a total of 6600 images and can be executed on limited-resource devices of 3.23 million parameters and 40.02 million multiply–accumulate operations (MACs). The number of parameters in this architecture is seven times less than the smallest model listed in the literature.

A Privacy-Oriented Approach for Depression Signs Detection Based on Speech Analysis

Currently, AI-based assistive technologies, particularly those involving sensitive data, such as systems for detecting mental illness and emotional disorders, are full of confidentiality, integrity, and security compromises. In the aforesaid context, this work proposes an algorithm for detecting depressive states based on only three never utilized speech markers. This reduced number of markers offers a valuable protection of personal (sensitive) data by not allowing for the retrieval of the speaker’s identity. The proposed speech markers are derived from the analysis of pitch variations measured in speech data obtained through a tale reading task performed by typical and depressed subjects. A sample of 22 subjects (11 depressed and 11 healthy, according to both psychiatric diagnosis and BDI classification) were involved. The reading wave files were listened to and split into a sequence of intervals, each lasting two seconds. For each subject’s reading and each reading interval, the average pitch, the pitch variation (T), the average pitch variation (A), and the inversion percentage (also called the oscillation percentage O) were automatically computed. The values of the triplet (Ti, Ai, Oi) for the i-th subject provide, all together, a 100% correct discrimination between the speech produced by typical and depressed individuals, while requiring a very low computational cost and offering a valuable protection of personal data.