Search

The neural correlates of face individuation—the acquisition of memory representations for novel faces—have been studied only in coarse detail and disregarding individual differences between learners. In their seminal study, Tanaka et al. (Tanaka et al. 2006 J. Cogn. Neurosci.18, 1488–1497. (doi:10.1162/jocn.2006.18.9.1488)) required the identification of a particular novel face across 70 trials and found that the N250 component in the EEG event-related potentials became more negative from the first to the second half of the experiment, where it reached a similar amplitude as a well-known face. We were unable to directly replicate this finding in our study when we used the original split of trials. However, when we applied a different split of trials we observed very similar changes in N250 amplitude. We conclude that the N250 component is indeed sensitive to the build-up of a robust representation of a face in memory; the time course of this process appears to vary as a function of variables that may be determined in future research.

This paper deals with the problem of transforming the data obtained from the IFC file of a given building into a weighted graph, which is used for searching shortest routes accessible for different types of users including people and mobile objects. This graph contains information about the topology and accessibility between building spaces. It is created using the parameter specifying the permissible distance from the center of a moving object to a wall. Edge weights are calculated based on the Euclidean distance between nodes representing doors or internal points of rooms with concave shapes. On the basis of information encoded in the graph the application calculates the shortest path between designated rooms and creates its visualization. The presented approach is illustrated on examples of searching shortest routs between spaces of the building extracted from the IFC file belonging to the free IFC model database.

This paper deals with graph grammar systems which are used to generate representations of complex designs. Space layouts of designs have their internal representations in the form of attributed graphs representing both topological structures and semantic properties. The system of graph grammars, which work in parallel on the common graph independently generating layouts of different design components, is proposed. The grammars of the system jointly generate a set of graphs representing design task solutions with required properties. The presented approach is illustrated through the example of designing kindergarten facilities.

This paper presents a computer system supporting conceptual design. The knowledge about designs saved in hierarchical hypergraphs allows the system to check if the current state of designs fulfills predefined constraints. The constraints are stored in external files, in the form of logic formulas. Originally, first-order logic was used; this paper proposes replacing it with many-sorted first-order logic.

This paper deals with searching accessible egress routes in case of emergency. The information about the building layout is extracted from the IFC file and stored in the graph representation together with current status of spaces and available equipment. The proposed method of knowledge-based adaptive search for egress routes is based on this graph representation. To support the decision-making process the rule-based reasoning system is applied, where rules for avoiding and eliminating threats are proposed. The user can introduce new information about the current situation to the system and thus the method provides flexible means for giving evacuation instructions. The presented approach is illustrated by examples of evacuation routes found in different types of emergency and visualized by the application written in Java.

W rozprawie przedstawiony jest formalny model systemu projektowego wykorzystującego wiedzę projektową do wspomagania koncepcyjnego etapu projektowania. Projektant posługuje się językiem wizualnym, który bazuje na zaproponowanej konceptualizacji dziedziny projektowania wizualnego. Elementami tego języka są diagramy projektowe opisujące proponowane rozwiązania. Wewnętrzną reprezentację diagramów stanowią atrybutowane hierarchiczne hipergrafy pozwalające zakodować wiedzę projektową. Przedstawiony jest mechanizm wnioskowania o poprawności rozwiązań z ich reprezentacji wewnętrznej, oparty na formułach logicznych pierwszego rzędu. Omawiany system wyposażony jest w agentów projektowych, których zachowanie modelowane jest z wykorzystaniem hierarchicznych gramatyk hipergrafowych. Zaprezentowane metody projektowania i wnioskowania zilustrowane są przykładami projektowania rozkładów pomieszczeń, krzeseł i kratowych wież przesyłowych., Studia Informatica, Vol 32, No 4B (2011): Visual design with the use of hierarchical hypergraphs

This paper deals with visual design and reasoning. A visual language with its internal representation in the form of attributed hierarchical hypergraphs is discussed. Hypergraph attributes allow for defining and analysing constraints imposed by design knowledge. Operations on hypergraphs which reflect modifications of design diagrams are also presented. The approach is illustrated by examples of designing floor-layouts., Electronic Communications of the EASST, Volume 10: Graph Transformation and Visual Modeling Techniques 2008