Carbon fiber structure and stability studies

A study has been made of the thermal-oxidative stability of several commercially available carbon fibers. Significant differences in the weight loss behavior were observed in air aging studies run on the bare fibers at 600°F (589 K). The stability of high temperature laminates, such as those based on NR-150 polyimide precursor solutions, was found to be directly affected by the stability of the reinforcing carbon fibers. In studies carried out to determine the reasons for carbon fiber instability, residual sodium sulfate was found to be the principle destabilizing factor. A mechanism whereby the sodium sulfate promotes the oxidation of carbon in the presence of air is proposed.     

Studies of microhardness and mar resistance using a scanning probe microscope

Scanning probe microscopy (SPM) is in a period of rapid development. It shows great promise for characterizing coating surfaces. This paper describes modification of an SPM so that it can be used to mar the surfaces of coatings under controlled conditions and to characterize the mars. Mar resistance of coatings is analyzed in terms of a ‘three response, two mechanism model.' The three responses (fracture, elastic, and plastic) can be measured quantitatively using the SPM. Of the three responses, only two (fracture and plastic deformation) are marring mechanisms – elastic deformations recover instantaneously. In some cases mars resulting from plastic deformation may recover slowly with time or with immersion in water; this phenomenon is attributed to viscoelastic creep. Microhardness is also measured with the modified SPM. Some thermoset coatings appear to be substantially harder near their surfaces than in the mass of material, and such materials may respond quite differently to stress applied at different levels near the surface. This finding has important implications for all coating properties that are strongly influenced by the surface. A quantity called ‘micro mar resistance' is defined. It may be useful for comparing different coatings under specified conditions of marring. However, there can be no single quantity that expresses ‘mar resistance' of a coating under all conditions.     

Modelling formation and growth of H2SO4-H2O aerosols: Uncertainty analysis and experimental evaluation

An aerosol dynamics model, AERO2, is presented, which describes the formation of H₂SO₄-H₂O aerosol in a smog chamber. The model is used to analyse how the uncertainties on four input parameters are propagated through an aerosol dynamics model. The input parameters are: the rate of the reaction between SO₂ and OH (k₁), the ratio between the nucleation rate used in AERO2 and that derived from classical nucleation theory (t_n), the H₂SO₄ mass accommodation coefficient () and a measure of the turbulence intensity in the reactor (k_e). Uncertainties for these parameters are taken from the literature. One of the results of the analysis is that AERO2 and aerosol dynamics models in general can only predict upper bounds for the total number (N_tot) and total volume (V_tot) concentrations of the particles. The uncertainties on N_tot and V_tot are mainly due to the uncertainties on k₁, and t_n. An uncertainty factor of 20–100 still remains when the uncertainty on k₁, is reduced to ±5%. Aerosol measurements from three smog chamber experiments have therefore been used, in an attempt to reduce the uncertainty on k₁ and t_n. Values for k₁ are obtained in the reduced range 7.8 × 10⁻¹³ to 1.0 × 10⁻¹² cm³ s⁻¹, which is within the range found in the literature. For t_n, values in the range 10⁴–10⁷ are obtained, which is close to the upper bound of the range in literature. These values for t_n are in marked contrast with a recent set of experiments on nucleation in H₂SO₄-H₂O mixtures, which suggests a value for t_n of at most 10⁻⁵.     

Expected runtimes of evolutionary algorithms for the Eulerian cycle problem

Evolutionary algorithms are randomized search heuristics, which are applied to problems whose structure is not well understood, as well as to problems in combinatorial optimization. They have successfully been applied to different kinds of arc routing problems. To start the analysis of evolutionary algorithms with respect to the expected optimization time on these problems, we consider the Eulerian cycle problem. We show that a variant of the well-known (1+1)$(1+1)$ EA working on the important encoding of permutations is able to find an Eulerian tour of an Eulerian graph in expected polynomial time. Altering the operator used for mutation in the considered algorithm, the expected optimization time changes from polynomial to exponential.     

很小很强大 打造超迷你平台客厅电脑 系列专题之一 平台搭建篇

“好小啊！”几乎所有人第一次看到NVIDIA离子平台的时候,都会发出这样的惊呼,然后人们会有三种反应,要反围观之后走开,要么打听哪里可以买到,而我们发烧级DLYer则会想：它为什么这么小,我们能自己搭建一台出来吗？为了实现打造超迷你平台客厅电脑的愿望,     

The acoustic properties of snores

This study was undertaken in an attempt to characterize the acoustic properties of snoring sounds in the time and frequency domains, and to correlate between these properties and the mechanical events underlying their production. Three experimental set-ups were used: 1) Dog model--six mongrel dogs, in which partial upper airway obstruction was created by an implanted supraglottic balloon. Flow, supraglottic pressure, and snoring sounds were recorded during different degrees of obstruction. Fifteen to 20 snores from each dog (total 100 snores) were analysed. 2) Simulated human snores--Six simulated snores from each of four subjects were recorded in two locations (trachea and ambient) with simultaneous airflow, and their correlations examined. 3) Snoring patients--snores were recorded with an ambient microphone from nine subjects with "heavy" snoring and no obstructive sleep apnoea (OSA). Forty to 50 snores from each subject were analysed (total of 400 snores). The snoring sound was analysed in the time (time-expanded waveform) and frequency (power spectrum) domains. After analysing these snores, we were able to identify two dominant patterns which are distinctly different from each other: the "simple-waveform" and the "complex-waveform". The complex-waveform snore is characterized by repetitive, equally-spaced, train of sound structures, starting with a large deflection followed by a decaying amplitude wave. In the frequency domain, it is characterized by multiple, equally-spaced peaks of power (comb-like spectrum). Simple-waveform snores have a quasi-sinusoidal waveform, with a range of variants, and almost no secondary internal oscillations. Their power spectrum contains only 1-3 peaks, of which the first is the most prominent. We developed a mathematical representation of these waveforms, which is presented along with its implications. The complex-waveform snores result from colliding of the airway walls and represent actual brief airway closure. Simple-waveform snores are of higher frequency and probably result from oscillation around a neutral position without actual closure of the lumen.     

Editorial: Special issue on approximate dynamic programming and reinforcement learning

We are extremely pleased to present this special issue of the Journal of Control Theory and Applications.Approximate dynamic programming (ADP) is a general and effective approach for solving optimal control and estimation problems by adapting to uncertain environments over time.ADP optimizes the sensing objectives accrued over a future time interval with respect to an adaptive control law,conditioned on prior knowledge of the system,its state,and uncertainties.A numerical search over the present value of the control minimizes a Hamilton-Jacobi-Bellman (HJB) equation providing a basis for real-time,approximate optimal control.     

Polygon subdivision for pocket machining process planning

This paper presents a new approach to improve tool selection for arbitrary shaped pockets based on an approximate polygon subdivision technique. The pocket is subdivided into smaller sub-polygons and tools are selected separately for each sub-polygon. A set of tools for the entire pocket is obtained based on both machining time and the number of tools used. In addition, the sub-polygons are sequenced to eliminate the requirement of multiple plunging operations. In process planning for pocket machining, selection of tool sizes and minimizing the number of plunging operations can be very important factors. The approach presented in this paper is an improvement over previous work in its use of a polygon subdivision strategy to improve the machining time as well as reducing the number of plunges. The implementation of this technique suggests that using a subdivision approach can reduce machining time when compared to solving for the entire polygonal region.