Search results for "Computer Science Applications"
showing 10 items of 3993 documents
Designing portfolios of financial products via integrated simulation and optimization models
1999
We analyze the problem of debt issuance through the sale of innovative financial products. The problem is broken down to questions of designing the financial products, specifying the debt structure with the amount issued in each product, and determining an optimal level of financial leverage. We formulate a hierarchical optimization model to integrate these three issues and provide constructive answers. Input data for the models are obtained from Monte Carlo simulation procedures that generate scenarios of holding period returns of the designed products. The hierarchical optimization model is specialized for the problem of issuing a portfolio of callable bonds to fund mortgage assets. The …
Apparel sizing using trimmed PAM and OWA operators
2012
This paper is concerned with apparel sizing system design. One of the most important issues in the apparel development process is to define a sizing system that provides a good fit to the majority of the population. A sizing system classifies a specific population into homogeneous subgroups based on some key body dimensions. Standard sizing systems range linearly from very small to very large. However, anthropometric measures do not grow linearly with size, so they can not accommodate all body types. It is important to determine each class in the sizing system based on a real prototype that is as representative as possible of each class. In this paper we propose a methodology to develop an …
Energy-efficient resource allocation for OFDMA two-way relay networks with imperfect CSI
2015
Most of the existed works on the radio resource allocation (RRA) problem commonly assume the channel-state information (CSI) can be perfectly obtained by the transmission source. However, such assumption is not practical in the realistic wireless systems. In this work, we consider the practical implementation issues of resource allocation in orthogonal frequency division multiple access (OFDMA) two-way relay networks: the inaccuracy of channel-state information (CSI) available to the source. Instead, only the estimated channel status is known by the source. In this context, a joint optimization of subcarrier pairing and allocation, relay selection, and transmit power allocation is formulate…
New Results on the Mixed General Routing Problem
2005
[EN] In this paper, we deal with the polyhedral description and the resolution of the Mixed General Routing Problem. This problem, in which the service activity occurs both at some of the nodes and at some of the arcs and edges of a mixed graph, contains a large number of important arc and node routing problems as special cases. Here, a large family of facet-defining inequalities, the Honeycomb inequalities, is described. Furthermore, a cutting-plane algorithm for this problem that incorporates new separation procedures for the K-C, Regular Path-Bridge, and Honeycomb inequalities is presented. Branch and bound is invoked when the final solution of the cutting-plane procedure is fractional. …
Preface
2015
This special issue of Mathematical Structures in Computer Science is devoted to the fourteenth Italian Conference on Theoretical Computer Science (ICTCS) held at University of Palermo, Italy, from 9th to 11th September 2013. ICTCS is the conference of the Italian Chapter of the European Association for Theoretical Computer Science and covers a wide spectrum of topics in Theoretical Computer Science, ranging from computational complexity to logic, from algorithms and data structure to programming languages, from combinatorics on words to distributed computing. For this reason, the contributions here included come from very different areas of Theoretical Computer Science. In fact this special…
Tensor tomography on Cartan–Hadamard manifolds
2017
We study the geodesic X-ray transform on Cartan-Hadamard manifolds, and prove solenoidal injectivity of this transform acting on functions and tensor fields of any order. The functions are assumed to be exponentially decaying if the sectional curvature is bounded, and polynomially decaying if the sectional curvature decays at infinity. This work extends the results of Lehtonen (2016) to dimensions $n \geq 3$ and to the case of tensor fields of any order.
Robotic path planning for non-destructive testing – A custom MATLAB toolbox approach
2016
AbstractThe requirement to increase inspection speeds for non-destructive testing (NDT) of composite aerospace parts is common to many manufacturers. The prevalence of complex curved surfaces in the industry provides motivation for the use of 6 axis robots in these inspections. The purpose of this paper is to present work undertaken for the development of a KUKA robot manipulator based automated NDT system. A new software solution is presented that enables flexible trajectory planning to be accomplished for the inspection of complex curved surfaces often encountered in engineering production. The techniques and issues associated with conventional manual inspection techniques and automated s…
Catalan and Schröder permutations sortable by two restricted stacks
2020
Abstract Pattern avoiding machines were introduced recently by Claesson, Cerbai and Ferrari as a particular case of the two-stacks in series sorting device. They consist of two restricted stacks in series, ruled by a right-greedy procedure and the stacks avoid some specified patterns. Some of the obtained results have been further generalized to Cayley permutations by Cerbai, specialized to particular patterns by Defant and Zheng, or considered in the context of functions over the symmetric group by Berlow. In this work we study pattern avoiding machines where the first stack avoids a pair of patterns of length 3 and investigate those pairs for which sortable permutations are counted by the…
A fully adaptive multiresolution scheme for image processing
2007
A nonlinear multiresolution scheme within Harten's framework [A. Harten, Discrete multiresolution analysis and generalized wavelets, J. Appl. Numer. Math. 12 (1993) 153-192; A. Harten, Multiresolution representation of data II, SIAM J. Numer. Anal. 33 (3) (1996) 1205-1256] is presented. It is based on a centered piecewise polynomial interpolation fully adapted to discontinuities. Compression properties of the multiresolution scheme are studied on various numerical experiments on images.
Randomized heuristics for the Capacitated Clustering Problem
2017
In this paper, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Greedy methodologies to the Capacitated Clustering Problem (CCP). In particular, we focus on the effect of the balance between randomization and greediness on the performance of these multi-start heuristic search methods when solving this NP-hard problem. The former is a memory-less approach that constructs independent solutions, while the latter is a memory-based method that constructs linked solutions, obtained by partially rebuilding previous ones. Both are based on the combination of greediness and randomization in the constructive process, and coupled with a subsequent l…