Refine
Departments, institutes and facilities
- Fachbereich Informatik (51)
- Institut für Technik, Ressourcenschonung und Energieeffizienz (TREE) (25)
- Fachbereich Ingenieurwissenschaften und Kommunikation (21)
- Institut für Cyber Security & Privacy (ICSP) (21)
- Institute of Visual Computing (IVC) (17)
- Fachbereich Wirtschaftswissenschaften (15)
- Institut für Verbraucherinformatik (IVI) (11)
- Fachbereich Angewandte Naturwissenschaften (10)
- Institut für Sicherheitsforschung (ISF) (8)
- Internationales Zentrum für Nachhaltige Entwicklung (IZNE) (5)
Document Type
- Conference Object (123) (remove)
Year of publication
- 2015 (123) (remove)
Keywords
- Eco-Feedback (4)
- FPGA (3)
- Sustainable Interaction Design (3)
- Workplace (3)
- E-Learning (2)
- Education (2)
- Organizational Culture (2)
- REST (2)
- Taxonomy (2)
- 3D user interface (1)
We present GEM-NI -- a graph-based generative-design tool that supports parallel exploration of alternative designs. Producing alternatives is a key feature of creative work, yet it is not strongly supported in most extant tools. GEM-NI enables various forms of exploration with alternatives such as parallel editing, recalling history, branching, merging, comparing, and Cartesian products of and for alternatives. Further, GEM-NI provides a modal graphical user interface and a design gallery, which both allow designers to control and manage their design exploration. We conducted an exploratory user study followed by in-depth one-on-one interviews with moderately and highly skills participants and obtained positive feedback for the system features, showing that GEM-NI supports creative design work well.
Binary relations with certain properties such as biorders, equivalences or difunctional relations can be represented as particular matrices. In order for these properties to be identified usually a rearrangement of rows and columns is required in order to reshape it into a recognisable normal form. Most algorithms performing these transformations are working on binary matrix representations of the underlying relations. This paper presents an approach to use the RLE-compressed matrix representation as a data structure for storing relations to test whether they are biorders in a hopefully more efficient way.
Communicating Sequential Processes (CSP) [7] is a calculus for concurrent systems that has been the basis of subject-oriented business process management (S-BPM) [4]. We use CSPm -- a machine readable dialect of CSP -- to create a sequence of models for a case study on an "Automated Teller Machine" [1]. We use the refinement checker FDR2 to prove that certain models are correct implementations of specifications.