Information cut for clustering using a gradient descent approach

We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between probability density functions. We propose to optimize the Information Cut using a gradient descent-based approach. Our algorithm has several advantages compared to many other graph-based methods in terms of determining an appropriate affinity measure, computational complexity, memory requirements and coping with different data scales. We show that our method may produce clustering and image segmentation results comparable or better than the state-of-the art graph-based methods.     

3D model retrieval using principal plane analysis and dynamic programming

Three dimensional models play an important role in many applications; the problem is how to select the appropriate models from a 3D database rapidly and accurately. In recent years, a variety of shape representations, statistical methods, and geometric algorithms have been proposed for matching 3D shapes or models. In this paper, we propose a 3D shape representation scheme based on a combination of principal plane analysis and dynamic programming. The proposed 3D shape representation scheme consists of three steps. First, a 3D model is transformed into a 2D image by projecting the vertices of the model onto its principal plane. Second, the convex hall of the 2D shape of the model is further segmented into multiple disjoint triangles using dynamic programming. Finally, for each triangle, a projection score histogram and moments are extracted as the feature vectors for similarity searching. Experimental results showed the robustness of the proposed scheme, which resists translation, rotation, scaling, noise, and destructive attacks. The proposed 3D model retrieval method performs fairly well in retrieving models having similar characteristics from a database of 3D models.     

Threshold cryptography based on Asmuth-Bloom secret sharing

In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present three novel function sharing schemes for RSA, ElGamal and Paillier cryptosystems. To the best of our knowledge, these are the first provably secure threshold cryptosystems realized using the Asmuth-Bloom secret sharing. Proposed schemes are comparable in performance to earlier proposals in threshold cryptography.     

Robust pole clustering in a good ride quality region of aircraft for matrices with structured uncertainties

This paper presents a general analysis of robust pole clustering in a good ride quality region (GRQR) of aircraft for matrices with structured uncertainties. This region is an intersection of a ring and a horizontal strip, located in the left half-plane, which is a specific non-Ω-transformable region providing good ride quality of aircraft. The paper applies the Rayleigh principle along the norm theory to analyze robust pole clustering within this region since the generalized Lyapunov theory is not valid for non-Ω-transformable regions. Concerned uncertainties are structured/parametric uncertainties, including interval matrices. The results are useful for robust control analysis and design, especially, of robust good ride quality of aircraft, shuttles, vehicles and space station, as well as some industrial systems. An example of the F-16 dynamics for which GRQR is suitable is included to illustrate the results.     

A comparison between reliability analyses based primarily on disjointness or statistical independence: The case of the generalized indra network

A switching expression is readily convertible to a reliability expression if (a) all ORed terms are disjoint, and (b) all ANDed sums are statistically independent. The usual approach of system reliability analysis makes a primary use of (a) and a secondary use of (b). An alternative approach reverses the roles of (a) and (b). Symbolic reliability expressions for the source-to-terminal reliability of a generalized Indra network (GIN) with nonidentical components are derived by the two approaches. For this particular case, the second approach leads to a shorter, more elegant derivation and simpler novel results. Typical plots of the GIN reliability functions are presented and their properties are discussed.     

Screening for diabetic retinopathy: the utility of nonmydriatic retinal photography in Egyptian adults

BACKGROUND AND OBJECTIVE: Drug resistance has become a major cause of treatment failure in patients with acute leukemia. P-glycoprotein (Pgp), which is associated with the multidrug resistance (MDR) phenotype, has been reported to be an important predictor of treatment outcome. The aim of this study was to analyze the value of Pgp expression in bone marrow or peripheral blood as a predictor of the response to remission induction chemotherapy as well as the duration of remission in patients with de novo acute myeloid leukemia (AML). DESIGN AND METHODS: We examined the expression of Pgp in 82 patients with de novo AML using an immunocytochemical assay with the C219 monoclonal antibody. RESULTS: Twenty-seven of the 82 patients (33%) were C219-positive in from 1% to 100% of their cells. Thirteen cases (16%) showed a positive reaction in more than 50% of the leukemic cells. Only hyperleukocytosis was significantly associated with higher expression of Pgp. Although 8 of the 13 cases (62%) with more than 50% of cells having Pgp expression were CD34-positive, this association was not statistically significant. A univariate analysis of resistance to induction therapy showed a significantly higher resistance rate in patients with increased Pgp expression (P = 0.01) as well as in those patients with decreased reactivity to myeloperoxidase. The multivariate analysis revealed the independent prognostic value of Pgp expression. C219 reactivity did not have an influence on remission duration. INTERPRETATION AND CONCLUSIONS: Our data indicate that P-glycoprotein expression is a reliable marker of resistance to induction treatment in patients with de novo AML.     

Uniform modeling of parameter dependent nonlinear systems

This paper addresses the problem of approximating parameter dependent nonlinear systems in a unified framework. This modeling has been presented for the first time in the form of parameter dependent piecewise affine systems. In this model, the matrices and vectors defining piecewise affine systems are affine functions of parameters. Modeling of the system is done based on distinct spaces of state and parameter, and the operating regions are partitioned into the sections that we call ’multiplied simplices’. It is proven that this method of partitioning leads to less complexity of the approximated model compared with the few existing methods for modeling of parameter dependent nonlinear systems. It is also proven that the approximation is continuous for continuous functions and can be arbitrarily close to the original one. Next, the approximation error is calculated for a special class of parameter dependent nonlinear systems. For this class of systems, by solving an optimization problem, the operating regions can be partitioned into the minimum number of hyper-rectangles such that the modeling error does not exceed a specified value. This modeling method can be the first step towards analyzing the parameter dependent nonlinear systems with a uniform method.     

Optimal Development of Agricultural Sectors in the Basin Based on Economic Efficiency and Social Equality

The limitation of freshwater resources and the growing demand for water, make the issue of water resource development planning and water allocation among stakeholders even more important. Ideally, water allocation should be economically efficient and socially equitable. In this study, a water allocation model is presented in an integrated framework that considers the interaction of water supply and demand according to economic and social factors. To achieve this, a reliability-based multi-objective optimization - simulation approach has been employed. The objective functions of the problem are: 1) maximizing GDP from agricultural sectors and 2) maximizing social equality in different provinces of the basin (measured using the Williamson coefficient). The fair development and allocation among the shared provinces in the basin can reduce conflicts in the region. Karkheh basin has been considered as a case study and decision variables of the problem are area under cultivation of agricultural development sectors in different provinces. The results show that, without harming the income of the agricultural sector, the spatial distribution of development projects can be done in such a way that equality (according to income level and the number of people working in each province) is achieved. One of the solutions of Pareto front compared to previous studies shows that, in addition to an increase of about 12% of the objective function 1 (GDP), the value of the objective function 2 (Williamson coefficient) decreased from 1.19 to 0.98. This indicates a decrease in income inequality among the provinces of the basin.

     

A novel chaotic Henry gas solubility optimization algorithm for solving real-world engineering problems

The paper proposes a novel metaheuristic based on integrating chaotic maps into a Henry gas solubility optimization algorithm (HGSO). The new algorithm is named chaotic Henry gas solubility optimization (CHGSO). The hybridization is aimed at enhancement of the convergence rate of the original Henry gas solubility optimizer for solving real-life engineering optimization problems. This hybridization provides a problem-independent optimization algorithm. The CHGSO performance is evaluated using various conventional constrained optimization problems, e.g., a welded beam problem and a cantilever beam problem. The performance of the CHGSO is investigated using both the manufacturing and diaphragm spring design problems taken from the automotive industry. The results obtained from using CHGSO for solving the various constrained test problems are compared with a number of established and newly invented metaheuristics, including an artificial bee colony algorithm, an ant colony algorithm, a cuckoo search algorithm, a salp swarm optimization algorithm, a grasshopper optimization algorithm, a mine blast algorithm, an ant lion optimizer, a gravitational search algorithm, a multi-verse optimizer, a Harris hawks optimization algorithm, and the original Henry gas solubility optimization algorithm. The results indicate that with selecting an appropriate chaotic map, the CHGSO is a robust optimization approach for obtaining the optimal variables in mechanical design and manufacturing optimization problems.