Die stacking has enabled 2.5D FPGAs by integrating multiple active dice on a passive silicon interposer for improved yield and capacity, and paved the way for 3D architectures that stack active dice directly atop one another. In these multi-die devices, the unique electrical and physical characteristics of the underlying die-stacking technology impose limitations on inter-die connection density and latency, necessitating a bespoke inter-die routing architecture. However, the absence of accurate and versatile modeling tools has left most questions about how to best design the inter-die routing architecture unanswered. To address this gap, we enhance the open-source FPGA CAD tool VTR to flexibly model a wide range of multi-die routing architectures, and augment VPR's placement and routing engines to improve optimization for both 2.5D and 3D FPGAs. We perform HSPICE-based circuit modeling of inter-die connections for active dice using a 7 nm process node and a 45 nm silicon interposer across several die-crossing technologies. Using this enhanced framework, we conduct a detailed design space exploration of inter-die routing architecture in 2.5D and 3D FPGAs, characterizing the impact o
Aluminum extrusion die manufacturing is a critical task for productive improvement and increasing potential of competition in aluminum extrusion industry. It causes to meet the efficiency not only consistent quality but also time and production cost reduction. Die manufacturing consists first of die design and process planning in order to make a die for extruding the customer's requirement products. The efficiency of die design and process planning are based on the knowledge and experience of die design and die manufacturer experts. This knowledge has been formulated into a computer system called the knowledge-based system. It can be reused to support a new die design and process planning. Such knowledge can be extracted directly from die geometry which is composed of die features. These features are stored in die feature library to be prepared for producing a new die manufacturing. Die geometry is defined according to the characteristics of the profile so we can reuse die features from the previous similar profile design cases. This paper presents the CaseXpert Process Planning System for die manufacturing based on feature based neural network technique. Die manufacturing cases in
Multi-die FPGAs enable device scaling beyond reticle limits but introduce severe interconnect overhead across die boundaries. Inter-die connections, commonly referred to as super-long lines (SLLs), incur high delay and consume scarce interposer interconnect resources, often dominating critical paths and complicating physical design. To address this, this work proposes an interconnect-aware logic resynthesis method that restructures the LUT-level netlist to reduce the number of SLLs. The resynthesis engine uses die partitioning information to apply logic resubstitutions, which simplifies local circuit structures and eliminates SLLs. By reducing the number of SLLs early in the design flow, prior to physical implementation, the proposed method shortens critical paths, alleviates pressure on scarce interposer interconnect resources, and improves overall physical design flexibility. We further build a tool flow for multi-die FPGAs by integrating the proposed resynthesis method with packing and placement. Experimental results on the EPFL benchmarks show that, compared with a state-of-the-art framework, the proposed method reduces the number of SLLs by up to 24.8% for a 2-die FPGA and up
Für eine frühzeitige Erkennung von Lieferengpässen müssen Lieferketten in einer geeigneten digitalen Form vorliegen, damit sie verarbeitet werden können. Der für die Datenmodellierung benötigte Arbeitsaufwand ist jedoch, gerade IT-fremden Personen, nicht zuzumuten. Es wurde deshalb im Rahmen dieser Arbeit eine Webanwendung entwickelt, welche die zugrunde liegende Komplexität für den Benutzer verschleiern soll. Konkret handelt es sich dabei um eine grafische Benutzeroberfläche, auf welcher Templates instanziiert und miteinander verknüpft werden können. Für die Definition dieser Templates wurden in dieser Arbeit geeignete Konzepte erarbeitet und erweitert. Zur Erhebung der Benutzerfreundlichkeit der Webanwendung wurde abschließend eine Nutzerstudie mit mehreren Testpersonen durchgeführt. Diese legte eine Vielzahl von nützlichen Verbesserungsvorschlägen offen. -- For early detection of supply bottlenecks, supply chains must be available in a suitable digital form so that they can be processed. However, the amount of work required for data modeling cannot be expected of people who are not familiar with IT topics. Therefore, a web application was developed in the context of this thesis,
The rapid growth of chiplet-based artificial intelligence systems-on-chip (SoCs) has exposed a fundamental gap in semiconductor test methodology. Existing Known Good Die (KGD) screening guarantees pre-assembly functional correctness, yet it offers no probabilistic assurance of post-assembly reliability lifetime. To address this limitation, the present work formalizes the transition from KGD to Known Good Reliable Die (KGRD) screening as a constrained inference problem over incomplete pre-assembly observability. Building upon this formulation, four interlocking contributions are presented: (i) a Bayesian probabilistic risk model that maps pre-assembly telemetry to post-assembly failure likelihood with a quantified observability bias bound; (ii) a safety-gated decision architecture that provides a provable post-assembly failure probability guarantee; (iii) uncertainty-aware disposition boundaries derived from Bayes-optimal decision theory; and (iv) a constrained closed-loop feedback mechanism that delivers consistent model improvement without violating reliability constraints. A Monte Carlo simulation study on N = 4,000 synthetic dies verifies all four theoretical properties and conf
The analyses of ancient coins, and especially the identification of those struck with the same die, provides invaluable information for archaeologists and historians. Nowadays, these die links are identified manually, which makes the process laborious, if not impossible when big treasures are discovered as the number of comparisons is too large. This study introduces advances that promise to streamline and enhance archaeological coin analysis. Our contributions include: 1) First publicly accessible labeled dataset of coin pictures (329 images) for die link detection, facilitating method benchmarking; 2) Novel SSIM-based scoring method for rapid and accurate discrimination of coin pairs, outperforming current techniques used in this research field; 3) Evaluation of clustering techniques using our score, demonstrating near-perfect die link identification. We provide datasets, to foster future research and the development of even more powerful tools for archaeology, and more particularly for numismatics.
3D die-stacked DRAM has emerged as a key technology for delivering high bandwidth and high density for applications such as high-performance computing, graphics, and machine learning. However, different applications place diverse and sometimes diverging demands on power, performance, and area that cannot be universally satisfied with fixed commodity DRAM designs. Die stacking creates the opportunity for a large DRAM design space through 3D integration and expanded total die area. To open and navigate this expansive design space of customized memory architectures that cater to application-specific needs, we introduce DreamRAM, a configurable bandwidth, capacity, energy, latency, and area modeling tool for custom 3D die-stacked DRAM designs. DreamRAM exposes fine-grained design customization parameters at the MAT, subarray, bank, and inter-bank levels, including extensions of partial page and subarray parallelism proposals found in the literature, to open a large previously-unexplored design space. DreamRAM analytically models wire pitch, width, length, capacitance, and scaling parameters to capture the performance tradeoffs of physical layout and routing design choices. Routing awar
Cosmic rays and background radioactive decay can deposit significant energy into superconducting quantum circuits on planar chips. This energy converts into pair-breaking phonons that travel across the substrate and generate quasiparticles, leading to correlated energy and phase errors in nearby qubits. To mitigate this, we fabricated two separate dies and placed them adjacently without a galvanic connection between them. This blocks phonon propagation from one die to the other. Using microwave kinetic inductance detectors on both dies, we successfully detected high-energy bursts and conclusively demonstrated the blocking effect. However, we also observed simultaneous events in both dies, likely from a single cosmic particle traversing both dies.
Nichtverbale Signale sind ein elementarer Bestandteil der menschlichen Kommunikation. Sie erfüllen eine Vielzahl von Funktionen bei der Klärung von Mehrdeutigkeiten, der subtilen Aushandlung von Rollen oder dem Ausdruck dessen, was im Inneren der Gesprächspartner vorgeht. Viele Studien mit sozial-interaktiven Robotern zeigen, dass vom Menschen inspirierte Bewegungsmuster ähnlich interpretiert werden wie die von realen Personen. Dieses Kapitel erläutert daher die wichtigsten Funktionen, welche die jeweiligen Bewegungsmuster in der Kommunikation erfüllen, und gibt einen Überblick darüber, wie sie auf Roboter übertragen werden können. -- Non-verbal signals are a fundamental part of human communication. They serve a variety of functions in clarifying ambiguities, subtly negotiating roles, or expressing what is going on inside the interlocutors. Many studies with socially-interactive robots show that human-inspired movement patterns are interpreted similarly to those of real people. This chapter therefore explains the most important functions that the respective movement patterns fulfill in communication and gives an overview of how they can be transferred to robots.
Due to their complex spatial structure and diverse geometric features, achieving high-precision and robust point cloud registration for complex Die Castings has been a significant challenge in the die-casting industry. Existing point cloud registration methods primarily optimize network models using well-established high-quality datasets, often neglecting practical application in real scenarios. To address this gap, this paper proposes a high-precision adaptive registration method called Multiscale Efficient Deep Closest Point (MEDPNet) and introduces a die-casting point cloud dataset, DieCastCloud, specifically designed to tackle the challenges of point cloud registration in the die-casting industry. The MEDPNet method performs coarse die-casting point cloud data registration using the Efficient-DCP method, followed by precision registration using the Multiscale feature fusion dual-channel registration (MDR) method. We enhance the modeling capability and computational efficiency of the model by replacing the attention mechanism of the Transformer in DCP with Efficient Attention and implementing a collaborative scale mechanism through the combination of serial and parallel blocks.
The extinction of species is a major problem of concern with a large literature. Our investigation gives insight into when species extinctions must occur, with an emphasis on determining which species might possibly die out and on how fast they die out. We investigate a differential equations model for population interactions with the goal of determining when several species (\ie, coordinates of a bounded solution) must die out or ``go extinct'' and must do so exponentially fast. Typically each coordinate represents the population density of a different species. For our main tool, we create what we call ``die-out'' Lyapunov functions. A given system may have several or many such functions, each of which is a function of a different set of coordinates. That die-out function implies that one of the species in its subset must die out exponentially fast -- for almost every choice of coefficients of the system. We create a ``team'' of die-out functions that work together to show that $k$ species must die, where $k$ is determined separately. Secondly, we present a ``trophic'' condition for generalized Lotka-Volterra systems that guarantees that there is a trapping region that is globally
Boltzmann's work, ``Ueber die sogenannte H-Curve," discusses his demonstration of the essential characteristics of the H-curve in a clear, concise, and precise style, showcasing his efforts to persuade his peers. To make these findings more widely accessible, the author aims to provide a translated version of the original article, while also correcting some typographical errors in the mathematical expressions with explanatory footnotes. The final section offers concluding remarks with graphs and relevant references for interested readers.
Die studies are fundamental to quantifying ancient monetary production, providing insights into the relationship between coinage, politics, and history. The process requires tedious manual work, which limits the size of the corpora that can be studied. Few works have attempted to automate this task, and none have been properly released and evaluated from a computer vision perspective. We propose a fully automatic approach that introduces several innovations compared to previous methods. We rely on fast and robust local descriptors matching that is set automatically. Second, the core of our proposal is a clustering-based approach that uses an intrinsic metric (that does not need the ground truth labels) to determine its critical hyper-parameters. We validate the approach on two corpora of Greek coins, propose an automatic implementation and evaluation of previous baselines, and show that our approach significantly outperforms them.
Multi-die FPGAs are widely adopted to deploy large hardware accelerators. Two factors impede the performance optimization of HLS designs implemented on multi-die FPGAs. On the one hand, the long net delay due to nets crossing die-boundaries results in an NP-hard problem to properly floorplan and pipeline an application. On the other hand, traditional automated searching flow for HLS directive optimizations targets single-die FPGAs, and hence, it cannot consider the resource constraints on each die and the timing issue incurred by the die-crossings. Further, it leads to an excessively long runtime to legalize the floorplan of HLS designs generated under each group of configurations during directive optimization due to the large design scale. To co-optimize the directives and floorplan of HLS designs on multi-die FPGAs, we propose the FADO framework, which formulates the directive-floorplan co-search problem based on the multi-choice multi-dimensional bin-packing and solves it using an iterative optimization flow. For each step of directive search, a latency-bottleneck-guided greedy algorithm searches for more efficient directive configurations. For floorplanning, instead of repetiti
Die analysis is an essential numismatic method, and an important tool of ancient economic history. Yet, manual die studies are too labor-intensive to comprehensively study large coinages such as those of the Roman Empire. We address this problem by proposing a model for unsupervised computational die analysis, which can reduce the time investment necessary for large-scale die studies by several orders of magnitude, in many cases from years to weeks. From a computer vision viewpoint, die studies present a challenging unsupervised clustering problem, because they involve an unknown and large number of highly similar semantic classes of imbalanced sizes. We address these issues through determining dissimilarities between coin faces derived from specifically devised Gaussian process-based keypoint features in a Bayesian distance clustering framework. The efficacy of our method is demonstrated through an analysis of 1135 Roman silver coins struck between 64-66 C.E..
Recent evolutions on forging process induce more complex shape on forging die. These evolutions, combined with High Speed Machining (HSM) process of forging die lead to important increase in time for machining preparation. In this context, an original approach for generating machining process based on machining knowledge is proposed in this paper. The core of this approach is to decompose a CAD model of complex forging die in geometric features. Technological data and topological relations are aggregated to a geometric feature in order to create machining features. Technological data, such as material, surface roughness and form tolerance are defined during forging process and dies design. These data are used to choose cutting tools and machining strategies. Topological relations define relative positions between the surfaces of the die CAD model. After machining features identification cutting tools and machining strategies currently used in HSM of forging die, are associated to them in order to generate machining sequences. A machining process model is proposed to formalize the links between information imbedded in the machining features and the parameters of cutting tools and ma
The analysis and the simulation of fluid extruded out of a die opening are of great importance in different industrial applications. Mathematical modeling and experimental studies of extrusion out of a constant die gap has been the subject of numerous publications in the literature. Extrusion Blow Molding is a polymer forming technique used to manufacture a wide range of large hollow parts such as fuel tanks used in the automotive industry. The die gap is varied during extrusion to adjust the manufactured product's final thickness and to compensate for uneven stretching during molding. In this work, mathematical modeling of varying die gap extrusion is introduced. Two models using different approaches are presented to model the time dependent effects of varying the die gap on the extrudate. In the first approach, physics based partial differential equations are used to simulate extrusion. The Navier Stokes equations are used as governing equations to simulate molten polymers. The governing equations are solved using Arbitrary Lagrangian Eulerian based Finite Element Method. A novel numerical method for defining the free surface of the extrudate is proposed. In addition, the effects
This paper looks into the gain or loss from rolling a fair die multiple times and choosing the highest or lowest number as the outcome over rolling the die just once. Specifically, this paper gives a general formula for the expected value of choosing the highest or lowest value of any number of die rolls and sides. It also shows how, for a fixed number of rolls, the ratio between this expected value and the number of sides converges as the number of sides increases asymptotically. The converging behavior of this ratio helps formulate the aforementioned gain or loss.
This paper explains the DYCOS-Algorithm as it was introduced in by Aggarwal and Li in 2011. It operates on graphs whichs nodes are partially labeled and automatically adds missing labels to nodes. To do so, the DYCOS algorithm makes use of the structure of the graph as well as content which is assigned to the node. Aggarwal and Li measured in an experimental analysis that DYCOS adds the missing labels to a Graph with 19396 nodes of which 14814 are labeled and another Graph with 806635 nodes of which 18999 are labeld on one core of an Intel Xeon 2.5 GHz CPU with 32 G RAM within less than a minute. Additionally, extensions of the DYCOS algorithm are proposed. ----- In dieser Arbeit wird der DYCOS-Algorithmus, wie er 2011 von Aggarwal und Li vorgestellt wurde, erklärt. Er arbeitet auf Graphen, deren Knoten teilweise mit Beschriftungen versehen sind und ergänzt automatisch Beschriftungen für Knoten, die bisher noch keine Beschriftung haben. Dieser Vorgang wird "Klassifizierung" genannt. Dazu verwendet er die Struktur des Graphen sowie textuelle Informationen, die den Knoten zugeordnet sind. Die von Aggarwal und Li beschriebene experimentelle Analyse ergab, dass er auch auf dynamischen
We discuss challenges to control systems engineering arising from the advent of cyber-physical systems (CPS). After discussing the terminology, general, IT-related issues are treated which need cooperation with computer science, in particular software engineering. Then we study those challenges that require specific core competencies from control systems engineering. We sketch solution approaches for the exemplary problem of dealing with changes in the physical environment of a CPS. ---- Der Beitrag befasst sich mit den methodischen Herausforderungen, die durch die Verbreitung der Cyber-Physical Systems (CPS) in der Automatisierungstechnik entstehen, und stellt Lösungsansätze vor. Nach einer Behandlung des Begriffs CPS werden zunächst die allgemeinen, IT-bezogenen Fragestellungen angesprochen, die gemeinsam mit der Informatik gelöst werden müssen. Danach gehen wir auf die Herausforderungen ein, deren Behandlung spezifisch automatisierungstechnische Kernkompetenzen erfordern und skizzieren für eine beispielhafte Problemstellung, den Umgang mit Änderungen in der physikalischen Umgebung, wie entsprechende Lösungen aussehen können.