| 1. |
|
|
| 2. |
- Bodén, Johan, et al.
(författare)
-
Point or click? : Evaluating two input modalities for mobile games
- 2007
-
Ingår i: Second International Conference on Internet and Web Applications and Services (ICIW'07). - : IEEE. - 0769528449 - 9780769528441
-
Konferensbidrag (refereegranskat)abstract
- Previous research in computer games have focused on user experience from the perspectives of game content, graphics, interactivity and underling game story while missing to address the effect of a certain input modality on the user experience. In this paper we report from two user studies that focus on players' experience and performance in relation to the use of two different input modalities for the same game and whether it changes the flow and gameplay in any way. The overall research was according to this whether a game can be more fun to play with a certain input modality? The paper presents the results from these studies and draws conclusions based on these data in relation to computer games and user experiences in the context of mobile game playing.
|
|
| 3. |
- Bodén, Mikael, et al.
(författare)
-
A Connectionist Model of Nonmonotonic Reasoning : Handling Exceptions in Inheritance Hierarchies
- 1992
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Nonmonotonic reasoning is a core problem in AI. An example of nonmonotonic reasoning is the type of default reasoning which occurs with inheritance structures which allow exceptions. This paper describes a connectionist model of a hierarchical inheritance structure with exceptions. Existing symbolic and related connectionist research are described, and their limitations summarized. The requirements for an adaptable connectionist model are laid out, and a representational architecture is constructed. The architecture requires relations (i.e. links between objects) to be bi-directional or directional, where the former is meant to capture those relations for which it is useful to have the inverse relation (e.g. `isa', `part-of'). The general assumption is that inferential distances are best captured by relying on representational similarities in the semantic features of tokens and types. Both the encoding mechanism and the decoding mechanism (for checking the uniqueness of the distributed representations) are described in detail. The representational architecture is implemented in recursive autoassociative memory. The model is successful, and future adaptation or handling multiple inheritance with exceptions is briefly explored.
|
|
| 4. |
- Bodén, Mikael
(författare)
-
A Connectionist Variation on Inheritance
- 1996
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- A connectionist architecture is outlined which makes use of RAAM to generate representations for objects in inheritance networks and extended learning to make such representations context-sensitive. The architecture embodies inheritance quite differently by relying on associative similarities and regions in representational space. The model avoids many of the problems identified for traditional inheritance.
|
|
| 5. |
- Bodén, Mikael, et al.
(författare)
-
A Representational Architecture for Nonmonotonic Inheritance Structures
- 1993
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- This paper describes a connectionist system for representing and reasoning with multiple inheritance structures with exceptions. The representational architecture has three characteristics. First, it merges relational with taxonomic representations. Secondly, it handles conflicts generated by exceptions and the use of multiple superclasses. Thirdly, it uses fully distributed representations. One novel feature is that, since the distributed representation of an entity is influenced by its position in the inheritance structure, representations of assertions are influenced by the context of the entities. An extension to the model which implements and makes use of confluent inference is described.
|
|
| 6. |
- Bodén, Mikael, et al.
(författare)
-
Features of distributed representations for tree-structures : A study of RAAM
- 1995
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- This paper presents an in-depth analysis of properties of patterns, generated by the Recursive Auto-Associative Memory, based on the idea that representational features can be detected by a classification network. The intension of this analysis is to examine the actual reasons for the success of connectionist processes acting on super-positional activity vectors generated in the fashion described. We show that the structure supplied during training is maintained and is extractable from the generated pattern. Further, we show that the influence of the actual constituents in the structures supplied during training is not necessarily available, in the generated patterns, for holistic processing. The outlook for holistic processing is therefore limited unless new forms can be found which take into account, what Sharkey and Jackson call, `whole net' representations.
|
|
| 7. |
- Bodén, Mikael
(författare)
-
Generalization by symbolic abstraction in cascaded recurrent networks
- 2004
-
Ingår i: Neurocomputing. - : Elsevier. - 0925-2312 .- 1872-8286. ; 57:1-4, s. 87-104
-
Tidskriftsartikel (refereegranskat)abstract
- Generalization performance in recurrent neural networks is enhanced by cascading several networks. By discretizing abstractions induced in one network, other networks can operate on a coarse symbolic level with increased performance on sparse and structural prediction tasks. The level of systematicity exhibited by the cascade of recurrent networks is assessed on the basis of three language domains.
|
|
| 8. |
- Bodén, Mikael, et al.
(författare)
-
Learning the Dynamics of Embedded Clauses
- 2003
-
Ingår i: Applied intelligence (Boston). - : Springer Netherlands. - 0924-669X .- 1573-7497. ; 19:1-2, s. 51-63
-
Tidskriftsartikel (refereegranskat)abstract
- Recent work by Siegelmann has shown that the computational power of recurrent neural networks matches that of Turing Machines. One important implication is that complex language classes (infinite languages with embedded clauses) can be represented in neural networks. Proofs are based on a fractal encoding of states to simulate the memory and operations of stacks. In the present work, it is shown that similar stack-like dynamics can be learned in recurrent neural networks from simple sequence prediction tasks. Two main types of network solutions are found and described qualitatively as dynamical systems: damped oscillation and entangled spiraling around fixed points. The potential and limitations of each solution type are established in terms of generalization on two different context-free languages. Both solution types constitute novel stack implementations—generally in line with Siegelmann's theoretical work—which supply insights into how embedded structures of languages can be handled in analog hardware.
|
|
| 9. |
- Bodén, Mikael, et al.
(författare)
-
On learning context-free and context-sensitive languages
- 2002
-
Ingår i: IEEE Transactions on Neural Networks. - New York : IEEE. - 1045-9227 .- 1941-0093. ; 13:2, s. 491-493
-
Tidskriftsartikel (refereegranskat)abstract
- The long short-term memory (LSTM) is not the only neural network which learns a context sensitive language. Second-order sequential cascaded networks (SCNs) are able to induce means from a finite fragment of a context-sensitive language for processing strings outside the training set. The dynamical behavior of the SCN is qualitatively distinct from that observed in LSTM networks. Differences in performance and dynamics are discussed.
|
|
| 10. |
- Harris, Kurt L., et al.
(författare)
-
Ancestral Sequence Reconstruction of a Cytochrome P450 Family Involved in Chemical Defense Reveals the Functional Evolution of a Promiscuous, Xenobiotic-Metabolizing Enzyme in Vertebrates
- 2022
-
Ingår i: Molecular biology and evolution. - : NLM (Medline). - 0737-4038 .- 1537-1719. ; 39:6
-
Tidskriftsartikel (refereegranskat)abstract
- The cytochrome P450 family 1 enzymes (CYP1s) are a diverse family of hemoprotein monooxygenases, which metabolize many xenobiotics including numerous environmental carcinogens. However, their historical function and evolution remain largely unstudied. Here we investigate CYP1 evolution via the reconstruction and characterization of the vertebrate CYP1 ancestors. Younger ancestors and extant forms generally demonstrated higher activity toward typical CYP1 xenobiotic and steroid substrates than older ancestors, suggesting significant diversification away from the original CYP1 function. Caffeine metabolism appears to be a recently evolved trait of the CYP1A subfamily, observed in the mammalian CYP1A lineage, and may parallel the recent evolution of caffeine synthesis in multiple separate plant species. Likewise, the aryl hydrocarbon receptor agonist, 6-formylindolo[3,2-b]carbazole (FICZ) was metabolized to a greater extent by certain younger ancestors and extant forms, suggesting that activity toward FICZ increased in specific CYP1 evolutionary branches, a process that may have occurred in parallel to the exploitation of land where UV-exposure was higher than in aquatic environments. As observed with previous reconstructions of P450 enzymes, thermostability correlated with evolutionary age; the oldest ancestor was up to 35 °C more thermostable than the extant forms, with a 10T50 (temperature at which 50% of the hemoprotein remains intact after 10 min) of 71 °C. This robustness may have facilitated evolutionary diversification of the CYP1s by buffering the destabilizing effects of mutations that conferred novel functions, a phenomenon which may also be useful in exploiting the catalytic versatility of these ancestral enzymes for commercial application as biocatalysts.
|
|
