HP700圆锥破碎机动锥的有限元分析

对HP700圆锥破碎机的主要部件动锥建立了有限元分析模型，用ANSYS软件对动锥进行了有限元强度和刚度分析，结果输出了动锥分布及变形图，对圆锥破碎机的结够设计提供了依据。     

Automatic conversion from lexical words to prosodic words for mandarin text-to-speech system

In real speech, not like lexical words (LWs), prosodic words (PWs) are basic rhythmic units. The naturalness of a Text-to-Speech (TTS) system is directly influenced by the segmentation of the PWs. Most of the PWs are the combination of several LWs. In this paper, three Lexical Combination Models are proposed to combine LWs into PWs, including a Directed Acyclic Graph Model, a Segmentation Model and a Markov Model (MM). To cope with the situation where some long LWs should be segmented into two or more PWs, a Lexical Split Model (LSM) is applied to the long LWs. Experimental results prove that relatively constant results with various training data can be obtained from a MM. The Transformation-Based Error Driven Learning (TBED) algorithm, for its high performance of individual property, is applied in combination with the MM to improve the precision of PW segmentation. Experiments show that among the three proposed models, the MM combined with TBED and LSM, leads to the best performance, in which a precision of 93.00% and a recall of 93.23% are achieved. The perception test indicates that by using PWs as the lowest prosodic units a speech sounds more natural and acceptable than by using LWs. This paper is supported by NSFC Project (60503071); 973 Natural Basic Research Program of China (2004CB318102); Postdoctor Science Foundation of P. R. China (20070420275).     

Critical Configurations for 1-View in Projections from ℙ<Superscript>k</Superscript> → ℙ<Superscript>2</Superscript>

In this paper we describe, from a theoretical point of view, critical configurations for the projective reconstruction of a set of points, for a single view, i.e. for calibration of a camera, in the case of projections from ℙ^k to ℙ² for k ≥ 4. We give first a general result describing these critical loci in ℙ^k, which, if irreducible, are algebraic varieties of dimension k−2 and degree 3. If k=4 they can be either a smooth ruled surface or a cone and if k = 5 they can be a smooth three dimensional variety, ruled in planes, or a cone. If k≥ 6, the variety is always a cone, the vertex of which has dimension at least k − 6. The reducible cases are studied in Appendix A. These results are then applied to determine explicitly the critical loci for the projections from ℙ^k which arise from the dynamic scenes in ℙ³ considered in [13]. Marina Bertolini is currently Associate Professor of Geometry at the Department of Mathematics at the Università degli Studi di Milano, Italy. Her main field of research is Complex Projective Algebraic Geometry, with particular interest for the classification of projective varieties and for the geometry of Grassmann varieties. On these topics M. Bertolini has published more than twenty reviewed papers on national and international journals. She has been for some years now interested also in applications of Algebraic Geometry to Computer Vision problems. Cristina Turrini is Associate Professor of Geometry at the Department of Mathematics of Università degli Studi di Milano, Italy. Her main research interest is Complex Projective Algebraic Geometry: subvarieties of Grassmannians, special varieties, automorphisms, classification. In the last two years she has started to work on applications of Algebraic Geometry to problems of Computer Vision. She is author or co-author of about thirty reviewed papers. She is also involved in popularization of Mathematics, and on this subject she is co-editor of some books.     

The hot blow forming of AZ31 Mg sheet: Formability assessment and application development

The hot blow forming of magnesium sheet offers significant opportunity for forming complex, lightweight parts for automotive applications. This paper characterizes the elevated-temperature formability of AZ31 magnesium sheet materials and the effect of processing conditions on the performance of these materials. In addition, magnesium sheet application development at General Motors Corporation is reviewed.     

Simulation of Strength Distribution in Ground Ceramics by Incorporating Residual Stress Effect

Strength of ground ceramics may be affected by residual stress as well as surface flaws induced by grinding. Strength prediction for ground ceramics is convenient for mechanical design of ceramic components. In this article, a numerical procedure based on fracture mechanics was proposed to estimate strength distribution of ground ceramics by considering grinding-induced residual stress. Bending strength and residual stress of ground ceramics were measured for three grinding-conditions. By comparison of simulated results with experimental ones, it was revealed that strength characteristics in experiments were well simulated by using the proposed procedure.     

Boosting nitrification by membrane-attached biofilm.

Nitrification is a key step for reliable biological nitrogen removal. In order to enhance nitrification in the activated sludge (AS) process, membrane-attached biofilm (MAB) was incorporated in a conventional activated sludge tank. Simultaneous organic carbon removal and nitrification of the MAB incorporated activated sludge (AS + MAB) process was investigated with continuous wastewater treatment. The effluent TOC concentration of AS and the AS + MAB processes were about 6.3 mg/L and 7.9 mg/L, respectively. The TOC removal efficiency of both AS and AS + MAB were above 95% during the wastewater treatment, indicating excellent organic carbon removal performance in both processes. Little nitrification occurred in the AS process. On the contrary, successful nitrification was obtained with the AS + MAB process with nitrification efficiency of about 90%. The volumetric and surface nitrification rates were about 0.14 g/Ld and 6.5 g/m2d, respectively. The results clearly demonstrated that nitrification in the conventional AS process was boosted by MAB. Furthermore, the microfaunal population in the AS + MAB process was different from that in the AS process. The high concentration of rotifers in the AS + MAB process was expected to decrease the generation of excess sludge in the process.     

Optimal algorithms for adjacent side routing

We consider the switchbox routing problem of two-terminal nets in the case when all thek nets lie on two adjacent sides of the rectangle. Our routing model is the standard two-layer model. We develop an optimal algorithm that routes all the nets whenever a routing exists. The routing obtained uses the fewest possible number of vias. A more general version of this problem (adjacent staircase) is also optimally solved.This research was supported in part by NSA Contract No. MDA-904-85H-0015, NSF Grant No. DCR-86-00378, and by NSF Engineering Research Centers Program NSFD CDR 88003012.     

Minimum-energy multicast in mobile ad hoc networks using network coding

The minimum energy required to transmit one bit of information through a network characterizes the most economical way to communicate in a network. In this paper, we show that, under a layered model of wireless networks, the minimum energy-per-bit for multicasting in a mobile ad hoc network can be found by a linear program; the minimum energy-per-bit can be attained by performing network coding. Compared with conventional routing solutions, network coding not only allows a potentially lower energy-per-bit to be achieved, but also enables the optimal solution to be found in polynomial time, in sharp contrast with the NP-hardness of constructing the minimum-energy multicast tree as the optimal routing solution. We further show that the minimum energy multicast formulation is equivalent to a cost minimization with linear edge-based pricing, where the edge prices are the energy-per-bits of the corresponding physical broadcast links. This paper also investigates minimum energy multicasting with routing. Due to the linearity of the pricing scheme, the minimum energy-per-bit for routing is achievable by using a single distribution tree. A characterization of the admissible rate region for routing with a single tree is presented. The minimum energy-per-bit for multicasting with routing is found by an integer linear program. We show that the relaxation of this integer linear program, studied earlier in the Steiner tree literature, can now be interpreted as the optimization for minimum energy multicasting with network coding. In short, this paper presents a unifying study of minimum energy multicasting with network coding and routing.