| 1. |
- Liu, Yuanhua, 1971, et al.
(författare)
-
Considering the importance of user profiles in interface design
- 2009
-
Ingår i: User Interfaces. ; , s. 23-
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- User profile is a popular term widely employed during product design processes by industrial companies. Such a profile is normally intended to represent real users of a product. The ultimate purpose of a user profile is actually to help designers to recognize or learn about the real user by presenting them with a description of a real user’s attributes, for instance; the user’s gender, age, educational level, attitude, technical needs and skill level. The aim of this chapter is to provide information on the current knowledge and research about user profile issues, as well as to emphasize the importance of considering these issues in interface design. In this chapter, we mainly focus on how users’ difference in expertise affects their performance or activity in various interaction contexts. Considering the complex interaction situations in practice, novice and expert users’ interactions with medical user interfaces of different technical complexity will be analyzed as examples: one focuses on novice and expert users’ difference when interacting with simple medical interfaces, and the other focuses on differences when interacting with complex medical interfaces. Four issues will be analyzed and discussed: (1) how novice and expert users differ in terms of performance during the interaction; (2) how novice and expert users differ in the perspective of cognitive mental models during the interaction; (3) how novice and expert users should be defined in practice; and (4) what are the main differences between novice and expert users’ implications for interface design. Besides describing the effect of users’ expertise difference during the interface design process, we will also pinpoint some potential problems for the research on interface design, as well as some future challenges that academic researchers and industrial engineers should face in practice.
|
|
| 2. |
|
|
| 3. |
- Casado, Lander, 1985, et al.
(författare)
-
ContikiSec: A Secure Network Layer for Wireless Sensor Networks under the Contiki Operating System
- 2009
-
Ingår i: Proceedings of the 14th Nordic Conference on Secure IT Systems (NordSec 2009), Lecture Notes in Computer Science. - 1611-3349. - 9783642047657 ; 5838, s. 133 - 147
-
Konferensbidrag (refereegranskat)abstract
- In this paper we introduce ContikiSec, a secure network layer forwireless sensor networks, designed for the Contiki Operating System. ContikiSechas a configurable design, providing three security modes starting fromconfidentiality and integrity, and expanding to confidentiality, authentication,and integrity. ContikiSec has been designed to balance low energy consumptionand security while conforming to a small memory footprint. Our design wasbased on performance evaluation of existing security primitives and is part ofthe contribution of this paper. Our evaluation was performed in the ModularSensor Board hardware platform for wireless sensor networks, running Contiki.Contiki is an open source, highly portable operating system for wireless sensornetworks (WSN) that is widely used in WSNs.
|
|
| 4. |
- Gustavsson, Per M., 1965-, et al.
(författare)
-
Machine Interpretable Representation of Commander's Intent
- 2008
-
Ingår i: Proceedings of the 13th International Command and Control Research and Technology Symposium (13th ICCRTS).
-
Konferensbidrag (refereegranskat)abstract
- The Network-Centric approach envisioned in the Global Information Grid enables the interconnection of systems in a dynamic and flexible architecture to support multi-lateral, civilian and military missions. Constantly changing environments require commanders to plan for missions that allow organizations from various nations and agencies to join or separate from the teams performing the missions, depending on the situation, as missions unfold. The uncertainty within an actual mission, and the variety of potential organizations that support the mission after it is underway, makes Command Intent (CI) a critical concept for the mission team. With new and innovative information technologies, CI can now be made available to the team of organizations in a coalition environment. Using a flexible and linguistically based approach for representing CI allows Intent to be interpreted and processed by all participants – both humans and machines. CI representations need to be able to express mission team’s purpose, the anticipated End-State of the mission and desired key tasks. In this work, the expression of CI is developed to enable the structure and dynamics of collaboration support.
|
|
| 5. |
- Mamontov, Eugen, 1955
(författare)
-
Ordinary differential equation system for population of individuals and the corresponding probabilistic model
- 2008
-
Ingår i: Mathl. Computer Modelling. - : Elsevier BV. - 0895-7177.
-
Tidskriftsartikel (refereegranskat)abstract
- The key model for particle populations in statistical mechanics is the Bogolyubov–Born– Green–Kirkwood–Yvon (BBGKY) equation chain. It is derived mainly from the Hamilton ordinary differential equation (ODE) system for the vectors of the particle states in the particle position-momentum phase space. Many problems beyond physics or chemistry, for instance, in the living-matter sciences (biology, medicine, ecology, and scoiology) make it necessary to extend the notion of a particle to an individual, or active particle. This challenge is met by the generalized kinetic theory. It implements the extension by extending the phase space from the space of the position-momentum vectors to more rich spaces formed by the state vectors with the entries which need not be limited to the entries of the position and momentum: they include other scalar variables (e.g., those associated with modelling homeorhesis or other features inherent to the individuals). One can assume that the dynamics of the state vector in the extended space, i.e. the states of the individuals (rather than common particles) is also described by an ODE system. The latter, however, need not be the Hamilton one. The question is how one can derive the analogue of the BBGKY paradigm for the new settings. The present work proposes an answer to this question. It applies a very limited number of carefully selected tools of probability theory and common statistical mechanics. It in particular uses the well-known feature that the maximum number of the individuals which can mutually interact simultaneously is bounded by a fixed value of a few units. The present approach results in the finite system of equations for the reduced many-individual distribution functions thereby eliminating the so-called closure problem inevitable in the BBGKY theory. The thermodynamic-limit assumption is not needed either. The system includes consistently derived terms of all of the basic types known in kinetic theory, in particular, both the “mean-field” and scattering-integral terms, and admits the kinetic equation of the form allowing a direct chemical-reaction reading. The present approach can deal with Hamilton’s equation systems which are nonmonogenic and not treated in statistical mechanics. The proposed modelling suggests the basis of the generalized kinetic theory and may serve as the stochastic mechanics of population of individuals.
|
|
| 6. |
- Hansson, Karin, et al.
(författare)
-
A framework for evaluation of flood management strategies
- 2008
-
Ingår i: Journal of Environmental Management. - : Elsevier BV. - 0301-4797 .- 1095-8630. ; 86:3, s. 465-480
-
Tidskriftsartikel (refereegranskat)abstract
- The resulting impact of disasters on society depends on the affected country's economic strength prior to the disaster. The larger the disaster and the smaller the economy, the more significant is the impact. This is clearest seen in developing countries, where weak economics become even weaker afterwards. Deliberate strategies for the sharing of losses from hazardous events may aid a country or a community in efficiently using scarce prevention and mitigation resources, thus being better prepared for the effects of a disaster. Nevertheless, many governments lack an adequate institutional system for applying cost effective and reliable technologies for disaster prevention, early warnings, and mitigation. Modelling by event analyses and strategy models is one way of planning ahead, but these models have so far not been linked together. An approach to this problem was taken during a large study in Hungary, the Tisza case study, where a number of policy strategies for spreading of flood loss were formulated. In these strategies, a set of parameters of particular interest were extracted from interviews with stakeholders in the region. However, the study was focused on emerging economies, and, in particular, on insurance strategies. The scope is now extended to become a functional framework also for developing countries. In general, they have a higher degree of vulnerability. The paper takes northern Vietnam as an example of a developing region. We identify important parameters and discuss their importance for flood strategy formulations. Based on the policy strategies in the Tisza case, we extract data from the strategies and propose a framework for loss spread in developing and emerging economics. The parameter set can straightforwardly be included in a simulation and decision model for policy formulation and evaluation, taking multiple stakeholders into account.
|
|
| 7. |
- Fersman, Elena, et al.
(författare)
-
Task Automata : Schedulability, Decidability and Undecidability
- 2007
-
Ingår i: Information and Computation. - : Elsevier. - 0890-5401 .- 1090-2651. ; 205:8, s. 1149-1172
-
Tidskriftsartikel (refereegranskat)abstract
- We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes that are computation tasks generated (or triggered) by timed events. Compared with classical task models for real time systems, task automata may be used to describe tasks (1) that are generated non-deterministically according to timing constraints in timed automata, (2) that may have interval execution times representing the best case and the worst case execution times, and (3) whose completion times may influence the releases of task instances. We generalize the classical notion of schedulability to task automata. A task automaton is schedulable if there exists a scheduling strategy such that all possible sequences of events generated by the automaton are schedulable in the sense that all associated tasks can be computed within their deadlines. Our first technical result is that the schedulability for a given scheduling strategy can be checked algorithmically for the class of task automata when the best case and the worst case execution times of tasks are equal. The proof is based on a decidable class of suspension automata: timed automata with bounded subtraction in which clocks may be updated by subtractions within a bounded zone. We shall also study the borderline between decidable and undecidable cases. Our second technical result shows that the schedulability checking problem will be undecidable if the following three conditions hold: (1) the execution times of tasks are intervals, (2) the precise finishing time of a task instance may influence new task releases, and (3) a task is allowed to preempt another running task.
|
|
| 8. |
- Falkman, Göran, 1968-, et al.
(författare)
-
SOMWeb - Towards an Infrastructure for Knowledge Sharing in Oral Medicine
- 2005
-
Ingår i: Connecting Medical Informatics and Bio-Informatics: Proceedings of MIE2005 - The XIXth International Congress of the European Federation for Medical Informatics. - Amsterdam : IOS Press. - 1586035495 ; 116, s. 527-32, s. 527-532
-
Konferensbidrag (refereegranskat)abstract
- In a net-based society, clinicians can come together for cooperative work and distance learning around a common medical material. This requires suitable techniques for cooperative knowledge management and user interfaces that are adapted to both the group as a whole and to individuals. To support distributed management and sharing of clinical knowledge, we propose the development of an intelligent web community for clinicians within oral medicine. This virtual meeting place will support the ongoing work on developing a digital knowledge base, providing a foundation for a more evidence-based oral medicine. The presented system is founded on the use and development of web services and standards for knowledge modelling and knowledge-based systems. The work is conducted within the frame of a well-established cooperation between oral medicine and computer science.
|
|
| 9. |
|
|
| 10. |
- Håkansson, Anne, et al.
(författare)
-
Using reengineering for knowledge-based systems
- 2007
-
Ingår i: Cybernetics and systems. - : Informa UK Limited. - 0196-9722 .- 1087-6553. ; 38:8, s. 799-824
-
Tidskriftsartikel (refereegranskat)abstract
- Reverse engineering, also called reengineering, is used to modify systems that have functioned for many years, but which can no longer accomplish their intended tasks and, therefore, need to be updated. Reverse engineering can support the modification and extension of the knowledge in an already existing system. However, this can be an intricate task for a large, complex and poorly documented knowledge-based system. The rules in the knowledge base must be gathered, analyzed and understood, but also checked for verification and validation. We introduce an approach that uses reverse engineering for the knowledge in knowledge-based systems. The knowledge is encapsulated in rules, facts and conclusions, and in the relationships between them. Reverse engineering also collects functionality and source code. The outcome of reverse engineering is a model of the knowledge base, the functionality and the source code connected to the rules. These models are presented in diagrams using a graphic representation similar to Unified Modeling Language and employing ontology. Ontology is applied on top of rules, facts and relationships. From the diagrams, test cases are generated during the reverse engineering process and adopted to verify and validate the system.
|
|
