Applicability of feed-forward and recurrent neural networks to Boolean function complexity modeling

In this paper, we present the feed-forward neural network (FFNN) and recurrent neural network (RNN) models for predicting Boolean function complexity (BFC). In order to acquire the training data for the neural networks (NNs), we conducted experiments for a large number of randomly generated single output Boolean functions (BFs) and derived the simulated graphs for number of min-terms against the BFC for different number of variables. For NN model (NNM) development, we looked at three data transformation techniques for pre-processing the NN-training and validation data. The trained NNMs are used for complexity estimation for the Boolean logic expressions with a given number of variables and sum of products (SOP) terms. Both FFNNs and RNNs were evaluated against the ISCAS benchmark results. Our FFNNs and RNNs were able to predict the BFC with correlations of 0.811 and 0.629 with the benchmark results, respectively.     

Observer-invariant histopathology using genetics-based machine learning

Prostate cancer accounts for one-third of noncutaneous cancers diagnosed in US men and is a leading cause of cancer-related death. Advances in Fourier transform infrared spectroscopic imaging now provide very large data sets describing both the structural and local chemical properties of cells within prostate tissue. Uniting spectroscopic imaging data and computer-aided diagnoses (CADx), our long term goal is to provide a new approach to pathology by automating the recognition of cancer in complex tissue. The first step toward the creation of such CADx tools requires mechanisms for automatically learning to classify tissue types—a key step on the diagnosis process. Here we demonstrate that genetics-based machine learning (GBML) can be used to approach such a problem. However, to efficiently analyze this problem there is a need to develop efficient and scalable GBML implementations that are able to process very large data sets. In this paper, we propose and validate an efficient GBML technique——based on an incremental genetics-based rule learner. exploits massive parallelisms via the message passing interface (MPI) and efficient rule-matching using hardware-implemented operations. Results demonstrate that is capable of performing prostate tissue classification efficiently, making a compelling case for using GBML implementations as efficient and powerful tools for biomedical image processing.     

Laser-treated austenitic steel and nickel alloy for human implants

The recent research in biocompatible materials has been useful in replacing and supporting the fractured natural human bones/joints. Under some condition, negative reaction like release of ions from the bare metal toward the human body fluid leads to corrosion. In this proposed research paper, the biocompatibility of the laser surface-modified austenitic stainless steel (SS316L) and nickel-based superalloy (Inconel 718) was studied. The investigation on laser-modified surfaces is evaluated through electrochemical polarization analysis using simulated body fluid (SBF). The samples subjected to electrochemical polarization analysis were characterized by optical image analysis, SEM, EDS, and XRD analysis. It was inferred that laser surface-modified materials provided enhanced corrosion resistance and bare nickel alloy is more susceptible to corrosion by SBF.     

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     

Biosynthesised silver and copper nanoformulation as foliar spray to control bird's eye spot disease in tea plantations

Tea leaves have economic importance in preparation of the popular beverage of the world “tea”. Bird’s eye spot disease of tea leaves creates significant revenue loss in tea trade of many tea plant cultivating countries. Management of this disease by silver (AgNps) and copper (CuNps) nanoparticles that are biosynthesised by efficient antagonists was studied. The biocontrol agents like Pseudomonas fluorescens, Trichoderma atroviride and Streptomyces sannanensis were evaluated for nanoparticle synthesis against Cercospora theae isolates namely KC10, MC24 and VC38. Initially, the freshly prepared extracellular AgNps showed high disease control (59.42 – 79.76%), but the stability of antagonistic property in stored nanoparticles were significantly high in CuNps (58.71 – 73.81%). Greenhouse studies on various treatments imposed also showed reduced disease incidence percentage of 13.4, 7.57 and 10.11% when treated with CuNps synthesized by P. fluorescens, T. atroviride and S. sannanensis respectively. Various treatment schedule in fields suggested the use of Bionanocopper@1.5 ppm for highest yield (3743 kg/ha) with 66.1% disease prevention. The results suggest the use of biosynthesised CuNps using Streptomyces sannanensis for controlling the tea plant pathogens causing foliar disease with higher stability in releasing the antagonistic activity during sporadic disease incidence of bird’s eye spot disease in tea plants.Inspec keywords: silver, copper, crops, plant diseases, nanoparticles, air pollution, agrochemicals, nanobiotechnologyOther keywords: biosynthesised silver, biosynthesised copper, nanoformulation, foliar spray, bird eye spot disease control, tea plantations, tea leaves, economic importance, revenue loss, tea trade, tea plant cultivating countries, silver nanoparticles, AgNps, copper nanoparticles, CuNps, biocontrol agents, nanoparticle synthesis, Cercospora theae isolates, KC10, MC24, VC38, greenhouse studies, antagonistic property, P. fluorescens, T. atroviride, S. sannanensis, fungicides, synthetic nanomaterials, bionanomaterials, disease prevention, green leaf yield, BionanoCu, tea plant pathogens, foliar disease     

Automatic text classification using BPLion-neural network and semantic word processing

Text mining has become a major research topic in which text classification is the important task for finding the relevant information from the new document. Accordingly, this paper presents a semantic word processing technique for text categorization that utilizes semantic keywords, instead of using independent features of the keywords in the documents. Hence, the dimensionality of the search space can be reduced. Here, the Back Propagation Lion algorithm (BP Lion algorithm) is also proposed to overcome the problem in updating the neuron weight. The proposed text classification methodology is experimented over two data sets, namely, 20 Newsgroup and Reuter. The performance of the proposed BPLion is analysed, in terms of sensitivity, specificity, and accuracy, and compared with the performance of the existing works. The result shows that the proposed BPLion algorithm and semantic processing methodology classifies the documents with less training time and more classification accuracy of 90.9%.     

An improved anti-forensics JPEG compression using Least Cuckoo Search algorithm

The lossy nature of the JPEG compression leaves traces which are utilized by the forensic agents to identify the local tampering in the image. In this paper, a tricky anti-forensic method has been proposed to remove the traces left by the JPEG compression in both the spatial domain and discrete cosine transform domain. A novel Least Cuckoo Search algorithm is devised in the proposed anti-forensic compression scheme. Moreover, a new fitness function called histogram deviation is formulated in the optimization algorithm. The experimentation of the proposed anti-forensic compression scheme is performed over uncompressed images from UCID database. The performance of the proposed method is evaluated, and it is compared with the existing methods using PSNR, MSE and classification accuracy as measures. The experimentation ensued with promising results, i.e. accuracy of 0.97, PSNR of 44.34?dB, and MSE of 0.1789 which prove the efficacy of the proposed method.     

Test Case Prioritization in Unit and Integration Testing: A Shuffled-Frog-Leaping Approach

Both unit and integration testing are incredibly crucial for almost any software application because each of them operates a distinct process to examine the product. Due to resource constraints, when software is subjected to modifications, the drastic increase in the count of test cases forces the testers to opt for a test optimization strategy. One such strategy is test case prioritization (TCP). Existing works have propounded various methodologies that re-order the system-level test cases intending to boost either the fault detection capabilities or the coverage efficacy at the earliest. Nonetheless, singularity in objective functions and the lack of dissimilitude among the re-ordered test sequences have degraded the cogency of their approaches. Considering such gaps and scenarios when the meteoric and continuous updations in the software make the intensive unit and integration testing process more fragile, this study has introduced a memetics-inspired methodology for TCP. The proposed structure is first embedded with diverse parameters, and then traditional steps of the shuffled-frog-leaping approach (SFLA) are followed to prioritize the test cases at unit and integration levels. On 5 standard test functions, a comparative analysis is conducted between the established algorithms and the proposed approach, where the latter enhances the coverage rate and fault detection of re-ordered test sets. Investigation results related to the mean average percentage of fault detection (APFD) confirmed that the proposed approach exceeds the memetic, basic multi-walk, PSO, and optimized multi-walk by 21.7%, 13.99%, 12.24%, and 11.51%, respectively.     

Buffer Management for Colored Packets with Deadlines

We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the number of packets delivered by their deadline. For a single port or with free reconfiguration, the problem reduces to the well-known packets scheduling problem, where the celebrated earliest-deadline-first (EDF) strategy is optimal 1-competitive. However, EDF is not 1-competitive when there is a reconfiguration overhead. We design an online algorithm that achieves a competitive ratio of 1−o(1) when the ratio between the minimum laxity of the packets and the number of ports tends to infinity. This is one of the rare cases where one can design an almost 1-competitive algorithm. One ingredient of our analysis, which may be interesting on its own right, is a perturbation theorem on EDF for the classical packets scheduling problem. Specifically, we show that a small perturbation in the release and deadline times cannot significantly degrade the optimal throughput. This implies that EDF is robust in the sense that its throughput is close to the optimum even when the deadlines are not precisely known.     

Randomized constraint solvers: a comparative study

The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compared the effectiveness of a symbolic solver (CVC3), a random solver, two heuristic search solvers, and seven hybrid solvers (i.e. mix of random, symbolic, and heuristic solvers). We evaluated the solvers on a benchmark generated with a concolic execution of 9 subjects. The performance of each solver was measured by its precision, which is the fraction of constraints that the solver can find solution out of the total number of constraints that some solver can find solution. As expected, symbolic solving subsumes the other approaches for the 4 subjects that only generate decidable constraints. For the remaining 5 subjects, which contain undecidable constraints, the hybrid solvers achieved the highest precision (fraction of constraints that a solver can find a solution out of the total number of satisfiable constraints). We also observed that the solvers were complementary, which suggests that one should alternate their use in iterations of a concolic execution driver.