Search results for "ESMA"
showing 10 items of 162 documents
Jaunatnes dārzs: kristīgs vadonis iesvētamiem
1925
Saturs: Ievads ; Ievadījums Svētos Rakstos I. Vecā Derība II. Jaunā Derība ; Bībeles pērles ; Bībeles panti ; Bībeles stāsti I. Vecā Derība II. Jaunā Derība ; Īsa kristīgās baznīcas vēsture ; Dziesmu grāmata ; Katķisms ; Dievkalpošanas kārtība ; Baznīcas gads.
Mahrtiņa Luttera Katķissis ar isskaidroschanahm, ar dseesmu- un bihbeles-perschiņeem un ar diweem peelikkumeem [Mārtiņa Lutera Katķisms ar īsskaidroš…
1865
IC3D Classification of Corneal Dystrophies—Edition 2
2015
To update the 2008 International Classification of Corneal Dystrophies (IC3D) incorporating new clinical, histopathologic, and genetic information.The IC3D reviewed worldwide peer-reviewed articles for new information on corneal dystrophies published between 2008 and 2014. Using this information, corneal dystrophy templates and anatomic classification were updated. New clinical, histopathologic, and confocal photographs were added.On the basis of revisiting the cellular origin of corneal dystrophy, a modified anatomic classification is proposed consisting of (1) epithelial and subepithelial dystrophies, (2) epithelial-stromal TGFBI dystrophies, (3) stromal dystrophies, and (4) endothelial d…
Sesquiterpenoids in subtribe Centaureinae (Cass.) Dumort (tribe Cardueae, Asteraceae): distribution, (13)C NMR spectral data and biological propertie…
2012
Asteraceae Bercht. & J. Presl is one of the biggest and most economically important plant families. The taxonomy and phylogeny of Asteraceae is rather complex and according to the latest and most reliable taxonomic classification of Panero & Funk, based on the analysis of nine chloroplast regions, the family is divided into 12 subfamilies and 35 tribes. One of the largest tribes of Asteraceae is Cardueae Cass. with four subtribes (Carlininae, Echinopinae, Carduinae and Centaureinae) and more than 2500 species. Susanna & Garcia-Jacas have organized the genera of Centaureinae (about 800 species) into seven informal groups, which recent molecular studies have confirmed: 1. Basal genera; 2. Vol…
Acid rearrangment of epoxy-germacranolides and absolute configuration of 1beta, 10alpha-epoxy-salonitenolide
2010
The acid-catalyzed cyclization of mono epoxides of cnicin acetonide (3) was investigated. Several 6,12-eudesmanolides were obtained, and their stereochemistry established by extensive spectroscopic analyses. Chemical correlations also led to the assignment of the absolute configuration of 1beta,10alpha-epoxy-salonitenolide (13), a previously isolated natural product. The cytotoxic activities of some compounds were determined against A549 and MCF-7 tumor cell lines. The esterified germacranolides 2-6 were selectively cytotoxic against the MCF-7 breast cancer cell line.
GRASP with path relinking for the orienteering problem
2014
In this paper, we address an optimization problem resulting from the combination of the well-known travelling salesman and knapsack problems. In particular, we target the orienteering problem, originated in the context of sport, which consists of maximizing the total score associated with the vertices visited in a path within the available time. The problem, also known as the selective travelling salesman problem, is NP-hard and can be formulated as an integer linear program. Since the 1980s, several solution methods for this problem have been developed and applied to a variety of fields, particularly in routing and tourism. We propose a heuristic method—based on the Greedy Randomized Adapt…
Vēstures un filoloģijas zinātnes, 1. sērija
1956
Towards Multilevel Ant Colony Optimisation for the Euclidean Symmetric Traveling Salesman Problem
2015
Ant Colony Optimization ACO metaheuristic is one of the best known examples of swarm intelligence systems in which researchers study the foraging behavior of bees, ants and other social insects in order to solve combinatorial optimization problems. In this paper, a multilevel Ant Colony Optimization MLV-ACO for solving the traveling salesman problem is proposed, by using a multilevel process operating in a coarse-to-fine strategy. This strategy involves recursive coarsening to create a hierarchy of increasingly smaller and coarser versions of the original problem. The heart of the approach is grouping the variables that are part of the problem into clusters, which is repeated until the size…
On Randomness and Structure in Euclidean TSP Instances: A Study With Heuristic Methods
2021
Prediction of the quality of the result provided by a specific solving method is an important factor when choosing how to solve a given problem. The more accurate the prediction, the more appropriate the decision on what to choose when several solving applications are available. In this article, we study the impact of the structure of a Traveling Salesman Problem instance on the quality of the solution when using two representative heuristics: the population-based Ant Colony Optimization (ACO) and the local search Lin-Kernighan (LK) algorithm. The quality of the result for a solving method is measured by the computation accuracy, which is expressed using the percent error between its soluti…
A note on the separation of subtour elimination constraints in elementary shortest path problems
2013
Abstract This note proposes an alternative procedure for identifying violated subtour elimination constraints (SECs) in branch-and-cut algorithms for elementary shortest path problems. The procedure is also applicable to other routing problems, such as variants of travelling salesman or shortest Hamiltonian path problems, on directed graphs. The proposed procedure is based on computing the strong components of the support graph. The procedure possesses a better worst-case time complexity than the standard way of separating SECs, which uses maximum flow algorithms, and is easier to implement.