Search results for " Theory"
showing 10 items of 23462 documents
A Novel Border Identification Algorithm Based on an “Anti-Bayesian” Paradigm
2013
Published version of a chapter in the book: Computer Analysis of Images and Patterns. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-40261-6_23 Border Identification (BI) algorithms, a subset of Prototype Reduction Schemes (PRS) aim to reduce the number of training vectors so that the reduced set (the border set) contains only those patterns which lie near the border of the classes, and have sufficient information to perform a meaningful classification. However, one can see that the true border patterns (“near” border) are not able to perform the task independently as they are not able to always distinguish the testing samples. Thus, researchers have worked on thi…
Grading investment diversification options in presence of non-historical financial information
2021
Modern portfolio theory deals with the problem of selecting a portfolio of financial assets such that the expected return is maximized for a given level of risk. The forecast of the expected individual assets’ returns and risk is usually based on their historical returns. In this work, we consider a situation in which the investor has non-historical additional information that is used for the forecast of the expected returns. This implies that there is no obvious statistical risk measure any more, and it poses the problem of selecting an adequate set of diversification constraints to mitigate the risk of the selected portfolio without losing the value of the non-statistical information owne…
The minimum mean cycle-canceling algorithm for linear programs
2022
Abstract This paper presents the properties of the minimum mean cycle-canceling algorithm for solving linear programming models. Originally designed for solving network flow problems for which it runs in strongly polynomial time, most of its properties are preserved. This is at the price of adapting the fundamental decomposition theorem of a network flow solution together with various definitions: that of a cycle and the way to calculate its cost, the residual problem, and the improvement factor at the end of a phase. We also use the primal and dual necessary and sufficient optimality conditions stated on the residual problem for establishing the pricing step giving its name to the algorith…
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.
Combined column-and-row-generation for the optimal communication spanning tree problem
2018
Abstract This paper considers the exact solution of the optimal communication spanning tree problem (OCSTP), which can be described as follows: Given an undirected graph with transportation costs on every edge and communication requirements for all pairs of vertices, the OCSTP seeks for a spanning tree that minimizes the sum of the communication costs between all pairs of vertices, where the communication cost of a pair of vertices is defined as their communication requirement multiplied by the transportation cost of the unique tree path that connects the two vertices. Two types of compact formulations for OCSTP were presented in the literature. The first one is a four-index model based on …
Heuristics for the min–max arc crossing problem in graphs
2018
Abstract In this paper, we study the visualization of complex structures in the context of automatic graph drawing. Constructing geometric representations of combinatorial structures, such as networks or graphs, is a difficult task that requires an expert system. The automatic generation of drawings of graphs finds many applications from software engineering to social media. The objective of graph drawing expert systems is to generate layouts that are easy to read and understand. This main objective is achieved by solving several optimization problems. In this paper we focus on the most important one: reducing the number of arc crossings in the graph. This hard optimization problem has been…
A Mechanical Approach for Evaluating the Distribution of Confinement Pressure in FRP-Wrapped Rectangular Columns
2019
In recent decades, fiber reinforced polymer (FRP) wrapping has become a common technique to retrofit reinforced concrete (RC) columns. Numerous research works have sought to verify analytically and experimentally its effectiveness in terms of enhancement of axial load bearing capacity and ductility. These studies highlighted that in the case of sharp-cornered sections, the maximum allowable confinement pressure is limited by premature failure at corners and, consequently, stress in the FRP, as well as the distribution of the confinement pressure, is not uniform. The prediction of this phenomenon is not straightforward, and existing theoretical studies propose complex numerical simulations, …
The Role the Static Maximization Approach Plays in Neoclassical Analyses
1994
This is an article on the methodology of economic thought. The critical assessment of the neoclassical research programme contained here basically comes from the contributions of J.M. Buchanan, Nobel prize winner in Economics 1986. These comments are aimed at pointing out the role that the static maximization approach plays in neoclassical analyses since L. Robbins and P. Samuelson’s influential contributions came about after World War II. Just to complement this basic purpose, I present in section 4 the alternative methodological foundations J.M. Buchanan proposes and uses to replace the static maximization approach when building public choice analyses and I sketch in section 5 several pe…
Exploring relationships between grid cell size and accuracy for debris-flow susceptibility models: a test in the Giampilieri catchment (Sicily, Italy)
2016
Debris flows are among the most hazardous phenomena in nature, requiring the preparation of suscep- tibility models in order to cope with this severe threat. The aim of this research was to verify whether a grid cell-based susceptibility model was capable of predicting the debris- flow initiation sites in the Giampilieri catchment (10 km2), which was hit by a storm on the 1st October 2009, resulting in more than one thousand landslides. This kind of event is to be considered as recurrent in the area as attested by historical data. Therefore, predictive models have been prepared by using forward stepwise binary logistic regression (BLR), a landslide inventory and a set of geo- environmental …
Automated Dental Identification with Lowest Cost Path-Based Teeth and Jaw Separation
2016
Abstract Teeth are some of the most resilient tissues of the human body. Because of their placement, teeth often yield intact indicators even when other metrics, such as finger prints and DNA, are missing. Forensics on dental identification is now mostly manual work which is time and resource intensive. Systems for automated human identification from dental X-ray images have the potential to greatly reduce the necessary efforts spent on dental identification, but it requires a system with high stability and accuracy so that the results can be trusted. This paper proposes a new system for automated dental X-ray identification. The scheme extracts tooth and dental work contours from the X-ray…