CanarDeep: a hybrid deep neural model with mixed fusion for rumour detection in social data streams

Neural Computing and Applications - The unrelenting trend of doctored narratives, content spamming, fake news and rumour dissemination on social media can lead to grave consequences that range from...     

Biocompatible antimicrobial cotton fibres for healthcare industries: a biogenic approach for synthesis of bio‐organic‐coated silver nanoparticles

Cotton fibres coated with biogenically fabricated silver nanoparticles (SNPs) are most sought material because of their enhanced activity and biocompatibility. After successful synthesis of SNPs on cotton fibres using leaf extract of Vitex negundo Linn, the fibres were studied using diffuse reflectance spectroscopy, scanning electron microscopy, nanoparticle tracking analysis, energy dispersive X‐ray, and inductively coupled plasma atomic emission spectrometry. The characterisation revealed uniformly distributed spherical agglomerates of SNPs having individual particle size around 50 nm with the deposition load of 423 μg of silver per gram of cotton. Antimicrobial assay of cotton–SNPs fibres showed effective performance against pathogenic bacteria and fungi. The method is biogenic, environmentally benign, rapid, and cost‐effective, producing highly biocompatible antimicrobial coating required for the healthcare industry.Inspec keywords: cotton, health care, nanoparticles, coatings, silver, fibres, nanofabrication, scanning electron microscopy, X‐ray chemical analysis, atomic emission spectroscopy, plasma applications, microorganisms, biotechnologyOther keywords: biocompatible antimicrobial cotton fibre coating, healthcare industry, bioorganic‐coated silver nanoparticle synthesis, biogenically fabricated silver nanoparticle, SNP, leaf extraction, Vitex negundo Linn, diffuse reflectance spectroscopy, scanning electron microscopy, nanoparticle tracking analysis, energy dispersive X‐ray spectrometry, inductively coupled plasma atomic emission spectrometry, uniformly distributed spherical agglomerate, antimicrobial assay, pathogenic bacteria, fungi, Ag     

Domain-specific initial population strategy for compliant mechanisms using customized genetic algorithm

Genetic algorithms (GAs) can precisely handle the discrete structural topology optimization of single-piece elastic structures called compliant mechanisms. The initial population of these elastic structures is mostly generated by assigning the material at random. This causes disconnected or unfeasible designs and further rule-based repairing can result in representation degeneracy. However, the problem-specific initial population can affect the performance of GAs like other operators. In this paper, a domain-specific initial population strategy is developed that generates geometrically feasible structures for path generating compliant mechanisms (PGCMs). It is coupled with the elitist non-dominated sorting genetic algorithm (NSGA-II) which has been customized for structural topology optimization. The performance of initial population strategy over random initialization using customized NSGA-II is checked on single and bi-objective optimization problems. Based on the results, it is observed that the custom initialization outperforms the random initialization by dominating all the solutions and exploring larger area of posed objectives. The elastic structures obtained by solving two examples of PGCMs using domain specific initial population strategy are also presented.     

Ascorbic acid imprinted polymer-modified graphite electrode: A diagnostic sensor for hypovitaminosis C at ultra trace ascorbic acid level

A new kind of molecularly imprinted polymer-modified graphite electrode was fabricated by “grafting-to” approach, incorporating sol–gel technique, for the detection of acute deficiency in serum ascorbic acid level (SAAL), manifesting hypovitaminosis C. The modified electrode exhibited ascorbic acid (AA) oxidation at less positive potential (0.0 V) than the earlier reported methods, resulting in a limit of detection as low as 6.13 ng mL⁻¹ (RSD = 1.2%, S/N = 3). The diffusion coefficient (1.096 × 10⁻⁵ cm² s⁻¹), rate constant (7.308 s⁻¹), and Gibb's free energy change (−12.59 kJ mol⁻¹) due to analyte adsorption, were also calculated to explore the kinetics of AA oxidation. The proposed sensor was found to enhance sensitivity substantially so as to detect ultra trace level of AA in the presence of other biologically important compounds (dopamine, uric acid, etc.), without any cross interference and matrix complications from biological fluids and pharmaceutical samples.     

An improved load-balancing mechanism based on deadline failure recovery on GridSim

Grid computing has emerged a new field, distinguished from conventional distributed computing. It focuses on large-scale resource sharing, innovative applications and in some cases, high performance orientation. The Grid serves as a comprehensive and complete system for organizations by which the maximum utilization of resources is achieved. The load balancing is a process which involves the resource management and an effective load distribution among the resources. Therefore, it is considered to be very important in Grid systems. For a Grid, a dynamic, distributed load balancing scheme provides deadline control for tasks. Due to the condition of deadline failure, developing, deploying, and executing long running applications over the grid remains a challenge. So, deadline failure recovery is an essential factor for Grid computing. In this paper, we propose a dynamic distributed load-balancing technique called “Enhanced GridSim with Load balancing based on Deadline Failure Recovery” (EGDFR) for computational Grids with heterogeneous resources. The proposed algorithm EGDFR is an improved version of the existing EGDC in which we perform load balancing by providing a scheduling system which includes the mechanism of recovery from deadline failure of the Gridlets. Extensive simulation experiments are conducted to quantify the performance of the proposed load-balancing strategy on the GridSim platform. Experiments have shown that the proposed system can considerably improve Grid performance in terms of total execution time, percentage gain in execution time, average response time, resubmitted time and throughput. The proposed load-balancing technique gives 7 % better performance than EGDC in case of constant number of resources, whereas in case of constant number of Gridlets, it gives 11 % better performance than EGDC.     

A compact printed multistubs loaded resonator rectangular monopole antenna design for multiband wireless systems

In the present article, a compact triple‐band multistubs loaded resonator printed monopole antenna is proposed. The antenna consists of a quarter wavelength two asymmetrical inverted L‐shaped stubs to excite two resonant modes for 3.5/5.5 GHz bands and one integrated horizontally T‐shaped stub with inverted long L‐shaped stub to excite resonant mode for 2.5 GHz band. By loading these stub resonators along y‐axis with distinct gaps, the antenna resonates at three frequencies 2.57/3.52/5.51 GHz covering the desired bands while keeping compact size of 24 × 30 mm² (0.2 × 0.25 ). The proposed antenna is fabricated on Rogers RT/duroid 5880 substrate with thickness 0.79 mm and its performance experimentally verified. The measured results reveal that the antenna has the impedance bandwidths of about 210 MHz (2.50‐2.71 GHz), 260 MHz (3.37‐3.63 GHz), and 650 MHz (5.20‐5.85 GHz), for 2.5/3.5/5.5 GHz WiMAX and 5.2/5.8 GHz WLAN band systems. The antenna provides omnidirectional radiation patterns and flat antenna gains over the three operating bands. In addition, the design approach and effects of multistubs resonator lengths on the operating bands are also examined and discussed in detail.     

Recognition of facial expressions based on salient geometric features and support vector machines

Facial expressions convey nonverbal cues which play an important role in interpersonal relations, and are widely used in behavior interpretation of emotions, cognitive science, and social interactions. In this paper we analyze different ways of representing geometric feature and present a fully automatic facial expression recognition (FER) system using salient geometric features. In geometric feature-based FER approach, the first important step is to initialize and track dense set of facial points as the expression evolves over time in consecutive frames. In the proposed system, facial points are initialized using elastic bunch graph matching (EBGM) algorithm and tracking is performed using Kanade-Lucas-Tomaci (KLT) tracker. We extract geometric features from point, line and triangle composed of tracking results of facial points. The most discriminative line and triangle features are extracted using feature selective multi-class AdaBoost with the help of extreme learning machine (ELM) classification. Finally the geometric features for FER are extracted from the boosted line, and triangles composed of facial points. The recognition accuracy using features from point, line and triangle are analyzed independently. The performance of the proposed FER system is evaluated on three different data sets: namely CK+, MMI and MUG facial expression data sets.     

Designing a Controller for a Multi-Train Multi-Track System

The use of formal methods for analyzing and synthesizing a controller for a multi-train multi-track railway system is discussed. The research was motivated by a case study involving the Bay Area Rapid Transit (BART) system. The overall goal is to design a train acceleration control function that enables trains to be safely placed but also increases system throughput. The use of a modeling language for specifying safety properties and a control function is illustrated. The program transformation methodology supported in the HATS system is employed to generate an efficient implementation from a high-level specification of a controller. This implementation can then be used to simulate the controller behavior, thus further enhancing confidence in the design. Properties of optimization transformations can be verified using an rewrite-rule based induction theorem prover Rewrite Rule Laboratory (RRL).     

Dataflow Architectures for GALS

In Kahn process network (KPN), the processes (nodes) communicate by unbounded unidirectional FIFO channels (arcs), with the property of non-blocking writes and blocking reads on the channels. KPN provides a semantic model of computation, where a computation can be expressed as a set of asynchronously communicating processes. However, the unbounded FIFO based asynchrony is not realizable in practice and hence requires refinement in real hardware. In this work, we start with KPN as the model of computation for GALS, and discuss how different GALS architectures can be realized. We borrow some ideas from existing dataflow architectures for our GALS designs.