In this paper we apply a Population based Ant Colony Optimization (PACO) algorithm for solving the following new version of the Traveling Salesperson problem that is called the Combined Tours TSP (CT-TSP). Given are a set of cities, for each pair of cities a cost function and an integer k. The aim is to find a set of k (cyclic) tours, i.e., each city is contained exactly once in each tour and e...

We describe reversibility mechanisms incorporated into a native code Forth used an an intermediate language for a B-GSL compiler. In contrast to our previous work, information preservation is limited to what is needed to implement the B-GSL semantics for non-deterministic choice and guard. Design choices are discussed with reference to the Pentium architecture. The use of guards and choice in F...

During June 2-8, 2009, an outbreak of influenza A pandemic (H1N1) 2009 occurred among 31 members of a tour group in China. To identify the mode of transmission and risk factors, we conducted a retrospective cohort investigation. The index case-patient was a female tourist from the United States. Secondary cases developed in 9 (30%) tour group members who had talked with the index case-patient a...

The possible formation of three-stranded RNA and DNA hybrid structures (R-loops) in thousands of functionally important guanine-rich genic and inter-genic regions could suggest their involvement in transcriptional regulation and even development of diseases. Here, we introduce the first freely available R-loop prediction program called Quantitative Model of R-loop Forming Sequence (RLFS) finder...

This paper describes the development process of a contextualized corpus for research on Human-Robot Communication. The data have been collected in two Wizard-of-Oz user studies performed with 22 and 5 users respectively in a scenario that is called the Home Tour. In this scenario the users show the environment (a single room, or a whole floor) to a robot using a combination of speech and gestur...

The problem that we consider here deals with a single vehicle of a given capacity that needs to serve N customers: some of the customers require a delivery of stock from the warehouse, whereas others need to deliver stock from their location to the warehouse. The objective is to find a shortest feasible tour visiting all customers, emanating from and ending at the warehouse. We introduce an eff...

This paper defines the Stochastic Eulerian Tour Problem (SETP) and investigates several characteristics of this problem. Given an undirected Eulerian graph , a subset =) of the edges in E that require service, and a probability distribution for the number of edges in R that have to be visited in any given instance of the graph, the SETP seeks an a priori Eulerian tour of minimum expected length...