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.
Community structure is an important feature of a complex network, where detection of the community structure can shed some light on the properties of such a complex network. Amongst the proposed community detection methods, the label propagation algorithm (LPA) emerges as an effective detection method due to its time efficiency. Despite this advantage in computational time, the performance of LPA is affected by randomness in the algorithm. A modified LPA, called CLPA-GNR, was proposed recently and it succeeded in handling the randomness issues in the LPA. However, it did not remove the tendency for trivial detection in networks with a weak community structure. In this paper, an improved CLPA-GNR is therefore proposed. In the new algorithm, the unassigned and assigned nodes are updated synchronously while the assigned nodes are updated asynchronously. A similarity score, based on the Sørensen-Dice index, is implemented to detect the initial communities and for breaking ties during the propagation process. Constraints are utilised during the label propagation and community merging processes. The performance of the proposed algorithm is evaluated on various benchmark and real-world networks. We find that it is able to avoid trivial detection while showing substantial improvement in the quality of detection.
For the purpose of teaching statistics, lecturers often rely on data from real studies, text book examples or painstakingly created datasets. The process of creating a dataset can be made easier with the utilization of PASW Statistics to generate random values. The objective of this article is to demonstrate the creation of data which are measured on continuous scale, using PASW Statistics menus and syntax.
In this paper, we consider the system of Volterra-Fredholm integral equations
of the second kind (SVFI-2). We proposed fixed point method (FPM) to solve
SVFI-2 and improved fixed point method (IFPM) for solving the problem. In addition,
a few theorems and two new algorithms are introduced. They are supported by
numerical examples and simulations using Matlab. The results are reasonably good
when compared with the exact solutions.
The water flow-like algorithm (WFA) is a relatively new metaheuristic algorithm, which has shown good solution for the Travelling Salesman Problem (TSP) and is comparable to state of the art results. The basic WFA for TSP uses a 2-opt searching method to decide a water flow splitting decision. Previous algorithms, such as the Ant Colony System for the TSP, has shown that using k-opt (k>2) improves the solution, but increases its complexity exponentially. Therefore, this paper aims to present the performance of the WFA-TSP using 3-opt and 4-opt, respectively, compare them with the basic WFA-TSP using 2-opt and the state of the art algorithms. The algorithms are evaluated using 16 benchmarks TSP datasets. The experimental results show that the proposed WFA-TSP-4opt outperforms in solution quality compare with others, due to its capacity of more exploration and less convergence.
The concepts of fuzzy semi-open and semi-closed sets have been utilised to define four types of semi-separation of fuzzy sets corresponding to the notions of separation, Q-separation, weak separation, strong separation and eight types of semi-connectedness viz SiC, SCi-connectedness for i = 1 ,2 ,3 ,4 corresponding to the notions of O-connectedness, connectedness, Oq-connectedness and ci-connectedness of a fuzzy set. Interrelationship between these notions of semi-connectedness of a fuzzy set and their properties have been discussed.
Konsep set semi-terbuka dan semi-tertutup kabur digunakan untuk mentakrif empat jenis semi-pemisahan bagi set-set kabur sepadan dengan konsep pemisahan, Q-pemisahan, pemisahan lemah, pemisahan kuat dan lapan jenis keberkaitan, iaitu keberkaitan-SiC dan keberkaitan-SCi untuk i=1 ,2 ,3 ,4 sepadan dengan konsep keberkaitan, keberkaitan-Oq dan keberkaitan-Ci bagi set kabur. Hubung kait antara konsep-konsep semi-keberkaitan set kabur ini dan sifat-sifatnya dibincangkan.
Predictor-corrector two point block methods are developed for solving first order ordinary differential equations (ODEs) using variable step size. The method will estimate the solutions of initial value problems (IVPs) at two points simultaneously. The existence multistep method involves the computations of the divided differences and integration coefficients when using the variable step size or variable step size and order. The block method developed will be presented as in the form of Adams Bashforth - Moulton type and the coefficients will be stored in the code. The efficiency of the predictor-corrector block method is compared to the standard variable step and order non block multistep method in terms of total number of steps, maximum error, total function calls and execution times.
An automatic approach, for reverse engineering of digitized hand printed and electronic planar objects, is presented which is useful for vectorizing the generic shapes. The rational cubic function were used to find the optimal solution of the curve fitting problem with the help of a soft computing technique genetic algorithm which finds appropiate values of shape parameters in the description of rational cubic functions.
A new method called parallel R-point explicit block method for solving a single equation of higher order ordinary differential equation directly using a constant step size is developed. This method calculates the numerical solution at R point simultaneously is parallel in nature. Computational advantages are presented by comparing the results obtained with the new method with that of the conventional 1-point method. The numerical results show that the new method reduces the total number of steps and execution time. The accuracy of the parallel block and the conventional 1-point methods is comparable particularly when finer step sizes are used.
In this paper we determined the estimate of p-adic sizes of common zeros of partial derivative polynomials associated with a cubic form whose indicator diagrams have one overlapping segment by using Newton polyhedron technique. We showed that the p-adic sizes of such common zeros can be found explicitly on the overlapping segment of the indicator diagrams associated with the polynomials.
In this paper, we have examined the effectiveness of the quarter-sweep iteration concept on conjugate gradient normal residual (CGNR) iterative method by using composite Simpson's (CS) and finite difference (FD) discretization schemes in solving Fredholm integro-differential equations. For comparison purposes, Gauss- Seidel (GS) and the standard or full- and half-sweep CGNR methods namely FSCGNR and HSCGNR are also presented. To validate the efficacy of the proposed method, several analyses were carried out such as computational complexity and percentage reduction on the proposed and existing methods.
An efficient algorithm for the persistence operation of data routing is crucial due to the uniqueness and challenges of the aqueous medium of the underwater acoustic wireless sensor networks (UA-WSNs). The existing multi-hop algorithms have a high energy cost, data loss, and less stability due to many forwarders for a single-packet delivery. In order to tackle these constraints and limitations, two algorithms using sink mobility and cooperative technique for UA-WSNs are devised. The first one is sink mobility for reliable and persistence operation (SiM-RPO) in UA-WSNs, and the second is the enhanced version of the SiM-RPO named CoSiM-RPO, which utilizes the cooperative technique for better exchanging of the information and minimizes data loss probability. To cover all of the network through mobile sinks (MSs), the division of the network into small portions is accomplished. The path pattern is determined for MSs in a manner to receive data even from a single node in the network. The MSs pick the data directly from the nodes and check them for the errors. When erroneous data are received at the MS, then the relay cooperates to receive correct data. The proposed algorithm boosts the network lifespan, throughput, delay, and stability more than the existing counterpart schemes.
Experimental design focuses on describing or explaining the multifactorial interactions that are hypothesized to reflect the variation. The design introduces conditions that may directly affect the variation, where particular conditions are purposely selected for observation. Combinatorial design theory deals with the existence, construction and properties of systems of finite sets whose arrangements satisfy generalized concepts of balance and/or symmetry. In this work, borrowing the concept of "balance" in combinatorial design theory, a novel method for multifactorial bio-chemical experiments design is proposed, where balanced templates in combinational design are used to select the conditions for observation. Balanced experimental data that covers all the influencing factors of experiments can be obtianed for further processing, such as training set for machine learning models. Finally, a software based on the proposed method is developed for designing experiments with covering influencing factors a certain number of times.
Special Protection Schemes (SPSs), are corrective action schemes that are designed to protect power
systems against severe contingency conditions. In planning of SPSs, protecting transmission network from
overloading issue due to critical situations has become a serious challenge which needs to be taken into
account. In this paper, a Special Protection and Control Scheme (SPCS) based on Differential Evolution
(DE) algorithm for optimal generation rescheduling has been applied to mitigate the transmission line
overloading in system contingency conditions. The N-1 contingency has been performed for different
single line outages under base and increased load in which generation rescheduling strategy has been
undertaken to overcome the overloading problem. Simulation results are presented for both pre-and
post system emergency situations. The IEEE 30-bus test system was utilised in order to validate the
effectiveness of the proposed method.
Recognizing traffic signs is an essential component of intelligent driving systems' environment perception technology. In real-world applications, traffic sign recognition is easily influenced by variables such as light intensity, extreme weather, and distance, which increase the safety risks associated with intelligent vehicles. A Chinese traffic sign detection algorithm based on YOLOv4-tiny is proposed to overcome these challenges. An improved lightweight BECA attention mechanism module was added to the backbone feature extraction network, and an improved dense SPP network was added to the enhanced feature extraction network. A yolo detection layer was added to the detection layer, and k-means++ clustering was used to obtain prior boxes that were better suited for traffic sign detection. The improved algorithm, TSR-YOLO, was tested and assessed with the CCTSDB2021 dataset and showed a detection accuracy of 96.62%, a recall rate of 79.73%, an F-1 Score of 87.37%, and a mAP value of 92.77%, which outperformed the original YOLOv4-tiny network, and its FPS value remained around 81 f/s. Therefore, the proposed method can improve the accuracy of recognizing traffic signs in complex scenarios and can meet the real-time requirements of intelligent vehicles for traffic sign recognition tasks.
Complement inhibition has shown promise in various disorders, including COVID-19. A prediction tool including complement genetic variants is vital. This study aims to identify crucial complement-related variants and determine an optimal pattern for accurate disease outcome prediction. Genetic data from 204 COVID-19 patients hospitalized between April 2020 and April 2021 at three referral centres were analysed using an artificial intelligence-based algorithm to predict disease outcome (ICU vs. non-ICU admission). A recently introduced alpha-index identified the 30 most predictive genetic variants. DERGA algorithm, which employs multiple classification algorithms, determined the optimal pattern of these key variants, resulting in 97% accuracy for predicting disease outcome. Individual variations ranged from 40 to 161 variants per patient, with 977 total variants detected. This study demonstrates the utility of alpha-index in ranking a substantial number of genetic variants. This approach enables the implementation of well-established classification algorithms that effectively determine the relevance of genetic variants in predicting outcomes with high accuracy.
Many studies showed electrocardiogram (ECG) parameters are useful for predicting fatal ventricular arrhythmias (VAs). However, the studies have several shortcomings. Firstly, all studies lack of effective way to present behavior of various ECG parameters prior to the occurrence of the VAs. Secondly, they also lack of discussion on how to consider the parameters as abnormal. Thirdly, the reports do not include approaches to increase the detection accuracy for the abnormal patterns. The purpose of this study is to address the aforementioned issues. It identifies ten ECG parameters from various sources and then presents a review based on the identified parameters. From the review, it has been found that the increased risk of VAs can be represented by presence and certain abnormal range of the parameters. The variation of parameters range could be influenced by either gender or age. This study also has discovered the facts that averaging, outliers elimination and morphology detection algorithms can contribute to the detection accuracy.