Search results for "Mod"
showing 10 items of 39605 documents
A note on best proximity point theory using proximal contractions
2018
In this paper, a reduction technique is used to show that some recent results on the existence of best proximity points for various classes of proximal contractions can be concluded from the corresponding results in fixed point theory.
An Artificial Bee Colony Approach for Classification of Remote Sensing Imagery
2018
This paper presents a novel Artificial Bee Colony (ABC) approach for supervised classification of remote sensing images. One proposes to apply an ABC algorithm to optimize the coefficients of the set of polynomial discriminant functions. We have experimented the proposed ABC-based classifier algorithm for a Landsat 7 ETM+ image database, evaluating the influence of the ABC model parameters on the classifier performances. Such ABC model parameters are: numbers of employed/onlooker/scout bees, number of epochs, and polynomial degree. One has compared the best ABC classifier Overall Accuracy (OA) with the performances obtained using a set of benchmark classifiers (NN, NP, RBF, and SVM). The re…
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…
Stabilized branch-and-price algorithms for vector packing problems
2018
Abstract This paper considers packing and cutting problems in which a packing/cutting pattern is constrained independently in two or more dimensions. Examples are restrictions with respect to weight, length, and value. We present branch-and-price algorithms to solve these vector packing problems (VPPs) exactly. The underlying column-generation procedure uses an extended master program that is stabilized by (deep) dual-optimal inequalities. While some inequalities are added to the master program right from the beginning (static version), other violated dual-optimal inequalities are added dynamically. The column-generation subproblem is a multidimensional knapsack problem, either binary, boun…
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…
Rough Set Theory for Optimization of Packet Management Mechanism in IP Routers
2020
Bandwidth and consequently optimum overall efficiency of network system relies greatly on mechanism of packet management in IP routers. Our research objective is to implement rough set theory to minimizing number of the network system attributes responsible for decision making in selection of those packets, which improve its transmission. Such an approach is called priority queuing system model, as we assign priority to the packets selected, following rough set theory. Regardless of the file format, for all the routers, packets are transmitted in sequence one-by-one. Nonetheless, quality of streaming data largely depends on how much the packet loss is minimized, or eliminated at all, if pos…
Best proximity point theorems for proximal cyclic contractions
2017
The purpose of this article is to compute a global minimizer of the function $$x\longrightarrow d(x, Tx)$$ , where T is a proximal cyclic contraction in the framework of a best proximally complete space, thereby ensuring the existence of an optimal approximate solution, called a best proximity point, to the equation $$Tx=x$$ when T is not necessarily a self-mapping.
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 …
DESDEO : An Open Framework for Interactive Multiobjective Optimization
2018
We introduce a framework for interactive multiobjective optimization methods called DESDEO released under an open source license. With the framework, we want to make interactive methods easily accessible to be applied in solving real-world problems. The framework follows an object-oriented software design paradigm, where functionalities have been divided to modular, self-contained components. The framework contains implementations of some interactive methods, but also components which can be utilized to implement more interactive methods and, thus, increase the applicability of the framework. To demonstrate how the framework can be used, we consider an example problem where the pollution of…
Procedure for a Temperature-Traffic Model on Rubberized Asphalt Layers for Roads and Railways
2017
The impact of temperature on the mechanical properties and thermal susceptibility of the railway bituminous sub-ballast layer, has served as motivation to develop the advanced measurement of thermal cycles in this layer and, an evaluation of the average seasonal temperatures interpolated by sinusoidal functions, of which characteristic parameters are determined. According to weather situation, Barber’s temperature model was used to prove the effectiveness for the railway superstructure. It is included the assessment of improved modified asphalt mixes performed with coarse rubber from scrap tires, having 1.5 to 3 percent of crumb rubber (particle size 0.2-4 mm) by weight of the total mix, as…