Searcharxiv⌕ Search

arXiv subjects

Wei-Chang Yeh

Publications and source records attributed to Wei-Chang Yeh.

At least 19 recordsLinked to original sources

A Finite Markov Chain Analysis of the Simplified Swarm Optimisation Update Rule

Simplified swarm optimisation (SSO) updates each variable by one draw that copies the global or personal best, keeps the current value or redraws uniformly, with probabilities $c_g$, $c_p$, $c_w$ and $c_r$. As a finite Markov chain under frozen memory, its coordinate kernel $c_w I + (1 - c_w)Π$ has an explicit stationary law and exact convergence rate $c_w^t$. The elitist chain has a geometric hitting-time bound, from a non-optimal start a fixed $c_r$ needs at least $\exp(nc_r/2)$ expected evaluations to reach a unique optimum, and a coupling under changing memories gives $O(n\log n)$ and $O(n^2)$ expected generations on OneMax and LeadingOnes for every population size with redraw share of order $1/n$ and no inertia, and within a $\log n$ factor for fixed inertia. With a frozen memory, inertia cannot speed up first entry into any set from stationary positions, though it can from others. Where the three reference values agree, only $c_r$ acts; where they disagree, copy branches recombine the memories, forcing a redraw only where no active branch holds the target value. Branch logging and checkpoint replay show inertia slowed the tested OneMax and LeadingOnes runs and suggest memory-mediated gains on wider gaps. On Jump functions SSO needed 3.8--8.9 times fewer evaluations than the (1+1) evolutionary algorithm with rate $1/n$, but no consistent advantage over rate-adjusted mutation or a $(μ+1)$ genetic algorithm with uniform crossover was established. The analytical redraw rule improved six of eight benchmark--setting pairs and redundancy allocation, but was slower than $c_r = 0.1$ on Jump$_2$.

cs.NE↗

Inner optimizers in active-learning Kriging reliability analysis: a pre-specified comparison and the unconservative estimates left by unlearned failure modes

Active-learning Kriging often replaces candidate pools by continuous metaheuristic search. A pre-specified comparison sharing surrogate, population and stopping rule isolated this inner optimizer: five budget-matched continuous optimizers, including hybrid swarm optimization with L-BFGS-B polishing, against candidate pools on eleven problems (dimension 2 to 100). The primary hypothesis was not supported: against optimizers sharing its criterion the hybrid won 6, tied 41 and lost 19 of 66 Holm-corrected accuracy comparisons, and against pool methods 0, 23 and 21 of 44. With sequential selection on three series systems, multistart L-BFGS-B left a failure mode unlearned in 59 of 60 runs, more often than swarm, genetic-algorithm or AK-MCS. In all 198 runs (22 post-freeze) with an unlearned mode, the learned modes did not compensate and failure probability was underestimated (exploratory). The error criterion can accept substantial underestimation: it accepted 17 runs (13 pool-selected) at 0.38 to 0.89 of the reference; 181 exhausted the budget. Follow-up analyses on single-design-point problems indicate underestimation when selections concentrate near the design point. Kriging-believer pool selection satisfied the surrogate stopping criterion with fewer calls than the best continuous method in all four informative batch cells (two post-freeze). We recommend default pool selection and coverage checks for any selection.

cs.CE↗

Simplified Swarm Optimization for Surrogate-Assisted Reliability Design of Insulated-Gate Bipolar Transistor Power Modules Using an Open-Source Process Finite-Element Model

Process-induced warpage, ceramic stress and solder strain limit the reliability of insulated-gate bipolar transistor (IGBT) modules on direct-bonded copper (DBC) substrates. Surrogate-assisted design studies train regression models on finite-element analysis (FEA) databases, but rarely check the optimized designs against new FEA or report how surrogate error interacts with the optimizer. This paper builds and evaluates an open pipeline: an open-source process finite-element model, surrogates tuned by Simplified Swarm Optimization (SSO), multi-objective design search, FEA confirmation of selected designs and confirmation-driven infill. The model starts at the second reflow and reproduces measured warpage within 18.2%, 33.6% and 15.3% at the reflow, housing and molding stages without fitted parameters. On a balanced 60-design database, all stochastic tuners reach the same test accuracy, outperform the published grid on cross-validated performance for every output but generalize better only for warpage; the cross-validated ranking of tuners does not transfer to the test set. With equal result reporting, multi-objective SSO and the non-dominated sorting genetic algorithm II give comparable Pareto fronts; a corrected multi-objective particle swarm optimizer trails both. FEA confirmation shows that warpage predictions hold (mean absolute error 0.5%), whereas at the design-space bounds reached by the optimizers the ceramic-stress surrogate is optimistic by up to 26%. Two confirmation-driven infill rounds reduce this error to 1-10% and halve the out-of-sample error; no confirmed design improves on the database in ceramic stress. Ceramic-stress results are indicative, as the metric is mesh-sensitive at production resolution. The model, database, scripts and pre-registered and post-registration results are released.

cs.NE↗

Time-reliability optimization of multi-pass underfill dispensing sequences on printed circuit boards: a schedule-dependent reliability model solved by a multiset-permutation binary-addition-tree algorithm

Multi-pass underfill dispensing couples cycle time with process reliability because the sequence determines the inter-pass flow times. This paper formulates a tri-objective multiset-permutation routing model that minimises nominal cycle time and additive duration variance while maximising reliability under hard- and soft-dwell policies; reliability combines pass, schedule-dependent flow and travel terms. Under independent durations and deterministic dwell thresholds, the variance measure equals the cycle-time variance under soft dwell and bounds it from above under hard dwell. A multiset-permutation binary-addition-tree algorithm enumerates the feasible routes without duplication and prunes prefixes by dominance. Six instances, including three BeagleBone Black benchmarks, yield reference Pareto fronts, the largest search space of $1.47 \times 10^{12}$ routes in 38 minutes on 20 CPU cores. Among simulated candidates, the nominally cost-selected routes incur maximum estimated excess costs of USD 0.0014 per board at the modelled duration variability and USD 0.0035 with it doubled. Round-robin dispatch is within 3.7 % of the reference optimum at the tested costs; NSGA-II and simplified swarm optimisation show at most 0.53 % observed cost regret while recovering about 30 % of the largest hard-dwell front. The framework quantifies sequencing trade-offs and heuristic decision regret; physical reliability prediction requires inspection-based calibration.

math.OC↗

Shared-End-First Control Ordering in Clean-Ancilla V-Chain Synthesis of Nested Multi-Controlled Cascades: A Quantum Binary-Addition-Tree Case Study

Control order is logically irrelevant for a multi-controlled-X gate but can become physically consequential after ordered ancilla-chain synthesis. This work derives and validates a shared-end-first ordering rule for nested-control cascades, using reversible Binary-Addition-Tree (BAT) successor circuits as the primary case. Under Maslov clean-v-chain synthesis, pre-optimization CX cost is order-invariant, whereas shared-end-first ordering exposes P(m)=(m-4)(m-3)/2 inverse relative-phase-CCX pairs across stage boundaries; standard optimization removes 6P(m) CX, giving 12m-31 for QBAT after an independently derived two-CX terminal identity. At m=20, retaining an ascending control list after mirroring the BAT direction yields 1,025 CX, while mirroring the chain orientation restores 209. A disjoint-target nested cascade reproduces the same cancellation count for count, showing that BAT target geometry is not required; an ordered dirty-v-chain control shows zero orientation advantage, delimiting the mechanism within the tested synthesis families. Independent ripple-carry baselines give 11m-28 CX on FULL connectivity, so the QBAT/RC ratio approaches 12/11, with equal natural width 2m-3 in the tested QBAT-A1 and INC_RC implementations. The contribution is a synthesis-ordering rule that exposes cancellation to an existing optimizer, not a new optimizer pass or a universal MCX rule.

cs.ET↗

Exact Multistate Reliability and Upgrade Design for Heterogeneous HBM Systems via Threshold-Pruned BAT

High Bandwidth Memory (HBM) systems can exhibit partial service rather than only full service or complete isolation: a controller-visible service unit may deliver full, reduced, or zero bandwidth because of sub-channel isolation, lane remapping, or protection overhead. This paper develops an exact multistate reliability framework in which each service unit carries an arbitrary finite set of bandwidth states and reliability is the probability that aggregate delivered bandwidth meets a demand. The binary k-out-of-n model is recovered as a special case, while closed-form binary-mapping error relations quantify mean-bandwidth distortion and provide a screening test for the simpler abstraction. For exact single-threshold evaluation a threshold-pruned multistate Binary-Addition-Tree (TP-mBAT) algorithm is proposed. It is deliberately regime-specific: fixed-grid dynamic programming is preferable on a compact common grid, where a 16-unit commensurate control required 273 pruned-DP updates versus 362,506 TP-mBAT node visits. On a reproducible 14-unit incommensurate benchmark, TP-mBAT is compared against a dynamic program carrying the same threshold rules, so that no baseline is weakened. Both expand the same state space, 6,862 nodes against 6,861 updates, and the separation lies entirely in retained state: 17 traversal entries against 412,121 probability states at central demand, reducing measured peak storage from 25.02 MB to 1,152 B. An exact probability-transfer sensitivity identifies when moving mass from a degraded state to a higher-bandwidth state changes system success, and a reserved-unit floor model admits a third exact pruning rule that is vacuous without such floors. A latent package-state mixture captures shared stress, where ignoring dependence overstates reliability by 8.73 percentage points.

cs.AR↗

Exact Anchoring and a Dualization-Based Matheuristic for Bi-Level Dual-Defense Network Interdiction

Bi-level interdiction models are frequently solved by metaheuristics whose solution quality cannot be assessed, because exact optima are unavailable at the scales tested. We supply them for the bi-level dual-defense attacker model (BDAM), which couples node interdiction, edge destruction and capacitated supply support, and which we previously solved by a hybrid metaheuristic. First, BDAM's dominant attacker-path term admits an exact single-level reformulation by lower-level dualization, a reduction available whenever arc lengths are linear in the defender's binary decisions; the resulting mixed-integer program certifies optimality on all eighteen three-row and five-row configurations of our earlier benchmark, seventeen in under ten seconds, with strong uncertified incumbents out to 15*30 grids. Our published averages sit 3.55% below that frontier, and the gap widens with scale. Second, the supply rule, like any rule priced on a single attacker shortest path, is ill-posed under ties, and our threat-corridor formulation is tie-invariant by construction. The tie-break moves the objective by under 10^(-3) but the realized supply cost by up to 0.83 units, so the defect is suppressed by the objective weight rather than absent. Third, MILP-DA pairs the exact anchor with the corridor decode and a feasibility repair; compared against our published figures with no re-implementation on either side, it wins on thirteen of eighteen certified configurations and on all eighteen larger ones, every loss falling on a three-row grid.

math.OC↗

Binary Weight Allocation for Multi-Objective Path Optimization: Efficient Earliest and Latest Path Discovery in Network Systems

This paper proposes earliest and latest path algorithms based on binary weight allocation, assigning weights of 2(i-1) and 2(m-i) to the i-th arc in a network. While traditional shortest path algorithms optimize only distance, our approach leverages Binary-Addition-Tree ordering to efficiently identify lexicographically smallest and largest paths that establish connectivity. These paths partition the solution space into three regions: guaranteed disconnection, transitional connectivity, and guaranteed no simple paths. Our weight allocation enables implicit encoding of multiple objectives directly in binary representations, maintaining the O((|V|+|E|)log|V|) complexity of Dijkstra's algorithm while allowing simultaneous optimization of competing factors like reliability and cost. Experimental validation demonstrates significant computational time reduction compared to traditional multi-objective methods. Applications span telecommunications, transportation networks, and supply chain management, providing efficient tools for network planning and reliability analysis under multiple constraints.

math.CO↗

Data-Driven Approximation of Binary-State Network Reliability Function: Algorithm Selection and Reliability Thresholds for Large-Scale Systems

Network reliability assessment is pivotal for ensuring the robustness of modern infrastructure systems, from power grids to communication networks. While exact reliability computation for binary-state networks is NP-hard, existing approximation methods face critical tradeoffs between accuracy, scalability, and data efficiency. This study evaluates 20 machine learning methods across three reliability regimes full range (0.0-1.0), high reliability (0.9-1.0), and ultra high reliability (0.99-1.0) to address these gaps. We demonstrate that large-scale networks with arc reliability larger than or equal to 0.9 exhibit near-unity system reliability, enabling computational simplifications. Further, we establish a dataset-scale-driven paradigm for algorithm selection: Artificial Neural Networks (ANN) excel with limited data, while Polynomial Regression (PR) achieves superior accuracy in data-rich environments. Our findings reveal ANN's Test-MSE of 7.24E-05 at 30,000 samples and PR's optimal performance (5.61E-05) at 40,000 samples, outperforming traditional Monte Carlo simulations. These insights provide actionable guidelines for balancing accuracy, interpretability, and computational efficiency in reliability engineering, with implications for infrastructure resilience and system optimization.

cs.LG↗

A Cut-Based BAT-MCS Approach for Binary-State Network Reliability Assessment

The BAT-MCS is an integrated Monte Carlo simulation method (MCS) that combines a binary adaptation tree algorithm (BAT) with a self-regulating simulation mechanism. The BAT algorithm operates deterministically, while the Monte Carlo simulation method is stochastic. By hybridizing these two approaches, BAT-MCS successfully reduces variance, increases efficiency, and improves the quality of its binary-state network reliability. However, it has two notable weaknesses. First, the selection of the supervectors, sub-vectors that form the core of BAT-MCS, is overly simplistic, potentially affecting overall performance. Second, the calculation of the approximate reliability is complicated, which limits its strength in reducing variance. In this study, a new BAT-MCS called cBAT-MCS is proposed to enhance the performance of the BAT-MCS. The approach reduces the complexity of MCS. Selecting the super-vector based on a novel layer-cut approach can reduce both runtime and variance. Extensive numerical experiments on large-scale binary-state network demonstrate that the proposed new cBAT-MCS outperforms traditional MCS and original BAT-MCS approaches in terms of computational efficiency and accuracy.

cs.CE↗

Applying Incremental Learning in Binary-Addition-Tree Algorithm for Dynamic Binary-State Network Reliability

This paper presents a novel approach to enhance the Binary-Addition-Tree algorithm (BAT) by integrating incremental learning techniques. BAT, known for its simplicity in development, implementation, and application, is a powerful implicit enumeration method for solving network reliability and optimization problems. However, it traditionally struggles with dynamic and large-scale networks due to its static nature. By introducing incremental learning, we enable the BAT to adapt and improve its performance iteratively as it encounters new data or network changes. This integration allows for more efficient computation, reduced redundancy without searching minimal paths and cuts, and improves overall performance in dynamic environments. Experimental results demonstrate the effectiveness of the proposed method, showing significant improvements in both computational efficiency and solution quality compared to the traditional BAT and indirect algorithms, such as MP-based algorithms and MC-based algorithms.

cs.LG↗

Building Reliable Budget-Based Binary-State Networks

Everyday life is driven by various network, such as supply chains for distributing raw materials, semi-finished product goods, and final products; Internet of Things (IoT) for connecting and exchanging data; utility networks for transmitting fuel, power, water, electricity, and 4G/5G; and social networks for sharing information and connections. The binary-state network is a basic network, where the state of each component is either success or failure, i.e., the binary-state. Network reliability plays an important role in evaluating the performance of network planning, design, and management. Because more networks are being set up in the real world currently, there is a need for their reliability. It is necessary to build a reliable network within a limited budget. However, existing studies are focused on the budget limit for each minimal path (MP) in networks without considering the total budget of the entire network. We propose a novel concept to consider how to build a more reliable binary-state network under the budget limit. In addition, we propose an algorithm based on the binary-addition-tree algorithm (BAT) and stepwise vectors to solve the problem efficiently.

cs.NI↗

Novel Node-Based BAT for Finding All Minimal Cuts

The binary-state network, a basic network, and its components are either working or failed. It is fundamental to all types of current networks, such as utility networks (gas, water, electricity, and 4G/5G), the Internet of Things (IoT), social networks, and supply chains. Network reliability is an important index in the planning, design, evaluation, and control of network systems, and the minimal path (MC) is the basis of an MC-based algorithm for calculating reliability. A new BAT called recursive node-based BAT is proposed and implemented in a recursive manner such that the jth vector in the ith iteration is equal to its parent, which is the jth vector, except that its ith coordinate value is one. Based on time complexity analysis and experiments on 20 benchmark binary-state networks, the proposed recursive node-based BAT is more efficient than the best-known node-based algorithm in finding MCs when combined with powerful rules to discard these infeasible vectors and all their offspring.

eess.SY↗

Development of a Parallel BAT and Its Applications in Binary-state Network Reliability Problems

Various networks are broadly and deeply applied in real-life applications. Reliability is the most important index for measuring the performance of all network types. Among the various algorithms, only implicit enumeration algorithms, such as depth-first-search, breadth-search-first, universal generating function methodology, binary-decision diagram, and binary-addition-tree algorithm (BAT), can be used to calculate the exact network reliability. However, implicit enumeration algorithms can only be used to solve small-scale network reliability problems. The BAT was recently proposed as a simple, fast, easy-to-code, and flexible make-to-fit exact-solution algorithm. Based on the experimental results, the BAT and its variants outperformed other implicit enumeration algorithms. Hence, to overcome the above-mentioned obstacle as a result of the size problem, a new parallel BAT (PBAT) was proposed to improve the BAT based on compute multithread architecture to calculate the binary-state network reliability problem, which is fundamental for all types of network reliability problems. From the analysis of the time complexity and experiments conducted on 20 benchmarks of binary-state network reliability problems, PBAT was able to efficiently solve medium-scale network reliability problems.

cs.DC↗

Newly Developed Flexible Grid Trading Model Combined ANN and SSO algorithm

In modern society, the trading methods and strategies used in financial market have gradually changed from traditional on-site trading to electronic remote trading, and even online automatic trading performed by a pre-programmed computer programs because the continuous development of network and computer computing technology. The quantitative trading, which the main purpose is to automatically formulate people's investment decisions into a fixed and quantifiable operation logic that eliminates all emotional interference and the influence of subjective thoughts and applies this logic to financial market activities in order to obtain excess profits above average returns, has led a lot of attentions in financial market. The development of self-adjustment programming algorithms for automatically trading in financial market has transformed a top priority for academic research and financial practice. Thus, a new flexible grid trading model combined with the Simplified Swarm Optimization (SSO) algorithm for optimizing parameters for various market situations as input values and the fully connected neural network (FNN) and Long Short-Term Memory (LSTM) model for training a quantitative trading model to automatically calculate and adjust the optimal trading parameters for trading after inputting the existing market situation is developed and studied in this work. The proposed model provides a self-adjust model to reduce investors' effort in the trading market, obtains outperformed investment return rate and model robustness, and can properly control the balance between risk and return.

q-fin.TR↗

Novel Recursive Inclusion-Exclusion Technology Based on BAT and MPs for Heterogeneous-Arc Binary-State Network Reliability Problems

Current network applications, such as utility networks (gas, water, electricity, and 4G/5G), the Internet of Things (IoT), social networks, and supply chains, are all based on binary state networks. Reliability is one of the most commonly used tools for evaluating network performance, and the minimal path (MP) is a basic algorithm for calculating reliability. However, almost all existing algorithms assume that all undirected arcs are homogeneous; that is, the probability of an arc from nodes a to b is equal to that from nodes b to a. Therefore, based on MPs, the binary-addition-tree algorithm (BAT), and the inclusion-exclusion technique (IET), a novel recursive inclusion-exclusion technology algorithm known as recursive BAT-based IET (RIE) is proposed to solve the heterogeneous-arc binary-state network reliability problem to overcome the above obstacles in applications. The computational complexity of the proposed RIE is analyzed using an illustrative example. Finally, 11 benchmark problems are used to verify the performance of RIE.

cs.NI↗

QB-II for Evaluating the Reliability of Binary-State Networks

Current real-life applications of various networks such as utility (gas, water, electric, 4G/5G) networks, the Internet of Things, social networks, and supply chains. Reliability is one of the most popular tools for evaluating network performance. The fundamental structure of these networks is a binary state network. Distinctive methods have been proposed to efficiently assess binary-state network reliability. A new algorithm called QB-II (quick binary-addition tree algorithm II) is proposed to improve the efficiency of quick BAT, which is based on BAT and outperforms many algorithms. The proposed QB-II implements the shortest minimum cuts (MCs) to separate the entire BAT into main-BAT and sub-BATs, and the source-target matrix convolution products to connect these subgraphs intelligently to improve the efficiency. Twenty benchmark problems were used to validate the performance of the QB-II.

cs.DS↗

A BAT-based Exact-Solution Algorithm for the Series-Parallel Redundancy Allocation Problem with Mixed Components

The series-parallel (active) redundancy allocation problem with mixed components (RAP) involves setting reliable objectives for components or subsystems to meet the resource consumption constraint, e.g., the total cost. RAP has been an active research area for the past four decades. The NP-hard difficulties confronted by RAP are maintaining feasibility with respect to two constraints: cost and weight. A novel algorithm called the bound-rule-BAT (BRB) based on the binary-addition-tree algorithm (BAT), the dominance rule, and dynamic bounds are proposed to solve the exact solutions of the most famous RAP benchmark problems called the (33-variation) Fyffe RAP. From the experiments, the proposed BRB can solve the Fyffe RAP correctly under the assumption that the maximal number of components of each subsystem is eight, and this is the first exact-solution algorithm that can solve the Fyffe RAP within 8 seconds and 60 seconds if no reliability lower bound is used.

cs.DM↗