Political Optimizer with Deep Learning-Enabled Tongue Color Image Analysis Model

Biomedical image processing is widely utilized for disease detection and classification of biomedical images. Tongue color image analysis is an effective and non-invasive tool for carrying out secondary detection at anytime and anywhere. For removing the qualitative aspect, tongue images are quantitatively inspected, proposing a novel disease classification model in an automated way is preferable. This article introduces a novel political optimizer with deep learning enabled tongue color image analysis (PODL-TCIA) technique. The presented PODL-TCIA model purposes to detect the occurrence of the disease by examining the color of the tongue. To attain this, the PODL-TCIA model initially performs image pre-processing to enhance medical image quality. Followed by, Inception with ResNet-v2 model is employed for feature extraction. Besides, political optimizer (PO) with twin support vector machine (TSVM) model is exploited for image classification process, shows the novelty of the work. The design of PO algorithm assists in the optimal parameter selection of the TSVM model. For ensuring the enhanced outcomes of the PODL-TCIA model, a wide-ranging experimental analysis was applied and the outcomes reported the betterment of the PODL-TCIA model over the recent approaches.     

Effect of CR and FT-paraffin versus SBS modification in terms of conventional and rheological properties

In this study, the rheological and conventional properties of binders prepared with crumb rubber (CR) and FT-paraffin were compared to styrene-butadiene-styrene (SBS)-modified binders’ properties. The objective of this study was to determine which modified binders in different combinations of the CR and the FT-paraffin exhibited better performance than the SBS-modified binders, in terms of conventional and rheological properties. Results showed that the additives exhibited different performances for different types of tests. Many of the combinations including the common usage of the CR and the FT-paraffin performed better at high temperature than the SBS modification. Overall, the test results show that the binders prepared by 6% CR with 3 and 4% FT-paraffin and those prepared with 8% CR with 3% FT-paraffin were better binders than the 4% SBS-modified binder, in terms of low and high temperature properties.     

Behaviour of sand–clay mixtures for road pavement subgrade

Materials forming sand grains and colluvial soil deposits have a distinct structure, consisting of a composite matrix of coarse and fine soil grains. The influence of sand grains content on the behaviour of sand–clay mixtures was investigated by a series of intensive laboratory experiments. The California bearing ratio (CBR), unconfined compression strength (UCS) and compaction tests were carried out on various contents of sand and clay mixtures. The sand–clay mixtures were prepared with sand contents of 0, 10, 20, 30, 40, and 50% by weight. The laboratory tests on these mixtures have indicated that their behaviour will depend on the relative concentration of the sand and clay samples. The results of the tests showed a decrease in the UCS, and an increase the CBR values with an increase in the amount of sand. An increase in dry unit weight and a decrease in respective moisture content by an increase in the amount of sand were observed in the compaction tests.     

An Optimal Algorithm for Resource Allocation in D2D Communication

The number of mobile devices accessing wireless networks is skyrocketing due to the rapid advancement of sensors and wireless communication technology. In the upcoming years, it is anticipated that mobile data traffic would rise even more. The development of a new cellular network paradigm is being driven by the Internet of Things, smart homes, and more sophisticated applications with greater data rates and latency requirements. Resources are being used up quickly due to the steady growth of smartphone devices and multimedia apps. Computation offloading to either several distant clouds or close mobile devices has consistently improved the performance of mobile devices. The computation latency can also be decreased by offloading computing duties to edge servers with a specific level of computing power. Device-to-device (D2D) collaboration can assist in processing small-scale activities that are time-sensitive in order to further reduce task delays. The task offloading performance is drastically reduced due to the variation of different performance capabilities of edge nodes. Therefore, this paper addressed this problem and proposed a new method for D2D communication. In this method, the time delay is reduced by enabling the edge nodes to exchange data samples. Simulation results show that the proposed algorithm has better performance than traditional algorithm.     

Dynamic storage and access load balancing for answering range queries in peer-to-peer networks

Recently, many applications have used Peer-to-Peer (P2P) systems to overcome the current problems with client/server systems such as non-scalability, high bandwidth requirement and single point of failure. In this paper, we propose an efficient scheme to support efficient range query processing over structured P2P systems, while balancing both the storage load and access load. The paper proposes a rotating token scheme to balance the storage load by placing joining nodes in appropriate locations in the identifier space to share loads with already overloaded nodes. Then, to support range queries, we utilize an order-preserving mapping function to map keys to nodes in order preserving way and without hashing. This may result in an access load imbalance due to non-uniform distribution of keys in the identifier space. Thus, we propose an adaptive replication scheme to relieve overloaded nodes by shedding some load on other nodes to balance the access load. We derive a formula for estimating the overhead of the proposed adaptive replication scheme. In this study, we carry simulation experiments with synthetic data to measure the performance of the proposed schemes. Our simulation experiments show significant gains in both storage load balancing and access load balancing.     

The mask of (2b + 4)-point n-ary subdivision scheme

In this paper, we present general formulae for the mask of (2b + 4)-point n-ary approximating as well as interpolating subdivision schemes for any integers ${b\,\geqslant\,0}$ and ${n\,\geqslant\,2}$ . These formulae corresponding to the mask not only generalize and unify several well-known schemes but also provide the mask of higher arity schemes. Moreover, the 4-point and 6-point a-ary schemes introduced by Lian [Appl Appl Math Int J 3(1):18–29, 2008] are special cases of our general formulae.