Iris-based human identity recognition with machine learning methods and discrete fast Fourier transform

Innovations in Systems and Software Engineering - One of the most important modules of computer systems is the one that is responsible for user safety. It was proven that simple passwords and...     

Transforming Vulnerability Indexing for Saltwater Intrusion into Risk Indexing through a Fuzzy Catastrophe Scheme

Mapping vulnerability to Saltwater Intrusion (SWI) in coastal aquifers is studied in this paper using the GALDIT framework but with a novelty of transforming the concept of vulnerability indexing to risk indexing. GALDIT is the acronym of 6 data layers, which are put consensually together to invoke a sense of vulnerability to the intrusion of saltwater against aquifers with freshwater. It is a scoring system of prescribed rates to account for local variations; and prescribed weights to account for relative importance of each data layer but these suffer from subjectivity. Another novelty of the paper is to use fuzzy logic to learn rate values and catastrophe theory to learn weight values and these together are implemented as a scheme and hence Fuzzy-Catastrophe Scheme (FCS). The GALDIT data layers are divided into two groups of Passive Vulnerability Indices (PVI) and Active Vulnerability Indices (AVI), where their sum is Total Vulnerability Index (TVI) and equivalent to GALDIT. Two additional data layers (Pumping and Water table decline) are also introduced to serve as Risk Actuation Index (RAI). The product of TVI and RAI yields Risk Indices. The paper applies these new concepts to a study area, subject to groundwater decline and a possible saltwater intrusion problem. The results provide a proof-of-concept for PVI, AVI, RAI and RI by studying their correlation with groundwater quality samples using the fraction of saltwater (f_sea), Groundwater Quality Indices (GQI) and Piper diagram. Significant correlations between the appropriate values are found and these provide a new insight for the study area.

     

Effect of expandable graphite and ammonium polyphosphate on the thermal degradation and weathering of intumescent fire-retardant coating

This research aims to study the effect of ammonium polyphosphate and expandable graphite on the intumescent coating formulations (ICF). The coating presented in this research article is based on carbon source expandable graphite (EG), blowing agent melamine, acid source ammonium polyphosphate (APP), epoxy resin as a binder with polyamide amine. The stability of the developed coating was verified at 950°C for 1-hour fire test. The results showed that the coating is stable and well bond with the steel substrate. The char was characterized by using FESEM, XRD, FTIR, DTA, TGA, XPS, Py-GCMS and Weathering Test. The morphology of the char was studied by SEM of the coating after furnace fire test. XRD and FTIR show the presence of graphite, borophosphate; boron oxide and sassolite in the residual char. TGA and DTG disclosed that EG improved the residual mass of coating. XPS analysis showed the char residue of IF5-APP-EG contains carbon and oxygen contents 47.50 and 40.70, respectively. Py-GCMS analysis described that the IF5-APP-EG released less gaseous compounds. The weathering test illustrated that's the char expansion of coatings samples was decreased due to the presence of a humid environment and UV light. The IF5-APP-EG showed the maximum char expansion, lower substrate temperature and high residual weight among the studied formulations.     

A process model for robotic disc grinding

Automation of deburring and cleaning of castings is desirable for many reasons. The major reasons are dangerous working conditions, difficulties in finding workers for cleaning sections, and improved profitability. A suitable robot cell capable of using different tools, such as cup grinders, disc grinders and rotary files, is the solution. This robot should be completed with sensors in order to keep the quality of the cleaned surface at an acceptable level. Although using sensors simplifies both the programming and quality control there are still other problems that need to be solved. These involve selection of machining data, e.g. feeding rate and grinding force in a force controlled operation based on parameters such as tool type, disc grinder and geometry. In order to decrease the programming time, a process model for disc grinders has been developed. This article investigates this process model and pays attention to problems such as wavy or burned surfaces and the effect of a robot's repetition accuracy in the results obtained. Many aspects treated in this article are quite general, and can be applied in other types of grinding operations.     

The isoxazolidines: the effects of steric factor and hydrophobic chain length on the corrosion inhibition of mild steel in acidic medium

Several new isoxazolidines having varying degree of steric environment and hydrophobic chain length, prepared efficiently using single-step nitrone cycloaddition reactions, are tested for corrosion inhibition of mild steel in 1 M and 5 M HCl at 50-70 °C range by gravimetric and electrochemical methods. All compounds have shown very good corrosion inhibition efficiency (IE%) in acidic solution. Steric crowding around the nitrogen centres and hydrophobic chain lengths as well as increase in temperature (in the presence of the inhibitor in the higher concentration range 100-400 ppm) are found to increase the inhibition efficiency of the isoxazolidines. Thermodynamic parameters (ΔG°_ads, ΔH°_ads, ΔS°_ads) for the adsorption process and kinetic parameters for the metal dissolution (or hydrogen evolution) reaction in the presence of one of the isoxazolidines were determined. Experimental results agree with the Temkin adsorption isotherm. The inhibition of corrosion in 1 M HCl, influenced by both physi- and chemi-sorption, was found to be under mixed control, but predominantly under cathodic control.     

An entropy-based persistence barcode

In persistent homology, the persistence barcode encodes pairs of simplices meaning birth and death of homology classes. Persistence barcodes depend on the ordering of the simplices (called a filter) of the given simplicial complex. In this paper, we define the notion of “minimal” barcodes in terms of entropy. Starting from a given filtration of a simplicial complex K, an algorithm for computing a “proper” filter (a total ordering of the simplices preserving the partial ordering imposed by the filtration as well as achieving a persistence barcode with small entropy) is detailed, by way of computation, and subsequent modification, of maximum matchings on subgraphs of the Hasse diagram associated to K. Examples demonstrating the utility of computing such a proper ordering on the simplices are given.     

Swarm Intelligent Compressive Routing in Wireless Sensor Networks

This article proposes a novel algorithm to improve the lifetime of a wireless sensor network. This algorithm employs swarm intelligence algorithms in conjunction with compressive sensing theory to build up the routing trees and to decrease the communication rate. The main contribution of this article is to extend swarm intelligence algorithms to build a routing tree in such a way that it can be utilized to maximize efficiency, thereby rectifying the delay problem of compressive sensing theory and improving the network lifetime. In addition, our approach offers accurate data recovery from small amounts of compressed data. Simulation results show that our approach can effectively extend the network lifetime of a large‐scale wireless sensor network.     

A Model for Incident Tickets Correlation in Network Management

In Information Technology Service Management (ITSM), network management teams typically use an Incident Ticket System (ITS) as a tool to track, troubleshoot, and coordinate the resolution of network incidents that occur during the daily operation of the network. A well organized ITS may positively impact on the efficiency of the incident management process. Nevertheless, in many cases the handling of tickets by the management team is not completely systematic and may be incoherent and inefficient. This way, irrelevant or redundant tickets for the same incident may be issued, thus creating a redundancy in the system that leads to inefficiencies. In this paper, we suggest a model aimed to correlate redundant tickets in order to reduce the information to a single ticket per incident. We validate the proposed correlation model by evaluating it with two datasets taken from a real ticketing system of a telecommunications network company. Using this model as a basis, we also develop and evaluate a methodology that assesses the efficiency of the management team during the process of tickets creation and management. Based on it, we also get some insights on the performance of the different management groups involved in the ticket creation process. These analyses can be leveraged for improving both the management groups functioning and the policies for the tickets’ creation.     

Delay and link utilization aware routing protocol for wireless multimedia sensor networks

Wireless Multimedia Sensor Networks (WMSNs) consist of networks of interconnected devices involved in retrieving multimedia content, such as, video, audio, acoustic, and scalar data, from the environment. The goal of these networks is optimized delivery of multimedia content based on quality of service (QoS) parameters, such as delay, jitter and distortion. In multimedia communications each packet has strict playout deadlines, thus late arriving packets and lost packets are treated equally. It is a challenging task to guarantee soft delay deadlines along with energy minimization, in resource constrained, high data rate WMSNs. Conventional layered approach does not provide optimal solution for guaranteeing soft delay deadlines due to the large amount of overhead involved at each layer. Cross layer approach is fast gaining popularity, due to its ability to exploit the interdependence between different layers, to guarantee QoS constraints like latency, distortion, reliability, throughput and error rate. The paper presents a channel utilization and delay aware routing (CUDAR) protocol for WMSNs. This protocol is based on a cross-layer approach, which provides soft end-to-end delay guarantees along with efficient utilization of resources. Extensive simulation analysis of CUDAR shows that it provides better delay guarantees than existing protocols and consequently reduces jitter and distortion in WMSN communication.