Theorem Proving Guided Development of Formal Assertions in a Resource-Constrained Scheduler for High-Level Synthesis

This paper presents a formal specification and a proof of correctness for the widely-used Force-Directed List Scheduling (FDLS) algorithm for resource-constrained scheduling of data flow graphs in high-level synthesis systems. The proof effort is conducted using a higher-order logic theorem prover. During the proof effort many interesting properties of the FDLS algorithm are discovered. These properties are formally stated and proved in a higher-order logic theorem proving environment. These properties constitute a detailed set of formal assertions and invariants that should hold at various steps in the FDLS algorithm. They are then inserted as programming assertions in the implementation of the FDLS algorithm in a production-strength high-level synthesis system. When turned on, the programming assertions (1) certify whether a specific run of the FDLS algorithm produced correct schedules and, (2) in the event of failure, help discover and isolate programming errors in the FDLS implementation.We present a detailed example and several experiments to demonstrate the effectiveness of these assertions in discovering and isolating errors. Based on this experience, we discuss the role of the formal theorem proving exercise in developing a useful set of assertions for embedding in the scheduler code and argue that in the absence of such a formal proof checking effort, discovering such a useful set of assertions would have been an arduous if not impossible task.     

Electro-oxidation of two reactive azo dyes on boron-doped diamond electrode

Electrochemical oxidation (decolorization/degradation) of blue and red commercial reactive azo dyes was carried out on boron-doped diamond (BDD) electrode. The effect of various quantities of FeSO(4) was investigated in the electro-Fenton reaction on BDD. Progress of dyes degradation during the electrolysis and electro-Fenton reaction was monitored by UV-visible absorption and by estimation of the chemical oxygen demand (COD). Direct electrolysis showed a limiting capacity for red and blue dye removal even at high current densities, e.g. maximum red color and COD removal were 70 and 20%, respectively at 30 mA cm(-2) after 300 min. Higher red and blue color removal efficiencies were achieved by electro-Fenton oxidation. Current density of 30 mA cm(-2) in the presence of 0.05 mmol/L of FeSO(4) resulted in the red color and COD removal of 98 and 96%, respectively. The optimum FeSO(4) concentration for the electro-Fenton reaction was determined to be 0.05 mmol/L. Instantaneous current efficiency (ICE) in the presence of FeSO(4) was almost three times higher than for experiments carried out without FeSO(4).     

Towards a unified framework for opinion retrieval, mining and summarization

The exponential increase of subjective, user-generated content since the birth of the Social Web, has led to the necessity of developing automatic text processing systems able to extract, process and present relevant knowledge. In this paper, we tackle the Opinion Retrieval, Mining and Summarization task, by proposing a unified framework, composed of three crucial components (information retrieval, opinion mining and text summarization) that allow the retrieval, classification and summarization of subjective information. An extensive analysis is conducted, where different configurations of the framework are suggested and analyzed, in order to determine which is the best one, and under which conditions. The evaluation carried out and the results obtained show the appropriateness of the individual components, as well as the framework as a whole. By achieving an improvement over 10% compared to the state-of-the-art approaches in the context of blogs, we can conclude that subjective text can be efficiently dealt with by means of our proposed framework.     

Distance maps from unthresholded magnitudes

A straightforward algorithm that computes distance maps from unthresholded magnitudes is presented, suitable for still images and video sequences. While results on binary images are similar to classic Euclidean Distance Transforms, the proposed approach does not require a binarization step. Thus, no thresholds are needed and no information is lost in intermediate classification stages. Experiments include the evaluation of spatial and temporal coherence of distance map values, showing better results in both measurements than those obtained with Sobel or Deriche gradients and classic chessboard distance transforms.     

Intrinsic Images by Clustering

Decomposing an input image into its intrinsic shading and reflectance components is a long‐standing ill‐posed problem. We present a novel algorithm that requires no user strokes and works on a single image. Based on simple assumptions about its reflectance and luminance, we first find clusters of similar reflectance in the image, and build a linear system describing the connections and relations between them. Our assumptions are less restrictive than widely‐adopted Retinex‐based approaches, and can be further relaxed in conflicting situations. The resulting system is robust even in the presence of areas where our assumptions do not hold. We show a wide variety of results, including natural images, objects from the MIT dataset and texture images, along with several applications, proving the versatility of our method.     

Desynchronization and inhibition of Kuramoto oscillators by scalar mean-field feedback

Motivated by neuroscience applications, and in particular by the deep brain stimulation treatment for Parkinson’s disease, we have recently derived a simplified model of an interconnected neuronal population under the effect of its mean-field proportional feedback. In this paper, we rely on that model to propose conditions under which proportional mean-field feedback achieves either oscillation inhibition or desynchronization. More precisely, we show that for small natural frequencies, this scalar control signal induces an inhibition of the collective oscillation. For the closed-loop system, this situation corresponds to a fixed point which is shown to be almost globally asymptotically stable in the fictitious case of zero natural frequencies and all-to-all coupling and feedback. In the case of an odd number of oscillators, this property is shown to be robust to small natural frequencies and heterogencities in both the coupling and feedback topology. On the contrary, for large natural frequencies, we show that scalar proportional mean-field feedback is able to induce desynchronization. After having recalled a formal definition for desynchronization, we show how it can be induced in a network of originally synchronized oscillators.     

Predictor-based stabilization of discrete time-varying input-delay systems

This paper adapts some literature results on stabilizing discrete time-varying input delay systems to the case of having a predictor-based controller. The objective of the paper is showing that the incorporation of predictors to the referred results is relatively simple and, by means of such predictors, robustness against delay mismatch in the input channel may be improved. In this way, larger delay variation margins are proved with predictors when compared to standard memoryless state feedback, as intuitively expected, due to the extra past information available.     

Mass appraisal of residential apartments: An application of Random forest for valuation and a CART-based approach for model diagnostics

To the best knowledge of authors, the use of Random forest as a potential technique for residential estate mass appraisal has been attempted for the first time. In the empirical study using data on residential apartments the method performed better than such techniques as CHAID, CART, KNN, multiple regression analysis, Artificial Neural Networks (MLP and RBF) and Boosted Trees. An approach for automatic detection of segments where a model significantly underperforms and for detecting segments with systematically under- or overestimated prediction is introduced. This segmentational approach is applicable to various expert systems including, but not limited to, those used for the mass appraisal.     

A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set

A new lower bound for the distance of cyclic codes is proposed. This bound depends on the defining set of the code, like several other bounds. The proposed bound improves upon the Bose-Chaudhuri-Hocquehghen (BCH) bound and, for some codes, improves upon the Hartmann-Tzeng bound and the Roos bound as well