Extracting a polyhedron from a single-view sketch: Topological construction of a wireframe sketch with minimal hidden elements

An essential prerequisite to construct a manifold trihedral polyhedron from a given natural (or partial-view) sketch is solution of the “wireframe sketch from a single natural sketch (WSS)” problem, which is the subject of this paper. Published solutions view WSS as an “image-processing”/“computer vision” problem where emphasis is placed on analyzing the given input (natural sketch) using various heuristics. This paper proposes a new WSS method based on robust tools from graph theory, solid modeling and Euclidean geometry. Focus is placed on producing a minimal wireframe sketch that corresponds to a topologically correct polyhedron.     

On detecting faults for Boolean expressions

Fault based testing aims at detecting hypothesized faults based on specifications or program source. There are some fault based techniques for testing Boolean expressions which are commonly used to model conditions in specifications as well as logical decisions in program source. The MUMCUT strategy has been proposed to generate test cases from Boolean expressions. Moreover, it detects eight common types of hypothesized faults provided that the original expression is in irredundant disjunctive normal form, IDNF. Software practitioners are more likely to write the conditions and logical decisions in general form rather than IDNF. Hence, it is interesting to investigate the fault detecting capability of the MUMCUT strategy with respect to general form Boolean expressions. In this article, we perform empirical studies to investigate the fault detection capability of the MUMCUT strategy with respect to general form Boolean expressions as well as mutated expressions. A mutated expression can be obtained from the original given Boolean expression by making a syntactic change based on a particular type of fault.

Interactive smart battery storage for a PV and wind hybrid energy management control based on conservative power theory

This paper presents interactive smart battery-based storage (BBS) for wind generator (WG) and photovoltaic (PV) systems. The BBS is composed of an asymmetric cascaded H-bridge multilevel inverter (ACMI) with staircase modulation. The structure is parallel to the WG and PV systems, allowing the ACMI to have a reduction in power losses compared to the usual solution for storage connected at the DC-link of the converter for WG or PV systems. Moreover, the BBS is embedded with a decision algorithm running real-time energy costs, plus a battery state-of-charge manager and power quality capabilities, making the described system in this paper very interactive, smart and multifunctional. The paper describes how BBS interacts with the WG and PV and how its performance is improved. Experimental results are presented showing the efficacy of this BBS for renewable energy applications.     

Active learning for extended finite state machines

We present a black-box active learning algorithm for inferring extended finite state machines (EFSM)s by dynamic black-box analysis. EFSMs can be used to model both data flow and control behavior of software and hardware components. Different dialects of EFSMs are widely used in tools for model-based software development, verification, and testing. Our algorithm infers a class of EFSMs called register automata. Register automata have a finite control structure, extended with variables (registers), assignments, and guards. Our algorithm is parameterized on a particular theory, i.e., a set of operations and tests on the data domain that can be used in guards.Key to our learning technique is a novel learning model based on so-called tree queries. The learning algorithm uses tree queries to infer symbolic data constraints on parameters, e.g., sequence numbers, time stamps, identifiers, or even simple arithmetic. We describe sufficient conditions for the properties that the symbolic constraints provided by a tree query in general must have to be usable in our learning model. We also show that, under these conditions, our framework induces a generalization of the classical Nerode equivalence and canonical automata construction to the symbolic setting. We have evaluated our algorithm in a black-box scenario, where tree queries are realized through (black-box) testing. Our case studies include connection establishment in TCP and a priority queue from the Java Class Library.     

An Experimental Investigation into the Effectiveness of OOA for Specifying Requirements

The application of object oriented concepts (OO) to the requirements phase of information systems (IS) and software development has been adopted by many proponents of IS and software development methodologies. Although many claims have been made about the effectiveness of OO techniques for improving requirements analysis, very few experimental studies have been done to substantiate these claims. This paper addresses this gap in the literature by conducting an experimental study that attempts to validate the effectiveness of object-oriented analysis (OOA) by comparing it to structured analysis (SA) for producing requirements. We argue that the quality of the requirements specification can be measured and that measurement can be used to compare the effectiveness of OOA and SA. We present an overview of the basic models and principles associated with OOA and SA, a discussion of quality in requirements definition, and a detailed discussion of the research methodology used. A review of relevant research is also presented and directions for further research are suggested. Our findings suggest that the OOA methodology does not necessarily produce better requirements statements.     

Discriminant subspace analysis: a Fukunaga-Koontz approach

The Fisher Linear Discriminant (FLD) is commonly used in pattern recognition. It finds a linear subspace that maximally separates class patterns according to the Fisher Criterion. Several methods of computing the FLD have been proposed in the literature, most of which require the calculation of the so-called scatter matrices. In this paper, we bring a fresh perspective to FLD via the Fukunaga-Koontz Transform (FKT). We do this by decomposing the whole data space into four subspaces with different discriminability, as measured by eigenvalue ratios. By connecting the eigenvalue ratio with the generalized eigenvalue, we show where the Fisher Criterion is maximally satisfied. We prove the relationship between FLD and FKT analytically, and propose a unified framework to understanding some existing work. Furthermore, we extend our our theory to Multiple Discriminant Analysis (MDA). This is done by transforming the data into intra- and extra-class spaces, followed by maximizing the Bhattacharyya distance. Based on our FKT analysis, we identify the discriminant subspaces of MDA/FKT, and propose an efficient algorithm, which works even when the scatter matrices are singular, or too large to be formed. Our method is general and may be applied to different pattern recognition problems. We validate our method by experimenting on synthetic and real data.     

Bilattices and Reasoning in Artificial Intelligence: Concepts and Foundations

The past few decades have seen a resurgence ofreasoning techniques in artificial intelligenceinvolving both classical and non-classical logics. Inhis paper, ``Multi-valued Logics: A Uniform Approach toReasoning in Artificial Intelligence', Ginsberg hasshown that through the use of bilattices,several reasoning techniques can be unified under asingle framework. A bilattice is a structure that canbe viewed as a class of truth values that canaccommodate incomplete and inconsistent informationand in certain cases default information. Inbilattice theory, knowledge is ordered along twodimensions: truth/falsity and certainty/uncertainty. By defining the corresponding bilattices as truthspaces, Ginsberg has shown that the same theoremprover can be used to simulate reasoning in firstorder logic, default logic, prioritized default logicand assumption truth maintenance system. Although thisis a significant contribution, Ginsberg's paper waslengthy and involved. This paper summarizes some ofthe essential concepts and foundations of bilatticetheory. Furthermore, it discusses the connections ofbilattice theory and several other existingmulti-valued logics such as the various three-valuedlogics and Belnap's four-valued logic. It is notedthat the set of four truth values in Belnap's logicform a lattice structure that is isomorphic to thesimplest bilattice. Subsequently, Fitting proposed aconflation operation that can be used to selectsub-sets of truth values from this and otherbilattices. This method of selecting sub-sets oftruth values provides a means for identifyingsub-logic in a bilattice.     

Sodium metabisulfite and SO2 release: an under-recognized hazard among shrimp fishermen

Since the introduction of sodium metabisulfite as a food preservative, it has been associated with several idiosyncratic reactions (eg, bronchospasm, oculonasal symptoms, and urticaria/angioedema) in sulfite-sensitive individuals. The pathogenic mechanism of these reactions is not yet understood. We report the case of two crewmen on a shrimp trawler who were found dead in the ship's hold. Their deaths had occurred while they were applying dry sodium metabisulfite, referred to as "shrimp dip" in the shrimping industry. Postmortem examinations showed diffuse pulmonary edema consistent with death secondary to asphyxia. Associated findings were visceral congestion. Although it is possible to measure death from sodium metabisulfite with available records, its potential morbidity cannot be estimated. It is known that sodium metabisulfite can react with acids and water, releasing toxic sulfur dioxide (SO2) gas. In addition, SO2 gas reacts with respiratory tissue forming sulfureous acid, and inducing a pulmonary reaction causing hypoxemia. Furthermore, sodium metabisulfite, compared with sodium bisulfite, has a much greater propensity to release SO2 gas. We conclude that there is a need for improved education regarding the potential side effects of sodium metabisulfite, thus eliminating needless occupational morbidity and mortality.     

Time-of-flight sensor and color camera calibration for multi-view acquisition

This paper presents a multi-view acquisition system using multi-modal sensors, composed of time-of-flight (ToF) range sensors and color cameras. Our system captures the multiple pairs of color images and depth maps at multiple viewing directions. In order to ensure the acceptable accuracy of measurements, we compensate errors in sensor measurement and calibrate multi-modal devices. Upon manifold experiments and extensive analysis, we identify the major sources of systematic error in sensor measurement and construct an error model for compensation. As a result, we provide a practical solution for the real-time error compensation of depth measurement. Moreover, we implement the calibration scheme for multi-modal devices, unifying the spatial coordinate for multi-modal sensors. The main contribution of this work is to present the thorough analysis of systematic error in sensor measurement and therefore provide a reliable methodology for robust error compensation. The proposed system offers a real-time multi-modal sensor calibration method and thereby is applicable for the 3D reconstruction of dynamic scenes.