Acoustic echo cancellation (AEC) is a well-known application of adaptive filters in communication acoustics. To implement AEC for multichannel reproduction systems, powerful adaptation algorithms like the generalized frequency-domain adaptive filtering (GFDAF) algorithm are required for satisfactory convergence behavior. In this paper, the GFDAF algorithm is rigorously derived as an approximati...

Objective The main purpose of this article is to choose the best predictive model for IVF/ICSI classification and to calculate the probability of IVF/ICSI success for each couple using Artificial intelligence. Also, we aimed to find the most effective factors for prediction of ART success in infertile couples. MaterialsAndMethods In this cross-sectional study, the data of 486 patients are colle...

We give a machine-checked definition and proof of semantic correctness for Danvy and Filinski’s properly tail-recursive, one-pass, call-by-value CPS transformation. We do so in the setting of the pure λ -calculus extended with a let construct. We propose a new first-order, one-pass, compositional formulation of the transformation. We point out that Danvy and Filinski’s simulation diagram does n...

We consider a variant of the vehicle routing problems with time windows, where the objective includes the inconvenience cost modeled by a convex function on each node. We formulate this mixed integer convex program using a novel set partitioning formulation, by considering all combinations of routes and block structures over the routes. We apply a branch-and-price framework to solve this formul...

In this article, we examine the solution of minimum-effort optimal control problems for open-chain manipulators. An approximate solution to the optimal control problem is determined by a constrained parameter optimization over a set of B-spline basis functions. We demonstrate that the parameter-optimization formulation of the problem is numerically ill-conditioned, and that it is therefore esse...

In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V,E) with an assignment of the vertices to horizontal layers, a plane drawing of G (with y-monotone edges) can be specified by stating for each layer the order of the vertices lying on and the edges intersecting that layer. Given these orders and a recursive partition of the vertices int...

Let k be an arbitrary field (of arbitrary characteristic) and let X = [xi,j] be a generic m × n matrix of variables. Denote by I2(X) the ideal in k[X] = k[xi,j ∶ i = 1, . . . ,m; j = 1, . . . , n] generated by the 2 × 2 minors of X. We give a recursive formulation for the lengths of the k[X]module k[X]/(I2(X) + (x q 1,1, . . . , x q m,n)) as q varies over all positive integers using Gröbner bas...

we give a new recursive method to compute the number of cliques and cycles of a graph. this method is related, respectively to the number of disjoint cliques in the complement graph and to the sum of permanent function over all principal minors of the adjacency matrix of the graph. in particular, let $g$ be a graph and let $overline {g}$ be its complement, then given the chromatic polynomial of...