Evaluation of three methods for retrospective correction of vignetting on medical microscopy images utilizing two open source software tools

Correction of vignetting on images obtained by a digital camera mounted on a microscope is essential before applying image analysis. The aim of this study is to evaluate three methods for retrospective correction of vignetting on medical microscopy images and compare them with a prospective correction method. One digital image from four different tissues was used and a vignetting effect was applied on each of these images. The resulted vignetted image was replicated four times and in each replica a different method for vignetting correction was applied with fiji and gimp software tools. The highest peak signal-to-noise ratio from the comparison of each method to the original image was obtained from the prospective method in all tissues. The morphological filtering method provided the highest peak signal-to-noise ratio value amongst the retrospective methods. The prospective method is suggested as the method of choice for correction of vignetting and if it is not applicable, then the morphological filtering may be suggested as the retrospective alternative method.     

Supervisory control and reactive synthesis: a comparative introduction

This paper presents an introduction to and a formal connection between synthesis problems for discrete event systems that have been considered, largely separately, in the two research communities of supervisory control in control engineering and reactive synthesis in computer science. By making this connection mathematically precise in a paper that attempts to be as self-contained as possible, we wish to introduce these two research areas to non-expert readers and at the same time to highlight how they can be bridged in the context of classical synthesis problems. After presenting general introductions to supervisory control theory and reactive synthesis, we provide a novel reduction of the basic supervisory control problem, non-blocking case, to a problem of reactive synthesis with plants and with a maximal permissiveness requirement. The reduction is for fully-observed systems that are controlled by a single supervisor/controller. It complements prior work that has explored problems at the interface of supervisory control and reactive synthesis. The formal bridge constructed in this paper should be a source of inspiration for new lines of investigation that will leverage the power of the synthesis techniques that have been developed in these two areas.     

The Refinement Calculus of Reactive Systems Toolset

International Journal on Software Tools for Technology Transfer - We present the Refinement Calculus of Reactive Systems Toolset, an environment for compositional formal modeling and reasoning...     

A graph-based model for malware detection and classification using system-call groups

In this paper we present a graph-based model that, utilizing relations between groups of System-calls, detects whether an unknown software sample is malicious or benign, and classifies a malicious software to one of a set of known malware families. More precisely, we utilize the System-call Dependency Graphs (or, for short, ScD-graphs), obtained by traces captured through dynamic taint analysis. We design our model to be resistant against strong mutations applying our detection and classification techniques on a weighted directed graph, namely Group Relation Graph, or Gr-graph for short, resulting from ScD-graph after grouping disjoint subsets of its vertices. For the detection process, we propose the \(\Delta \)-similarity metric, and for the process of classification, we propose the SaMe-similarity and NP-similarity metrics consisting the SaMe-NP similarity. Finally, we evaluate our model for malware detection and classification showing its potentials against malicious software measuring its detection rates and classification accuracy.     

ETHYLENE OXIDATION ON SILVER CATALYSTS: EFFECT OF ETHYLENE OXIDE AND OF EXTERNAL TRANSFER LIMITATIONS

Ethylene oxidation to ethylene oxide and to carbon dioxide over silver catalysts was studied in a CSTR. The effects of two factors on the catalyst performance were examined. The first was the presence of excess ethylene oxide in the feed. A kinetic model was introduced which assumed that ethylene and ethylene oxide compete for the same sites on the catalyst surface. This model provided reasonable quantitative agreement with kinetic and potentiometric measurements. The second factor that was studied was the presence of external heat and mass transfer limitations. It was found that such limitations cause a significant decrease of the selectivity to ethylene oxide. This decrease is a result of the temperature difference between the catalyst surface and the bulk of the gas phase and of the fact that the activation energy of ethylene combustion is greater than that of ethylene epoxidation. The contribution of other factors such as inhibition by CO₂ or possible incomplete mixing in the reactor is shown to be insignificant.     

Performance vs. freshness in web database applications

In this work, we present a novel approach for the efficient materialization of dynamic web pages in e-commerce applications such as an online retail store with millions of items, hundreds of HTTP requests per second and tens of dynamic web page types. In such applications, user satisfaction, as measured in terms of response time (QoS) and content freshness (QoD), determines their success especially under heavy workload. The novelty of our materialization approach over existing ones is that, it considers the data dependencies between content fragments of a dynamic web page. We introduce two new semantic-based data freshness metrics that capture the content dependencies and propose two materialization algorithms that balance QoS and QoD. In our evaluation, we use a real-world experimental system that resembles an online bookstore and show that our approach outperforms existing QoS-QoD balancing approaches in terms of server-side response time (throughput), data freshness and scalability.     

Extraction and identification of natural antioxidant from the seeds of the Moringa oleifera tree variety of Malawi

The oil from the dried seeds of the Moringa oleifera tree (variety of Malawi) was extracted with a mixture of chloroform/methanol (50∶50). The induction period measurements demonstrated a great resistance to oxidative rancidity. After degumming, there was a reduction of 74% in induction periods. The gums produced were extracted with diethylether, n-butanol, and water, yielding four fractions: Fraction 1 (81.8% w/w), Fraction 2 (0.04% w/w), Fraction 3 (0.05% w/w), and Fraction 4 (17.0% w/w). These fractions were tested for their protection of fresh sunflower oil against rancidity, at 50°C, using a UV accelerated method. The oxidation of the sunflower oil was measured using PV; absorbance E _1cm ^1% and malondialdehyde concentration were measured by HPLC. The fraction that showed the highest antioxidant activity was further fractionated by HPLC, yielding seven fractions. Fraction HPLC 3 (present in a quantity of 330.8 and 29.11 ppm in gums and oil, respectively) showed the highest antioxidant activity. Its activity was also compared with that of the commonly used antioxidants BHT and α-tocopherol on sunflower oil using the same methods. At the same level of addition (200 ppm), HPLC 3 showed higher antioxidant activity than BHT and α-tocopherol. The identification of HPLC3 was done using ¹H NMR, ¹³C NMR, MS, melting point, and UV absorption spectroscopy and proved to be 3,5,7,3′,4′,5′-hexahydroxyflavone (myricetin).     

The Longest Path Problem has a Polynomial Solution on Interval Graphs

The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it is NP-hard on general graphs, as it is a generalization of the Hamiltonian path problem. Motivated by the work of Uehara and Uno (Proc. of the 15th Annual International Symp. on Algorithms and Computation (ISAAC), LNCS, vol. 3341, pp. 871–883, 2004), where they left the longest path problem open for the class of interval graphs, in this paper we show that the problem can be solved in polynomial time on interval graphs. The proposed algorithm uses a dynamic programming approach and runs in O(n ⁴) time, where n is the number of vertices of the input graph.     

Multimodal and ontology-based fusion approaches of audio and visual processing for violence detection in movies

In this paper we present our research results towards the detection of violent scenes in movies, employing advanced fusion methodologies, based on learning, knowledge representation and reasoning. Towards this goal, a multi-step approach is followed: initially, automated audio and visual analysis is performed to extract audio and visual cues. Then, two different fusion approaches are deployed: (i) a multimodal one that provides binary decisions on the existence of violence or not, employing machine learning techniques, (ii) an ontological and reasoning one, that combines the audio-visual cues with violence and multimedia ontologies. The latter reasons out not only the existence of violence or not in a video scene, but also the type of violence (fight, screams, gunshots). Both approaches are experimentally tested, validated and compared for the binary decision problem of violence detection. Finally, results for the violence type identification are presented for the ontological fusion approach. For evaluation purposes, a large dataset of real movie data has been populated.