Developing usability evaluation heuristics for augmented reality applications

There is no generic usability heuristics for Augmented Reality (AR) applications, thus, the aim of this thesis was to develop one. The development of the heuristics was carried out in phases. Based on a literature review, a preliminary version of the heuristics was developed, which was evaluated by four experts. As a result, six evaluation criteria were formed: 1) interaction methods and controls, 2) presentation of virtual objects, 3) relationship between virtual objects and real world, 4) information related to virtual objects, 5) suitability for the usage context and 6) physical comfort of use. The heuristics should be used with Nielsen's (1995) generic usability evaluation heuristics. The heuristics are not ready to be used as such, since it must still be tested in practice.

Optimization and Measuring Techniques for Collect-and-Place Machines in Printed Circuit Board Industry

This thesis considers optimization problems arising in printed circuit board assembly. Especially, the case in which the electronic components of a single circuit board are placed using a single placement machine is studied. Although there is a large number of different placement machines, the use of collect-and-place -type gantry machines is discussed because of their flexibility and increasing popularity in the industry. Instead of solving the entire control optimization problem of a collect-andplace machine with a single application, the problem is divided into multiple subproblems because of its hard combinatorial nature. This dividing technique is called hierarchical decomposition. All the subproblems of the one PCB - one machine -context are described, classified and reviewed. The derived subproblems are then either solved with exact methods or new heuristic algorithms are developed and applied. The exact methods include, for example, a greedy algorithm and a solution based on dynamic programming. Some of the proposed heuristics contain constructive parts while others utilize local search or are based on frequency calculations. For the heuristics, it is made sure with comprehensive experimental tests that they are applicable and feasible. A number of quality functions will be proposed for evaluation and applied to the subproblems. In the experimental tests, artificially generated data from Markov-models and data from real-world PCB production are used. The thesis consists of an introduction and of five publications where the developed and used solution methods are described in their full detail. For all the problems stated in this thesis, the methods proposed are efficient enough to be used in the PCB assembly production in practice and are readily applicable in the PCB manufacturing industry.

Heuristics for the Critical Node Detection Problem in Large Complex Networks

Complex networks have recently attracted a significant amount of research attention due to their ability to model real world phenomena. One important problem often encountered is to limit diffusive processes spread over the network, for example mitigating pandemic disease or computer virus spread. A number of problem formulations have been proposed that aim to solve such problems based on desired network characteristics, such as maintaining the largest network component after node removal. The recently formulated critical node detection problem aims to remove a small subset of vertices from the network such that the residual network has minimum pairwise connectivity. Unfortunately, the problem is NP-hard and also the number of constraints is cubic in number of vertices, making very large scale problems impossible to solve with traditional mathematical programming techniques. Even many approximation algorithm strategies such as dynamic programming, evolutionary algorithms, etc. all are unusable for networks that contain thousands to millions of vertices. A computationally efficient and simple approach is required in such circumstances, but none currently exist. In this thesis, such an algorithm is proposed. The methodology is based on a depth-first search traversal of the network, and a specially designed ranking function that considers information local to each vertex. Due to the variety of network structures, a number of characteristics must be taken into consideration and combined into a single rank that measures the utility of removing each vertex. Since removing a vertex in sequential fashion impacts the network structure, an efficient post-processing algorithm is also proposed to quickly re-rank vertices. Experiments on a range of common complex network models with varying number of vertices are considered, in addition to real world networks. The proposed algorithm, DFSH, is shown to be highly competitive and often outperforms existing strategies such as Google PageRank for minimizing pairwise connectivity.

A Study of Ordered Gene Problems Featuring DNA Error Correction and DNA Fragment Assembly with a Variety of Heuristics, Genetic Algorithm Variations, and Dynamic Representations

Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is also common to see many different types of problems reduced to ordered gene style problems as there are many popular heuristics and metaheuristics for them due to their popularity. Multiple ordered gene problems are studied, namely, the travelling salesman problem, bin packing problem, and graph colouring problem. In addition, two bioinformatics problems not traditionally seen as ordered gene problems are studied: DNA error correction and DNA fragment assembly. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types or representations. The majority of the algorithms are built around the Recentering- Restarting Genetic Algorithm. The algorithm variations were successful on all problems studied, and particularly for the two bioinformatics problems. For DNA Error Correction multiple cases were found with 100% of the codes being corrected. The algorithm variations were also able to beat all other state-of-the-art DNA Fragment Assemblers on 13 out of 16 benchmark problem instances.

Models, algorithms, and heuristics for multiobjetive commercial territory design.

Tesis (Doctor en Ingeniería de Sistemas) UANL, 2010.

Constructive Universalism: Sen and Sensitivity to Difference

Amartya Sen’s capability approach is, on the one hand, in line with universalism such as exhibited in Martha Nussbaum’s capabilities approach and Len Doyal and Ian Gough’s human need theory. On the other hand, his approach puts priority on people’s “self-evaluation” of capabilities and needs. The latter emphasis makes his approach distinctly sensitive to people’s differences such as gender, ethnicity, disability, sexual orientation, etc.. One could ask, however, how successfully the former commitment to universalism relates to this latter feature that places importance on taking difference seriously. This question is especially relevant with respect to global justice and gender, for example. To offer a potential answers to this question is main goal of this paper.

Rule-based quality heuristics formalization and identification

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal

Asymptotics of number fields and the Cohen-Lenstra heuristics

We study the asymptotics conjecture of Malle for dihedral groups Dl of order 2l, where l is an odd prime. We prove the expected lower bound for those groups. For the upper bounds we show that there is a connection to class groups of quadratic number fields. The asymptotic behavior of those class groups is predicted by the Cohen-Lenstra heuristics. Under the assumption of this heuristic we are able to prove the expected upper bounds.

Truth in complex adaptive systems models should be based on truth by constructive verification

It is argued that the truth status of emergent properties of complex adaptive systems models should be based on an epistemology of proof by constructive verification and therefore on the ontological axioms of a non-realist logical system such as constructivism or intuitionism. ‘Emergent’ properties of complex adaptive systems (CAS) models create particular epistemological and ontological challenges. These challenges bear directly on current debates in the philosophy of mathematics and in theoretical computer science. CAS research, with its emphasis on computer simulation, is heavily reliant on models which explore the entailments of Formal Axiomatic Systems (FAS). The incompleteness results of Gödel, the incomputability results of Turing, and the Algorithmic Information Theory results of Chaitin, undermine a realist (platonic) truth model of emergent properties. These same findings support the hegemony of epistemology over ontology and point to alternative truth models such as intuitionism, constructivism and quasi-empiricism.

Assessing the PhD: a constructive view of criteria

Research and informed debate reveals that institutional practices in relation to research degree examining vary considerably across the sector. Within a context of accountability and quality assurance/total quality management, the range and specificity of criteria that are used to judge doctoral work is of particular relevance. First, a review of the literature indicates that, although interest in and concern about the process is burgeoning, there is little empirical research published from which practitioners can draw guidance. The second part of the paper reviews that available research, drawing conclusions about issues that seem to pertain at a general level across disciplines and institutions. Lest the variation is an artefact of discipline difference, the third part of the paper focuses on a within discipline study. Criteria expected/predicted by supervisors are compared and contrasted with those anticipated and experienced by candidates and with those implemented and considered important by examiners. The results are disturbing.

Integrating constructive feedback in personalised e-learning

When using e-learning material some students progress readily, others have difficulties. In a traditional classroom the teacher would identify those with difficulties and direct them to additional resources. This support is not easily available within e-learning. A new approach to providing constructive feedback is developed that will enable an e-learning system to identify areas of weakness and provide guidance on further study. The approach is based on the tagging of learning material with appropriate keywords that indicate the contents. Thus if a student performs poorly on an assessment on topic X, there is a need to suggest further study of X and participation in activities related to X such as forums. As well as supporting the learner this type of constructive feedback can also inform other stakeholders. For example a tutor can monitor the progress of a cohort; an instructional designer can monitor the quality of learning objects in facilitating the appropriate knowledge across many learners.