Observatorio de la accesibilidad universal en la vivienda en España 2013

Estudio elaborado por Fundación ONCE y Vía Libre y cuenta con la colaboración del Comité Español de Representantes de Personas con Discapacidad (CERMI). El objetivo del Observatorio es analizar la accesibilidad del parque de viviendas familiares de uso principal en España, determinar posibles variables que están influyendo en la accesibilidad, proponer recomendaciones orientadas a la mejora y realizar mediciones posteriores para conocer la evolución en este ámbito. Para ello, la investigación se ha abordado desde una metodología cuantitativa, desarrollada a través de encuesta telefónica, que se ha completado con una fase cualitativa previa y una evaluación técnica de la accesibilidad “in situ” de una muestra de vivienda.

La accesibilidad y el diseño universal entendido por todos. De cómo Stephen Hawking viajó por el espacio

La publicación ‘La accesibilidad y el diseño universal entendido por todos. De cómo Stephen Hawking viajó por el espacio’ es un libro al alcance de todos los públicos para acercarse a la accesibilidad universal, al diseño para todos y a la importancia de la igualdad de oportunidades para todas las personas. Sin duda, el autor se esfuerza con este libro en recopilar y sintetizar gran parte del conocimiento que había disperso en la materia, para condensarlo en una obra amena y apta para cualquier persona, independientemente si es profesional de la accesibilidad o está relacionada con el mundo de la discapacidad.

Energy of line graphs

The energy of a graph is equal to the sum of the absolute values of its eigenvalues. The energy of a matrix is equal to the sum of its singular values. We establish relations between the energy of the line graph of a graph G and the energies associated with the Laplacian and signless Laplacian matrices of G. © 2010 Elsevier B.V. All rights reserved.

Efficient edge domination in regular graphs

An induced matching of a graph G is a matching having no two edges joined by an edge. An efficient edge dominating set of G is an induced matching M such that every other edge of G is adjacent to some edge in M. We relate maximum induced matchings and efficient edge dominating sets, showing that efficient edge dominating sets are maximum induced matchings, and that maximum induced matchings on regular graphs with efficient edge dominating sets are efficient edge dominating sets. A necessary condition for the existence of efficient edge dominating sets in terms of spectra of graphs is established. We also prove that, for arbitrary fixed p ≥ 3, deciding on the existence of efficient edge dominating sets on p-regular graphs is NP-complete. © 2008 Elsevier B.V. All rights reserved.

Reflections of universal algebras into semilattices, their Galois theories, and related factorization systems

Estabelecemos uma condição suficiente para a preservação dos produtos finitos, pelo reflector de uma variedade de álgebras universais numa subvariedade, que é, também, condição necessária se a subvariedade for idempotente. Esta condição é estabelecida, seguidamente, num contexto mais geral e caracteriza reflexões para as quais a propriedade de ser semi-exacta à esquerda e a propriedade, mais forte, de ter unidades estáveis, coincidem. Prova-se que reflexões simples e semi-exactas à esquerda coincidem, no contexto das variedades de álgebras universais e caracterizam-se as classes do sistema de factorização derivado da reflexão. Estabelecem-se resultados que ajudam a caracterizar morfismos de cobertura e verticais-estáveis em álgebras universais e no contexto mais geral já referido. Caracterizam-se as classes de morfismos separáveis, puramente inseparáveis e normais. O estudo dos morfismos de descida de Galois conduz a condições suficientes para que o seu par kernel seja preservado pelo reflector.

Spectral characterization of families of split graphs

An upper bound for the sum of the squares of the entries of the principal eigenvector corresponding to a vertex subset inducing a k-regular subgraph is introduced and applied to the determination of an upper bound on the order of such induced subgraphs. Furthermore, for some connected graphs we establish a lower bound for the sum of squares of the entries of the principal eigenvector corresponding to the vertices of an independent set. Moreover, a spectral characterization of families of split graphs, involving its index and the entries of the principal eigenvector corresponding to the vertices of the maximum independent set is given. In particular, the complete split graph case is highlighted.

The Jordan canonical form for a class of weighted directed graphs

Recently, Cardon and Tuckfield (2011) [1] have described the Jordan canonical form for a class of zero-one matrices, in terms of its associated directed graph. In this paper, we generalize this result to describe the Jordan canonical form of a weighted adjacency matrix A in terms of its weighted directed graph.

Spectra of graphs obtained by a generalization of the join graph operation

Taking a Fiedler’s result on the spectrum of a matrix formed from two symmetric matrices as a motivation, a more general result is deduced and applied to the determination of adjacency and Laplacian spectra of graphs obtained by a generalized join graph operation on families of graphs (regular in the case of adjacency spectra and arbitrary in the case of Laplacian spectra). Some additional consequences are explored, namely regarding the largest eigenvalue and algebraic connectivity.

A recursive construction of the regular exceptional graphs with least eigenvalue -2

In spectral graph theory a graph with least eigenvalue 2 is exceptional if it is connected, has least eigenvalue greater than or equal to 2, and it is not a generalized line graph. A ðk; tÞ-regular set S of a graph is a vertex subset, inducing a k-regular subgraph such that every vertex not in S has t neighbors in S. We present a recursive construction of all regular exceptional graphs as successive extensions by regular sets.

Determination of (0,2)-regular sets in graphs and applications

In this paper, relevant results about the determination of (k,t)-regular sets, using the main eigenvalues of a graph, are reviewed and some results about the determination of (0,2)-regular sets are introduced. An algorithm for that purpose is also described. As an illustration, this algorithm is applied to the determination of maximum matchings in arbitrary graphs.

What is universal and what differs in language development?

Goldin-Meadow (2015) presents an exceptional synthesis of work from studies of children acquiring language under variable circumstances of input or processing abilities. Deaf children who acquire homesign without any well- formed model from which to learn language represent a powerful example. Goldin-Meadow argues that the resilient properties of language that nevertheless emerge include simple syntactic structures, hierarchical organisa- tion, markers modulating the meaning of sentences, and social-communicative functions. Among the fragile or input-dependent properties are the orders that the language follows, the parts into which words are decomposed, and the features that distinguish nominals from predicates. Separation of these two types of properties poses questions concerning the innate constraints on language acquisition (perhaps these equate to the resilient properties) and con‐ cerning the specificity of processes to language (e.g., whether properties such as hierarchical organisation are specific to language or originate in the structure of thought). The study of the resilient properties of human language in the face of adversity and the relation of these properties to the information that is encoded in the human genome represent a research strategy that draws inferences about species universals (properties that all humans share) from data about individual differences (IDs; factors that make humans different from one another). In the following, we suggest three reasons to be cautious about this approach.

Success or failure in knowledge management systems: a universal issue

This paper takes a sociotechnical viewpoint of knowledge management system (KMS) implementation in organizations considering issues such as stakeholder disenfranchisement, lack of communication, and the low involvement of key personnel in system design asking whether KMS designers could learn from applying sociotechnical principles to their systems. The paper discusses design elements drawn from the sociotechnical principles essential for the success of IS and makes recommendations to increase the success of KMS in organizations. It also provides guidelines derived from Clegg’s Principles (2000) for KMS designers to enhance their designs. Our data comes from the application of a plurality of analysis methods on a large comprehensive global survey conducted from 2007 to 2011 of 1034 participants from 76 countries. The survey covers a variety of organizations of all types and sizes from a comprehensive selection of economic sectors and industries. Our results showed that users were not satisfied with the information and knowledge systems that they were being offered. In addition to multiple technology and usability issues, there were human and organisational barriers that prevented the systems from being used to their full potential. We recommend that users of KMS are integrated into the design team so that these usability and other barriers can be addressed during the feasibility stage as well as the actual design and implementation phases.

Banca de cozinha: projeto de design universal

Mais do que uma dissertação sobre o envelhecimento da população e o impacto que ela tem na sociedade, a presente tese visa documentar todo o processo projetual desenvolvido para a criação de uma banca de cozinha. Para tal foram tidas em conta, não apenas o tipo de tarefas desenvolvidas nesta zona da habitação como também os índices de fragilidade e de debilidade que os utilizadores mais envelhecidos apresentam. O facto da população envelhecida estar cada vez mais a aumentar, atingindo em alguns países valores preocupantes, associados ao facto de esses mesmos idosos atingirem cada vez mais idades mais avançadas, faz com que haja um aumento do número de pessoas incapacitadas. Assim sendo, o principal objectivo será o desenvolvimento de um projeto assente nas premissas defendidas pelo design universal. Tal projeto tentará encontrar as respostas que melhor respondam às necessidades e problemáticas, não apenas dos utilizadores mais idosos, mas do resto da população, independentemente da sua idade, estatura e condição física.

Periodic paths on nonautonomous graphs

We define nonautonomous graphs as a class of dynamic graphs in discrete time whose time-dependence consists in connecting or disconnecting edges. We study periodic paths in these graphs, and the associated zeta functions. Based on the analytic properties of these zeta functions we obtain explicit formulae for the number of n-periodic paths, as the sum of the nth powers of some specific algebraic numbers.

Sequencing cutting patterns with colored interval graphs

The problem addressed here originates in the industry of flat glass cutting and wood panel sawing, where smaller items are cut from larger items accordingly to predefined cutting patterns. In this type of industry the smaller pieces that are cut from the patterns are piled around the machine in stacks according to the size of the pieces, which are moved to the warehouse only when all items of the same size have been cut. If the cutting machine can process only one pattern at a time, and the workspace is limited, it is desirable to set the sequence in which the cutting patterns are processed in a way to minimize the maximum number of open stacks around the machine. This problem is known in literature as the minimization of open stacks (MOSP). To find the best sequence of the cutting patterns, we propose an integer programming model, based on interval graphs, that searches for an appropriate edge completion of the given graph of the problem, while defining a suitable coloring of its vertices.