Software assurance practices for mobile applications

Mobile software applications have to cope with a particular environment that involves small size, limited resources, high autonomy requirements, competitive business models and many other challenges. To provide development guidelines that respond to these needs, several practices have been introduced; however, it is not clear how these guidelines may contribute to solve the issues present in the mobile domain. Furthermore, the rapid evolution of the mobile ecosystem challenges many of the premises upon which the proposed practices were designed. In this paper, we present a survey of the literature on software assurance practices for mobile applications, with the objective of describing them and assessing their contribution and success. We identified, organized and reviewed a body of research that spans in three levels: software development processes, software product assurance practices, and software implementation practices. By carrying out this literature survey, we reviewed the different approaches that researchers on Software Engineering have provided to address the needs that raise in the mobile software development arena. Moreover, we review the evolution of these practices, identifying how the constant changes and modernization of the mobile execution environment has impacted the methods proposed in the literature. Finally, we introduced discussion on the application of these practices in a real productive setting, opening an area for further research that may determine if practitioners have followed the proposed assurance paradigms.     

Experimental and numerical assessment of gate-lag phenomena in AlGaAs-GaAs heterostructure field-effect transistors (FETs)

Gate-lag effects are characterized in AlGaAs-GaAs heterostructure field-effect transistors (HFETs) by means of measurements and numerical device simulations. Gate lag increasingly affects device switching at increasing ungated recess extension, suggesting that responsible deep levels be located at the ungated, recess surface of the HFET. Gate lag diminishes by making the off-state gate-source voltage less negative and by increasing the drain bias. Increasing the temperature makes the turn-on transient faster at low drain bias, while slightly delaying it at high drain bias. Numerical device simulations accounting for acceptor-like traps at the ungated surface predict gate-lag phenomena in good agreement with experiments, reproducing correctly the observed bias and temperature dependences. Simulations show that surface states behave, during the turn-on transient, as hole traps capturing holes attracted at the ungated surface by the negative trapped charge.     

Gquest: Modeling patient questionnaires and administering them through a mobile platform application

Background

The use of surveys is becoming popular in the health care industry for acquiring information useful to the accomplishment of several studies. Besides their exploitation on a large scale for conducting epidemiological studies, surveys are being increasingly carried out on a narrower perspective through the administration of questionnaires aimed at assessing the quality of life perceived by patients or their clinical status during mid- or long-term treatments. This is useful for managing resources or optimizing and individualizing treatments.

Objectives

This paper describes Gquest, a platform for modeling, generating and administering questionnaires through mobile devices such as smartphones or tablets. Gquest was motivated by the need of administering questionnaires during home treatments, albeit its applicability is rather general. The main requirement was to have a very simple, clean and easy to use platform able to support (a) physicians in the design and delivery of questionnaires and (b) outpatients in sending self-recorded outcomes to the clinical staff.

Methods

Gquest has two basic components. The first one is a model devised for representing questionnaires which is extremely flexible. It allows the generation of questions and answers of different types, supports adaptivity in the dialog with the user and enforces simple consistency rules for checking his input. The second component is an application able to run instances of those questionnaires. It downloads questionnaires over the air in terms of XML files from a server and stores them locally into the mobile repository. Questionnaires become then available to the user, who in our case is a patient or one of his relatives. The user can select which one to fill-in, according to his needs and/or the specific treatment protocol. The selected questionnaire may be filled-in all at once or be completed in subsequent steps over time since any input provided is persisted on a local database. Finally, when a questionnaire is closed all the answers are transparently synchronized to a server for further evaluation or statistical purposes.

Results

The platform has been exploited and tested in two medical domains where questionnaires have very different purposes; a quality of life pilot survey involving patients with atrial fibrillation within the EU-funded project MobiGuide, and an investigation of the users’ needs during the requirements elicitation phase of a telemedicine project for the safe discharge of fragile patients.

Conclusions

Gquest proved to be a suitable tool for dealing with a wide variety of question types and has been positively accepted by the patients enrolled in the pilot study.     

A local landscape mapping method for protein structure prediction in the HP model

The hydrophobic-polar (HP) model has been widely studied in the field of protein structure prediction both for theoretical purposes and as a benchmark for new optimization strategies. In this work we present results of the recently proposed Hybrid Monte Carlo Ant Colony Optimization heuristic in the HP model using a fragment assembly-like strategy. Moreover we extend that method introducing a general framework for optimization in the HP model, called Local Landscape Mapping, and we test it using the pull moves set to generate solutions. We describe the heuristic and compare results obtained on well known HP instances in the 3-dimensional cubic lattice to those obtained with standard Ant Colony optimization and Simulated Annealing. Fragment assembly-like tests were performed using a modified objective function to prevent the creation of overlapping walks. Results show that our method performs better than the other heuristics in all benchmark instances when the fragment assembly-like strategy is used while in the case of pull moves-based neighborhood its performance is comparable to that of simulated annealing.     

An ensemble evolutionary constraint-based approach to understand the emergence of metabolic phenotypes

Constraint-based modeling is largely used in computational studies of metabolism. We propose here a novel approach that aims to identify ensembles of flux distributions that comply with one or more target phenotype(s). The methodology has been tested on a small-scale model of yeast energy metabolism. The target phenotypes describe the differential pattern of ethanol production and O₂ consumption observed in “Crabtree-positive” and “Crabtree-negative” yeasts in changing environment (i.e., when the upper limit of glucose uptake is varied). The ensembles were obtained either by selection among sampled flux distributions or by means of a search heuristic (genetic algorithm). The former approach provided indication about the probability to observe a given phenotype, but the resulting ensembles could not be unambiguously partitioned into “Crabtree-positive” and “Crabtree-negative” clusters. On the contrary well-separated clusters were obtained with the latter method. The cluster analysis further allowed identification of distinct groups within each target phenotype. The method may thus prove useful in characterizing the design principles underlying metabolic plasticity arising from evolving physio-pathological or developmental constraints.     

A bio-inspired predictive sensory-motor coordination scheme for robot reaching and preshaping

This paper presents a sensory-motor coordination scheme for a robot hand-arm-head system that provides the robot with the capability to reach an object while pre-shaping the fingers to the required grasp configuration and while predicting the tactile image that will be perceived after grasping. A model for sensory-motor coordination derived from studies in humans inspired the development of this scheme. A peculiar feature of this model is the prediction of the tactile image. The implementation of the proposed scheme is based on a neuro-fuzzy module that, after a learning phase, starting from visual data, calculates the position and orientation of the hand for reaching, selects the best-suited hand configuration, and predicts the tactile feedback. The implementation of the scheme on a humanoid robot allowed experimental validation of its effectiveness in robotics and provided perspectives on applications of sensory predictions in robot motor control.     

Plasmon hybridization engineering in self-organized anisotropic metasurfaces

Nano Research - The engineering of self-organized plasmonic metasurfaces is demonstrated using a maskless technique with defocused ion-beam sputtering and kinetically controlled deposition. The...     

On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications

We provide a uniform framework for the study of index data structures for a two-dimensional matrixTEXT[1:n, 1:n] whose entries are drawn from an ordered alphabetΣ. An index forTEXTcan be informally seen as the two-dimensional analog of the suffix tree for a string. It allows on-line searches and statistics to be performed onTEXTby representing compactly theΘ(n³) square submatrices ofTEXTin optimalO(n²) space. We identify 4ⁿ⁻¹families of indices forTEXT, each containing ∏ⁿ_i=1 (2i−1)! isomorphic data structures. We also develop techniques leading to a single algorithm that efficiently builds any index in any family inO(n² log n) time andO(n²) space. Such an algorithm improves in various respects the algorithms for the construction of the PAT tree and the Lsuffix tree. The framework and the algorithm easily generalize tod>2 dimensions. Moreover, as part of our algorithm, we provide new algorithmic tools that yield a space-efficient implementation of the “naming scheme” of R. Karpet al.(in“Proceedings, Fourth Symposium on Theory of Computing,” pp. 125–136) for strings and matrices.     

Non-confluence in divisionless P systems with active membranes

We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simulating such devices on a nondeterministic Turing machine with a polynomial slowdown. Together, these results prove that the complexity class of problems solvable non-confluently and in polynomial time by this kind of P system is exactly the class .