Piecewise linearisation of the first order loss function for families of arbitrarily distributed random variables

We discuss the problem of computing optimal linearisation parameters for the first order loss function of a family of arbitrarily distributed random variable. We demonstrate that, in contrast to the problem in which parameters must be determined for the loss function of a single random variable, this problem is nonlinear and features several local optima and plateaus. We introduce a simple and yet effective heuristic for determining these parameters and we demonstrate its effectiveness via a numerical analysis carried out on a well known stochastic lot sizing problem

Optimality program in segment and string graphs

Planar graphs are known to allow subexponential algorithms running in time $2^{O(\sqrt n)}$ or $2^{O(\sqrt n \log n)}$ for most of the paradigmatic problems, while the brute-force time $2^{\Theta(n)}$ is very likely to be asymptotically best on general graphs. Intrigued by an algorithm packing curves in $2^{O(n^{2/3}\log n)}$ by Fox and Pach [SODA'11], we investigate which problems have subexponential algorithms on the intersection graphs of curves (string graphs) or segments (segment intersection graphs) and which problems have no such algorithms under the ETH (Exponential Time Hypothesis). Among our results, we show that, quite surprisingly, 3-Coloring can also be solved in time $2^{O(n^{2/3}\log^{O(1)}n)}$ on string graphs while an algorithm running in time $2^{o(n)}$ for 4-Coloring even on axis-parallel segments (of unbounded length) would disprove the ETH. For 4-Coloring of unit segments, we show a weaker ETH lower bound of $2^{o(n^{2/3})}$ which exploits the celebrated Erd\H{o}s-Szekeres theorem. The subexponential running time also carries over to Min Feedback Vertex Set but not to Min Dominating Set and Min Independent Dominating Set.Comment: 19 pages, 15 figure

Derived environment effects: A representational approach

Derived environment effects involve either overapplication or underapplication of phonological rules in phonological or morphological environments. This paper focuses on underapplication effects in both phonological and morphological environments, which are treated as resulting from representational differences between derived and non-derived environments at the appropriate level. The Government and Dependency Phonology notions of head and dependent are utilised to this end. Thus, phonologically derived environment effects result from melodic structure that differentiates branching from immediate dominance relations between elements, allowing phonological processes to target a segment of one melodic configuration to the exclusion of another. Morphologically derived environment effects, on the other hand, involve representational differences at the constituent structure level, corresponding to the fact that morphological effects are a result of junctural or morpheme-integrity effects. In the latter case, head-dependent relations are defined as holding over domains, thereby differentiating affixal from non-affixal material, while in the former junctural effects the representational difference is defined at the CV tier, with phonological processes being sensitive to the presence of empty V and C positions. © 2008 Elsevier B.V. All rights reserved

A hybrid heuristic solving the traveling salesman problem

This paper presents a new hybrid heuristic for solving the Traveling Salesman Problem, The algorithm is designed on the frame of a general optimization procedure which acts upon two steps, iteratively. In first step of the global search, a feasible tour is constructed based on insertion approach. In the second step the feasible tour found at the first step, is improved by a local search optimization procedure. The second part of the paper presents the performances of the proposed heuristic algorithm, on several test instances. The statistical analysis shows the effectiveness of the local search optimization procedure, in the graphical representation.peer-reviewe

Neutralization in Aztec Phonology – the Case of Classical Nahuatl Nasals

This article investigates nasal assimilation in Classical Nahuatl. The distribution of nasal consonants is shown to be the result of coda neutralization. It is argued that generalizations made for root and word level are disproportionate and cannot be explained through the means of rule-based phonology. It is shown that the process responsible for nasal distribution can only be accounted for by introducing derivational levels in Optimality Theor

Sampling-based optimal kinodynamic planning with motion primitives

This paper proposes a novel sampling-based motion planner, which integrates in RRT* (Rapidly exploring Random Tree star) a database of pre-computed motion primitives to alleviate its computational load and allow for motion planning in a dynamic or partially known environment. The database is built by considering a set of initial and final state pairs in some grid space, and determining for each pair an optimal trajectory that is compatible with the system dynamics and constraints, while minimizing a cost. Nodes are progressively added to the tree {of feasible trajectories in the RRT* by extracting at random a sample in the gridded state space and selecting the best obstacle-free motion primitive in the database that joins it to an existing node. The tree is rewired if some nodes can be reached from the new sampled state through an obstacle-free motion primitive with lower cost. The computationally more intensive part of motion planning is thus moved to the preliminary offline phase of the database construction at the price of some performance degradation due to gridding. Grid resolution can be tuned so as to compromise between (sub)optimality and size of the database. The planner is shown to be asymptotically optimal as the grid resolution goes to zero and the number of sampled states grows to infinity

Moment-Based Relaxation of the Optimal Power Flow Problem

The optimal power flow (OPF) problem minimizes power system operating cost subject to both engineering and network constraints. With the potential to find global solutions, significant research interest has focused on convex relaxations of the non-convex AC OPF problem. This paper investigates ``moment-based'' relaxations of the OPF problem developed from the theory of polynomial optimization problems. At the cost of increased computational requirements, moment-based relaxations are generally tighter than the semidefinite relaxation employed in previous research, thus resulting in global solutions for a broader class of OPF problems. Exploration of the feasible space for test systems illustrates the effectiveness of the moment-based relaxation.Comment: 7 pages, 4 figures. Abstract accepted, full paper in revie