602 research outputs found
Convolutional Autoencoders and Clustering for Low-dimensional Parametrization of Incompressible Flows
No full textWe provide the complete code base of the presented approaches in the paper.
Jan Heiland and Yongho Kim (2022), Convolutional Auto Encoders and Clustering for Low-dimensional Parametrization of Incompressible Flows, 25th International Symposium on Mathematical Theory of Networks and Systems (MTNS
sj-docx-1-cqx-10.1177_19389655231223359 – Supplemental material for When Does (Mis)Fit Between Customer Service Orientation and Internal Service Qualities Matter for Frontline Employees’ Pride in Membership and Their Behaviors?
No full textSupplemental material, sj-docx-1-cqx-10.1177_19389655231223359 for When Does (Mis)Fit Between Customer Service Orientation and Internal Service Qualities Matter for Frontline Employees’ Pride in Membership and Their Behaviors? by Martin Yongho Hyun, Lisa Gao, Seoki Lee and Hyeon-Cheol Kim in Cornell Hospitality Quarterly</p
Evaluation on Property and Reliability of Micro-bump Joint between Si Chip and Flexible Substrate
No full textConstant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem
No full textFacility location is a prominent optimization problem that has inspired a large quantity of both theoretical and practical studies in combinatorial optimization. Although the problem has been investigated under various settings reflecting typical structures within the optimization problems of practical interest, little is known on how the problem behaves in conjunction with parity constraints. This shortfall of understanding was rather discouraging when we consider the central role of parity in the field of combinatorics.
In this paper, we present the first constant-factor approximation algorithm for the facility location problem with parity constraints. We are given as the input a metric on a set of facilities and clients, the opening cost of each facility, and the parity requirement - odd, even, or unconstrained - of every facility in this problem. The objective is to open a subset of facilities and assign every client to an open facility so as to minimize the sum of the total opening costs and the assignment distances, but subject to the condition that the number of clients assigned to each open facility must have the same parity as its requirement.
Although the unconstrained facility location problem as a relaxation for this parity-constrained generalization has unbounded gap, we demonstrate that it yields a structured solution whose parity violation can be corrected at small cost. This correction is prescribed by a T-join on an auxiliary graph constructed by the algorithm. This auxiliary graph does not satisfy the triangle inequality, but we show that a carefully chosen set of shortcutting operations leads to a cheap and sparse T-join. Finally, we bound the correction cost by exhibiting a combinatorial multi-step construction of an upper bound
A mobility management scheme using SCTP-SIP for real-time services across heterogeneous networks
No full textPolytopic Autoencoders with Smooth Clustering for Reduced-order Modelling of Flows
No full text<p>This repository contains simulation code files for results introduced in the paper "Polytopic Autoencoders with Smooth Clustering for Reduced-order Modelling of Flows". (J. Heiland and Y. Kim)</p>
Convolutional Autoencoders, Clustering, and POD for Low-dimensional Parametrization of Flow Equations [source codes]
No full text<p>This is a repository of the source codes for the paper "J. Heiland and Y. Kim. Convolutional Autoencoders, Clustering, and POD for Low-dimensional Parametrization of Flow Equations".</p>Due to the large file size, it does not contain all pretrained model files. For the training task, a GPU is preferred
High-Performance Poly-Si TFT Using a Poly-Si Film Prepared by a Silicide-Enhanced Rapid Thermal Annealing (SERTA) Process
No full textA Fast SerDes Equalizer Effect-Included Worst Eye Diagram Estimation Method for High-Speed Serial Links
No full textIn this article, a fast serializer/deserializer (SerDes) equalizer effect-included worst eye diagram estimation method is proposed for high-speed serial links. The proposed approach analytically integrates the effects of linear and nonlinear equalizers in the frequency and time domains, respectively, based on the behavior of the equalizers. This approach enables fast single-bit response (SBR) calculations without requiring input/output buffer information specifications, i.e., an algorithmic model interface (IBIS-AMI) model-based transient simulation. Additionally, a modified peak distortion analysis (PDA)-based worst eye estimation method was employed, including the outer contours. To validate the proposed method, tests were conducted in a peripheral component interconnect express (PCIe) Gen 6.0 channel environment configured with various equalizer combinations and different loss conditions. The proposed method achieves eye contour results comparable to those in conventional circuit simulations, operating up to 255 times faster than bit-by-bit methods and up to 66 times faster than the statistical methods. The proposed method offers significant advantages in environments that require rapid exploration of optimal channel and equalizer combinations, providing substantial time savings and efficient evaluations.
- …
