862 resultados para Low Autocorrelation Binary Sequence Problem
Resumo:
This paper describes the conceptual ideas, the theoretical validation, the laboratory testing and the field trials of a recently patented fuel-air mixing device for use in high-pressure ratio, low emissions, gaseous-fueled gas turbines. By making the fuel-air mixing process insensitive to pressure fluctuations in the combustion chamber, it is possible to avoid the common problem of positive feedback between mixture strength and the unsteady combustion process. More specifically, a mixing duct has been designed such that fuel-air ratio fluctuations over a wide range of frequencies can be damped out by passive design means. By scaling the design in such a way that the range of damped frequencies covers the frequency spectrum of the acoustic modes in the combustor, the instability mechanism can be removed. After systematic development, this design philosophy was successfully applied to a 35:1 pressure ratio aeroderivative gas turbine yielding very low noise levels and very competitive NOx and CO measurements. The development of the new premixer is described from conceptual origins through analytic and CFD evaluation to laboratory testing and final field trials. Also included in this paper are comments about the practical issues of mixing, flashback resistance and autoignition.
Resumo:
A great deal of experimental studies have shown that many introns of eukaryotic genes function as regulators of transcription. However, comprehensive studies of this problem have not yet been conducted. After checking the transcription frequencies of some Saccharomyces cerevisiae (yeast), genes and their introns, a remarkable phenomenon was discovered that generally the introns of the genes with higher transcription frequencies are longer, and the introns of the genes with lower transcription frequencies are shorter. This suggests that the longer introns of genes with higher transcription frequencies may contain some characteristic sequence structures, which could enhance the transcription of genes. Therefore, two sets of introns of yeast genes were chosen for further study. The transcription frequencies of the first set of genes are higher (>30), and those of the second set of genes are lower (less than or equal to10). Some oligonucleotides are detected by statistically comparative analyses of the occurrence frequencies of oligonucleotides (mainly tetranucleotides and pentanucleotides), whose occurrence frequencies in the first set of introns; are significantly higher than those in the second set of introns, and are also significantly higher than those in the exons flanking the introns of the first set. Some of these extracted oligonucleotides are the same as the regulatory elements of transcription revealed by experimental analyses. Besides, the distributions of these extracted oligonucleotides in the two sets of introns and the exons show that the sequence structures of the first set of introns are favorable for transcription of genes.
Resumo:
In order to minimize the number of iterations to a turbine design, reasonable choices of the key parameters must be made at the earliest possible opportunity. The choice of blade loading is of particular concern in the low pressure (LP) turbine of civil aero engines, where the use of high-lift blades is widespread. This paper presents an analytical mean-line design study for a repeating-stage, axial-flow Low Pressure (LP) turbine. The problem of how to measure blade loading is first addressed. The analysis demonstrates that the Zweifel coefficient [1] is not a reasonable gauge of blade loading because it inherently depends on the flow angles. A more appropriate coefficient based on blade circulation is proposed. Without a large set of turbine test data it is not possible to directly evaluate the accuracy of a particular loss correlation. The analysis therefore focuses on the efficiency trends with respect to flow coefficient, stage loading, lift coefficient and Reynolds number. Of the various loss correlations examined, those based on Ainley and Mathieson ([2], [3], [4]) do not produce realistic trends. The profile loss model of Coull and Hodson [5] and the secondary loss models of Craig and Cox [6] and Traupel [7] gave the most reasonable results. The analysis suggests that designs with the highest flow turning are the least sensitive to increases in blade loading. The increase in Reynolds number lapse with loading is also captured, achieving reasonable agreement with experiments. Copyright © 2011 by ASME.
Resumo:
Thumbnail image of graphical abstract Reflective binary Fresnel lenses fabricated so far all suffer from reflections from the opaque zones and hence degradation in focusing and lensing properties. Here a solution is found to this problem by developing a carbon nanotube Fresnel lens, where the darkest man-made material ever, i.e., low-density vertically aligned carbon nanotube arrays, are exploited.
Resumo:
We offer a solution to the problem of efficiently translating algorithms between different types of discrete statistical model. We investigate the expressive power of three classes of model-those with binary variables, with pairwise factors, and with planar topology-as well as their four intersections. We formalize a notion of "simple reduction" for the problem of inferring marginal probabilities and consider whether it is possible to "simply reduce" marginal inference from general discrete factor graphs to factor graphs in each of these seven subclasses. We characterize the reducibility of each class, showing in particular that the class of binary pairwise factor graphs is able to simply reduce only positive models. We also exhibit a continuous "spectral reduction" based on polynomial interpolation, which overcomes this limitation. Experiments assess the performance of standard approximate inference algorithms on the outputs of our reductions.
Resumo:
This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a distance matrix when the dimension of the data embedding space is possibly unknown but small compared to the number of considered data points. The focus is on high-dimensional problems. We recast the considered problem into an optimization problem over the set of low-rank positive semidefinite matrices and propose two efficient algorithms for low-rank distance matrix completion. In addition, we propose a strategy to determine the dimension of the embedding space. The resulting algorithms scale to high-dimensional problems and monotonically converge to a global solution of the problem. Finally, numerical experiments illustrate the good performance of the proposed algorithms on benchmarks. © 2011 IEEE.
Resumo:
We propose an algorithm for solving optimization problems defined on a subset of the cone of symmetric positive semidefinite matrices. This algorithm relies on the factorization X = Y Y T , where the number of columns of Y fixes an upper bound on the rank of the positive semidefinite matrix X. It is thus very effective for solving problems that have a low-rank solution. The factorization X = Y Y T leads to a reformulation of the original problem as an optimization on a particular quotient manifold. The present paper discusses the geometry of that manifold and derives a second-order optimization method with guaranteed quadratic convergence. It furthermore provides some conditions on the rank of the factorization to ensure equivalence with the original problem. In contrast to existing methods, the proposed algorithm converges monotonically to the sought solution. Its numerical efficiency is evaluated on two applications: the maximal cut of a graph and the problem of sparse principal component analysis. © 2010 Society for Industrial and Applied Mathematics.
Resumo:
Compared with the Doubly fed induction generators (DFIG), the brushless doubly fed induction generator (BDFIG) has a commercial potential for wind power generation due to its lower cost and higher reliability. In the most recent grid codes, wind generators are required to be capable of riding through low voltage faults. As a result of the negative sequence, induction generators response differently in asymmetrical voltage dips compared with the symmetrical dip. This paper gave a full behavior analysis of the BDFIG under different types of the asymmetrical fault and proposed a novel control strategy for the BDFIG to ride through asymmetrical low voltage dips without any extra hardware such as crowbars. The proposed control strategies are experimentally verified by a 250-kW BDFIG. © 2012 IEEE.
Resumo:
Heavy goods vehicles exhibit poor braking performance in emergency situations when compared to other vehicles. Part of the problem is caused by sluggish pneumatic brake actuators, which limit the control bandwidth of their antilock braking systems. In addition, heuristic control algorithms are used that do not achieve the maximum braking force throughout the stop. In this article, a novel braking system is introduced for pneumatically braked heavy goods vehicles. The conventional brake actuators are improved by placing high-bandwidth, binary-actuated valves directly on the brake chambers. A made-for-purpose valve is described. It achieves a switching delay of 3-4 ms in tests, which is an order of magnitude faster than solenoids in conventional anti-lock braking systems. The heuristic braking control algorithms are replaced with a wheel slip regulator based on sliding mode control. The combined actuator and slip controller are shown to reduce stopping distances on smooth and rough, high friction (μ = 0.9) surfaces by 10% and 27% respectively in hardware-in-the-loop tests compared with conventional ABS. On smooth and rough, low friction (μ = 0.2) surfaces, stopping distances are reduced by 23% and 25%, respectively. Moreover, the overall air reservoir size required on a heavy goods vehicle is governed by its air usage during an anti-lock braking stop on a low friction, smooth surface. The 37% reduction in air usage observed in hardware-in-the-loop tests on this surface therefore represents the potential reduction in reservoir size that could be achieved by the new system. © 2012 IMechE.
Resumo:
The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is characterized by an efficient factorization that makes the trace norm differentiable in the search space and the computation of duality gap numerically tractable. The search space is nonlinear but is equipped with a Riemannian structure that leads to efficient computations. We present a second-order trust-region algorithm with a guaranteed quadratic rate of convergence. Overall, the proposed optimization scheme converges superlinearly to the global solution while maintaining complexity that is linear in the number of rows and columns of the matrix. To compute a set of solutions efficiently for a grid of regularization parameters we propose a predictor-corrector approach that outperforms the naive warm-restart approach on the fixed-rank quotient manifold. The performance of the proposed algorithm is illustrated on problems of low-rank matrix completion and multivariate linear regression. © 2013 Society for Industrial and Applied Mathematics.
Resumo:
The optimization of a near-circular low-Earth-orbit multispacecraft refueling problem is studied. The refueling sequence, service time, and orbital transfer time are used as design variables, whereas the mean mission completion time and mean propellant consumed by orbital maneuvers are used as design objectives. The J2 term of the Earth's nonspherical gravity perturbation and the constraints of rendezvous time windows are taken into account. A hybridencoding genetic algorithm, which uses normal fitness assignment to find the minimum mean propellant-cost solution and fitness assignment based on the concept of Pareto-optimality to find multi-objective optimal solutions, is presented. The proposed approach is demonstrated for a typical multispacecraft refueling problem. The results show that the proposed approach is effective, and that the J2 perturbation and the time-window constraints have considerable influences on the optimization results. For the problems in which the J2 perturbation is not accounted for, the optimal refueling order can be simply determined as a sequential order or as the order only based on orbitalplane differences. In contrast, for the problems that do consider the J2 perturbation, the optimal solutions obtained have a variety of refueling orders and use the drift of nodes effectively to reduce the propellant cost for eliminating orbital-plane differences. © 2013 by the American Institute of Aeronautics and Astronautics, Inc. All rights reserved.
Resumo:
Although the peritrichous ciliate Carchesium polypinum is common in freshwater, its population genetic structure is largely unknown. We used inter-simple sequence repeat (ISSR) fingerprinting to analyze the genetic structure of 48 different isolates of the species from four lakes in Wuhan, central China. Using eight polymorphic primers, 81 discernible DNA fragments were detected, among which 76 (93.83%) were polymorphic, indicating high genetic diversity at the isolate level. Further, Nei's gene diversity (h) and Shannon's Information index (I) between the different isolates both revealed a remarkable genetic diversity, higher than previously indicated by their morphology. At the same time, substantial gene flow was found. So the main factors responsible for the high level of diversity within populations are probably due to conjugation (sexual reproduction) and wide distribution of swarmers. Analysis of molecular variance (AMOVA) showed that there was low genetic differentiation among the four populations probably due to common ancestry and flooding events. The cluster analysis and principal component analysis (PCA) suggested that genotypes isolated from the same lake displayed a higher genetic similarity than those from different lakes. Both analyses separated C. polypinum isolates into subgroups according to the geographical locations. However, there is only a weak positive correlation between the genetic distance and geographical distance, suggesting a minor effect of geographical distance on the distribution of genetic diversity between populations of C. polypinum at the local level. In conclusion, our studies clearly demonstrated that a single morphospecies may harbor high levels of genetic diversity, and that the degree of resolution offered by morphology as a marker for measuring distribution patterns of genetically distinct entities is too low.
Resumo:
Genetic variation and phylogenetic relationship of Leiocassis longirostris populations from the Yangtze River were investigated at mitochondrial DNA level. The samples were collected from the upstream and mid-downstream of the Yangtze River. Three mitochondrial DNA fragments, ND5/6, cytochrome b (Cyt b) and control region (D-loop), were amplified and then digested by 10 restriction endonucleases. Twenty-three D-loop fragments randomly selected were sequenced. Digestion patterns of ND5/6 by AluI and HaeIII, D-loop by HinfI and RsaI, and Cyt b by HaeIII were polymorphic. Ten and eighteen haplotypes were obtained from RFLP data and sequence data, respectively. The individuals from upstream and mid-downstream of the Yangtze River were apparently divided into two groups. The average genetic distance was 0.008 and 0.010 according to the two data. Low diversities and decreasing abundance indicated that Leiocassis longirostris may be in severe danger and reasonable measures of fishery management should be taken.
Resumo:
Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and then exploit the Riemannian quotient geometry of the search space in the design of a class of gradient descent and trust-region algorithms. The proposed algorithms generalize our previous results on fixed-rank symmetric positive semidefinite matrices, apply to a broad range of applications, scale to high-dimensional problems, and confer a geometric basis to recent contributions on the learning of fixed-rank non-symmetric matrices. We make connections with existing algorithms in the context of low-rank matrix completion and discuss the usefulness of the proposed framework. Numerical experiments suggest that the proposed algorithms compete with state-of-the-art algorithms and that manifold optimization offers an effective and versatile framework for the design of machine learning algorithms that learn a fixed-rank matrix. © 2013 Springer-Verlag Berlin Heidelberg.
Resumo:
High dose Mn was implanted into semi-insulating GaAs substrate to fabricate embedded ferromagnetic Mn-Ga binary particles by mass-analyzed dual ion beam deposit system at room temperature. The properties of as-implanted and annealed samples were measured with X-ray diffraction, high-resolution X-ray diffraction to characterize the structural changes. New phase formed after high temperature annealing. Sample surface image was observed with atomic force microscopy. All the samples showed ferromagnetic behaviour at room temperature. There were some differences between the hysteresis loops of as-implanted and annealed samples as well as the cluster size of the latter was much larger than that of the former through the surface morphology. (C) 2004 Elsevier B.V. All rights reserved.