Image noise is a variation of uneven pixel values that occurs randomly. A good estimation of image noise parameters is crucial in image noise modeling, image denoising, and image quality assessment. To the best of our knowledge, there is no single estimator that can predict all noise parameters for multiple noise types. The first contribution of our research was to design a noise data feature extractor that can effectively extract noise information from the image pair. The second contribution of our work leveraged other noise parameter estimation algorithms that can only predict one type of noise. Our proposed method, DE-G, can estimate additive noise, multiplicative noise, and impulsive noise from single-source images accurately. We also show the capability of the proposed method in estimating multiple corruptions.
Background: In recent times, digitization is gaining importance in different domains of knowledge such as agriculture, medicine, recommendation platforms, the Internet of Things (IoT), and weather forecasting. In agriculture, crop yield estimation is essential for improving productivity and decision-making processes such as financial market forecasting, and addressing food security issues. The main objective of the article is to predict and improve the accuracy of crop yield forecasting using hybrid machine learning (ML) algorithms. Methods: This article proposes hybrid ML algorithms that use specialized ensembling methods such as stacked generalization, gradient boosting, random forest, and least absolute shrinkage and selection operator (LASSO) regression. Stacked generalization is a new model which learns how to best combine the predictions from two or more models trained on the dataset. To demonstrate the applications of the proposed algorithm, aerial-intel datasets from the github data science repository are used. Results: Based on the experimental results done on the agricultural data, the following observations have been made. The performance of the individual algorithm and hybrid ML algorithms are compared using cross-validation to identify the most promising performers for the agricultural dataset. The accuracy of random forest regressor, gradient boosted tree regression, and stacked generalization ensemble methods are 87.71%, 86.98%, and 88.89% respectively. Conclusions: The proposed stacked generalization ML algorithm statistically outperforms with an accuracy of 88.89% and hence demonstrates that the proposed approach is an effective algorithm for predicting crop yield. The system also gives fast and accurate responses to the farmers.
This paper presents a real time implementation of the single-phase power factor correction (PFC) AC-DC boost converter. A combination of higher order sliding mode controller based on super twisting algorithm and predictive control techniques are implemented to improve the performance of the boost converter. Due to the chattering effects, the higher order sliding mode control (HOSMC) is designed. Also, the predictive technique is modified taking into account the large computational delays. The robustness of the controller is verified conducting simulation in MATLAB, the results show good performances in both steady and transient states. An experiment is conducted through a test bench based on dSPACE 1104. The experimental results proved that the proposed controller enhanced the performance of the converter under different parameters variations.
Optical burst switching (OBS) networks have been attracting much consideration as a promising approach to build the next generation optical Internet. A solution for enhancing the Quality of Service (QoS) for high priority real time traffic over OBS with the fairness among the traffic types is absent in current OBS' QoS schemes. In this paper we present a novel Real Time Quality of Service with Fairness Ratio (RT-QoSFR) scheme that can adapt the burst assembly parameters according to the traffic QoS needs in order to enhance the real time traffic QoS requirements and to ensure the fairness for other traffic. The results show that RT-QoSFR scheme is able to fulfill the real time traffic requirements (end to end delay, and loss rate) ensuring the fairness for other traffics under various conditions such as the type of real time traffic and traffic load. RT-QoSFR can guarantee that the delay of the real time traffic packets does not exceed the maximum packets transfer delay value. Furthermore, it can reduce the real time traffic packets loss, at the same time guarantee the fairness for non real time traffic packets by determining the ratio of real time traffic inside the burst to be 50-60%, 30-40%, and 10-20% for high, normal, and low traffic loads respectively.
Digital predistortion is one of the most widely used techniques to linearize a power amplifier (PA) to
reduce the error vector magnitude (EVM) distortion and spectral regrowth. By far, the lookup table (LUT) predistorters are most frequently used scheme to mitigate the effects of non-linear power amplifier. In this paper, a new algorithm of joint-polynominal LUT predistorter which attains the best linearization performance is proposed. The algorithm employs the hermite interpolation LUT, which has a higher accuracy of interpolation. Simulation results show that the proposed method provides a better rejection of EVM distortion and an improvement of 30-40% of adjacent channel leakage ratio (ACLR) for the wideband code division multiple access at a minimal memory usage.
In this study, a new class of exponential-rational methods (ERMs) for the numerical solution of first order initial value problems has been developed. Developments of third order and fourth order ERMs, as well as their corresponding local truncation error have been presented. Each ERM was found to be consistent with the differential equation and L-stable. Numerical experiments showed that the third order and fourth order ERMs generates more accurate numerical results compared with the existing rational methods in solving first order initial value problems.
In this article, a fourth order quintic spline method has been developed to obtain numerical solutions for second order
boundary value problems with Dirichlet boundary conditions. The developments of the quintic spline method and
convergence analysis were presented. Three test problems have been considered for comparison purposes. The numerical
results showed that the quintic spline method is more accurate compared to existing cubic spline method when solving
nonlinear second order boundary value problems but vice versa when solving linear second order boundary value
problems.
Data Streams create new challenges for fuzzy clustering algorithms, specifically Interval Type-2 Fuzzy C-Means (IT2FCM). One problem associated with IT2FCM is that it tends to be sensitive to initialization conditions and therefore, fails to return global optima. This problem has been addressed by optimizing IT2FCM using Ant Colony Optimization approach. However, IT2FCM-ACO obtain clusters for the whole dataset which is not suitable for clustering large streaming datasets that may be coming continuously and evolves with time. Thus, the clusters generated will also evolve with time. Additionally, the incoming data may not be available in memory all at once because of its size. Therefore, to encounter the challenges of a large data stream environment we propose improvising IT2FCM-ACO to generate clusters incrementally. The proposed algorithm produces clusters by determining appropriate cluster centers on a certain percentage of available datasets and then the obtained cluster centroids are combined with new incoming data points to generate another set of cluster centers. The process continues until all the data are scanned. The previous data points are released from memory which reduces time and space complexity. Thus, the proposed incremental method produces data partitions comparable to IT2FCM-ACO. The performance of the proposed method is evaluated on large real-life datasets. The results obtained from several fuzzy cluster validity index measures show the enhanced performance of the proposed method over other clustering algorithms. The proposed algorithm also improves upon the run time and produces excellent speed-ups for all datasets.
We extend the path lifting property in homotopy theory for topological spaces to bitopological semigroups and we show and prove its role in the C(ℵ)-fibration property. We give and prove the relationship between the C(ℵ)-fibration property and an approximate fibration property. Furthermore, we study the pullback maps for C(ℵ)-fibrations.
An efficient simulation technique was proposed to examine the thermal-fluid structure interaction in the effects of solder temperature on pin through-hole during wave soldering. This study investigated the capillary flow behavior as well as the displacement, temperature distribution, and von Mises stress of a pin passed through a solder material. A single pin through-hole connector mounted on a printed circuit board (PCB) was simulated using a 3D model solved by FLUENT. The ABAQUS solver was employed to analyze the pin structure at solder temperatures of 456.15 K (183(°)C) < T < 643.15 K (370(°)C). Both solvers were coupled by the real time coupling software and mesh-based parallel code coupling interface during analysis. In addition, an experiment was conducted to measure the temperature difference (ΔT) between the top and the bottom of the pin. Analysis results showed that an increase in temperature increased the structural displacement and the von Mises stress. Filling time exhibited a quadratic relationship to the increment of temperature. The deformation of pin showed a linear correlation to the temperature. The ΔT obtained from the simulation and the experimental method were validated. This study elucidates and clearly illustrates wave soldering for engineers in the PCB assembly industry.
Numerical investigation has been carried out on heat transfer and friction factor characteristics of copper-water nanofluid flow in a constant heat-fluxed tube with the existence of new configuration of vortex generator using Computational Fluid Dynamics (CFD) simulation. Two types of swirl flow generator: Classical twisted tape (CTT) and Parabolic-cut twisted tape (PCT) with a different twist ratio (y = 2.93, 3.91 and 4.89) and different cut depth (w = 0.5, 1.0 and 1.5 cm) with 2% and 4% volume concentration of CuO nanofluid were used for simulation. The effect of different parameters such as flow Reynolds number, twist ratio, cut depth and nanofluid were considered. The results show that the enhancement of heat transfer rate and the friction factor induced by the Classical (CTT) and Parabolic-cut (PCT) inserts increases with twist ratio and cut depth decreases. The results also revealed that the heat transfer enhancement increases with an increase in the volume fraction of the CuO nanoparticle. Furthermore, the twisted tape with twist ratio (y = 2.93) and cut depth w = 0.5 cm offered 10% enhancement of the average Nusselt number with significant increases in friction factor than those of Classical twisted tape.
In this paper, a novel design approach for a phase to sinusoid amplitude converter (PSAC) has been investigated. Two segments have been used to approximate the first sine quadrant. A first linear segment is used to fit the region near the zero point, while a second fourth-order parabolic segment is used to approximate the rest of the sine curve. The phase sample, where the polynomial changed, was chosen in such a way as to achieve the maximum spurious free dynamic range (SFDR). The invented direct digital frequency synthesizer (DDFS) has been encoded in VHDL and post simulation was carried out. The synthesized architecture exhibits a promising result of 90 dBc SFDR. The targeted structure is expected to show advantages for perceptible reduction of hardware resources and power consumption as well as high clock speeds.
Rattleback is a canoe-shaped object, already known from ancient times, exhibiting a nontrivial rotational behaviour. Although its shape looks symmetric, its kinematic behaviour seems to be asymmetric. When spun in one direction it normally rotates, but when it is spun in the other direction it stops rotating and oscillates until it finally starts rotating in the other direction. It has already been reported that those oscillations demonstrate chaotic characteristics. In this paper, rattleback's chaotic dynamics are studied by applying Kane's model for different sets of (experimentally decided) parameters, which correspond to three different experimental prototypes made of wax, gypsum, and lead-solder. The emerging chaotic behaviour in all three cases has been studied and evaluated by the related time-series analysis and the calculation of the strange attractors' invariant parameters.
In this paper, a numerical method for the solution of a strongly coupled reaction-diffusion system, with suitable initial and Neumann boundary conditions, by using cubic B-spline collocation scheme on a uniform grid is presented. The scheme is based on the usual finite difference scheme to discretize the time derivative while cubic B-spline is used as an interpolation function in the space dimension. The scheme is shown to be unconditionally stable using the von Neumann method. The accuracy of the proposed scheme is demonstrated by applying it on a test problem. The performance of this scheme is shown by computing L∞ and L2 error norms for different time levels. The numerical results are found to be in good agreement with known exact solutions.
A domination polynomial is a type of graph polynomial in which its coefficients represent the number of dominating sets in the graph. There are many researches being done on the domination polynomial of some common types of graphs but not yet for graphs associated to finite groups. Two types of graphs associated to finite groups are the conjugate graph and the conjugacy class graph. A graph of a group G is called a conjugate graph if the vertices are non-central elements of G and two distinct vertices are adjacent if they are conjugate to each other. Meanwhile, a conjugacy class graph of a group G is a graph in which its vertices are the non-central conjugacy classes of G and two distinct vertices are connected if and only if their class cardinalities are not coprime. The conjugate and conjugacy class graph of dihedral groups can be expressed generally as a union of complete graphs on some vertices. In this paper, the domination polynomials are computed for the conjugate and conjugacy class graphs of the dihedral groups.
In this paper, we first present a 6-point binary interpolating subdivision scheme (BISS) which produces a C2 continuous curve and 4th order of approximation. Then as an application of the scheme, we develop an iterative algorithm for the solution of 2nd order nonlinear singularly per-turbed boundary value problems (NSPBVP). The convergence of an iterative algorithm has also been presented. The 2nd order NSPBVP arising from combustion, chemical reactor theory, nuclear engi-neering, control theory, elasticity, and fluid mechanics can be solved by an iterative algorithm with 4th order of approximation.
Recently, green computing has received significant attention for Internet of Things (IoT) environments due to the growing computing demands under tiny sensor enabled smart services. The related literature on green computing majorly focuses on a cover set approach that works efficiently for target coverage, but it is not applicable in case of area coverage. In this paper, we present a new variant of a cover set approach called a grouping and sponsoring aware IoT framework (GS-IoT) that is suitable for area coverage. We achieve non-overlapping coverage for an entire sensing region employing sectorial sensing. Non-overlapping coverage not only guarantees a sufficiently good coverage in case of large number of sensors deployed randomly, but also maximizes the life span of the whole network with appropriate scheduling of sensors. A deployment model for distribution of sensors is developed to ensure a minimum threshold density of sensors in the sensing region. In particular, a fast converging grouping (FCG) algorithm is developed to group sensors in order to ensure minimal overlapping. A sponsoring aware sectorial coverage (SSC) algorithm is developed to set off redundant sensors and to balance the overall network energy consumption. GS-IoT framework effectively combines both the algorithms for smart services. The simulation experimental results attest to the benefit of the proposed framework as compared to the state-of-the-art techniques in terms of various metrics for smart IoT environments including rate of overlapping, response time, coverage, active sensors, and life span of the overall network.
We present an algorithm to reduce the number of slices from 2D contour cross sections. The main aim of the algorithm is to filter less significant slices while preserving an acceptable level of output quality and keeping the computational cost to reconstruct surface(s) at a minimal level. This research is motivated mainly by two factors; first 2D cross sections data is often huge in size and high in precisions – the computational cost to reconstruct surface(s) from them is closely related to the size and complexity of this data. Second, we can trades visual fidelity with speed of computations if we can remove visually insignificant data from the original dataset which may contains redundant information. In our algorithm we use the number of contour points on a pair of slices to calculate the distance between them. Selection to retain/reject a slice is based on the value of distance compared against a threshold value. Optimal threshold value is derived to produce set of slices that collectively represent the feature of the dataset. We tested our algorithm over six different set of data, varying in complexities and sizes. The results show slice reduction rate depends on the complexity of the dataset, where highest reduction percentage is achieved for objects with lots of constant local variations. Our derived optimal thresholds seem to be able to produce the right set of slices with the potential of creating surface(s) that traded off the accuracy and speed requirements.
Recently, Wireless Body Area Network (WBAN) has witnessed significant attentions in research and product development due to the growing number of sensor-based applications in healthcare domain. Design of efficient and effective Medium Access Control (MAC) protocol is one of the fundamental research themes in WBAN. Static on-demand slot allocation to patient data is the main approach adopted in the design of MAC protocol in literature, without considering the type of patient data specifically the level of severity on patient data. This leads to the degradation of the performance of MAC protocols considering effectiveness and traffic adjustability in realistic medical environments. In this context, this paper proposes a Traffic Priority-Aware MAC (TraPy-MAC) protocol for WBAN. It classifies patient data into emergency and non-emergency categories based on the severity of patient data. The threshold value aided classification considers a number of parameters including type of sensor, body placement location, and data transmission time for allocating dedicated slots patient data. Emergency data are not required to carry out contention and slots are allocated by giving the due importance to threshold value of vital sign data. The contention for slots is made efficient in case of non-emergency data considering threshold value in slot allocation. Moreover, the slot allocation to emergency and non-emergency data are performed parallel resulting in performance gain in channel assignment. Two algorithms namely, Detection of Severity on Vital Sign data (DSVS), and ETS Slots allocation based on the Severity on Vital Sign (ETS-SVS) are developed for calculating threshold value and resolving the conflicts of channel assignment, respectively. Simulations are performed in ns2 and results are compared with the state-of-the-art MAC techniques. Analysis of results attests the benefit of TraPy-MAC in comparison with the state-of-the-art MAC in channel assignment in realistic medical environments.