Work on single tone frequency estimation has focused on uniformly sampled data. However, it has been shown that, for a given number of samples, more information on the frequency of a signal can be gained by non-uniform sampling schemes [M. Wieler, S. Trittler, F.A. Hamprecht, Optimal design for single tone frequency estimation, Digital Signal Process., in press]. Unfortunately, an optimum sampling pattern (that, for example, minimizes the Cramér–Rao bound) does not automatically have a fast and simple algorithm for frequency estimation associated with it. For application in an interferometric measurement system, an algorithm is needed that gathers as much information as possible from a low number of samples, while at the same time keeping the computational effort sufficiently low to process millions of time series in a few seconds. This paper proposes a simple approximation to the optimum sampling pattern by using uniformly sampled blocks of data and further proposes to estimate phase and frequency in each of these blocks and to exploit these intermediate results in the final estimation. An approach to do so is investigated in detail. Results are compared to the Cramér–Rao bound (CRB), and it is shown that this algorithm almost reaches this limit on the variance of unbiased estimators, at a computational complexity lower than that of a typical FFT-based approach. For samples and a signal-to-noise ratio of 10, the standard deviation of the frequency estimate is lower by more than 50% compared to uniform sampling. In addition, the algorithm can easily be applied to poorly characterized systems, e.g. systems for which the noise is not known exactly. Finally, we demonstrate that the proposed strategy yields results that are within 3% of the theoretically achievable accuracy for the theoretically optimum sampling pattern. 相似文献
We report on a program for the numerical evaluation of divergent multi-loop integrals. The program is based on iterated sector decomposition. We improve the original algorithm of Binoth and Heinrich such that the program is guaranteed to terminate. The program can be used to compute numerically the Laurent expansion of divergent multi-loop integrals regulated by dimensional regularisation. The symbolic and the numerical steps of the algorithm are combined into one program.
Program summary
Program title: sector_decompositionCatalogue identifier: AEAG_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAG_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 47 506No. of bytes in distributed program, including test data, etc.: 328 485Distribution format: tar.gzProgramming language: C++Computer: allOperating system: UnixRAM: Depending on the complexity of the problemClassification: 4.4External routines: GiNaC, available from http://www.ginac.de, GNU scientific library, available from http://www.gnu.org/software/gslNature of problem: Computation of divergent multi-loop integrals.Solution method: Sector decomposition.Restrictions: Only limited by the available memory and CPU time.Running time: Depending on the complexity of the problem. 相似文献
Twelve different (/ß)8-barrel enzymes belonging tothree structurally distinct families were found to contain,near the C-terminus of their strand ß5, a conservedinvariant glutamic acid residue that plays an important functionalrole in each of these enzymes. The search was based on the ideathat a conserved sequence region of an (/ß)8-barrelenzyme should be more or less conserved also in the equivalentpart of the structure of the other enzymes with this foldingmotif owing to their mutual evolutionary relatedness. For thispurpose, the sequence region around the well conserved fifthß-strand of a-amylase containing catalytic glutamate(Glu230, Aspergillus oryzae -amylase numbering), was used asthe sequence-structural template. The isolated sequence stretchesof the 12 (/ß)8-barrels are discussed from both thesequence-structural and the evolutionary point of view, theinvariant glutamate residue being proposed to be a joining featureof the studied group of enzymes remaining from their ancestral(/ß)8-barrel 相似文献
Poly(3,4-ethylenedioxythiophene):polystyrene sulfonate (PEDOT:PSS) has been one of the most established hole transport layers (HTL) in organic solar cells (OSCs) for several decades. However, the presence of PSS− ions is known to deteriorate device performance via a number of mechanisms including diffusion to the HTL-active layer interface and unwanted local chemical reactions. In this study, it is shown that PSS− ions can also result in local p-doping in the high efficiency donor:non-fullerene acceptor blends – resulting in photocurrent loss. To address these issues, a facile and effective approach is reported to improve the OSC performance through a two-component hole transport layer (HTL) consisting of a self-assembled monolayer of 2PACz ([2-(9H-Carbazol-9-yl)ethyl]phosphonic acid) and PEDOT:PSS. The power conversion efficiency (PCE) of 17.1% using devices with PEDOT:PSS HTL improved to 17.7% when the PEDOT:PSS/2PACz two-component HTL is used. The improved performance is attributed to the overlaid 2PACz layer preventing the formation of an intermixed p-doped PSS− ion rich region (≈5–10 nm) at the bulk heterojunction-HTL contact interface, resulting in decreased recombination losses and improved stability. Moreover, the 2PACz monolayer is also found to reduce electrical shunts that ultimately yield improved performance in large area devices with PCE enhanced from 12.3% to 13.3% in 1 cm2 cells. 相似文献
Optimization problems in software engineering typically deal with structures as they occur in the design and maintenance of software systems. In model-driven optimization (MDO), domain-specific models are used to represent these structures while evolutionary algorithms are often used to solve optimization problems. However, designing appropriate models and evolutionary algorithms to represent and evolve structures is not always straightforward. Domain experts often need deep knowledge of how to configure an evolutionary algorithm. This makes the use of model-driven meta-heuristic search difficult and expensive. We present a graph-based framework for MDO that identifies and clarifies core concepts and relies on mutation operators to specify evolutionary change. This framework is intended to help domain experts develop and study evolutionary algorithms based on domain-specific models and operators. In addition, it can help in clarifying the critical factors for conducting reproducible experiments in MDO. Based on the framework, we are able to take a first step toward identifying and studying important properties of evolutionary operators in the context of MDO. As a showcase, we investigate the impact of soundness and completeness at the level of mutation operator sets on the effectiveness and efficiency of evolutionary algorithms.
ABSTRACTThe workshop of Zambana el Vato (region Trentino, Northern Italy), is dated to the period between the 7th-6th and the 5th century BC. Iron working activities are clearly recognizable from the various finds. Among them there are working slag, heated clay, fragments of hearth or forge, hammerscale and more residues that can be referred to iron technology. A number of selected specimens were sectioned and mounted for photomicroscopy to identify the structure and some of the mounted samples were also examined by scanning electron microscopy (SEM) using both a back scattered electron detector and energy dispersive (EDS) x-ray analysis. This paper presents the results of these studies. The hearths were regularly repaired, as their fragments were found mixed with working slag. The hammerscale samples indicate that there were three iron-working areas. The fragments of forge with traces of tuyeres indicate that bellows were employed. Refining slag was identified among the debris. This is particularly significant as for the moment no iron refining centers are known in this area. 相似文献
We present a robust optimization framework that is applicable to general nonlinear programs (NLP) with uncertain parameters. We focus on design problems with partial differential equations (PDE), which involve high computational cost. Our framework addresses the uncertainty with a deterministic worst-case approach. Since the resulting min–max problem is computationally intractable, we propose an approximate robust formulation that employs quadratic models of the involved functions that can be handled efficiently with standard NLP solvers. We outline numerical methods to build the quadratic models, compute their derivatives, and deal with high-dimensional uncertainties. We apply the presented approach to the parametrized shape optimization of systems that are governed by different kinds of PDE and present numerical results. 相似文献