Let U0, U1 be two normal measures on κ. We say that U0 is in the Mitchell oredering less then U1, U0 ⊳ U1, if U0 ∈ Ult(V, U1). The ordering is wellknown to be transitive and well-founded. It has been an open problem to find a model where ⊳ embeds the four-element poset | |. We find a generic extension where all well-founded posets are embeddable. Hence there is no structural restriction on the ...

A characterization of the Mathieu group M12 is established; the characterization is used by Aschbacher and Smith in their classification of the quasithin finite simple groups. This is one in a series of papers providing simplified, modern, computer free treatments of the existence and uniqueness of the sporadic groups, and of the normalizers of subgroups of prime order and Sylow subgroups in th...

We propose covert beamforming design frameworks for integrated radar sensing and communication (IRSC) systems, where the can covertly communicate with legitimate users under cover of probing waveforms without being detected by eavesdropper. Specifically, jointly designing target detection beamformer beamformer, we aim to maximize mutual information (MI) (or rate) subject constraint, rate constr...

We consider several fading channel models for which we aim to maximize ergodic capacity subject to different power constraints assuming that channel state information (CSI) is available at both the transmitter and the receiver. We characterize the optimal power allocation structure in the single-inputsingle-output (SISO), multiple-input-single-output (MISO), and multiple-input-multiple-output (...

Constraint answer set programming is a promising research direction that integrates answer setprogramming with constraint processing. Recently, the formal link between this research area andsatisfiability modulo theories (or SMT) was established. This link allows the cross-fertilizationbetween traditionally different solving technologies. The paper presents the system ezsmt, one...

Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. Recently, the formal link between this research area and satisfiability modulo theories (or SMT) was established. This link allows the cross-fertilization between traditionally different solving technologies. The paper presents the system ezsmt, one of the first...

We compare two heuristic approaches, evolutionary computation and ant colony optimisation, and a complete tree-search approach, constraint programming, for solving binary constraint satisfaction problems. We experimentally show that, if evolutionary computation is far from being able to compete with the two other approaches, ant colony optimisation nearly always succeeds in finding a solution, ...

We consider constrained versions of the prize-collecting traveling salesman and the minimum spanning tree problems. The goal is to maximize the number of vertices in the returned tour/tree subject to a bound on the tour/tree cost. We present a 2-approximation algorithm for these problems based on a primal-dual approach. The algorithm relies on finding a threshold value for the dual variable cor...

We call ”on/off” constraint an algebraic constraint that is activated if and only if a corresponding boolean variable is turned ”on” or equal to 1. Our main subject of interest is to derive tight convex formulations of Mixed Integer NonLinear Programs (MINLPs) featuring ”on/off” constraints. We study the simple set defined by one ”on/off” constraint with bounded variables. Using disjunctive pro...

The problem of setting a confidence interval with fixed proportional accuracy for the mean of a normal distribution is considered. A sequential procedure is proposed; and asymptotic expansions for its average coverage probabilities and its expected sample size are obtained. The procedure is shown to have asymptotically minimal expected sample size, subject to a constraint on the error probabili...