GVU Center
http://hdl.handle.net/1853/48
Interdisciplinary center focused on computing at the boundariesâ€”where computing touches the outside world.Mon, 03 Jun 2019 15:01:27 GMT2019-06-03T15:01:27ZPassive Haptic Learning for Vibrotactile Skin-Reading: Comparison of Teaching Structures
http://hdl.handle.net/1853/60532
Passive Haptic Learning for Vibrotactile Skin-Reading: Comparison of Teaching Structures
Luzhnica, Granit; Veas, Eduardo; Seim, Caitlyn
This paper investigates the effects of using passive haptic
learning to train the skill of reading text from vibrotactile
patterns. The vibrotactile method of transmitting messages,
skin-reading, is effective at conveying rich information but its
active training method requires full user attention, is demanding,
time-consuming, and tedious. Passive haptic learning
offers the possibility to learn in the background while performing
another primary task. We present a study investigating the
use of passive haptic learning to train for skin-reading. Additionally,
a word-based learning structure is typically used for
this passive learning method. We expose trends that suggest
this word-based incrimental teaching may not be optimal.
Mon, 01 Jan 2018 00:00:00 GMThttp://hdl.handle.net/1853/605322018-01-01T00:00:00ZLuzhnica, GranitVeas, EduardoSeim, CaitlynThis paper investigates the effects of using passive haptic
learning to train the skill of reading text from vibrotactile
patterns. The vibrotactile method of transmitting messages,
skin-reading, is effective at conveying rich information but its
active training method requires full user attention, is demanding,
time-consuming, and tedious. Passive haptic learning
offers the possibility to learn in the background while performing
another primary task. We present a study investigating the
use of passive haptic learning to train for skin-reading. Additionally,
a word-based learning structure is typically used for
this passive learning method. We expose trends that suggest
this word-based incrimental teaching may not be optimal.SQUINT Fields, Maps, Patterns, and Lattices
http://hdl.handle.net/1853/60061
SQUINT Fields, Maps, Patterns, and Lattices
Rossignac, Jarek
The proposed Steady QUad INTerpolating (SQUINT) map is formulated in terms of a SQUINT Field of Similarities (FoS). It is controlled by four coplanar points. It maps the unit square onto a curved planar quad, R, which has these points as corners. Uniformly spaced, log-spiral isocurves decompose R into tiles that are similar to each other and, hence, each have equal angles at opposite corners. We provide closed-form expressions for computing the representation of the SQUINT map and for evaluating the map and its inverse. We discuss extensions and potential applications to texture maps and field warps and to the design, display, and constant-cost query of procedural models of arbitrarily complex lattices.
Mon, 23 Jul 2018 00:00:00 GMThttp://hdl.handle.net/1853/600612018-07-23T00:00:00ZRossignac, JarekThe proposed Steady QUad INTerpolating (SQUINT) map is formulated in terms of a SQUINT Field of Similarities (FoS). It is controlled by four coplanar points. It maps the unit square onto a curved planar quad, R, which has these points as corners. Uniformly spaced, log-spiral isocurves decompose R into tiles that are similar to each other and, hence, each have equal angles at opposite corners. We provide closed-form expressions for computing the representation of the SQUINT map and for evaluating the map and its inverse. We discuss extensions and potential applications to texture maps and field warps and to the design, display, and constant-cost query of procedural models of arbitrarily complex lattices.Permutation Classifier
http://hdl.handle.net/1853/60060
Permutation Classifier
Zhou, Xinrui; Guerra, Concettina; Rossignac, Jarek; Rossignac-Milon, Leo
We consider permutations of a given set of n different symbols. We are given two unordered training sets, T1 and T2, of such permutations that are each assumed to contain examples of permutations of the corresponding type, t1 and t2. Our goal is to train a classifier, C(q), by computing a statistical model from T1 and T2, which, when given a candidate permutation, q, decides whether q is of type t1 or t2. We discuss two versions of this problem. The ranking version focuses on the order of the symbols. Our Separation Average Distance Matrix (SADiM) solution expands on previously proposed ranking aggregation formulations. The grouping version focuses on contiguity of symbols and hierarchical grouping. We propose and compare two solutions: (1) The Population Augmentation Ratio (PAR) solution computes a PQ-tree for each training set and uses a novel measure of distance between these and q that is based on ratios of population counts (i.e., of numbers of permutations explained by specific PQ-trees). (2) The Difference of Positions (DoP) solution is computationally less expensive than PAR and is independent of the absolute population counts. Although DoP does not have the simple statistical grounding of PAR, our experiments show that it is consistently effective.
Tue, 24 Apr 2018 00:00:00 GMThttp://hdl.handle.net/1853/600602018-04-24T00:00:00ZZhou, XinruiGuerra, ConcettinaRossignac, JarekRossignac-Milon, LeoWe consider permutations of a given set of n different symbols. We are given two unordered training sets, T1 and T2, of such permutations that are each assumed to contain examples of permutations of the corresponding type, t1 and t2. Our goal is to train a classifier, C(q), by computing a statistical model from T1 and T2, which, when given a candidate permutation, q, decides whether q is of type t1 or t2. We discuss two versions of this problem. The ranking version focuses on the order of the symbols. Our Separation Average Distance Matrix (SADiM) solution expands on previously proposed ranking aggregation formulations. The grouping version focuses on contiguity of symbols and hierarchical grouping. We propose and compare two solutions: (1) The Population Augmentation Ratio (PAR) solution computes a PQ-tree for each training set and uses a novel measure of distance between these and q that is based on ratios of population counts (i.e., of numbers of permutations explained by specific PQ-trees). (2) The Difference of Positions (DoP) solution is computationally less expensive than PAR and is independent of the absolute population counts. Although DoP does not have the simple statistical grounding of PAR, our experiments show that it is consistently effective.Designing and processing parametric models of steady lattices
http://hdl.handle.net/1853/60058
Designing and processing parametric models of steady lattices
Gupta, Ashish; Kurzeja, Kelsey; Rossignac, Jarek; Allen, George; Kumar, Pranav Srinivas; Musuvathy, Suraj
Our goal is to facilitate the design, analysis, optimization, and additive manufacturing of a specific class of 3D lattices that may comprise an extremely large number of elements. We target curved lattices that exhibit periodicity and uniform geometric gradations in three directions, along possibly curved axes. We represent a lattice by a simple computer program with a carefully selected set of exposed control parameters that may be used to adjust the overall shape of the lattice, its repetition count in each direction, its microstructure, and its gradation. In our Programmed-Lattice Editor (PLE), a typical lattice is represented by a short program of 10 to 50 statements. We propose a simple API and a few rudimentary GUI tools that automate the creation of the corresponding expressions in the program. The overall shape and gradation of the lattice is controlled by three similarity transformations. This deliberate design choice ensures that the gradation in each direction is regular (i.e., mathematically steady), that each cell can be evaluated directly, without iterations, and that integral properties (such as surface area, volume, center of mass and spherical inertia) can be obtained rapidly without having to calculate them for each individual element of the lattice.
Mon, 01 Jan 2018 00:00:00 GMThttp://hdl.handle.net/1853/600582018-01-01T00:00:00ZGupta, AshishKurzeja, KelseyRossignac, JarekAllen, GeorgeKumar, Pranav SrinivasMusuvathy, SurajOur goal is to facilitate the design, analysis, optimization, and additive manufacturing of a specific class of 3D lattices that may comprise an extremely large number of elements. We target curved lattices that exhibit periodicity and uniform geometric gradations in three directions, along possibly curved axes. We represent a lattice by a simple computer program with a carefully selected set of exposed control parameters that may be used to adjust the overall shape of the lattice, its repetition count in each direction, its microstructure, and its gradation. In our Programmed-Lattice Editor (PLE), a typical lattice is represented by a short program of 10 to 50 statements. We propose a simple API and a few rudimentary GUI tools that automate the creation of the corresponding expressions in the program. The overall shape and gradation of the lattice is controlled by three similarity transformations. This deliberate design choice ensures that the gradation in each direction is regular (i.e., mathematically steady), that each cell can be evaluated directly, without iterations, and that integral properties (such as surface area, volume, center of mass and spherical inertia) can be obtained rapidly without having to calculate them for each individual element of the lattice.