Article history: Received 16 August 2015 Received in revised form 3 December 2015 Accepted 17 December 2015 Available online 21 December 2015

A new and simple approach for calculating the eigenstructure of a regular matrix pencil is presented. This proposed approach transforms the generalized eigenvalues problem into a usual eigenvalues problem, and it also can be used to calculate the Weierstrass form of a regular matrix pencil. Mathematics Subject Classification: 93B55

torsion of many symmetric structures, which were designed based on the seismic codes, is due to their asymmetricity induced during inelastic behavior. although the structure was designed symmetrically assuming elastic based criteria, different factors such as material inconsistency in structure, construction details discrepancy and construction errors may result in asymmetric behavior in inelas...

Hierarchical structure with nested nonlocal dependencies is a key feature of human language and can be identified theoretically in most pieces of tonal music. However, previous studies have argued against the perception of such structures in music. Here, we show processing of nonlocal dependencies in music. We presented chorales by J. S. Bach and modified versions in which the hierarchical stru...

In application-specific SoCs the topology is usually irregular. In this paper we present a mapping tool able to map the initial irregular topology of a SoC system into a logical regular structure (2D-mesh) where a Logic-Based Distributed Routing mechanism (LBDRx) can be applied. The goal is to implement the routing paths without using memory resources. The original topology is not changed. Eval...

Digital elevation models can represent many types of geographic data. One of the common digital elevation models is the triangulated irregular network (also called TIN, or polyhedral terrain, or triangulated terrain). We discuss ways to represent a TIN in a data structure, and give some of the basic algorithms that work on TINs. These include retrieving contour lines, computing perspective view...

Current compilers show ineffective when optimizing complex applications, both analyzing dependences and exploiting data locality and extracting parallelism. Complex applications may be characterized as irregular and dynamic. Irregular applications arrange data as multidimensional arrays and memory is referenced through array indirections. Dynamic applications organize data as pointer-based stru...

Irregular reduction operations are the core of many large scientific and engineering applications. There are, in the literature, different methods to solve these operations in parallel. In this paper we discuss a new technique which improves performance significantly, both in terms of execution time and memory overhead. These improvements are achieved in the preprocessing as well as in the resu...

We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighted zeta function of an (irregular or regular) covering of a graph by equivalence classes of prime, reduced cycles of the base graph. As an application, we discuss the structure of balanced coverings of signed graphs.

We study a generalization of the isomonodromic deformation to the case of connections with irregular singularities. We call this generalization Isostokes Deformation. A new deformation parameter arises: one can deform the formal normal forms of connections at irregular points. We study this part of the deformation, giving an algebraic description. Then we show how to use loop groups and hyperco...