Mohamad Amin Kalateh, Naeime Talebi, Soroush Nekoei
et al.
A comprehensive study on thermomechanical processing of pure Mg was conducted through sequential hot extrusion, hot rolling, and cold drawing operations. Three different extrusion ratios (6:1, 25:1, and 39:1) were investigated at 350°C, revealing that 39:1 ratio produced an optimal bimodal grain structure with beneficial twin morphology. Subsequently, hot rolling experiments were performed at varying linear speeds (26- and 130-mm s-1) and interpass annealing times (2.5 and 10 minutes). Results demonstrated that higher rolling speeds led to finer microstructure, while longer interpass annealing times resulted in reduced twin fraction and more inhomogeneous microstructure. The processed material was then subjected to cold drawing with approximately 12% true strain per pass. Different annealing conditions (275°C and 375°C for 2.5-10 minutes) between drawing passes were evaluated. Analysis showed that annealing at 375°C for 2.5-5 minutes provided optimal softening for subsequent deformation. Fracture analysis revealed a mixed ductile-brittle behavior, with twin-matrix interfaces serving as preferred crack propagation paths This study establishes optimal processing parameters for pure Mg wire production, highlighting the critical role of twin characteristics and restoration processes in determining material formability during multi-step thermomechanical processing.
Siva Aditya Gooty, Samin Riasat, Hessam Mahdavifar
et al.
We consider the problem of Multiple-Input Multiple-Output (MIMO) communication with limited feedback, where the transmitter relies on a limited number of bits associated with the channel state information (CSI), available at the receiver (CSIR) but not at the transmitter (no CSIT), sent via the feedback link. We demonstrate how character-polynomial (CP) codes, a class of analog subspace codes (also, referred to as Grassmann codes) can be used for the corresponding quantization problem in the Grassmann space. The proposed CP codebook-based precoding design allows for a smooth trade-off between the number of feedback bits and the beamforming gain, by simply adjusting the rate of the underlying CP code. We present a theoretical upper bound on the \textit{mean squared quantization error} of the CP codebook for Multiple-Input Single-Output (MISO) communication system and utilize it to upper bound the resulting \textit{distortion} with perfect CSIT. We show that the distortion vanishes asymptotically. We compute the EGT baseline gain for MIMO systems with two receive antennas and observe that the CP gain approaches the EGT gain for MIMO system. The results are also confirmed via simulations for different types of fading models for both uncorrelated and correlated channels in the MISO and MIMO systems.
Augmentation technologies, fueled by Artificial Intelligence (AI), are undergoing a process of adaptation and normalization geared to everyday users in various roles as practitioners, educators, and students. While new innovations, applications, and algorithms are developed as augmentation technology, Chapter 1 focuses on human subjects, contexts, and rhetorical strategies proposed for them by external actors. The chapter discusses core functions of technical and professional communication and provides rationale for positioning technical and professional communicators (TPCs) to understand augmentation technologies and AI as a means to design ethical futures across this work. An overview of Augmentation Technologies and AI- An Ethical Design Futures Framework serves as a guide for reframing professional practice and pedagogy to promote digital and AI literacy surrounding the ethical design, adoption, and adaptation of augmentation technologies. The chapter concludes with an overview of the remaining chapters in this book.
The recent Artificial Intelligence (AI) revolution has opened transformative possibilities for the humanities, particularly in unlocking the visual-artistic content embedded in historical illuminated manuscripts. While digital archives now offer unprecedented access to these materials, the ability to systematically locate, extract, and analyze illustrations at scale remains a major challenge. We present a general and scalable AI-based pipeline for large-scale visual analysis of illuminated manuscripts. The framework integrates modern deep-learning models for page-level illustration detection, illustration extraction, and multimodal description, enabling scholars to search, cluster, and study visual materials and artistic trends across entire corpora. We demonstrate the applicability of this approach on large heterogeneous collections, including the Vatican Library and richly illuminated manuscripts such as the Bible of Borso d'Este. The system reveals meaningful visual patterns and cross-manuscript relationships by embedding illustrations into a shared representation space and analyzing their similarity structure (see figure 4). By harnessing recent advances in computer vision and vision-language models, our framework enables new forms of large-scale visual scholarship in historical studies, art history, and cultural heritage making it possible to explore iconography, stylistic trends, and cultural connections in ways that were previously impractical.
Recognizing symbols in architectural CAD drawings is critical for various advanced engineering applications. In this paper, we propose a novel CAD data annotation engine that leverages intrinsic attributes from systematically archived CAD drawings to automatically generate high-quality annotations, thus significantly reducing manual labeling efforts. Utilizing this engine, we construct ArchCAD-400K, a large-scale CAD dataset consisting of 413,062 chunks from 5538 highly standardized drawings, making it over 26 times larger than the largest existing CAD dataset. ArchCAD-400K boasts an extended drawing diversity and broader categories, offering line-grained annotations. Furthermore, we present a new baseline model for panoptic symbol spotting, termed Dual-Pathway Symbol Spotter (DPSS). It incorporates an adaptive fusion module to enhance primitive features with complementary image features, achieving state-of-the-art performance and enhanced robustness. Extensive experiments validate the effectiveness of DPSS, demonstrating the value of ArchCAD-400K and its potential to drive innovation in architectural design and construction.
Arne Bethmann, Marina Aoki, Charlotte Hunsicker
et al.
Figure drawing is often used as part of dementia screening protocols. The Survey of Health Aging and Retirement in Europe (SHARE) has adopted three drawing tests from Addenbrooke's Cognitive Examination III as part of its questionnaire module on cognition. While the drawings are usually scored by trained clinicians, SHARE uses the face-to-face interviewers who conduct the interviews to score the drawings during fieldwork. This may pose a risk to data quality, as interviewers may be less consistent in their scoring and more likely to make errors due to their lack of clinical training. This paper therefore reports a first proof of concept and evaluates the feasibility of automating scoring using deep learning. We train several different convolutional neural network (CNN) models using about 2,000 drawings from the 8th wave of the SHARE panel in Germany and the corresponding interviewer scores, as well as self-developed 'gold standard' scores. The results suggest that this approach is indeed feasible. Compared to training on interviewer scores, models trained on the gold standard data improve prediction accuracy by about 10 percentage points. The best performing model, ConvNeXt Base, achieves an accuracy of about 85%, which is 5 percentage points higher than the accuracy of the interviewers. While this is a promising result, the models still struggle to score partially correct drawings, which are also problematic for interviewers. This suggests that more and better training data is needed to achieve production-level prediction accuracy. We therefore discuss possible next steps to improve the quality and quantity of training examples.
MITICA (Megavolt ITER Injector & Concept Advancement), the full scale prototype of ITER Heating Neutral Beam, is under realization at the Neutral Beam Test Facility (Padova, Italy). It is designed to deliver 16.5 MW to ITER plasma, obtained by accelerating negative Deuterium ions up to 1 MeV for a total ion current of 40 A and then neutralized. MITICA Acceleration Power Supply is composed of several non-standard equipment, beyond industrial standard for insulation voltage level (-1 MVdc) and dimensions. Voltage withstand tests (up to 1.265 MVdc) have been performed in five subsequent steps (from 2018 to 2019), according to the installation progress, after connecting equipment belonging to different procurements. During integrated commissioning, started in 2021, two breakdowns occurred in a position of the HV plant not still identified, so they could be occurred either in air or in SF6. To identify the locations of possible weak insulation points, the existing diagnostics for partial discharge detection (the precursor of breakdowns) as a first step have been improved on air-insulated parts by consisting in a set of instrumentation, like capacitive probes and off-the-shelf instruments for AC application (acoustic and electromagnetic sensors). The paper deals with the instruments qualification to assess their suitability for DC usage and then with the investigation performed in MITICA, in particular: 1) sensitivity assessment campaign, with artificially produced corona effect to identify the minimum threshold of each diagnostics 2) voltage application to MITICA plant, moving the instrumentation around equipment and increasing progressively the voltage looking for corona phenomena to identify possible weak insulation points.
This thesis is partly an attempt to explore the potential of pre-modern Chinese painting, on its distinctive formats and schemes to achieve spatial depth and time duration, as a way to interpret and design architecture. By a survey on changing modes of Chinese traditional landscape and cityscape paintings in different scales, the poetic language of painting will be gradually explored. Beyond pictorial techniques, language is concerned with an ideological level of understanding and experience. Thus, it signposts a wider significance of architectural representation – as a verbal medium to express narrative and critic semantics besides visual effects. In this thesis, we will also see how traditional painting remains a base in the ideating process of several contemporary Chinese architects, so to avoid a mere uncritical imitation of international models. A subtle fusion of contemporaneity with cultural identity afforded by the presence of taken concepts from traditional painting, allows this architecture to increase its meaning and dimension. Lastly, understanding such processes of ideation can possibly provide us assistance in the intuitive formulation of ways to enrich Western architecture. Particularly, establishing poetic connections to our cultural traditions can be a useful strategy to prevent Western architecture's frequent falls into empty excesses of utilitarianism, iconicism or simple banality. Esta tesis en parte intenta explorar la capacidad de la pintura china pre-moderna en sus peculiares formatos y esquemas para lograr expresar la profundidad del espacio y la duración del tiempo, como una manera de interpretar y diseñar arquitectura contemporánea. Mediante un estudio de la pintura tradicional de temática paisajística y urbana, y a diferentes escalas, se analizará el lenguaje poético de la pintura china. Más allá de las técnicas pictóricas, este lenguaje se sitúa en un nivel ideológico de comprensión y experiencia; expresa, por tanto, una gama de significados más amplia que la mera representación arquitectónica, actúa como lo haría un medio verbal para expresar una semántica de tipo crítico y narrativo, además de los consiguientes efectos visuales. En esta tesis, también veremos cómo la pintura tradicional sigue siendo la base del proceso de creación de ideas de varios arquitectos chinos contemporáneos para evitar así una mera imitación acrítica de modelos internacionales. Una fusión sutil de la contemporaneidad con la identidad cultural proporcionada por la presencia de conceptos de la pintura tradicional permite a esta arquitectura ganar nuevas capas de significado y dimensión. Por último, comprender tales procesos de ideación puede brindarnos ayuda en la formulación intuitiva de formas de enriquecer la arquitectura occidental. En particular, establecer conexiones poéticas con nuestras tradiciones culturales puede ser una estrategia útil para prevenir las frecuentes caídas de la arquitectura occidental en los excesos vacíos del utilitarismo, el iconicismo o la simple banalidad.
In this paper, we study an unmanned aerial vehicle (UAV) communication system, where a ground node (GN) communicate with a UAV assisted by intelligent reflecting surface (IRS) in the presence of a jammer with imperfect location information. We aim to improve the achievable average rate via the joint robust design of UAV trajectory, IRS passive beamforming and GN's power allocation. However, the formulated optimization problem is challenging to solve due to its non-convexity and coupled variables. To overcome the difficulty, we propose an alternating optimization (AO) based algorithm to solve it sub-optimally by leveraging semidefinite relaxation (SDR), successive convex approximation (SCA), and S-procedure methods. Simulation results show that by deploying the IRS near the GN, our proposed algorithm always improves the uplink achievable average rate significantly compared with the benchmark algorithms, while deploying the IRS nearby the jammer is effective only when the jammer's location is perfectly known.
Human pose information is a critical component in many downstream image processing tasks, such as activity recognition and motion tracking. Likewise, a pose estimator for the illustrated character domain would provide a valuable prior for assistive content creation tasks, such as reference pose retrieval and automatic character animation. But while modern data-driven techniques have substantially improved pose estimation performance on natural images, little work has been done for illustrations. In our work, we bridge this domain gap by efficiently transfer-learning from both domain-specific and task-specific source models. Additionally, we upgrade and expand an existing illustrated pose estimation dataset, and introduce two new datasets for classification and segmentation subtasks. We then apply the resultant state-of-the-art character pose estimator to solve the novel task of pose-guided illustration retrieval. All data, models, and code will be made publicly available.
La pandemia del Covid-19 ha dado un vuelco a nuestras vidas, ha cambiado nuestros hábitos, destrozado nuestros planes y, de alguna forma, también ha influenciado nuestros proyectos de futuro a corto, medio e incluso largo plazo. Repasamos cúal ha sido la respuesta de algunas marcas durante estas primeras semanas de crisis y confinamiento; que aún suponiendo un breve lapso de tiempo, han puesto a prueba la creatividad de todos.
We consider the problem of stretching pseudolines in a planar straight-line drawing to straight lines while preserving the straightness and the combinatorial embedding of the drawing. We answer open questions by Mchedlidze et al. by showing that not all instances with two pseudolines are stretchable. On the positive side, for $k\geq 2$ pseudolines intersecting in a single point, we prove that in case that some edge-pseudoline intersection-patterns are forbidden, all instances are stretchable. For intersection-free pseudoline arrangements we show that every aligned graph has an aligned drawing. This considerably reduces the gap between stretchable and non-stretchable instances.
In this paper, I present VQ-DRAW, an algorithm for learning compact discrete representations of data. VQ-DRAW leverages a vector quantization effect to adapt the sequential generation scheme of DRAW to discrete latent variables. I show that VQ-DRAW can effectively learn to compress images from a variety of common datasets, as well as generate realistic samples from these datasets with no help from an autoregressive prior.
The edge-length ratio of a straight-line drawing of a graph is the ratio between the lengths of the longest and of the shortest edge in the drawing. The planar edge-length ratio of a planar graph is the minimum edge-length ratio of any planar straight-line drawing of the graph. In this paper, we study the planar edge-length ratio of planar graphs. We prove that there exist $n$-vertex planar graphs whose planar edge-length ratio is in $Ω(n)$; this bound is tight. We also prove upper bounds on the planar edge-length ratio of several families of planar graphs, including series-parallel graphs and bipartite planar graphs.
Popular Virtual Reality (VR) tools allow users to draw varying-width, ribbon-like 3D brush strokes by moving a hand-held controller in 3D space. Artists frequently use dense collections of such strokes to draw virtual 3D shapes. We propose SurfaceBrush, a surfacing method that converts such VR drawings into user-intended manifold free-form 3D surfaces, providing a novel approach for modeling 3D shapes. The inputs to our method consist of dense collections of artist-drawn stroke ribbons described by the positions and normals of their central polylines, and ribbon widths. These inputs are highly distinct from those handled by existing surfacing frameworks and exhibit different sparsity and error patterns, necessitating a novel surfacing approach. We surface the input stroke drawings by identifying and leveraging local coherence between nearby artist strokes. In particular, we observe that strokes intended to be adjacent on the artist imagined surface often have similar tangent directions along their respective polylines. We leverage this local stroke direction consistency by casting the computation of the user-intended manifold surface as a constrained matching problem on stroke polyline vertices and edges. We first detect and smoothly connect adjacent similarly-directed sequences of stroke edges producing one or more manifold partial surfaces. We then complete the surfacing process by identifying and connecting adjacent similarly directed edges along the borders of these partial surfaces. We confirm the usability of the SurfaceBrush interface and the validity of our drawing analysis via an observational study. We validate our stroke surfacing algorithm by demonstrating an array of manifold surfaces computed by our framework starting from a range of inputs of varying complexity, and by comparing our outputs to reconstructions computed using alternative means.
Pen pressure is an input channel typically available in tablet pen device. To date, little attention has been paid to the use of pressure in the domain of graphical interaction, its usage largely limited to drawing and painting program, typically for varying brush characteristic such as stroke width, opacity and color. In this paper, we explore the use of pressure in 3D curve drawing. The act of controlling pressure using pen, pencil and brush in real life appears effortless, but to mimic this natural ability to control pressure using a pressure sensitive pen in the realm of electronic medium is difficult. Previous pressure based interaction work have proposed various signal processing techniques to improve the accuracy in pressure control, but a one-for-all signal processing solution tend not to work for different curve types. We propose instead a framework which applies signal processing techniques tuned to individual curve type. A neural network classifier is used as a curve classifier. Based on the classification, a custom combination of signal processing techniques is then applied. Results obtained point to the feasibility and advantage of the approach.
Application Specific Instruction-set Processor (ASIP) is one of the popular processor design techniques for embedded systems which allows customizability in processor design without overly hindering design flexibility. Multi-pipeline ASIPs were proposed to improve the performance of such systems by compromising between speed and processor area. One of the problems in the multi-pipeline design is the limited inherent instruction level parallelism (ILP) available in applications. The ILP of application programs can be improved via a compiler optimization technique known as loop unrolling. In this paper, we present how loop unrolling effects the performance of multi-pipeline ASIPs. The improvements in performance average around 15% for a number of benchmark applications with the maximum improvement of around 30%. In addition, we analyzed the variable of performance against loop unrolling factor, which is the amount of unrolling we perform.
We consider the problem of creating plane orthogonal drawings of 4-planar graphs (planar graphs with maximum degree 4) with constraints on the number of bends per edge. More precisely, we have a flexibility function assigning to each edge $e$ a natural number $\mathrm{flex}(e)$, its flexibility. The problem FlexDraw asks whether there exists an orthogonal drawing such that each edge $e$ has at most $\mathrm{flex}(e)$ bends. It is known that FlexDraw is NP-hard if $\mathrm{flex}(e) = 0$ for every edge $e$. On the other hand, FlexDraw can be solved efficiently if $\mathrm{flex}(e) \ge 1$ and is trivial if $\mathrm{flex}(e) \ge 2$ for every edge $e$. To close the gap between the NP-hardness for $\mathrm{flex}(e) = 0$ and the efficient algorithm for $\mathrm{flex}(e) \ge 1$, we investigate the computational complexity of FlexDraw in case only few edges are inflexible (i.e., have flexibility~$0$). We show that for any $\varepsilon > 0$ FlexDraw is NP-complete for instances with $O(n^\varepsilon)$ inflexible edges with pairwise distance $Ω(n^{1-\varepsilon})$ (including the case where they induce a matching). On the other hand, we give an FPT-algorithm with running time $O(2^k\cdot n \cdot T_{\mathrm{flow}}(n))$, where $T_{\mathrm{flow}}(n)$ is the time necessary to compute a maximum flow in a planar flow network with multiple sources and sinks, and $k$ is the number of inflexible edges having at least one endpoint of degree 4.