Foundations

As a contribution to automated set-theoretic inferencing, a translation is proposed of conjunctions of literals of the forms , , and $z=\left\{x\right\}$, where stand for variables ranging over the von Neumann universe of sets, into quantifier-free Boolean formulae of a rather simple conjunctive normal form. The formulae in the target language involve variables ranging over a Boolean ring of sets, along with a difference operator and relators designating equality, non-disjointness, and inclusion. Moreover, the result of each translation is a conjunction of literals of the forms and and of implications whose antecedents are isolated literals and whose consequents are either inclusions (strict or non-strict) between variables, or equalities between variables. Besides reflecting a simple and natural semantics, which ensures satisfiability preservation, the proposed translation has quadratic algorithmic time complexity and bridges two languages, both of which are known to have an $\mathsf{NP}$-complete satisfiability problem.

Global optimization represents a fundamental challenge in computer science and engineering, as it aims to identify high-quality solutions to problems spanning from moderate to extremely high dimensionality. The Differential Evolution (DE) algorithm is a population-based algorithm like Genetic Algorithms (GAs) and uses similar operators such as crossover, mutation and selection. The proposed method introduces a set of methodological enhancements designed to increase both the robustness and the computational efficiency of the classical DE framework. Specifically, an adaptive termination criterion is incorporated, enabling early stopping based on statistical measures of convergence and population stagnation. Furthermore, a population sampling strategy based on k-means clustering is employed to enhance exploration and improve the redistribution of individuals in high-dimensional search spaces. This mechanism enables structured population renewal and effectively mitigates premature convergence. The enhanced algorithm was evaluated on standard large-scale numerical optimization benchmarks and compared with established global optimization methods. The experimental results indicate substantial improvements in convergence speed, scalability and solution stability.

The structural vibration of industrial droplet dispensers can be modeled by telegraph-like equations to a good approximation. We reinterpret the telegraph equation from the standpoint of an electric–circuit system consisting of an inductor and a resistor, which is in interaction with an environment, say, a substrate. This interaction takes place through a capacitor and a shunt resistor. Such interactions serve as leakage. We have performed an analytical investigation of the frequency dispersion of telegraph equations over an unbounded one-dimensional domain. By varying newly identified key parameters, we have not only recovered the well-known characteristics but also discovered crossover phenomena regarding phase and group velocities. We have examined frequency responses of the electric circuit underlying telegraph equations, thereby confirming the role as low-pass filters. By identifying a set of physically meaningful reduced cases, we have laid the foundations on which we could further explore wave propagations over a finite domain with appropriate side conditions.