Visualization of level-of-detail meshes on the GPU

Extensive research has been carried out in multiresolution models for many decades. The tendency in recent years has been to harness the potential of GPUs to perform the level-of-detail extraction on graphics hardware. The aim of this work is to present a new level-of-detail scheme based on triangles which is both simple and efficient. In this approach, the extraction process updates vertices instead of indices, thus providing a perfect framework for adapting the algorithms to work completely on GPU shaders. One of the key aspects of our proposal is the need for just a single rendering pass in order to obtain the desired geometry. Moreover, coherence among the different approximations is maximized by means of a symmetric extraction algorithm, which performs the same process when refining and coarsening the mesh. Lastly, we also introduce different uses of the scheme to offer continuous and view-dependent resolution.     

Fracture morphology and mechanical properties of thermocatalytically polymerized MMA-impregnated mortar

Mortar mixes with different water-cement ratios and consistency were impregnated with methyl-methacrylate monomer and polymerized thermally under water using the free radical initiator, -azobis (isobutyronitrile). Results on drying, impregnation and polymerization are presented. It is shown that a considerable amount of polymer remained strongly adhered or chemically inserted in the inorganic matrix. The molecular weight of the inserted polymer is higher than that obtained in the solvent extracted polymer and this is also higher than the polymer molecular weight obtained by bulk polymerization under the same conditions. The compressive and flexural strength of the impregnated mortar were found to be a function of the amount of polymer in the composites. Fracture behaviour under load, and polymer distribution inside the composites were examined by scanning electron microscopic techniques (SEM). It was observed that the polymer acts in two ways, first as a filler of porous and microcrack voids, secondly forming an anisotropic irregular network improving the bond characteristic of the interface between aggregate and matrix. Furthermore, due to the the adhesion of the polymer to both phases, it acts as a reinforcement and improves the mechanical properties, in particular the flexural strength.     

Energy Production in Water Distribution Networks: A PAT Design Strategy

Pump operating as turbine (PAT) is an effective source of reducing the equipment cost in small hydropower plants. However, the manufacturers provide poor information on the PAT performance thus representing a limit for its wider diffusion. Additional implementation difficulties arise under variable operating conditions, characteristic of water distribution networks (WDNs). WDNs allow to obtain widespread and globally significant amount of produced energy by exploiting the head drop due to the network pressure control strategy for leak reductions. Thus a design procedure is proposed that couples a parallel hydraulic circuit with an overall plant efficiency criteria for the market pump selection within a WDN. The proposed design method allows to identify the performance curves of the PAT that maximizes the produced energy for an assigned flow and pressure-head distribution pattern. Finally, computational fluid dynamics (CFD) is shown as a suitable alternative for performance curve assessment covering the limited number of experimental data.     

Anaerobic monodigestion of poultry manure: determination of operational parameters for CSTR

In this work the anaerobic monodigestion for the treatment of turkey manure was evaluated, without its codigestion with another substrate. The effect of the organic loading rate (OLR) and the substrate concentration (high total solids (TS) concentration) or product concentration (high volatile fatty acids (VFA) and/or ammonia (NH(3)-N) concentrations) was studied. The results show that for a continuous stirred tank reactor (CSTR) operation, a maximum of 40 g/L of TS and 4.0 g/L of ammonium (NH(4)(+)) was required. In addition, the maximum organic loading rate (OLR) will not exceed 1.5 kg VS/m(3)d. Higher TS and NH(4)(+) concentrations and OLR lead to a reduction on the methane productivity and volatile solids (VS) removal. During the CSTR operation, a high alkalinity concentration (above 10 g/L CaCO(3)) was found; this situation allowed maintaining a constant and appropriate pH (close to 7.8), despite the VFA accumulation. In this sense, the alkalinity ratio (α) is a more appropriate control and monitoring parameter of the reactor operation compared to pH. Additionally, with this parameter a VS removal of 80% with a methane productivity of 0.50 m(3)(CH4)/m(3)(R)d is achieved.     

A new DSATUR-based algorithm for exact vertex coloring

This paper describes a new exact algorithm PASS for the vertex coloring problem based on the well known DSATUR algorithm. At each step DSATUR maximizes saturation degree to select a new candidate vertex to color, breaking ties by maximum degree w.r.t. uncolored vertices. Later Sewell introduced a new tiebreaking strategy, which evaluated available colors for each vertex explicitly. PASS differs from Sewell in that it restricts its application to a particular set of vertices. Overall performance is improved when the new strategy is applied selectively instead of at every step. The paper also reports systematic experiments over 1500 random graphs and a subset of the DIMACS color benchmark.     

A metaheuristic for a teaching assistant assignment-routing problem

The Flemish Ministry of Education promotes the integrated education of disabled children by providing educational opportunities in common schools. In the current system, disabled children receive ambulant help from a teaching assistant (TA) employed at an institute for extra-ordinary education. The compensation that the TAs receive for driving to visit the pupils is a major cost factor for the institute that provides the assistance. Therefore, the institute's management desires a schedule that minimizes the accumulated distance traveled by all TAs combined. We call this optimization problem the teaching assistants assignment-routing problem (TAARP). It involves three decisions that have to be taken simultaneously: (1) pupils have to be assigned to TAs; (2) pupils assigned to a given TA have to be spread over the TA's different working days; and (3) the order in which to visit the pupils on each day has to be determined. We propose a solution strategy based on an auction algorithm and a variable neighborhood search heuristic which has an excellent performance when applied to both simulated and real instances. The total distance traveled in the solution obtained for the institute's data set improves the current solution by about 22% which represents a saving of approximately 9% on the annual budget of the institute for integrated education.     

Intrinsically universal n-dimensional quantum cellular automata

Several non-axiomatic approaches have been taken to define Quantum Cellular Automata (QCA); Partitioned QCA (PQCA) are the most canonical. Here we show any QCA can be put into PQCA form. Our construction reconciles the non-axiomatic definitions of QCA, showing that they can all simulate one another, thus they are all equivalent to the axiomatic definition. A simple n-dimensional QCA capable of simulating all others to arbitrary precision is described, where the initial configuration and the evolution of any QCA can be encoded within the initial configuration of the intrinsically universal QCA. Several steps then correspond to one step of the simulated QCA, achieved via a non-trivial reduction of the problem to universality in quantum circuits. Results are formalised by defining generalised n-dimensional intrinsic simulation, preserving topology in that each cell of the simulated QCA is encoded as a group of adjacent cells in the universal QCA. Implications are discussed.     

udpSkeduler: A Web architecture based decision support system for course and classroom scheduling

A key process for post-secondary educational institutions is the definition of course timetables and classroom assignments. Manual scheduling methods require enormous amounts of time and resources to deliver results of questionable quality, and multiple course and classroom conflicts usually occur. This article presents a scheduling system implemented in a Web environment. This system generates optimal schedules via an integer-programming model. Among its functionalities, this system enables direct interaction with instructors in order to gather data on their time availability for teaching courses. The results demonstrate that significant improvements over the typical fully manual process were obtained.     

Fast wrapper feature subset selection in high-dimensional datasets by means of filter re-ranking

This paper deals with the problem of supervised wrapper-based feature subset selection in datasets with a very large number of attributes. Recently the literature has contained numerous references to the use of hybrid selection algorithms: based on a filter ranking, they perform an incremental wrapper selection over that ranking. Though working fine, these methods still have their problems: (1) depending on the complexity of the wrapper search method, the number of wrapper evaluations can still be too large; and (2) they rely on a univariate ranking that does not take into account interaction between the variables already included in the selected subset and the remaining ones.Here we propose a new approach whose main goal is to drastically reduce the number of wrapper evaluations while maintaining good performance (e.g. accuracy and size of the obtained subset). To do this we propose an algorithm that iteratively alternates between filter ranking construction and wrapper feature subset selection (FSS). Thus, the FSS only uses the first block of ranked attributes and the ranking method uses the current selected subset in order to build a new ranking where this knowledge is considered. The algorithm terminates when no new attribute is selected in the last call to the FSS algorithm. The main advantage of this approach is that only a few blocks of variables are analyzed, and so the number of wrapper evaluations decreases drastically.The proposed method is tested over eleven high-dimensional datasets (2400-46,000 variables) using different classifiers. The results show an impressive reduction in the number of wrapper evaluations without degrading the quality of the obtained subset.     

Prediction of parking space availability in real time

Intelligent parking reservation (IPR) systems allow customers to select a parking facility according to their preferences, rapidly park their vehicle without searching for a free stall, and pay their reservation in advance avoiding queues. Some IPR systems interact with in-vehicle navigation systems and provide users with information in real time such as capacity, parking fee, and current parking utilization. However, few of these systems provide information on the forecast utilization at specific hours - a process that requires the study of the competition between parking alternatives for the market share. This paper proposes a methodology for predicting real-time parking space availability in IPR architectures. This methodology consists of three subroutines to allocate simulated parking requests, estimate future departures, and forecast parking availability. Parking requests are allocated iteratively using an aggregated approach as a function of simulated drivers’ preferences, and parking availability. This approach is based on a calibrated discrete choice model for selecting parking alternatives. A numerical comparison between a one-by-one simulation-based forecast and the proposed aggregated approach indicates that no significant discrepancies exists, validating and suggesting the use of the less time consuming proposed aggregated methodology. Results obtained from contrasting predictions with real data yielded small average error availabilities. The forecast improves as the system registers arrivals and departures. Thus, the forecast is adequate for potential distribution in real-time using different media such as Internet, navigation systems, cell phones or GIS.