In this paper, firstly, we define the k-step generalized Balancing sequences and study Binet formula of these sequences. Also, find families super-diagonal matrices such that permanents are elements Finally, examine periods in semi-direct product presented by G = < x, y | x2m−1 y2 1, yxy x−1 > for generating pair (x, y).

We study excited spherical branes (“giant gravitons”) in AdS × S spacetimes with background flux. For large excitation, these branes may be treated semiclassically. We compute their spectra using Bohr-Sommerfeld quantization and use the AdS/CFT correspondence to relate them to anomalous dimensions in the dual field theory at strong coupling, expressed as a series expansion in powers of 1/N . Th...

This paper proposes an implementable proximal quasi-Newton method for minimizing a nondifferentiable convex function f in <n . The method is based on Rockafellar’s proximal point algorithm and a cutting-plane technique. At each step, we use an approximate proximal point p(xk) of xk to define a vk ∈ ∂ k f(p(xk))with k ≤ α‖vk‖,where α is a constant. The method monitors the reduction in the value ...

We search for nonlinear effects in nuclear giant resonances (GRs), in particular the isovector dipole and the isoscalar quadrupole modes. To that end, we employ a spectral analysis of time-dependent Hartree-Fock (TDHF) dynamics using Skyrme forces. Based on TDHF calculations over a wide range of excitation amplitudes, we explore the collectivity and degree of harmonic motion in these modes. Bot...

We review the step-by-step method of constructing finitely generated free modal algebras. First we discuss the global step-by-step method, which works well for rank one modal logics. Next we refine the global step-by-step method to obtain the local step-by-step method, which is applicable beyond rank one modal logics. In particular, we show that it works well for constructing the finitely gener...

On modern large-scale parallel computers, the performance of Krylov subspace iterative methods is limited by global synchronization. This has inspired the development of s-step (or communication-avoiding) Krylov subspace method variants, in which iterations are computed in blocks of s. This reformulation can reduce the number of global synchronizations per iteration by a factor of O(s), and has...

In this paper, we present a hybrid clustering method that combines the divisive hierarchical clustering with the agglomerative hierarchical clustering. We used the bisect K-means divisive clustering algorithm in our method. First, we cluster the document collection using bisect K-means clustering algorithm with K’ > K as the total number of clusters. Second, we calculate the centroids of K’ clu...