Horizontal Voting Ensemble Based Predictive Modeling System for ColonCancer

Colon cancer is the third most commonly diagnosed cancer in the world. Most colon AdenoCArcinoma (ACA) arises from pre-existing benign polyps in the mucosa of the bowel. Thus, detecting benign at the earliest helps reduce the mortality rate. In this work, a Predictive Modeling System (PMS) is developed for the classification of colon cancer using the Horizontal Voting Ensemble (HVE) method. Identifying different patterns in microscopic images is essential to an effective classification system. A twelve-layer deep learning architecture has been developed to extract these patterns. The developed HVE algorithm can increase the system’s performance according to the combined models from the last epochs of the proposed architecture. Ten thousand (10000) microscopic images are taken to test the classification performance of the proposed PMS with the HVE method. The microscopic images obtained from the colon tissues are classified into ACA or benign by the proposed PMS. Results prove that the proposed PMS has ~8% performance improvement over the architecture without using the HVE method. The proposed PMS for colon cancer reduces the misclassification rate and attains 99.2% of sensitivity and 99.4% of specificity. The overall accuracy of the proposed PMS is 99.3%, and without using the HVE method, it is only 91.3%.     

Linear complete differential resultants and the implicitization of linear DPPEs

The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resultants of the implicit equation of a system of n$n$ linear differential polynomial parametric equations in n−1$n-1$ differential parameters. We give necessary conditions to ensure properness of the system of differential polynomial parametric equations.     

Stabilization of linear systems with input delay and saturation—A parametric Lyapunov equation approach

This paper studies the problem of stabilizing a linear system with delayed and saturating feedback. It is known that the eigenstructure assignment‐based low‐gain feedback law (globally) stabilizes a linear system in the presence of arbitrarily large delay in its input, and semi‐globally stabilizes it when the input is also subject to saturation, as long as all its open‐loop poles are located in the closed left‐half plane. Based on a recently developed parametric Lyapunov equation‐based low‐gain feedback design method, this paper presents alternative, but simpler and more elegant, feedback laws that solve these problems. The advantages of this new approach include its simplicity, the capability of giving explicit conditions to guarantee the stability of the closed‐loop system, and the ease in scheduling the low‐gain parameter on line to achieve global stabilization in the presence of actuator saturation. Copyright © 2009 John Wiley & Sons, Ltd.     

Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports

The problem of transporting patients or elderly people has been widely studied in literature and is usually modeled as a dial-a-ride problem (DARP). In this paper we analyze the corresponding problem arising in the daily operation of the Austrian Red Cross. This nongovernmental organization is the largest organization performing patient transportation in Austria. The aim is to design vehicle routes to serve partially dynamic transportation requests using a fixed vehicle fleet. Each request requires transportation from a patient's home location to a hospital (outbound request) or back home from the hospital (inbound request). Some of these requests are known in advance. Some requests are dynamic in the sense that they appear during the day without any prior information. Finally, some inbound requests are stochastic. More precisely, with a certain probability each outbound request causes a corresponding inbound request on the same day. Some stochastic information about these return transports is available from historical data. The purpose of this study is to investigate, whether using this information in designing the routes has a significant positive effect on the solution quality. The problem is modeled as a dynamic stochastic dial-a-ride problem with expected return transports. We propose four different modifications of metaheuristic solution approaches for this problem. In detail, we test dynamic versions of variable neighborhood search (VNS) and stochastic VNS (S-VNS) as well as modified versions of the multiple plan approach (MPA) and the multiple scenario approach (MSA). Tests are performed using 12 sets of test instances based on a real road network. Various demand scenarios are generated based on the available real data. Results show that using the stochastic information on return transports leads to average improvements of around 15%. Moreover, improvements of up to 41% can be achieved for some test instances.     

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.     

The labeled maximum matching problem

Given a graph G where a label is associated with each edge, we address the problem of looking for a maximum matching of G using the minimum number of different labels, namely the labeled maximum matching problem. It is a relatively new problem whose application is related to the timetabling problem. We prove it is NP-complete and present four different mathematical formulations. Moreover, we propose an exact algorithm based on a branch-and-bound approach to solve it. We evaluate the performance of our algorithm on a wide set of instances and compare our computational times with the ones required by CPLEX to solve the proposed mathematical formulations. Test results show the effectiveness of our procedure, that hugely outperforms the solver.     

A hybrid multi-criteria decision-making model for firms competence evaluation

In this paper, we present a hybrid multi-criteria decision-making (MCDM) model to evaluate the competence of the firms. According to the competence-based theory reveals that firm competencies are recognized from exclusive and unique capabilities that each firm enjoy in marketplace and are tightly intertwined within different business functions throughout the company. Therefore, competence in the firm is a composite of various attributes. Among them many intangible and tangible attributes are difficult to measure. In order to overcome the issue, we invite fuzzy set theory into the measurement of performance. In this paper first we calculate the weight of each criterion through adaptive analytic hierarchy process (AHP) approach (A³) method, and then we appraise the performance of firms via linguistic variables which are expressed as trapezoidal fuzzy numbers. In the next step we transform these fuzzy numbers into interval data by means of α-cut. Then considering different values for α we rank the firms through TOPSIS method with interval data. Since there are different ranks for different α values, we apply linear assignment method to obtain final rank for alternatives.     

Robust finite-time boundedness of multi-agent systems subject to parametric uncertainties and disturbances

In this paper, we consider finite-time control problems for linear multi-agent systems subject to exogenous constant disturbances and impulses. Some sufficient conditions are obtained to ensure the finite-time boundedness of the multi-agent systems, which could be then reduced to a feasibility problem involving linear matrix inequalities. Numerical examples are given to illustrate the results.