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

A complete MAPLE procedure is designed to implement effectively an algorithm for approximating the trigonometric functions. The algorithm gives a piecewise polynomial approximation on an arbitrary interval, presenting a special partition that we can get its parts, subintervals with ending points of finite rational numbers, together with corresponding approximate polynomials. The procedure takes a sequence of pairs of interval-polynomial as its output that we can easily explore in some useful ways. Examples on calculating approximate values of the sine function with arbitrary accuracy for both of rational and irrational arguments as well as drawing the graph of the piecewise approximate functions will be presented. Moreover, from the approximate integration of integrands of the form $x^m\sin x$ on $[a,b]$, another MAPLE procedure is proposed to find the desired polynomial estimates in norm for the best $L^2$-approximation of the sine function in the vector space $\mathcal{P}_{\ell}$ of polynomials of degree at most $\ell$, a subspace of $L^2(a,b)$.

In recent decades, power consumption has become an essential factor in attracting the attention of integrated circuit (IC) designers. Multiple-valued logic (MVL) and approximate computing are some techniques that could be applied to integrated circuits to make power-efficient systems. By utilizing MVL-based circuits instead of binary logic, the information conveyed by digital signals increases, and this reduces the required interconnections and power consumption. On the other hand, approximate computing is a class of arithmetic computing used in systems where the accuracy of the computation can be traded-off for lower energy consumption. In this paper, we propose novel designs for exact and inexact ternary multipliers based on carbon-nanotube field-effect transistors (CNFETs). The unique characteristics of CNFETs make them a desirable alternative to MOSFETs. The simulations are conducted using Synopsys HSPICE. The proposed design is compared against existing ternary multipliers. The results show that the proposed exact multiplier reduces energy consumption by up to 6X. At the same time, the best inexact design improves energy efficiency by up to 35X compared to the latest state-of-the-art methods. Using the imprecise multipliers for image processing provides evidence that these proposed designs are a low-power system with an acceptable error.

This paper introduces a novel 3D NoC router that combines buffered and bufferless routing with approximate priority comparison when deflecting flits. Our proposal is a modification of an asymmetrical router that is buffered in the z dimension ports and bufferless in the x and y dimension ports. Flits that request output ports in the x and y dimensions are granted or deflected based on approximate, instead of accurate, priority comparison. Experimental results show that the proposed router, besides effectively combining the advantages of both buffered and bufferless routers, it achieves additional performance and area gains due to the reduced logic required for approximate priority comparison in flit deflections. Experimental results using synthetic and realistic traffic show that the proposed router begins to saturate at a sifnificantly higher injection rate than a bufferless router, but at a slightly lower injection rate than when using accurate priority comparison. Furthermore, the proposed router achieves higher clock frequencies and reduced area compared to the simpler permutation network.

In this paper we present a successful implementation of the Hindmarsh–Rose model within a SC environment. The merits of the proposed approach are design simplicity, due to stochastic computing, and the ease of implementation. Simulation results showed that the approximation achieved is equivalent to introducing a noise source into the original model. A study for the level of noise introduced, according to the number of bits in the stochastic sequence, has been performed. Additionally, we demonstrate that such an approach, even though it is noisy, it reproduces the behaviour of biological systems, which are intrinsically noisy. It is also demonstrated that a speedup of x2 compared to biological systems is easily achievable, with a very small number of gates, thus paving the road for the in silico implementation of large neuron networks.

Linear mixed models are frequently used for analysing heterogeneous data in a broad range of applications. The restricted maximum likelihood method is often preferred to estimate co-variance parameters in such models due to its unbiased estimation of the underlying variance parameters. The restricted log-likelihood function involves log determinants of a complicated co-variance matrix. An efficient statistical estimate of the underlying model parameters and quantifying the accuracy of the estimation requires the first derivatives and the second derivatives of the restricted log-likelihood function, i.e., the observed information. Standard approaches to compute the observed information and its expectation, the Fisher information, is computationally prohibitive for linear mixed models with thousands random and fixed effects. Customized algorithms are of highly demand to keep mixed models analysis scalable for increasing high-throughput heterogeneous data sets. In this paper, we explore how to leverage an averaged information splitting technique and dedicate matrix transform to significantly reduce computations and to accelerate computing. Together with a fill-in reducing multi-frontal sparse direct solver, the averaged information splitting approach improves the performance of the computation process.

This article has two objectives. Firstly, we will use the vector variational-like inequalities problems to achieve local approximate (weakly) efficient solutions of Vector Optimization Problem within the novel field of the Hadamard manifolds. Previously, we will introduce the concepts of generalized approximate geodesic convex functions and illustrate them with examples. We will see the minimum requirements under which critical points, solutions of Stampacchia and Minty weak variational-like inequalities and local approximate weakly efficient solutions can be identified, extending previous results from the literature for linear Euclidean spaces. Secondly, we will show an economical application, using again solutions of the variational problems to identify with Stackelberg equilibrium points on Hadamard manifolds and under geodesic convexity assumptions.

The Brahmaputra is one of the largest rivers in the world, ranking fifth in average discharge. As a result, it is heavily braided with various intricate paths in order to dissipate its huge energy. Although this river is normally classed as a braided river, it has recently been classified as an anastomosing river due to its multi-channel features over alluvial plains. Additionally, the Brahmaputra river’s morphology is random in nature as a result of its high flow variability and bank erodibility. Its anastomosing planform changes in response to seasonal water and sediment waves, resulting in a morphology that is extremely complex. The purpose of this study is to examine the Brahmaputra river’s anastomosing planform entropy as a measure of complexity, power spectral density as a measure of fluctuation and their relationship to the energy expenditure as an imprint of flflow rate of river systems on alluvial landscapes.

In this article, we present a comparative study between the Adomian Decomposition Method (ADM) and Variational Iteration Method (VIM). The study outlines the significant features of the two methods, for solving nonlinear Volterra-Fredholm integro-differential equations. From the computational viewpoint, the VIM is more efficient, convenient and easy to use. Moreover, we proved the existence and uniqueness results and convergence of the solution. Finally, an example is included to demonstrate the validity and applicability of the proposed techniques.

An exploding demand for processing capabilities related to the emergence of the IoT, AI and big data, has led to the quest for increasingly efficient ways to expeditiously process the rapidly increasing amount of data. These ways include different approaches like improved devices capable of going further in the more Moore path, but also new devices and architectures capable of going beyond Moore and getting more than Moore. Among the solutions being proposed, Stochastic Computing has positioned itself as a very reasonable alternative for low-power, low-area, low-speed, and adjustable precision calculations; four key-points beneficial to edge computing. On the other hand, chaotic circuits and systems appear to be an attractive solution for (low-power, green) secure data transmission in the frame of edge computing and IoT in general. Classical implementations of this class of circuits require intensive and precise calculations. This paper discusses the use of the SC framework for the implementation of nonlinear systems, showing that it can provide results comparable to those of classical integration, with much simpler hardware, paving the way for relevant applications.

Estimating the parameters of statistical distributions generally involves solving a system of nonlinear equations or a nonlinear equation, being a technical difficulty in their usual application in hydrology. This article presents improved approximations and, in some cases, new approximations for the estimation with the method of ordinary moments and the method of linear moments, which are useful for the direct calculation of the parameters, because the errors in the approximate estimation are similar to the use of iterative numerical methods. Thirteen statistical distributions of two and three parameters frequently used in hydrology are presented, for which parameter estimation was laborious. Thus, the approximate estimation of the parameters by the two methods is simple but also precise and easily applicable by hydrology researchers. The approximate forms characterized by very small errors are the result of the research conducted within the Faculty of Hydrotechnics to update the romanian normative standards in the hydrotechnical field.

In this paper, our goal is to establish the relationship between solutions of local sharp vector variational type inequality and sharp efficient solutions of vector optimization problems, also Minty local sharp vector variational type inequality and sharp efficient solutions of vector optimization problems, under generalized approximate $\eta$-convexity conditions for locally Lipschitzian functions

Interval-valued functions have been widely used to accommodate data inexactness in optimization and decision theory. In this paper, we study interval-valued vector optimization problems, and derive their relationships to interval variational inequality problems, of both Stampacchia and Minty types. Using the concept of interval approximate convexity, we establish necessary and sufficient optimality conditions for local strong quasi and approximate $LU$-efficient solutions to nonsmooth optimization problems with interval-valued multiobjective functions.

In the past few decades, probabilistic interpretations of brain functions have become widespread in cognitive science and neuroscience. In particular, the free energy principle and active inference are increasingly popular theories of cognitive functions that claim to offer a unified understanding of life and cognition within a general mathematical framework derived from information and control theory, and statistical mechanics. However, we argue that if the active inference proposal is to be taken as a general process theory for biological systems, it is necessary to understand how it relates to existing control theoretical approaches routinely used to study and explain biological systems. For example, recently, PID control has been shown to be implemented in simple molecular systems and is becoming a popular mechanistic explanation of behaviours such as chemotaxis in bacteria and amoebae, and robust adaptation in biochemical networks. In this work, we will show how PID controllers can fit a more general theory of life and cognition under the principle of (variational) free energy minimisation when using approximate linear generative models of the world. This more general interpretation provides also a new perspective on traditional problems of PID controllers such as parameter tuning as well as the need to balance performances and robustness conditions of a controller. Specifically, we then show how these problems can be understood in terms of the optimisation of the precisions (inverse variances) modulating different prediction errors in the free energy functional.

During the last years some new variants of Permutation entropy have been introduced and applied to EEG analysis, among them a conditional variant and variants using some additional metric information or being based on entropies different from the Shannon entropy. In some situations it is not completely clear what kind of information the new measures and their algorithmic implementations provide. We discuss the new developments and illustrate them for EEG data.

The eastern subterranean termite, Reticulitermes flavipes, currently inhabits previously glaciated regions of the northeastern U.S., as well as the unglaciated southern Appalachian Mountains and surrounding areas. We hypothesized that Pleistocene climatic fluctuations have influenced the distribution of R. flavipes, and thus the evolutionary history of the species. We estimated contemporary and historical geographic distributions of R. flavipes by constructing Species Distribution Models (SDM). We also inferred the evolutionary and demographic history of the species using mitochondrial (cytochrome oxidase I and II) and nuclear (endo-beta-1,4-glucanase) DNA sequence data. To do this, genetic populations were delineated using Bayesian spatial genetic clustering, competing hypotheses about population divergence were assessed using approximate Bayesian computation (ABC), and changes in population size were estimated using Bayesian skyline plots. SDMs identified areas in the north with suitable habitat during the transition from the Last Interglacial to the Last Glacial Maximum, as well as an expanding distribution from the mid-Holocene to the present. Genetic analyses identified three geographically cohesive populations, corresponding with northern, central, and southern portions of the study region. Based on ABC analyses, divergence between the Northern and Southern populations was the oldest, estimated to have occurred 64.80 thousand years ago (kya), which corresponds with the timing of available habitat in the north. The Central and Northern populations diverged in the mid-Holocene, 8.63 kya, after which the Central population continued to expand. Accordingly, phylogeographic patterns of R. flavipes in the southern Appalachians appear to have been strongly influenced by glacial-interglacial climate change.

Particle Swarm Optimization (PSO) is a metaheuristic global optimization paradigm that has gained prominence in the last two decades due to its ease of application in unsupervised, complex multidimensional problems which cannot be solved using traditional deterministic algorithms. The canonical particle swarm optimizer is based on the flocking behavior and social co-operation of birds and fish schools and draws heavily from the evolutionary behavior of these organisms. This paper serves to provide a thorough survey of the PSO algorithm with special emphasis on the development, deployment and improvements of its most basic as well as some of the very recent state–of-the-art implementations. Concepts and directions on choosing the inertia weight, constriction factor, cognition and social weights and perspectives on convergence, parallelization, elitism, niching and discrete optimization as well as neighborhood topologies are outlined. Hybridization attempts with other evolutionary and swarm paradigms in selected applications are covered and an up-to-date review is put forward for the interested reader.