The aim of this paper is to present an explicit reduction algorithm for Hilbert modular groups over arbitrary totally real number fields. An implementation the available download from [20] . exposition self-contained and sufficient details are given reader understand how it works implement their own version if desired.

assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. in this study, we solve quadratic assignment problem (qap), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. it should be noted that any facility must be assign to only one location. in this paper, first o...

distributed generations (dgs) are utilized to supply the active and reactive power in the transmission and distribution systems. these types of power sources have many benefits such as power quality enhancement, voltage deviation reduction, power loss reduction, load shedding reduction, reliability improvement, etc. in order to reach the above benefits, the optimal placement and sizing of dg is...

Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...

brain-computer interface systems are a new mode of communication which provides a new path between brain and its surrounding by processing eeg signals measured in different mental states.  therefore, choosing suitable features is demanded for a good bci communication. in this regard, one of the points to be considered is feature vector dimensionality. we present a method of feature reduction us...

We generalize the Gauss algorithm for the reduction of two–dimensional lattices from the l2-norm to arbitrary norms and extend Vallée’s analysis [J. Algorithms 12 (1991), 556-572] to the generalized algorithm.

In this paper, we give a definition of an optimally reduced basis for a lattice in the sense that an optimally reduced basis is a shortest basis for the lattice. Then we present an algorithm for computing an approximation of an optimally reduced basis for a lattice using a novel unimodular transformation. To compare lattice bases, we propose a quantitative measure of the degree of the linear in...

The recently developed algorithm FIRE performs the reduction of Feynman integrals to master integrals. It is based on a number of strategies, such as applying the Laporta algorithm, the s-bases algorithm, region-bases and integrating explicitly over loop momenta when possible. Currently it is being used in complicated three-loop calculations. Supported by RFBR grant 08-02-01451-a and DFG throug...