Eine Farbenreaktion von Galluss?ure und Tannin

Ohne Zusammenfassung     

Conformable variational iteration method,conformable fractional reduced differential transform method and conformable homotopy analysis method for non-linear fractional partial differential equations

In this paper, we introduce conformable variational iteration method (C-VIM), conformable fractional reduced differential transform method (CFRDTM) and conformable homotopy analysis method (C-HAM). Between these methods, the C-VIM is introduced for the first time for fractional partial differential equations (FPDEs). These methods are new versions of well-known VIM, RDTM and HAM. In addition, above-mentioned techniques are based on new defined conformable fractional derivative to solve linear and non-linear conformable FPDEs. Firstly, we present some basic definitions and general algorithm for proposal methods to solve linear and non-linear FPDEs. Secondly, to understand better, the presented new methods are supported by some examples. Finally, the obtained results are illustrated by the aid of graphics and the tables. The applications show that these new techniques C-VIM, CFRDTM and C-HAM are extremely reliable and highly accurate and it provides a significant improvement in solving linear and non-linear FPDEs.     

Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains

We consider the problem of computing the minimum ofnvalues, and several well-known generalizations [prefix minima, range minima, and all nearest smaller values (ANSV)] for input elements drawn from the integer domain [1···s], wheres ≥ n. In this article we give simple and efficient algorithms for all of the preceding problems. These algorithms all takeO(log log log s) time using an optimal number of processors andO(ns^ε) space (for constant ε < 1) on the COMMON CRCW PRAM. The best known upper bounds for the range minima and ANSV problems were previouslyO(log log n) (using algorithms for unbounded domains). For the prefix minima and for the minimum problems, the improvement is with regard to the model of computation. We also prove a lower bound of Ω(log log n) for domain sizes = 2^{Ω(log n log log n)}. Since, forsat the lower end of this range, log log n = Ω(log log log s), this demonstrates that any algorithm running ino(log log log s) time must restrict the range ofson which it works.     

A 2-D orientation-adaptive prediction filter in lifting structures for image coding.

Lifting-style implementations of wavelets are widely used in image coders. A two-dimensional (2-D) edge adaptive lifting structure, which is similar to Daubechies 5/3 wavelet, is presented. The 2-D prediction filter predicts the value of the next polyphase component according to an edge orientation estimator of the image. Consequently, the prediction domain is allowed to rotate +/-45 degrees in regions with diagonal gradient. The gradient estimator is computationally inexpensive with additional costs of only six subtractions per lifting instruction, and no multiplications are required.     

A unified analytical framework for distributed variable step size LMS algorithms in sensor networks

Internet of Things (IoT) is helping to create a smart world by connecting sensors in a seamless fashion. With the forthcoming fifth generation (5G) wireless communication systems, IoT is becoming increasingly important since 5G will be an important enabler for the IoT. Sensor networks for IoT are increasingly used in diverse areas, e.g., in situational and location awareness, leading to proliferation of sensors at the edge of physical world. There exist several variable step-size strategies in literature to improve the performance of diffusion-based Least Mean Square (LMS) algorithm for estimation in wireless sensor networks. However, a major drawback is the complexity in the theoretical analysis of the resultant algorithms. Researchers use several assumptions to find closed-form analytical solutions. This work presents a unified analytical framework for distributed variable step-size LMS algorithms. This analysis is then extended to the case of diffusion based wireless sensor networks for estimating a compressible system and steady state analysis is carried out. The approach is applied to several variable step-size strategies for compressible systems. Theoretical and simulation results are presented and compared with the existing algorithms to show the superiority of proposed work.     

Determining optimum carob powder adsorbtion for cleaning wastewater: intelligent optimization with electro-search algorithm

Wireless Networks - In this study, effective and fast removal efficiency of carob powder (as an absorbent material from liquid phase) was investigated by focusing on the dangerous paint methylene...     

A new fuzzy logic approach for reliable communications in wireless underground sensor networks

Wireless Networks - Nowadays, the exploitation of Wireless Underground Sensor Networks (WUSNs) remains challenging because of the attenuation of wireless underground communications. This issue...