Aalto Science Institute

Finland

Aalto Science Institute

Finland
SEARCH FILTERS
Time filter
Source Type

Subramanian S.,University of Sussex | Seah S.A.,Ultrahaptics | Shinoda H.,University of Tokyo | Hoggan E.,Aalto Science Institute | Corenthy L.,Ultrahaptics
Conference on Human Factors in Computing Systems - Proceedings | Year: 2016

A fundamental shift is underway in how we interact with our computers and devices. Touchless sensing products are being launched across consumer electronics, home, automotive and healthcare industries. Recent advances in haptics and display technologies has meant that interaction designers can also provide users with tactile feedback in mid-air AND display visual elements wherever the user needs them without in anyway instrumenting the user. The overarching goal of this workshop is to bring together a group of researchers spanning across multiple facets of exploring interactions with mid-air systems to discuss, explore, and outline research challenges for this novel area. We are especially interested in exploring how novel display and haptic technology provide users with more compelling and immersive experiences without instrumenting them in anyway. © 2016 Authors.


Ekeberg M.,KTH Royal Institute of Technology | Ekeberg M.,Albanova University Center | Hartonen T.,Aalto University | Hartonen T.,University of Helsinki | And 3 more authors.
Journal of Computational Physics | Year: 2014

Direct-coupling analysis is a group of methods to harvest information about coevolving residues in a protein fsamily by learning a generative model in an exponential family from data. In protein families of realistic size, this learning can only be done approximately, and there is a trade-off between inference precision and computational speed. We here show that an earlier introduced l2-regularized pseudolikelihood maximization method called plmDCA can be modified as to be easily parallelizable, as well as inherently faster on a single processor, at negligible difference in accuracy. We test the new incarnation of the method on 143 protein family/structure-pairs from the Protein Families database (PFAM), one of the larger tests of this class of algorithms to date. © 2014 Elsevier Inc.


Austrin P.,Aalto Science Institute | Austrin P.,KTH Royal Institute of Technology | Khot S.,New York University | Khot S.,University of Chicago
ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science | Year: 2013

A constraint satisfaction problem (CSP) is said to be approximation resistant if it is hard to approximate better than the trivial algorithm which picks a uniformly random assignment. Assuming the Unique Games Conjecture, we give a characterization of approximation resistance for k-partite CSPs defined by an even predicate. © 2013 ACM.


Austrin P.,Aalto Science Institute | Austrin P.,KTH Royal Institute of Technology | Hastad J.,KTH Royal Institute of Technology | Pass R.,Cornell University
ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science | Year: 2013

We study the class of languages, denoted by MIP[k, 1-∈, s], which have k-prover games where each prover just sends a single bit, with completeness 1-∈ and soundness error s. For the case that k=1 (i.e., for the case of interactive proofs), Goldreich, Vadhan and Wigderson (Computational Complexity'02) demonstrate that SZK exactly characterizes languages having 1-bit proof systems with "non-trivial" soundness (i.e., 1/2 < s ≤ 1-2∈). We demonstrate that for the case that k ≥ 2, 1-bit k-prover games exhibit a significantly richer structure: •(Folklore) When s ≤ 1/2 k - ∈, MIP[k, 1-∈, s] = BPP; • When 1/2k + ∈ ≤ s < 2/2k -∈, MIP[k, 1-∈, s] = SZK; • When s ≥ 2/2k + ∈, AM ⊆ MIP[k, 1-∈, s]; • For s ≤ 0.62 k/2k and sufficiently large k, MIP[k, 1-∈, s] ⊆ EXP; • For s ≥ 2k/2k, MIP[k, 1, 1-∈, s] = NEXP. As such, 1-bit k-prover games yield a natural "quantitative" approach to relating complexity classes such as BPP, SZK, AM, EXP, and NEXP. We leave open the question of whether a more fine-grained hierarchy (between AM and NEXP) can be established for the case when s ≥ 2/2k + ∈. © 2013 ACM.


Tracey J.,Aalto University | Federici Canova F.,Aalto Science Institute | Keisanen O.,Aalto University | Gao D.Z.,University College London | And 3 more authors.
Computer Physics Communications | Year: 2015

Non-contact Atomic Force Microscopy (NC-AFM) is an experimental technique capable of imaging almost any surface with atomic resolution, in a wide variety of environments. Linking measured images to real understanding of system properties is often difficult, and many studies combine experiments with detailed modelling, in particular using virtual simulators to directly mimic experimental operation. In this work we present the PyVAFM, a flexible and modular based virtual atomic force microscope capable of simulating any operational mode or set-up. Furthermore, the PyVAFM is fully expandable to allow novel and unique set-ups to be simulated, finally the PyVAFM ships with fully developed documentation and tutorial to increase usability. Program summary: Program title: Python Virtual Atomic Force Microscope (PyVAFM). Catalogue identifier: AEWX_v1_0. Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEWX_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland. Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 852449. No. of bytes in distributed program, including test data, etc.: 28531404. Distribution format:.ZIP. Programming language: Python input scripts and a C core. Computer: Desktop. Operating system: UNIX. RAM: 500 Megabytes. Classification: 16.4. External routines: GCC, Python 2.7, scipy and numpy. Nature of problem: Simulation of any atomic force microscope operational mode including experimental delays/artefacts. Solution method: A modular simulation was developed where a user can connect several components together in order to simulate any operational mode. Each of these components is also developed to be mathematically similar to their real life counter parts hence incorporating any experimental delays or artefacts. Restrictions: For tip-sample interactions beyond simple analytical forms, the interaction field should be provided by the user via separate simulations e.g first principles or classical calculations. Unusual features: Modularity. Additional comments: The tutorials include several example tip-sample interaction approaches and fields, and authors can provide others upon request. Running time: 2h. The example given in the installation section of the user manual only takes about 30s. © 2015 Elsevier B.V.


Tracey J.,Aalto University | Federici Canova F.,Aalto Science Institute | Keisanen O.,Aalto University | Gao D.Z.,University College London | And 3 more authors.
Computer Physics Communications | Year: 2015

Non-contact Atomic Force Microscopy (NC-AFM) is an experimental technique capable of imaging almost any surface with atomic resolution, in a wide variety of environments. Linking measured images to real understanding of system properties is often difficult, and many studies combine experiments with detailed modelling, in particular using virtual simulators to directly mimic experimental operation. In this work we present the PyVAFM, a flexible and modular based virtual atomic force microscope capable of simulating any operational mode or set-up. Furthermore, the PyVAFM is fully expandable to allow novel and unique set-ups to be simulated, finally the PyVAFM ships with fully developed documentation and tutorial to increase usability. Program summary Program title: Python Virtual Atomic Force Microscope (PyVAFM) Catalogue identifier: AEWX-v1-0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEWX-v1-0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 852449 No. of bytes in distributed program, including test data, etc.: 28531404 Distribution format:.ZIP Programming language: Python input scripts and a C core. Computer: Desktop. Operating system: UNIX. RAM: 500 Megabytes Classification: 16.4. External routines: GCC, Python 2.7, scipy and numpy Nature of problem: Simulation of any atomic force microscope operational mode including experimental delays/artefacts. Solution method: A modular simulation was developed where a user can connect several components together in order to simulate any operational mode. Each of these components is also developed to be mathematically similar to their real life counter parts hence incorporating any experimental delays or artefacts. Restrictions: For tip-sample interactions beyond simple analytical forms, the interaction field should be provided by the user via separate simulations e.g first principles or classical calculations. Unusual features: Modularity Additional comments: The tutorials include several example tip-sample interaction approaches and fields, and authors can provide others upon request. Running time: 2 h. The example given in the installation section of the user manual only takes about 30 s. © 2015 Elsevier B.V.

Loading Aalto Science Institute collaborators
Loading Aalto Science Institute collaborators