Forging preform design with shape complexity control in simulating backward deformation

This paper presents a preform design method which employs an alternative boundary node release criterion in the finite element simulation of backward deformation of forging processes. The method makes use of the shape complexity factor which provides an effective measure of forging difficulty. The objective is to release die contacting nodes in a sequence which will minimize the geometric complexity throughout the backward deformation simulation. This is done by calculating the effect of releasing each of a select group of boundary element nodes at each finite element solution step. The particular detached node which results in the minimum shape complexity factor will be released for the current step. This process continues for each backward step until the last few nodes remain in contact. This design method is demonstrated through the simulated forging of an integrated blade and rotor turbine disk blank. A preform shape developed by this method is compared with an empirically designed preform. Performance parameters for comparison include die fill, flash volume, effective strain variance, frictional power and die load. Comparing the results of the forward simulations indicates improved performance of the preform design using FEM based backward deformation method over that of the empirical design.     

iPods in the Sauna or Kids These Days….

Abstract

Inter-play, an on-line index to plays in collections, anthologies and periodicals, provides easy access to the locations of printed plays by making citations for the location(s) of each play searchable by author and/or title. The process of converting the original card file play index into an electronic database available on the World Wide Web is described. The index has been designed to provide easy access to and broad coverage of available plays. New titles are added to the file on a regular basis, placing this Web publication squarely in the electronic journal arena.     

Preservice Teachers’ Understandings of the Relation Between a Fraction or Integer and Its Decimal Expansion: Strength and Stability of Belief

Abstract

In an earlier study of preservice elementary and middle school teachers’ beliefs about repeating decimals, Weller, Arnon, and Dubinsky (2009) reported on a comparison of the mathematical performance of 77 preservice teachers who completed an APOS-based instructional unit with 127 preservice teachers who completed traditional instruction. The purpose of the current study, based on 47 interviews conducted 4 months after the instruction, during which time there was no further instruction on this topic, is to determine the strength and stability (over time) of the students’ beliefs, to uncover thinking that did not arise in the earlier study, and to see whether the interviews yield similar comparative results. The interviews did uncover changes in student thinking. The students who received the APOS-based instruction developed stronger and more stable (over time) beliefs that a repeating decimal is a number; a repeating decimal has a fraction or integer to which it corresponds; a repeating decimal in general equals its corresponding fraction or integer; and, in particular, In addition, a number of indices and categories were developed that may prove useful in other studies consisting of the comparison of interview and questionnaire data involving a large number of interview subjects.     

Discipline-based instruction to promote interdisciplinary design of wearable and pervasive computing products

This paper reports on a design experience for undergraduates in computer engineering, industrial design, and marketing that focuses on pervasive computing devices. Across a broad range of targeted application areas and user groups, many of the student designs have been wearable computers. Consequently, our course will be of interest to the wearable computing community, particularly in terms of our aim of bridging the gap between design and engineering. For the two most recent offerings of the course, we have utilized external observers and surveyed the students in order to validate the impact of aspects of our process and changes to it. This paper is based upon 5 years of experience and 2 years of analysis of our course, and it presents an overview of our process with both qualitative and quantitative results from these two most recent offerings.     

Optimal infinite scheduling for multi-priced timed automata

This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes both costs and rewards as separate modelling features. A precise definition is then given of what constitutes optimal infinite behaviours for this class of models. We subsequently show that the derivation of optimal non-terminating schedules for such double-priced timed automata is computable. This is done by a reduction of the problem to the determination of optimal mean-cycles in finite graphs with weighted edges. This reduction is obtained by introducing the so-called corner-point abstraction, a powerful abstraction technique of which we show that it preserves optimal schedules. This work has been mostly done while visiting CISS at Aalborg University in Denmark and has been supported by CISS and by ACI Cortos, a program of the French Ministry of Research.     

新闻动态Q＆A Linn Olofsdotter

这是一位四海为家的瑞典籍天才运动图形插画家,她将会为你展示自己对肌理的热衷以及为什么你无需害怕黑暗的一面……     

A fully pipelined RLS-based array for channel equalization

It is shown that several recursive least squares (RLS) type equalization algorithms such as, e.g., decisiondirected schemes and orthogonalized constant modulus algorithms, possess a common algorithmic structure and are therefore rather straightforwardly implemented on an triangular array (filter structure) for RLS estimation with inverse updating. While the computational complexity for such algorithms isO(N ²), whereN is the problem size, the throughput rate for the array implementation isO(1), i.e., independent of the problem size. Such a throughput rate cannot be achieved with standard (Gentleman-Kung-type) RLS/QR-updating arrays because of feedback loops in the computational schemes.     

Empirical studies on programming language stimuli

Comprehending and debugging computer programs are inherently difficult tasks. The current approach to building program execution and debugging environments is to use exclusively visual stimuli on programming languages whose syntax and semantics has often been designed without empirical guidance. We present an alternative: Sodbeans, an open-source integrated development environment designed to output carefully chosen spoken auditory cues to supplement empirically evaluated visual stimuli. Originally designed for the blind, earlier work suggested that Sodbeans may benefit sighted programmers as well. We evaluate Sodbeans in two experiments. First, we report on a formal debugging experiment comparing (1) a visual debugger, (2) an auditory debugger, and (3) a multimedia debugger, which includes both visual and auditory stimuli. The results from this study indicate that while auditory debuggers on their own are significantly less effective for sighted users when compared with visual and multimedia debuggers, multimedia debuggers might benefit sighted programmers under certain circumstances. Specifically, we found that while multimedia debuggers do not provide instant usability, once programmers have some practice, their performance in answering comprehension questions improves. Second, we created and evaluated a pilot survey analyzing individual elements in a custom programming language (called HOP) to garner empirical metrics on their comprehensibility. Results showed that some of the most widely used syntax and semantics choices in commercial programming languages are extraordinarily unintuitive for novices. For example, at an aggregate level, the word for , as in a for loop, was rated reliably worse than repeat by more than 673% by novices. After completing our studies, we implemented the HOP programming language and integrated it into Sodbeans.     

Information Seeking Can Be Social

For reasons ranging from obligation to curiosity, users have a strong inclination to seek information from others during the search process. Search systems using statistical analytics over traces left behind by others can help support the search experience.     

Terrorism and cardiovascular responses to acute stress in children.

A number of studies have considered whether background stress affects cardiovascular responses to acute stress tasks. The present study considers the effect of a potent background stressor with a clear onset, namely the terrorist attacks on September 11, 2001. Specifically, the authors investigated differences among 9.5-year-old children tested before (N = 30) and then following (N = 20) the 9/11 attacks. In addition, a majority of these children (N = 37) were retested approximately 1 year later (i.e., before and after 9/11/2002). Children tested directly following 9/11/2001 exhibited significantly greater stroke volume and cardiac output responses to acute stress tasks compared with their responses 1 year later, and this change in reactivity differed significantly from the change in reactivity exhibited by children tested before 9/11/2001 and again 1 year later. These results suggest that a potent background stressor can temporarily heighten some children's cardiovascular responses to subsequent acute stressors. (PsycINFO Database Record (c) 2010 APA, all rights reserved)