Scheduling in or-parallel Prolog systems: Survey and open problems

Implementation of or-parallel Prolog systems offers a number of interesting scheduling problems. The main issues are the interaction between memory models and scheduling, ordering of multiple solutions, and scheduling of speculative work. The problems occur partly because of the design choices (e.g. the choice of a memory model), and partly because of the desire to maintain observational equivalence between parallel and sequential implementations of Prolog, while achieving high efficiency. In the first part of this paper a common framework for discussing scheduling in or-parallel systems is introduced, and also a collection of issues that must be addressed in such systems is presented. In the second part of the paper we survey a number of solutions to these problems comparing their efficiency whenever possible. We close the survey with a short discussion of open problems.Current association: Carlstedt Elektronik AB     

Influence of the amount of ferromagnetic addition on the rheological properties of spinning solutions,the structure,the strength,and thermal properties of polyacrylonitrile fibres

The rheological properties of spinning solutions of polyacrylonitrile in dimethyl formamide (DMF) containing various amounts of a ferromagnetic nanoaddition were investigated. The porous structure, the strength and thermal properties of fibers obtained from these solutions were assessed, as well as the uniformity of the nanoaddition distribution on the fiber surface was estimated. © 2008 Wiley Periodicals, Inc. J Appl Polym Sci, 2008     

Note on covering monotone orthogonal polygons with star-shaped polygons

In 1986, Keil provided an O(n²) time algorithm for the problem of covering monotone orthogonal polygons with the minimum number of r-star-shaped orthogonal polygons. This was later improved to O(n) time and space by Gewali et al. in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63]. In this paper we simplify the latter algorithm—we show that with a little modification, the first step Sweep1 of the discussed algorithm—which computes the top ceilings of horizontal grid segments—can be omitted.In addition, for the minimum orthogonal guard problem in the considered class of polygons, our approach provides a linear time algorithm which uses O(k) additional space, where k is the size of the optimal solution—the algorithm in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63] uses both O(n) time and O(n) additional space.     

Recursion from iteration

In a simply-typed, call-by-value (CBV) language with first-class continuations, the usual CBV fixpoint operator can be defined in terms of a simple, infinitely-looping iteration primitive. We first consider a natural but flawed definition, based on exceptions and “iterative deepening” of finite unfoldings, and point out some of its shortcomings. Then we present the proper construction using full first-class continuations, with both an informal derivation and a proof that the behavior of the defined operator faithfully mimics a “built-in” recursion primitive. In fact, given an additional uniformity assumption, the construction is a two-sided inverse of the usual definition of iteration from recursion. Continuing, we show that the CBV looping primitive is in fact the direct-style equivalent of a continuation-passing-style fixpoint, and that this correspondence extends all the way to traditional definitions of these operators in terms of reflexive types.     

Ein Beitrag zur Bestimmung der mittleren Zeitkonstante von Diffusionsprozessen

In the paper the general Galerkin method has been applied for the determination of the equivalent time constant of diffusion processes. After establishing the step function response the general formulas have been obtained, which allow for the consideration of boundary conditions of various kinds. The method has been illustrated with some numerical examples.     

Determination of porous glass surface free energy components from contact angles

The contact angles of water drops and diiodomethane drops on pellets made of controlled porosity glasses have been measured. The surface of the glasses was modified by thermal treatment at 873 K which led to an increase in the surface concentration of boron atoms. Glass modified with Carbowax 20M (polyethylene glycol) and fully hydroxylated glass have also been studied. Using the measured contact angles and modified Young equation, the dispersion and nondispersion components of the glass surface free energy have been calculated. The values show that with increasing heating time (increasing surface density of boron atoms) an increase in the surface polarity takes place. However, the polarity of the same samples decreases after treatment with Carbowax, increasingly so with higher boron atom concentrations.     

Morse set classification and hierarchical refinement using Conley index

Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is not unique, and its granularity directly impacts its computational cost. In this paper, we propose an automatic refinement scheme to construct the Morse Connection Graph (MCG) of a given vector field in a hierarchical fashion. Our framework allows a Morse set to be refined through a local update of the flow combinatorialization graph, as well as the connection regions between Morse sets. The computation is fast because the most expensive computation is concentrated on a small portion of the domain. Furthermore, the present work allows the generation of a topologically consistent hierarchy of MCGs, which cannot be obtained using a global method. The classification of the extracted Morse sets is a crucial step for the construction of the MCG, for which the Poincare′ index is inadequate. We make use of an upper bound for the Conley index, provided by the Betti numbers of an index pair for a translation along the flow, to classify the Morse sets. This upper bound is sufficiently accurate for Morse set classification and provides supportive information for the automatic refinement process. An improved visualization technique for MCG is developed to incorporate the Conley indices. Finally, we apply the proposed techniques to a number of synthetic and realworld simulation data to demonstrate their utility.     

An optimization of allocation of information granularity in the interpretation of data structures: toward granular fuzzy clustering

Clustering forms one of the most visible conceptual and algorithmic framework of developing information granules. In spite of the algorithm being used, the representation of information granules-clusters is predominantly numeric (coming in the form of prototypes, partition matrices, dendrograms, etc.). In this paper, we consider a concept of granular prototypes that generalizes the numeric representation of the clusters and, in this way, helps capture more details about the data structure. By invoking the granulation-degranulation scheme, we design granular prototypes being reflective of the structure of data to a higher extent than the representation that is provided by their numeric counterparts (prototypes). The design is formulated as an optimization problem, which is guided by the coverage criterion, meaning that we maximize the number of data for which their granular realization includes the original data. The granularity of the prototypes themselves is treated as an important design asset; hence, its allocation to the individual prototypes is optimized so that the coverage criterion becomes maximized. With this regard, several schemes of optimal allocation of information granularity are investigated, where interval-valued prototypes are formed around the already produced numeric representatives. Experimental studies are provided in which the design of granular prototypes of interval format is discussed and characterized.     

Asphalts as inhibitors of radical polymerization

The results of investigations concerning the effect of asphalts on radical polymerization of a monomer for model systems composed of styrene and two petroleum asphalts originated from two different crude oils: low sulphur nonparaffinic crude oil and medium sulphur paraffinic crude oil. Based on determination of styrene conversion in the radical polymerization process in the presence of asphalts, it was found that both asphalts act as inhibitors of this reaction. The inhibiting effect of asphalts is weakened by using higher temperatures and prolongation of polymerization time or application of greater initiator rates. On the basis of the analysis of group and elementary chemical composition of both asphalts as well as electron paramagnetic resonance, it was found that the inhibiting effect to radical polymerization is caused mainly by the presence of structures which are stable free radicals in character. The probability of inhibiting effect by sulphur compounds present in asphalts is also discussed.     

Quality assessment for a visual and automatic license plate recognition

Video transmission and analysis is often utilized in applications outside of the entertainment sector, and generally speaking this class of video is used to perform specific tasks. Examples of these applications include security and public safety. The Quality of Experience (QoE) concept for video content used for entertainment differs significantly from the QoE of surveillance video used for recognition tasks. This is because, in the latter case, the subjective satisfaction of the user depends on achieving a given functionality. Recognizing the growing importance of video in delivering a range of public safety services, we focused on developing critical quality thresholds in license plate recognition tasks based on videos streamed in constrained networking conditions. Since the number of surveillance cameras is still growing it is obvious that automatic systems will be used to do the tasks. Therefore, the presented research includes also analysis of automatic recognition algorithms.