Evaluation of Setup Procedures on Mobile Devices Based on Users’ Initial Experience

Users’ initial perceptions of their competence are key motivational factors for further use. However, initial tasks on a mobile operating system (OS) require setup procedures, which are currently largely inconsistent, do not provide users with clear, visible and immediate feedback on their actions, and require significant adjustment time for first-time users. This paper reports on a study with ten users, carried out to better understand how both prior experience and initial interaction with two touchscreen mobile interfaces (Apple iOS and Google Android) affected setup task performance and motivation. The results show that the reactions to setup on mobile interfaces appear to be partially dependent on which device was experienced first. Initial experience with lower-complexity devices improves performance on higher-complexity devices, but not vice versa. Based on these results, the paper proposes six guidelines for designers to design more intuitive and motivating user interfaces (UI) for setup procedures. The preliminary results indicate that these guidelines can contribute to the design of more inclusive mobile platforms and further work to validate these findings is proposed.

Experimental Setup for Assessing the Energetic Materials Deflagration Propagation under High Temperature and High Pressure Conditions

The technology of "explosion in fractures" is one of new synthetic engineering methods used in low permeability reservoirs. The most important problem arose from the technology is to assess the deflagration propagation capability of milky explosives in rock fractures. In order to investigate detailed this problem in the laboratory, an experimental setup was designed and developed in which different conditions can be simulated. The experimental setup mainly includes two parts. One is the experimental part and the other is the measurement part. In the experimental setup, the narrow slots with different width can be simulated; meanwhile, different initial pressures and initial temperatures can be loaded on the explosives inside the narrow slots. The initial pressure range is from 0-60 MPa, and the initial temperatures range is from room temperature to 100 V. The temperature and the velocity of deflagration wave can be measured; meanwhile the corresponding pressure in the narrow slot is also measured. In the end, some typical measurement results are briefly presented and discussed.

Studies of effect of phase volume ratio on transfer of ionizable species across the water/1,2-dichloroethane interface by a three-electrode setup

The electrochemical behavior of pyridine distribution at the water/1,2-dichloroethane interface with variable phase volume ratios (r=V-0/V-W) was investigated by cyclic voltammetry. The system was composed of an aqueous droplet supported on a Ag/AgCl disk electrode covered with an organic solution or an organic droplet supported on a Ag/AgTPBCl disk electrode covered with an aqueous solution. In this way, a conventional three-electrode potentiostat can be used to study an ionizable compound transfer process at a liquid/liquid interface with a wide range of phase volume ratios (from 0.0004 to 1 and from 1 to 2500). Using this special cell we designed, only very small volumes of both phase were needed for r equal to unity, which is very useful for the investigation of the distribution of ionizable species at a biphasic system when the available amount of species is limited. The ionic partition diagrams were obtained for different phase volume ratios.

Two-stage no-wait scheduling models with setup and removal times separated

This paper studies two models of two-stage processing with no-wait in process. The first model is the two-machine flow shop, and the other is the assembly model. For both models we consider the problem of minimizing the makespan, provided that the setup and removal times are separated from the processing times. Each of these scheduling problems is reduced to the Traveling Salesman Problem (TSP). We show that, in general, the assembly problem is NP-hard in the strong sense. On the other hand, the two-machine flow shop problem reduces to the Gilmore-Gomory TSP, and is solvable in polynomial time. The same holds for the assembly problem under some reasonable assumptions. Using these and existing results, we provide a complete complexity classification of the relevant two-stage no-wait scheduling models.

Approximation algorithms for two-machine flow shop scheduling with batch setup times

In many practical situations, batching of similar jobs to avoid setups is performed while constructing a schedule. This paper addresses the problem of non-preemptively scheduling independent jobs in a two-machine flow shop with the objective of minimizing the makespan. Jobs are grouped into batches. A sequence independent batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. Besides its practical interest, this problem is a direct generalization of the classical two-machine flow shop problem with no grouping of jobs, which can be solved optimally by Johnson's well-known algorithm. The problem under investigation is known to be NP-hard. We propose two O(n logn) time heuristic algorithms. The first heuristic, which creates a schedule with minimum total setup time by forcing all jobs in the same batch to be sequenced in adjacent positions, has a worst-case performance ratio of 3/2. By allowing each batch to be split into at most two sub-batches, a second heuristic is developed which has an improved worst-case performance ratio of 4/3. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

Group technology approach to the open shop scheduling problem with batch setup times

This paper studies the problem of scheduling jobs in a two-machine open shop to minimize the makespan. Jobs are grouped into batches and are processed without preemption. A batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. For this NP-hard problem, we propose a linear-time heuristic algorithm that creates a group technology schedule, in which no batch is split into sub-batches. We demonstrate that our heuristic is a -approximation algorithm. Moreover, we show that no group technology algorithm can guarantee a worst-case performance ratio less than 5/4.

On-line algorithms for single machine scheduling with family setup times

The paper considers an on-line single machine scheduling problem where the goal is to minimize the makespan. The jobs are partitioned into families and a setup is performed every time the machine starts processing a batch of jobs of the same family. The scheduler is aware of the number of families and knows the setup time of each family, although information about a job only becomes available when that job is released. We give a lower bound on the competitive ratio of any on-line algorithm. Moreover, for the case of two families, we provide an algorithm with a competitive ratio that achieves this lower bound. As the number of families increases, the lower bound approaches 2, and we give a simple algorithm with a competitive ratio of 2.

An improved approximation algorithm for the two-machine open shop scheduling problem with family setup times

We consider the problem of scheduling families of jobs in a two-machine open shop so as to minimize the makespan. The jobs of each family can be partitioned into batches and a family setup time on each machine is required before the first job is processed, and when a machine switches from processing a job of some family to a job of another family. For this NP-hard problem the literature contains (5/4)-approximation algorithms that cannot be improved on using the class of group technology algorithms in which each family is kept as a single batch. We demonstrate that there is no advantage in splitting a family more than once. We present an algorithm that splits one family at most once on a machine and delivers a worst-case performance ratio of 6/5.

Experimental setup and first measurement of DNA damage induced along and around an antiproton beam

Radiotherapy employs ionizing radiation to induce lethal DNA lesions in cancer cells while minimizing damage to healthy tissues. Due to their pattern of energy deposition, better therapeutic outcomes can, in theory, be achieved with ions compared to photons. Antiprotons have been proposed to offer a further enhancement due to their annihilation at the end of the path. The work presented here aimed to establish and validate an experimental procedure for the quantification of plasmid and genomic DNA damage resulting from antiproton exposure. Immunocytochemistry was used to assess DNA damage in directly and indirectly exposed human fibroblasts irradiated in both plateau and Bragg peak regions of a 126 MeV antiproton beam at CERN. Cells were stained post irradiation with an anti-gamma-H2AX antibody. Quantification of the gamma-H2AX foci-dose relationship is consistent with a linear increase in the Bragg peak region. A qualitative analysis of the foci detected in the Bragg peak and plateau region indicates significant differences highlighting the different severity of DNA lesions produced along the particle path. Irradiation of desalted plasmid DNA with 5 Gy antiprotons at the Bragg peak resulted in a significant portion of linear plasmid in the resultant solution.

Non-Markovian qubit dynamics in a circuit-QED setup

We consider a circuit-QED setup that allows the induction and control of non-Markovian dynamics of a qubit. Non-Markovianity is enforced over the qubit by means of its direct coupling to a bosonic mode which is controllably coupled to another qubit-mode system. We show that this configuration can be achieved in a circuit-QED setup consisting of two initially independent superconducting circuits, each formed by one charge qubit and one transmission-line resonator, which are put in interaction by coupling the resonators to a current-biased Josephson junction. We solve this problem exactly and then proceed with a thorough investigation of the emergent non-Markovianity in the dynamics of the qubits. Our study might serve the context for the first experimental assessment of non-Markovianity in a multielement solid-state device.

A Computational Approach for Simulating P-type Silicon Piezoresistor Using Four Point Bending Setup

The piezoresistance effect is defined as change in resistance due to applied stress. Silicon has a relatively large piezoresistance effect which has been known since 1954. A four point bending setup is proposed and designed to analyze the piezoresistance effect in p-type silicon. This setup is used to apply uniform and uniaxial stress along the <110> crystal direction. The main aim of this work is to investigate the piezoresistive characteristic of p-type resistors as a function of doping concentrations using COMSOL Multiphysics. Simulation results are compared with experimental data.