Search combinators

The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is often inadequate. Either modeling capabilities are extremely limited or users are faced with a general-purpose programming language whose features are not tailored towards writing search heuristics. As a result, major improvements in performance may remain unexplored. This article introduces search combinators, a lightweight and solver-independent method that bridges the gap between a conceptually simple modeling language for search (high-level, functional and naturally compositional) and an efficient implementation (low-level, imperative and highly non-modular). By allowing the user to define application-tailored search strategies from a small set of primitives, search combinators effectively provide a rich domain-specific language (DSL) for modeling search to the user. Remarkably, this DSL comes at a low implementation cost to the developer of a constraint solver. The article discusses two modular implementation approaches and shows, by empirical evaluation, that search combinators can be implemented without overhead compared to a native, direct implementation in a constraint solver.     

Preservice Teachers’ Understandings of the Relation Between a Fraction or Integer and Its Decimal Expansion: Strength and Stability of Belief

Abstract

In an earlier study of preservice elementary and middle school teachers’ beliefs about repeating decimals, Weller, Arnon, and Dubinsky (2009) reported on a comparison of the mathematical performance of 77 preservice teachers who completed an APOS-based instructional unit with 127 preservice teachers who completed traditional instruction. The purpose of the current study, based on 47 interviews conducted 4 months after the instruction, during which time there was no further instruction on this topic, is to determine the strength and stability (over time) of the students’ beliefs, to uncover thinking that did not arise in the earlier study, and to see whether the interviews yield similar comparative results. The interviews did uncover changes in student thinking. The students who received the APOS-based instruction developed stronger and more stable (over time) beliefs that a repeating decimal is a number; a repeating decimal has a fraction or integer to which it corresponds; a repeating decimal in general equals its corresponding fraction or integer; and, in particular, In addition, a number of indices and categories were developed that may prove useful in other studies consisting of the comparison of interview and questionnaire data involving a large number of interview subjects.     

On preconditioning for a parallel solution of the Richards equation

In this paper, we present a class of preconditioning methods for a parallel solution of the three-dimensional Richards equation. The preconditioning methods Jacobi scaling, block-Jacobi, incomplete lower–upper, incomplete Cholesky and algebraic multigrid were applied in combination with a parallel conjugate gradient solver and tested for robustness and convergence using two model scenarios. The first scenario was an infiltration into initially dry, sandy soil discretised in 500,000 nodes. The second scenario comprised spatially distributed soil properties using 275,706 numerical nodes and atmospheric boundary conditions. Computational results showed a high efficiency of the nonlinear parallel solution procedure for both scenarios using up to 64 processors. Using 32 processors for the first scenario reduced the wall clock time to slightly more than 1% of the single processor run. For scenario 2 the use of 64 processors reduces the wall clock time to slightly more than 20% of the 8 processors wall clock time. The difference in the efficiency of the various preconditioning methods is moderate but not negligible. The use of the multigrid preconditioning algorithm is recommended, since on average it performed best for both scenarios.     

Hidden Markov model-based ensemble methods for offline handwritten text line recognition

This paper investigates various ensemble methods for offline handwritten text line recognition. To obtain ensembles of recognisers, we implement bagging, random feature subspace, and language model variation methods. For the combination, the word sequences returned by the individual ensemble members are first aligned. Then a confidence-based voting strategy determines the final word sequence. A number of confidence measures based on normalised likelihoods and alternative candidates are evaluated. Experiments show that the proposed ensemble methods can improve the recognition accuracy over an optimised single reference recogniser.     

Evidence for Glass–glass Interfaces in a Columnar Cu–Zr Nanoglass

Comprehensive analyses of the atomic structure using advanced analytical transmission electron microscopy-based methods combined with atom probe tomography confirm the presence of distinct glass–glass interfaces in a columnar Cu-Zr nanoglass synthesized by magnetron sputtering. These analyses provide first-time in-depth characterization of sputtered film nanoglasses and indicate that glass–glass interfaces indeed present an amorphous phase with reduced mass density as compared to the neighboring amorphous regions. Moreover, dedicated analyses of the diffusion kinetics by time-of-flight secondary ion mass spectroscopy (ToF SIMS) prove significantly enhanced diffusivity, suggesting fast transport along the low density glass–glass interfaces. The present results further indicate that sputter deposition is a feasible technique for reliable production of nanoglasses and that some of the concepts proposed for this new class of glassy materials are applicable.     

Enterprise networks: The re-engineering of complex software systems

Today technology design can no longer be understood as a design process on a green site. Design and implementation of new technology are always dependent on existing technology and the way it is used by people. In this respect Software-Engineering has also changed to the characteristics of normal technology design taking into account existing computer systems. Experiences show that the conditions and needs of such Software-Reengineering projects are highly complex and differ in their special characteristics ranging from aspects of quality of existing system documentation to organizational structures of the computer departments concerned. The Task-Artifact Cycle presented here gives a suitable reengineering approach emphasizing both analysis and design in Software-Reengineering.     

In vitro processing of herpes simplex virus type 1 DNA replication intermediates by the viral alkaline nuclease, UL12

Herpes simplex virus type 1 (HSV-1) DNA replication intermediates exist in a complex nonlinear structure that does not migrate into a pulsed-field gel. Genetic evidence suggests that the product of the UL12 gene, termed alkaline nuclease, plays a role in processing replication intermediates (R. Martinez, R. T. Sarisky, P. C. Weber, and S. K. Weller, J. Virol. 70:2075-2085, 1996). In this study we have tested the hypothesis that alkaline nuclease acts as a structure-specific resolvase. Cruciform structures generated with oligonucleotides were treated with purified alkaline nuclease; however, instead of being resolved into linear duplexes as would be expected of a resolvase activity, the artificial cruciforms were degraded. DNA replication intermediates were isolated from the well of a pulsed-field gel ("well DNA") and treated with purified HSV-1 alkaline nuclease. Although alkaline nuclease can degrade virion DNA to completion, digestion of well DNA results in a smaller-than-unit-length product that migrates as a heterogeneous smear; this product is resistant to further digestion by alkaline nuclease. The smaller-than-unit-length products are representative of the entire HSV genome, indicating that alkaline nuclease is not inhibited at specific sequences. To further probe the structure of replicating DNA, well DNA was treated with various known nucleases; our results indicate that replicating DNA apparently contains no accessible double-stranded ends but does contain nicks and gaps. Our data suggest that UL12 functions at nicks and gaps in replicating DNA to correctly repair or process the replicating genome into a form suitable for encapsidation.     

GPU-based real-time approximation of the ablation zone for radiofrequency ablation

Percutaneous radiofrequency ablation (RFA) is becoming a standard minimally invasive clinical procedure for the treatment of liver tumors. However, planning the applicator placement such that the malignant tissue is completely destroyed, is a demanding task that requires considerable experience. In this work, we present a fast GPU-based real-time approximation of the ablation zone incorporating the cooling effect of liver vessels. Weighted distance fields of varying RF applicator types are derived from complex numerical simulations to allow a fast estimation of the ablation zone. Furthermore, the heat-sink effect of the cooling blood flow close to the applicator's electrode is estimated by means of a preprocessed thermal equilibrium representation of the liver parenchyma and blood vessels. Utilizing the graphics card, the weighted distance field incorporating the cooling blood flow is calculated using a modular shader framework, which facilitates the real-time visualization of the ablation zone in projected slice views and in volume rendering. The proposed methods are integrated in our software assistant prototype for planning RFA therapy. The software allows the physician to interactively place virtual RF applicator models. The real-time visualization of the corresponding approximated ablation zone facilitates interactive evaluation of the tumor coverage in order to optimize the applicator's placement such that all cancer cells are destroyed by the ablation.     

Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic

This paper presents a new algorithm for the dynamic multi-level capacitated lot sizing problem with setup carry-overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production orders in the sense that the first and the last products produced in a period are determined by the model. We solve a model which is applicable to general bill-of-material structures and which includes minimum lead times of one period and multi-period setup carry-overs. Our algorithm solves a series of mixed-integer linear programs in an iterative so-called fix-and-optimize approach. In each instance of these mixed-integer linear programs a large number of binary setup variables is fixed whereas only a small subset of these variables is optimized, together with the complete set of the inventory and lot size variables. A numerical study shows that the algorithm provides high-quality results and that the computational effort is moderate.     

B2C-E-Commerce als Treiber simultaner Veränderungen in IT-Struktur und Markenarchitektur

We analyze the influence of B2C e-commerce on IT structure and brand architecture based on conceptual considerations, a case study and an empirical survey. We first discuss the changes in transaction costs that are induced by B2C e-commerce. The effects of B2C e-commerce on IT structure and brand architecture, which are anticipated from a transaction cost perspective, are illustrated using a case study from the tourism industry. We conducted a quantitative study among 101 chief information officers (CIOs) and chief marketing officers (CMOs) from the most important consumer brand companies in Austria. The results of a correspondence analysis show that a high importance of e-commerce triggers a typical bundle of changes in IT structure and brand architecture, which point toward a stronger integration within and between these two structural elements. We therefore conclude that B2C e-commerce calls for a better coordination of those measures that impact IT structure and brand architecture.