Multitouch tablet applications and activities to enhance the social skills of children with autism spectrum disorders

In spite of great improvements in early diagnosis and interventions, most children diagnosed with autism spectrum disorders (ASD) are unlikely to live independently when they reach adulthood. We have been conducting research on novel computer-based interventions with the goal of promoting social skills. Working with 26 children with ASD, their teachers, and other stakeholders, we have iteratively developed a set of activities based on applications that run on multitouch tablets. Our observations suggest these activities increased pro-social behaviors such as collaboration and coordination, augmented appreciation for social activities, and provided children with novel forms of expression.     

Resolution proof transformation for compression and interpolation

Verification methods based on SAT, SMT, and theorem proving often rely on proofs of unsatisfiability as a powerful tool to extract information in order to reduce the overall effort. For example a proof may be traversed to identify a minimal reason that led to unsatisfiability, for computing abstractions, or for deriving Craig interpolants. In this paper we focus on two important aspects that concern efficient handling of proofs of unsatisfiability: compression and manipulation. First of all, since the proof size can be very large in general (exponential in the size of the input problem), it is indeed beneficial to adopt techniques to compress it for further processing. Secondly, proofs can be manipulated as a flexible preprocessing step in preparation for interpolant computation. Both these techniques are implemented in a framework that makes use of local rewriting rules to transform the proofs. We show that a careful use of the rules, combined with existing algorithms, can result in an effective simplification of the original proofs. We have evaluated several heuristics on a wide range of unsatisfiable problems deriving from SAT and SMT test cases.     

Viewfinder Alignment

The viewfinder of a digital camera has traditionally been used for one purpose: to display to the user a preview of what is seen through the camera's lens. High quality cameras are now available on devices such as mobile phones and PDAs, which provide a platform where the camera is a programmable device, enabling applications such as online computational photography, computer vision‐based interactive gaming, and augmented reality. For such online applications, the camera viewfinder provides the user's main interaction with the environment. In this paper, we describe an algorithm for aligning successive viewfinder frames. First, an estimate of inter‐frame translation is computed by aligning integral projections of edges in two images. The estimate is then refined to compute a full 2D similarity transformation by aligning point features. Our algorithm is robust to noise, never requires storing more than one viewfinder frame in memory, and runs at 30 frames per second on standard smartphone hardware. We use viewfinder alignment for panorama capture, low‐light photography, and a camera‐based game controller.     

Verification of evolving software via component substitutability analysis

This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniques for checking correctness of software upgrades: (1) a technique based on simultaneous use of over-and under-approximations obtained via existential and universal abstractions; (2) a dynamic assume-guarantee reasoning algorithm—previously generated component assumptions are reused and altered on-the-fly to prove or disprove the global safety properties on the updated system. When upgrades are found to be non-substitutable, our solution generates constructive feedback to developers showing how to improve the components. The substitutability approach has been implemented and validated in the ComFoRT reasoning framework, and we report encouraging results on an industrial benchmark. This is an extended version of a paper, Dynamic Component Substitutability Analysis, published in the Proceedings of the Formal Methods 2005 Conference, Lecture Notes in Computer Science, vol. 3582, by the same authors. This research was sponsored by the National Science Foundation under grant nos. CNS-0411152, CCF-0429120, CCR-0121547, and CCR-0098072, the Semiconductor Research Corporation under grant no. TJ-1366, the US Army Research Office under grant no. DAAD19-01-1-0485, the Office of Naval Research under grant no. N00014-01-1-0796, the ICAST project and the Predictable Assembly from Certifiable Components (PACC) initiative at the Software Engineering Institute, Carnegie Mellon University. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of any sponsoring institution, the US government or any other entity.     

A model checking-based approach for security policy verification of mobile systems

This article describes an approach for the automated verification of mobile systems. Mobile systems are characterized by the explicit notion of location (e.g., sites where they run) and the ability to execute at different locations, yielding a number of security issues. To this aim, we formalize mobile systems as Labeled Kripke Structures, encapsulating the notion of location net that describes the hierarchical nesting of the threads constituting the system. Then, we formalize a generic security-policy specification language that includes rules for expressing and manipulating the code location. In contrast to many other approaches, our technique supports both access control and information flow specification. We developed a prototype framework for model checking of mobile systems. It works directly on the program code (in contrast to most traditional process-algebraic approaches that can model only limited details of mobile systems) and uses abstraction-refinement techniques, based also on location abstractions, to manage the program state space. We experimented with a number of mobile code benchmarks by verifying various security policies. The experimental results demonstrate the validity of the proposed mobile system modeling and policy specification formalisms and highlight the advantages of the model checking-based approach, which combines the validation of security properties with other checks, such as the validation of buffer overflows.     

The Dynamics of Syntactic Knowledge

The syntactic approach to epistemic logic avoids the logicalomniscience problem by taking knowledge as primary rather thanas defined in terms of possible worlds. In this study, we combinethe syntactic approach with modal logic, using transition systemsto model reasoning. We use two syntactic epistemic modalities:‘knowing at least’ a set of formulae and ‘knowingat most’ a set of formulae. We are particularly interestedin models restricting the set of formulae known by an agentat a point in time to be finite. The resulting systems are investigatedfrom the point of view of axiomatization and complexity. Weshow how these logics can be used to formalise non-omniscientagents who know some inference rules, and study their relationshipto other systems of syntactic epistemic logics, such as Ågotnesand Walicki (2004, Proc. 2nd EUMAS, pp. 1–10), Alechinaet al. (2004, Proc. 3rd AAMAS, pp. 601–613), Duc (1997,J. Logic Comput., 7, 633–648).     

Infants learn about objects from statistics and people.

In laboratory experiments, infants are sensitive to patterns of visual features that co-occur (e.g., Fiser & Aslin, 2002). Once infants learn the statistical regularities, however, what do they do with that knowledge? Moreover, which patterns do infants learn in the cluttered world outside of the laboratory? Across 4 experiments, we show that 9-month-olds use this sensitivity to make inferences about object properties. In Experiment 1, 9-month-old infants expected co-occurring visual features to remain fused (i.e., infants looked longer when co-occurring features split apart than when they stayed together). Forming such expectations can help identify integral object parts for object individuation, recognition, and categorization. In Experiment 2, we increased the task difficulty by presenting the test stimuli simultaneously with a different spatial layout from the familiarization trials to provide a more ecologically valid condition. Infants did not make similar inferences in this more distracting test condition. However, Experiment 3 showed that a social cue did allow inferences in this more difficult test condition, and Experiment 4 showed that social cues helped infants choose patterns among distractor patterns during learning as well as during test. These findings suggest that infants can use feature co-occurrence to learn about objects and that social cues shape such foundational learning in distraction-filled environments. (PsycINFO Database Record (c) 2011 APA, all rights reserved)     

Soluble Epoxide Hydrolase and Diabetes Complications

Type 2 diabetes mellitus (T2DM) can result in microvascular complications such as neuropathy, retinopathy, nephropathy, and cerebral small vessel disease, and contribute to macrovascular complications, such as heart failure, peripheral arterial disease, and large vessel stroke. T2DM also increases the risks of depression and dementia for reasons that remain largely unclear. Perturbations in the cytochrome P450-soluble epoxide hydrolase (CYP-sEH) pathway have been implicated in each of these diabetes complications. Here we review evidence from the clinical and animal literature suggesting the involvement of the CYP-sEH pathway in T2DM complications across organ systems, and highlight possible mechanisms (e.g., inflammation, fibrosis, mitochondrial function, endoplasmic reticulum stress, the unfolded protein response and autophagy) that may be relevant to the therapeutic potential of the pathway. These mechanisms may be broadly relevant to understanding, preventing and treating microvascular complications affecting the brain and other organ systems in T2DM.     

The combustion behavior of epoxy-based multifunctional electrolytes

Multifunctional or structural electrolytes are characterized by ionic conductivity high enough to be used in the electrochemical devices and mechanical performance suitable for the structural applications. Preliminary insights are provided into the combustion behavior of structural bi-continuous electrolytes based on bisphenol A diglycidyl ether (DGEBA), synthesized using the techniques of reaction induced phase separation and emulsion templating. The effect of the composition of the structural electrolytes and external heat flux on the behavior of the formulations were studied using a cone calorimeter with gases formed during testing analyzed using FTIR. The composition of the formulations investigated was changed by varying the type and amount of the ion conductive part of the bi-continuous electrolyte. Two ionic liquids, 1-ethyl-3-methylimidazolium bis(fluorosulfonyl)imide (EMIM-TFSI) and 1-butyl-3-methylimidazolium tetrafluoroborate (BMIM-BF₄), as well as a deep eutectic solvent (DES) based on ethylene glycol and choline chloride, were used. The results obtained confirm that time to ignition, heat release rate (HRR), total mass loss, as well as the composition of the gases released during tests depend on the composition of the formulations. Addition of liquid electrolyte is found to reduce the time to ignition by up to 10% and the burning time by between 28% and 60% with the added benefit of reducing the HRR by at least 34%. Gaseous products such as CO₂, CO, H₂O, CH₄, C₂H₂, N₂O, NO, and HCN were detected for all formulations with the gases SO₂, NH₃, HCl, C₂H₄, and NH₃ found to be for certain formulations only.