Supporting pruning in tabled LP

This paper analyzes issues which appear when supporting pruning operators in tabled LP. A version of the once/1 control predicate tailored for tabled predicates is presented, and an implementation analyzed and evaluated. Using once/1 with answer-on-demand strategies makes it possible to avoid computing unneeded solutions for problems which can benefit from tabled LP but in which only a single solution is needed, such as model checking and planning. The proposed version of once/1 is also directly applicable to the efficient implementation of other optimizations, such as early completion, cut-fail loops (to, e.g., prune at the top level), if-then-else, and constraint-based branch-and-bound optimization. Although once/1 still presents open issues such as dependencies of tabled solutions on program history, our experimental evaluation confirms that it provides an arbitrarily large efficiency improvement in several application areas.

Asymptotically Toeplitz Hessenberg Operators and the Rieman mapping

In a recent work the authors have established a relation between the limits of the elements of the diagonals of the Hessenberg matrix D associated with a regular measure, whenever those limits exist, and the coe?cients of the Laurent series expansion of the Riemann mapping ?(z) of the support supp(?), when this is a Jordan arc or a connected nite union of Jordan arcs in the complex plane C. We extend here this result using asymptotic Toeplitz operator properties of the Hessenberg matriz.

Coronary Artery Tracking in 3D Cardiac CT Images Using Local Morphological Reconstruction Operators

Automatic segmentation and tracking of the coronary artery tree from Cardiac Multislice-CT images is an important goal to improve the diagnosis and treatment of coronary artery disease. This paper presents a semi-automatic algorithm (one input point per vessel) based on morphological grayscale local reconstructions in 3D images devoted to the extraction of the coronary artery tree. The algorithm has been evaluated in the framework of the Coronary Artery Tracking Challenge 2008 [1], obtaining consistent results in overlapping measurements (a mean of 70% of the vessel well tracked). Poor results in accuracy measurements suggest that future work should refine the centerline extraction. The algorithm can be efficiently implemented and its general strategy can be easily extrapolated to a completely automated centerline extraction or to a user interactive vessel extraction

Spatio-temporal filtering with morphological operators for robust cell migration estimation in "in-vivo" images

The understanding of the embryogenesis in living systems requires reliable quantitative analysis of the cell migration throughout all the stages of development. This is a major challenge of the "in-toto" reconstruction based on different modalities of "in-vivo" imaging techniques -spatio-temporal resolution and image artifacts and noise. Several methods for cell tracking are available, but expensive manual interaction -time and human resources- is always required to enforce coherence. Because of this limitation it is necessary to restrict the experiments or assume an uncontrolled error rate. Is it possible to obtain automated reliable measurements of migration? can we provide a seed for biologists to complete cell lineages efficiently? We propose a filtering technique that considers trajectories as spatio-temporal connected structures that prunes out those that might introduce noise and false positives by using multi-dimensional morphological operators.

Aircraft flight trajectory deviation in the standard instrument departures. Operators penalties.

In the recent years many problems are emerging due to the aircraft noise on the airport surrounding areas. The solution to this problem is not easy considering that the neighbourhood asks for the reduction of the number of aircraft operations and the airlines ask for a growing demand in the number of operations in the major airports. So the airport and regulatory authorities try to get a solution imposing a fine to the aircraft which its actual trajectory differs from the nominal one more than a lateral deviation. But, which is the value of this deviation?. The current situation is that many operators have to pay a lot of money for exceeding a deviation which has been established without operational criteria. This paper presents the results of a research program which is being carried out by the authors which aims to determine the "delta" deviation to be used for this purpose. In addition it is proposed a customized method per SID and per airport to be used for determining the maximum allowed lateral deviation by which if the aircraft is within it, then none fine will be imposed.

Analysis of the operating efficiency of mobile operators during the 2002 to 2008 period

This article aims to quantify the efficiency of mobile operators in Spain and other European countries such as France and Germany. The period considered is from 2002 to 2008. Linear regression is used to analyze the relationship between growth in revenue and gross operating margin (EBITDA) generated by the relevant operators and the aggregate industry in each country. At the industry level, it is shown that (i) there is a strong correlation between revenue and margin; and (ii) this correlation weakens when competitive intensity grows. At the operator level, those which achieved larger increases in revenues did not sacrifice their margins, but offset the additional investments and costs required to achieve said growth through economies of scale.

How network operators can enhance ambient assisted living applications through next generation networks

Within the technological framework of Information and Communication Technologies (ICT), consumers are currently requesting multimedia services with simplicity of use, reliability, security and service availability through mobile and fixed access. Network operators are proposing the Next Generation Networks (NGN) to address the challenges of providing both services and network convergence. Apart from these considerations, there is a need to provide social and healthcare assistance services in order to support the progressive aging in the elderly population. In order to achieve this objective, the Ambient Assisted Living (AAL) initiative proposes ICT systems and services to promote autonomy and an independent life among the elderly. This paper describes the design and implementation of a group of services, called “service enablers”, which helps AAL applications to be supported in NGN. The presented enablers are identified to support the teleconsulting applications requirements in an NGN environment, involving the implementation of a virtual waiting room, a virtual whiteboard, a multimedia multiconference and a vital-signs monitoring presence status. A use case is defined and implemented to evaluate the developed enablers' performance.

A genetic algorithm for slope stability analyses with concave slip surfaces using custom operators

Heuristic methods are popular tools to find critical slip surfaces in slope stability analyses. A new genetic algorithm (GA) is proposed in this work that has a standard structure but a novel encoding and generation of individuals with custom-designed operators for mutation and crossover that produce kinematically feasible slip surfaces with a high probability. In addition, new indices to assess the efficiency of operators in their search for the minimum factor of safety (FS) are proposed. The proposed GA is applied to traditional benchmark examples from the literature, as well as to a new practical example. Results show that the proposed GA is reliable, flexible and robust: it provides good minimum FS estimates that are not very sensitive to the number of nodes and that are very similar for different replications

An optimal yet fast pruning algorithm to reduce latency in multiview prediction structures

We propose a new algorithm for the design of prediction structures with low delay and limited penalty in the rate-distortion performance for multiview video coding schemes. This algorithm constitutes one of the elements of a framework for the analysis and optimization of delay in multiview coding schemes that is based in graph theory. The objective of the algorithm is to find the best combination of prediction dependencies to prune from a multiview prediction structure, given a number of cuts. Taking into account the properties of the graph-based analysis of the encoding delay, the algorithm is able to find the best prediction dependencies to eliminate from an original prediction structure, while limiting the number of cut combinations to evaluate. We show that this algorithm obtains optimum results in the reduction of the encoding latency with a lower computational complexity than exhaustive search alternatives.