953 resultados para Code generators.
Resumo:
An experimental comparison of several vortex generator geometries was conducted at Mach 1.5, 1.8, and 2.5 to better understand downstream vortex development as a function of device shape and Mach number. The devices had heights less than that of the boundary-layer ("micro"-vortex generators) and were either vane-shaped or of the alternative microramp geometry. LDV was used to measure two components of velocity at several stations downstream of the devices. The velocity data were then fitted to a vortex model so that vortex parameters such as circulation, core radius, and trajectory were estimated. Mach number dependence was seen for all parameters. Vortex height and core radius both tended to decrease slightly with increasing Mach number. A critical vane angle for maximum circulation was observed and also decreased with increasing Mach number. Circulation was seen to scale with wall-friction velocity for Mach 1.5 and 1.8 but not 2.5. © 2012 by W.R. Nolan and H. Babinsky.
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:
In this study, the Serpent Monte Carlo code was used as a tool for preparation of homogenized few-group cross sections for the nodal diffusion analysis of Sodium cooled Fast Reactor (SFR) cores. Few-group constants for two reference SFR cores were generated by Serpent and then employed by nodal diffusion code DYN3D in 2D full core calculations. The DYN3D results were verified against the references full core Serpent Monte Carlo solutions. A good agreement between the reference Monte Carlo and nodal diffusion results was observed demonstrating the feasibility of using Serpent for generation of few-group constants for the deterministic SFR analysis.
Resumo:
We demonstrate for the first time an electronically processed Walsh Code with 16 chips at 18Gchip/s. An auto-cross correlation ratio of 18.1dB is achieved between two orthogonal codes after transmission over 10km of SMF. © 2009 OSA.
Resumo:
A new scheme for the code of chemical environments of compounds is described in this paper, and three molecular similarity methods have been used to select nearest neighbors from four different types of probe compounds. One of the methods is based on the C-13 NMR spectra. The second method is based on the code of chemical environments and molecular topological index A(x). The third approach, i.e. the Tanimoto coefficient, is also based on the code of chemical environments, but not to use the topological index. Five nearest neighbors for each probe compound using these three molecular similarity methods were determined and taken from the database of 7309 structures. The results indicate that the scheme of the chemical environment code and the method for similarity measure of intermolecules suggested in this study are reasonable. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.
Resumo:
A new code for chemical environment and an empirical mathematical pattern Sa(m) on computation of molecular similarity were suggested. Seven molecules which referred to as the probe compounds and the nearest neighbors of each probe structure were determined by the methods of Sa(m) and Tanimoto, The results show an intuitive notion of chemical similarity.
Resumo:
Scientists are faced with a dilemma: either they can write abstract programs that express their understanding of a problem, but which do not execute efficiently; or they can write programs that computers can execute efficiently, but which are difficult to write and difficult to understand. We have developed a compiler that uses partial evaluation and scheduling techniques to provide a solution to this dilemma.
Resumo:
Fitzgerald, S., Simon, B., and Thomas, L. 2005. Strategies that students use to trace code: an analysis based in grounded theory. In Proceedings of the First international Workshop on Computing Education Research (Seattle, WA, USA, October 01 - 02, 2005). ICER '05. ACM, New York, NY, 69-80
Resumo:
Thomas, L., Ratcliffe, M., and Robertson, A. 2003. Code warriors and code-a-phobes: a study in attitude and pair programming. SIGCSE Bull. 35, 1 (Jan. 2003), 363-367.
Resumo:
In college courses dealing with material that requires mathematical rigor, the adoption of a machine-readable representation for formal arguments can be advantageous. Students can focus on a specific collection of constructs that are represented consistently. Examples and counterexamples can be evaluated. Assignments can be assembled and checked with the help of an automated formal reasoning system. However, usability and accessibility do not have a high priority and are not addressed sufficiently well in the design of many existing machine-readable representations and corresponding formal reasoning systems. In earlier work [Lap09], we attempt to address this broad problem by proposing several specific design criteria organized around the notion of a natural context: the sphere of awareness a working human user maintains of the relevant constructs, arguments, experiences, and background materials necessary to accomplish the task at hand. We report on our attempt to evaluate our proposed design criteria by deploying within the classroom a lightweight formal verification system designed according to these criteria. The lightweight formal verification system was used within the instruction of a common application of formal reasoning: proving by induction formal propositions about functional code. We present all of the formal reasoning examples and assignments considered during this deployment, most of which are drawn directly from an introductory text on functional programming. We demonstrate how the design of the system improves the effectiveness and understandability of the examples, and how it aids in the instruction of basic formal reasoning techniques. We make brief remarks about the practical and administrative implications of the system’s design from the perspectives of the student, the instructor, and the grader.