Hasil untuk "Drawing. Design. Illustration"

Laura Palau Bravo, Antonio Loriguillo-López, José Antonio Palao Errando

Las secuencias de apertura representan algo más que una relación informativa de los contribuyentes de una producción audiovisual. Además de acreditar, los openings ayudan a establecer el tono de una serie y las expectativas de los espectadores con ánimo persuasivo a través de recursos visuales de la puesta en escena y el montaje. En el contexto del audiovisual de las plataformas y de la viralización de clips vía redes sociales, estas breves partículas suponen una excelente oportunidad promocional para los estudios, que exhiben sus mejores valores de producción en vistas a una mejora de su propia imagen de marca. En este artículo proponemos un análisis de dos estudios de caso, los openings de los anime Netflix Originals Cyberpunk: Edgerunners (Hiroyuki Imaishi, Trigger, 2022) y Devilman Crybaby (Masaaki Yuasa, Science Saru, 2018). Mediante un estudio formal de perspectiva publicitaria y de gestión de marca se relaciona la función identificativa de estos openings con la búsqueda de prestigio por parte de sus estudios responsables en un escaparate de gran alcance: el catálogo global de Netflix.

Covadonga Organero Castrillo

Eugenio Vega, inspirado en académicos del diseño como Ezio Manzini o Klaus Krippendorf, propone una visión sobre el diseño como escenario de transformación social. Herramienta económica, profesión o afición, el diseño puede ser muchas cosas y ninguna a la vez. En las 160 páginas de ¿Por qué nadie sabe lo qué es el diseño?, Vega ilustra su exposición con abundantes ejemplos visuales tanto en la práctica como en la teoría de muchos de los cambios que ha supuesto la evolución del diseño a lo largo de la historia. Nuevos métodos, nuevos medios. Con la preocupación de un futuro incierto para la profesión del diseño tanto por los límites no establecidos como por la presencia del diseño “profano”, pretende analizar cada ámbito en el que se desarrolla esta disciplina “difusa”.

Subroto Kumer Deb Nath, Benjamin Tan

With greater design complexity, the challenge to anticipate and mitigate security issues provides more responsibility for the designer. As hardware provides the foundation of a secure system, we need tools and techniques that support engineers to improve trust and help them address security concerns. Knowing the security assets in a design is fundamental to downstream security analyses, such as threat modeling, weakness identification, and verification. This paper proposes an automated approach for the initial identification of potential security assets in a Verilog design. Taking inspiration from manual asset identification methodologies, we analyze open-source hardware designs in three IP families and identify patterns and commonalities likely to indicate structural assets. Through iterative refinement, we provide a potential set of primary security assets and thus help to reduce the manual search space.

Carla Guillermina García

Con motivo del 75 aniversario de la revista Anales del IAA y en el marco de la mesa homenaje celebrada en septiembre de 2023, este artículo propone algunas reflexiones sobre el desarrollo de esta publicación y su centralidad en la propuesta institucional de Mario Buschiazzo entre 1948 y 1971. Como objetivo general, el texto piensa el proyecto editorial dentro del esquema canónico de las disciplinas humanísticas en la Universidad de Buenos Aires, así como su valorización por parte de la historia de la historiografía. También se enfatiza su capa­cidad de promover aportes decisivos en el área de los estudios americanistas y de constituir un espacio de referencia para comprender el desarrollo de biografías profesionales desde la segunda mitad del siglo XX.

Jialiang Wang, Hanmo Liu, Shimin Di et al.

High-level automation is increasingly critical in AI, driven by rapid advances in large language models (LLMs) and AI agents. However, LLMs, despite their general reasoning power, struggle significantly in specialized, data-sensitive tasks such as designing Graph Neural Networks (GNNs). This difficulty arises from (1) the inherent knowledge gaps in modeling the intricate, varying relationships between graph properties and suitable architectures and (2) the external noise from misleading descriptive inputs, often resulting in generic or even misleading model suggestions. Achieving proficiency in designing data-aware models -- defined as the meta-level capability to systematically accumulate, interpret, and apply data-specific design knowledge -- remains challenging for existing automated approaches, due to their inefficient construction and application of meta-knowledge. To achieve meta-level proficiency, we propose DesiGNN, a knowledge-centered framework that systematically converts past model design experience into structured, fine-grained knowledge priors well-suited for meta-learning with LLMs. To account for the inherent variability and external noise, DesiGNN aligns empirical property filtering from extensive benchmarks with adaptive elicitation of literature insights via LLMs. By constructing a solid meta-knowledge between unseen graph understanding and known effective architecture patterns, DesiGNN can deliver top-5.77% initial model proposals for unseen datasets within seconds and achieve consistently superior performance with minimal search cost compared to baselines.

Olivier Bernardi, Éric Fusy, Shizhe Liang

We present two graph drawing algorithms based on the recently defined "grand-Schnyder woods", which are a far-reaching generalization of the classical Schnyder woods. The first is a straight-line drawing algorithm for plane graphs with faces of degree 3 and 4 with no separating 3-cycle, while the second is a rectangular drawing algorithm for the dual of such plane graphs. In our algorithms, the coordinates of the vertices are defined in a global manner, based on the underlying grand-Schnyder woods. The grand-Schnyder woods and drawings are computed in linear time. When specializing our algorithms to special classes of plane graphs, we recover the following known algorithms: (1) He's algorithm for rectangular drawing of 3-valent plane graphs, based on transversal structures, (2) Fusy's algorithm for the straight-line drawing of triangulations of the square, based on transversal structures, (3) Bernardi and Fusy's algorithm for the orthogonal drawing of 4-valent plane graphs, based on 2-orientations, (4) Barriere and Huemer's algorithm for the straight-line drawing of quadrangulations, based on separating decompositions. Our contributions therefore provide a unifying perspective on a large family of graph drawing algorithms that were originally defined on different classes of plane graphs and were based on seemingly different combinatorial structures.

Špela Kajzer, Alexander Dobler, Janja Jerebic et al.

In this paper, we introduce tiled graphs as models of learning and maturing processes. We show how tiled graphs can combine graphs of learning spaces or antimatroids (partial hypercubes) and maturity models (total orders) to yield models of learning processes. For the visualization of these processes it is a natural approach to aim for certain optimal drawings. We show for most of the more detailed models that the drawing problems resulting from them are NP-complete. The terse model of a maturing process that ignores the details of learning, however, results in a polynomially solvable graph drawing problem. In addition, this model provides insight into the process by ordering the subjects at each test of their maturity. We investigate extremal and random instances of this problem, and provide exact results and bounds on their optimal crossing number. Graph-theoretic models offer two approaches to the design of optimal maturity models given observed data: (1) minimizing intra-subject inconsistencies, which manifest as regressions of subjects, is modeled as the well-known feedback arc set problem. We study the alternative of (2) finding a maturity model by minimizing the inter-subject inconsistencies, which manifest as crossings in the respective drawing. We show this to be NP-complete.

Ágoston Kaposi, Zoltán Kolarovszki, Adrián Solymos et al.

Unitary designs are essential tools in several quantum information protocols. Similarly to other design concepts, unitary designs are mainly used to facilitate averaging over a relevant space, in this case, the unitary group $\mathrm{U}(d)$. While it is known that exact unitary $t$-designs exist for any degree $t$ and dimension $d$, the most appealing type of designs, group designs (in which the elements of the design form a group), can provide at most $3$-designs. Moreover, even group $2$-designs can exist only in limited dimensions. In this paper, we present novel construction methods for creating exact generalized group designs based on the representation theory of the unitary group and its finite subgroups that overcome the $4$-design-barrier of unitary group designs. Furthermore, a construction is presented for creating generalized group $2$-designs in arbitrary dimensions.

Este número especial de Inmaterial. Diseño, Arte y Sociedad surge del proyecto «Visiones del futuro: cultura visual ibérica después de la democracia, 1974-1998», un proyecto de investigación colaborativa que profundiza en el papel de la comunicación visual en el paisaje político único de la península ibérica (incluyendo otros territorios de España y Portugal) durante su transición hacia la democracia a finales del siglo XX. 

Christopher Leet, Chanwook Oh, Michele Lora et al.

We address the warehouse servicing problem (WSP) in automated warehouses, which use teams of mobile agents to bring products from shelves to packing stations. Given a list of products, the WSP amounts to finding a plan for a team of agents which brings every product on the list to a station within a given timeframe. The WSP consists of four subproblems, concerning what tasks to perform (task formulation), who will perform them (task allocation), and when (scheduling) and how (path planning) to perform them. These subproblems are NP-hard individually and become more challenging in combination. The difficulty of the WSP is compounded by the scale of automated warehouses, which frequently use teams of hundreds of agents. In this paper, we present a methodology that can solve the WSP at such scales. We introduce a novel, contract-based design framework which decomposes an automated warehouse into traffic system components. By assigning each of these components a contract describing the traffic flows it can support, we can synthesize a traffic flow satisfying a given WSP instance. Component-wise search-based path planning is then used to transform this traffic flow into a plan for discrete agents in a modular way. Evaluation shows that this methodology can solve WSP instances on real automated warehouses.

I.M.U. Madhuwanthi

“Kacha Kacha Simona” was a pioneering chapter book series of Sinhala literature, categorized under chapter books the children story genre, authored and published from the year 2017 by the Sri Lankan writer I.M. Uthpala Madhuwanthi alias ‘Sandha Uthpalawee’. At present, “Kacha Kacha Simona” book series which is also considered a significant milestone of the author’s writing career has evolved into a trilogy targeting not only readers aged 7 to 11, but also beyond. The book series “Kacha Kacha Simona”, accompanied with delightful illustrations, captures the essence of the author’s childhood experiences. The series revolves around the protagonist, a talkative, playful, yet innocent girl with a strong determination for her studies. The books showcase Simona’s family, pets, hobbies, and her profound appreciation for the little joys of life. Also the storyline revolves around Simona’s journey as she prepares for and faces the grade five scholarship examination, a significant challenge that alters the course of her life. The first book in the series, “Kacha Kacha Simona” was an island-wide success, not only among children but also with adults. The author’s personal handling of story development, illustrations, book layout, cover design, publishing, distribution, sales and marketing showcased her multifaceted talent. The positive reception received from the audience including fan mail and drawings from readers inspired the author to create the second installment of the series, “Kacha Kacha Simona - Vibhaga Boothaya '' in 2020. In the year 2021, the third book “ Kacha Kacha Simona – Duwana Iskole” was also published and they all received an overwhelming amount of love and attention from young readers.The author introduced a unique page layout and a presentation style, setting a new trend in Sri Lankan children’s story books. The trilogy was also recognized for its educational value by the Ministry of Education as all three installments were certified as suitable for Sri Lankan school libraries. The series’s success can be attributed to four key elements consistently praised by its young audience based on their feedback. First, the narration style is engaging and captivating, keeping children enthralled throughout the reading experience. Second, humor is artfully woven into the narrative, providing moments of laughter and joy. Third, the author’s simple writing style resonates well with young readers, making the books accessible and relatable to their real life experiences. Fourth, the delightful illustrations complement the story, enhancing the overall appeal of the series. Taking “Kacha Kacha Simona’s user feedback into consideration, this study reveals the desired expectations of young readers of Sri Lankan chapter book series.

Adrián Arias Astorgano

Ana Maria Copetti Maccagnan, Guilherme Englert Corrêa Meyer

Even though experimentation and its material aspect are linked to the practice of design, few texts approach the concept intertwined with a dimension of touch. Considering the uncertain and critical times in which we perceive ourselves as a society, we need practices different from those prevalent in interaction design fields, yet capable of touching other possible worlds. We trust that the act of slowing down enables us to cultivate a distinct sensitivity, hesitating in the construction of a ‘good common world’. This article investigates spaces of hesitation through touch-oriented experimentation and reports on one case of an experimental practice developed from the formation of an embroidery collective. The practice proposes a design performance more engaged with uncertainties, care, and subjectivities.

Raida Karim, Edgar Lopez, Elin A. Björling et al.

The intersection of data visualization and human-robot interaction (HRI) is a burgeoning field. Understanding, communicating, and processing different kinds of data for creating versatile visualizations can benefit HRI. Conversely, expressing different kinds of data generated from HRI through effective visualizations can provide interesting insights. Our work adds to the literature of this growing domain. In this paper, we present our exploratory work on visualizing mental health data on a social robot. Particularly, we discuss development of mental health data visualizations using a participatory design (PD) approach. As a first step with mental health data visualization on a social robot, this work paves the way for relevant further work and using social robots as data visualization tools.

A. G. Grozin

A package for drawing publication-quality Feynman diagrams written in GLE is described.

Yu Cao, Hao Tian, P. Y. Mok

Automatic colorization of anime line drawing has attracted much attention in recent years since it can substantially benefit the animation industry. User-hint based methods are the mainstream approach for line drawing colorization, while reference-based methods offer a more intuitive approach. Nevertheless, although reference-based methods can improve feature aggregation of the reference image and the line drawing, the colorization results are not compelling in terms of color consistency or semantic correspondence. In this paper, we introduce an attention-based model for anime line drawing colorization, in which a channel-wise and spatial-wise Convolutional Attention module is used to improve the ability of the encoder for feature extraction and key area perception, and a Stop-Gradient Attention module with cross-attention and self-attention is used to tackle the cross-domain long-range dependency problem. Extensive experiments show that our method outperforms other SOTA methods, with more accurate line structure and semantic color information.

Helios Sanchis-Alepuz, Monika Stipsitz

This paper presents a method to simulate the thermal behavior of 3D systems using a graph neural network. The method discussed achieves a significant speed-up with respect to a traditional finite-element simulation. The graph neural network is trained on a diverse dataset of 3D CAD designs and the corresponding finite-element simulations, representative of the different geometries, material properties and losses that appear in the design of electronic systems. We present for the transient thermal behavior of a test system. The accuracy of the network result for one-step predictions is remarkable (\SI{0.003}{\%} error). After 400 time steps, the accumulated error reaches \SI{0.78}{\%}. The computing time of each time step is \SI{50}{ms}. Reducing the accumulated error is the current focus of our work. In the future, a tool such as the one we are presenting could provide nearly instantaneous approximations of the thermal behavior of a system that can be used for design optimization.

Laura Teresa Gómez-Vera, Irazema del Carmen Díaz Sánchez

El desecho de materiales médicos y de curación que se utilizan en el entorno doméstico es un problema no resuelto que provoca el contagio de enfermedades diversas, pero a raíz de la pandemia SARS CoV 2 se tiene mayor riesgo en el entorno inmediato, como en aquellos en donde trabajan personas de mantenimiento y limpieza, incluyendo los recolectores de basura. En este trabajo se describe el diseño de una alternativa que facilita las funciones de triturar, desinfectar y desechar ese tipo de basura de una forma segura y responsable sin provocar efectos dañinos al ambiente. Se trabajó bajo el enfoque del Diseño Universal a fin de que su uso sea reconocible en la relación usuario-objeto-contexto mediante propiedades tales como la sencillez, la intui-ción, la flexibilidad, así como destacar la máxima seguridad para el usuario. Esta solución responde a ciertas especificaciones que determinan las normas mexicanas que establecen los lineamientos de seguridad en los procesos de separación, recolección, almacenamiento y disposición final de desechos médicos.

Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani et al.

Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of topology-preserving morphs for pairs of non-planar graph drawings. We make a step towards this problem by showing that a topology-preserving morph always exists for drawings of a meaningful family of $1$-planar graphs. While our proof is constructive, the vertices may follow trajectories of unbounded complexity.

Yuanzheng Ma, Chang Lu, Kedi Xiong et al.

An amendment to this paper has been published and can be accessed via the original article.