196,388 research outputs found
Nyctelia kulzeri Marcuzzi
Nyctelia kulzeri Marcuzzi (Fig. 19) Nyctelia kulzeri Marcuzzi, 1977: 141; Flores 1997: 9 (list). Diagnosis. See Marcuzzi (1977). Discussion. Kulzer (1963) did not see the type of Nyctelia blapoides described by Fairmaire (1905) and in his redescription of this species, Kulzer (1963) based his observations on misidentified specimens that represented a new species at that time, later described by Marcuzzi (1977) as N. kulzeri without knowing that fact. Recently Flores & Carrara (2006) in describing Nyctelia nevadoensis, presented a comparative note with N. blapoides but such specimens of N. blapoides identified with the key of Kulzer (1963) really belong to N. kulzeri. Using the key of Kulzer (1963) for Nyctelia, specimens of both species N. blapoides and N. kulzeri actually key out at couplet 6 (5) of the group 5 for N. blapoides. Nyctelia kulzeri has pronotum smooth, without punctures, lateral margin arcuate towards anterior, widest at base (Fig. 19); elytra with terminal apophysis semicircular, with 11–13 deep, rugose, transverse grooves, lateral margin sinuate, not crenulated, marked by transverse grooves (Fig. 19); on the other hand, N. blapoides exhibits pronotum with abundant, large and small punctures, lateral margin concave, widest at mid-point (Fig. 18); elytra without terminal apophysis, with 7–9 shallow, almost straight, transverse grooves, lateral margin straight, crenulated, not marked by transverse grooves (Fig. 18). Type material. Holotype: [Neuquén/ Pilmatué/ 12 -V- 64 (pro 1964)] [Holotypus] [Nyctelia / kulzeri / mihi] [Holotypus / Nyctelia / kulzeri / Marcuzzi, 1977] [Museo Genova/ coll. G. Marcuzzi/ (acquisto 2000)] (MSNG). Other material examined. ARGENTINA: Neuquén: Dto. Loncopué: Loncopué, IX- 1959, M. Gentili, (11 IADIZA, 1 MACN), VII- 1959, J. Bertezene, 1 (IADIZA); Dto. Picunches: 14 km N Bajada del Agrio, 11 - I- 2003, G. Flores, 3 (IADIZA). Distribution. Known only from a restricted area of central-western Neuquén province of Argentina, in the Patagonian biogeographic province, Payunia district (Morrone et al., 2002).Published as part of Flores, Gustavo E., 2009, Revision of some types of the South American tribes Nycteliini, Praocini, and Scotobiini (Coleoptera: Tenebrionidae), with new synonymies, pp. 21-33 in Zootaxa 1985 on pages 31-32, DOI: 10.5281/zenodo.27464
An Approximate Waves-Bordering Algorithm for Adaptive Finite Elements Analysis
In this paper an Approximate Waves-Bordering algorithm (AWB) is
presented. It computes the Finite Elements linear system solution-update after a
refinement/un-refinement step. This is done taking into consideration only
the equations that corresponds to the nodes whose solution is modified
above a certain tolerance and it shows to be very efficient. The algorithm
considers an increasing set of equations that updates recursively and stops when the norm of the residual has gone under a user-defined threshold
Accurate detection of hidden material changes as fictitious heat sources
In this article we present a numerical method for the estimation of hidden material changes, interpreted as fictitious source terms. The method adapts the parameters of its reference model in order to cancel the estimated fictitious source terms and thus it indirectly estimates the hidden material changes. The novelty of this method is triple: first, a parsimonious minimization strategy that effectively avoids local minima, by using the maximum principle as a barrier against falling into; second, an error indicator based on estimates of fictitious heat sources, instead of the temperatures-prediction-error, because it is smeared by diffusion; third, the adaptation of model parameters is computed without the problematic matrix inversion which would arise in Newton-based procedures. As a particular example application, we show that, in thermographic experiments for hidden corrosion detection, the gradient of the temperatures-prediction-error, often used in the literature, is quite inefficient, while the fictitious-source-term estimation behaves intrinsically better. Its accuracy and moderate computational demand are highlighted in the numerical tests. Moreover, this approach is applicable to general hidden material change problems
Deviation maximization for rank-revealing QR factorizations
In this paper, we introduce a new column selection strategy, named here “Deviation Maximization”, and apply it to compute rank-revealing QR factorizations as an alternative to the well-known block version of the QR factorization with the column pivoting method, called QP3 and currently implemented in LAPACK’s xgeqp3 routine. We show that the resulting algorithm, named QRDM, has similar rank-revealing properties of QP3 and better execution times. We present experimental results on a wide data set of numerically singular matrices, which has become a reference in the recent literature
A Fast Numerical Homogenization Algorithm for Finite Element Analysis
A numerical homogenization method is here presented to solve problems
governed by partial differential equations with coefficients that are
generic functions in . It consists of a recursive finite elements discretization and an
algebraic homogenization. This method takes advantages for speed and memory
occupation from the hierarchy of elements and nodes defined by
the recursive discretization. It turns out that using state-of-the-art
general linear algebra techniques, all non-numerical data manipulations that are
typically done before real computations, can be avoided
An Algorithm for the Anisotropic Adaptivity of Unstructured Triangular Meshes
It is well recognized today the importance of anisotropic meshes when it is solved a
problem whose solution exhibits a substantial anisotropy. Most of the times it is better to build
these meshes adaptively, and a corresponding algorithm is proposed in this paper. A comparison
is made with the existing leading algorithms for the adaptive refinement of isotropic meshes, i.e.
regular refinement and longest-edge bisection
Adaptivity in Space and Time for Shallow Water Equations
In this paper, adaptive algorithms for time and space discretizations are added to an existing
solution method previously applied to the Venice lagoon tidal
circulation problem. An analysis of the interactions between space and
time discretizations adaptation algorithms is presented. In particular
it turns out that both error estimation in space and time must be
present for maintaining the adaptation efficient. Several advantages,
for adaptivity and for time decoupling of the equations,
offered by the operator splitting adopted for shallow waters equations
solution are put in evidenc
Stochastic geometry for the analysis of small radio cells and PLC back-hauling
Although powerlines have not been designed for data transmission, recent technical developments in Power Line Communication (PLC) have pushed the offered capacity much higher than expected, making PLC an interesting technology for last mile connections like the back-hauling considered in this work. On the other hand, cellular traffic is doubling every year, and this growth trend is not expected to end soon. Small cells have been advocated as a solution to fragment the network and increase the local capacity; in addition, new generation of mobile communication is likely to employ high frequency bands that will cover smaller areas, hence, an increase in cell density is expected. This will increase the challenge for the realization of a cost effective high performance back-haul to bridge the small cell network with the core network. Nowadays, the back-haul portion of the network is either wireless or high speed wireline (ADSL, optical fiber). This paper introduces the idea of employing PLC to support back-hauling for small radio cells. To assess the back-haul requirements and the performance of the integrated radio-PLC network, a topology model is proposed to describe both the small radio cell network layout and the power delivery grid used to both power and”data” connect the base stations. Then, a parametric cell traffic model is considered to measure the overall traffic to be transported through the PLC network and determine whether (under the power grid topology constraints) the PLC back-haul can meet the traffic demands
- …
