GENETIC ALGORITHM APPLICATION TO THE STANDARD ARABIC PHONEMES CLASSIFICATION

The goal of this article is the application of genetic algorithms (GAs) to the automatic speech recognition (ASR) domain at the acoustic sequences classification level. Speech recognition has been cast as a pattern classification problem where we would like to classify an input acoustic signal into one of all possible phonemes. Also, the supervised classification has been formulated as a function optimization problem. Thus, we have attempted to recognize Standard Arabic (SA) phonemes of continuous, naturally spoken speech by using GAs, which have several advantages in resolving complicated optimization problems. In SA, there are 40 sounds. We have analyzed a corpus that contains several sentences composed of the whole SA phoneme types in the initial, medium, and final positions, recorded by several male speakers. Furthermore, the acoustic segments classification and the GAs have been explored. Among a set of classifiers such as Bayesian, likelihood, and distance classifier, we have used the distance classifier. It is based on the classification measure criterion. Therefore, we have used the decision rule Manhattan distance as the fitness functions for our GA evaluations. The corpus phonemes were extracted and classified successfully with an overall accuracy of 90.20%.     

Operating characteristics of a failure counting group replacement policy

This article presents some operating characteristics of a failure counting group replacement policy. A group of identical units are put in service together. The maintenance policy applied for them is a group replacement policy based on failure count; they are replaced altogether when a number of failures reaches a certain amount. For the expected cost rate function under the failure counting group replacement policy, this article presents a method to obtain the optimum cost rate. We also show that the optimum cost rate is an increasing function in the fleet size. Numerical examples are presented to demonstrate the results.     

使用VBA统计Excel中字符个数

通过菜单操作,统计Excel文中字数非常麻烦,而借助ExcelVBA可方便快捷的统计单个Excel文件的字符个数、多个Excel文件的字符个数。将所有需统计的Excel文件放到一个文件夹下,使用文中提供的程序即可完成字数统计,并能将含有文件名及对应字符个数的统计结果存放到Excel文件中。     

布尔表达式匹配问题研究

提出了布尔表达式匹配问题,并给出了它的形式化定义;提出了一个解决布尔表达式匹配问题的通用算法框架,并在此框架上给出了一种算法及其改进;通过理论分析和实验数据给出了影响布尔表达式匹配算法性能的因素和它们之间的关系.     

用于放射性测量的快响应单板机计数率仪

本文介绍了一种结构简便、响应速度快、测量精度高的单板机计数率仪,可用于放射性计数率或积分计数的自动监测记录。由于采用了单板计算机,该装置能数字显示及自动打印测量结果。     

Synthesis, Characterization, and Cytotoxicity Analysis of a Biodegradable Polyurethane

A polyester urethane was synthesized for use in a biodegradable scaffold. The polyurethane was synthesized in a two-step process: first, ester diol was synthesized from lactic acid and polyethylene glycol 400 (PEG 400), then it was polymerized with toluene diisocyanate using dibutyl tin dilaurate (DBTDL) as a catalyst to form a polyester urethane. Polyester urethane has tensile strength of 51-59 MPa and elongation at fracture of 369-439%. FTIR and XRD were used to confirm the formation and structure of the polymer. Hydrolytic degradation was studied in different alkali solutions and in saline water. In order to assess the cellular response of this material, cytotoxicity analysis was carried out against the cell line.     

基于精度延时技术的脉冲同步机研制

介绍的高精度延时同步机延时范围在0～99μs(最小步进1ns)内可调;延时输出幅度≥ 50V;延时输出宽度≥100ns;延时输出前沿≤3ns;延时时间晃动≤5ns.     

生活饮用水3M Petrifilm^TM菌落总数测试片法的不确定度评定

对3M PetrifilmTM菌落总数测试片法检测生活饮用水中菌落总数的测量结果进行了不确定度评定,评述了引起测量结果不确定度的主要因素,对样品稀释及方法精密度因素进行了详细评价,并对单一样品重复测量10次及30个样品每个样品平行测量2次的两种情况,分别进行了重复性标准偏差评价。结果显示：单一样品重复测量时,测量结果的不确定度主要由样品稀释和重复性标准偏差引起,扩展不确定度U95为20CFU/mL,k=2;多个样品每个样品平行测量2次时,测量结果的不确定度主要由重复性标准偏差引起,在95%的置信度时,扩展不确定度U（lgxj）为0.093,k=2.75。     

Bruising on ostrich carcasses and the implications on the microbiology and losses in utilizable meat when removing them post-evisceration or post-chilling

Bruising on ostrich carcasses reduces meat yield. These bruises are usually removed as part of the primary meat inspection, performed directly after evisceration. Three separate studies were conducted to determine the advantages and disadvantages of removing the bruises at primary meat inspection or after overnight cooling of the ostrich carcasses (0–4 °C). The bruised areas were also investigated to determine their frequency and distribution and to establish the most obvious causes and possible preventative measures. The neck bruises represented 52.58% of all bruises; the high side railings of the transport vehicles being the most probable cause. Large and multiple bruising were probably from the trampling of birds lying down. It was established that trimming bruises on warm carcasses caused higher total aerobic viable counts on the trimmed surfaces than cold trimming. Cold trimming together with better management of trimming practices also led to a decrease in meat yield losses.     

An extension of the FFT‐based algorithm for the match‐count problem to weighted scores

The match‐count problem on strings is the basic problem of counting the matches of characters between two strings for every possible alignment. The problem is classically computed in O (σ n log m ) time using a fast Fourier transform (FFT) for two strings of lengths m and n (m ≤ n ) over an alphabet of size σ . This paper extends the target of this FFT‐based algorithm to a weighted version of the problem, which computes the sum of similarities between characters instead of the number of matches. The algorithm extended in this paper can solve the weighted match‐count problem in O (dn log m ) time by mapping characters to numerical vectors of dimensionality d . This paper also evaluates the usefulness of the extended algorithm by applying it to plagiarism detection in documents. The experimental results show that the proposed algorithm is applicable to general vector representation of words and that the obtained plagiarism detection method can extremely reduce the processing time with a slight decrease of accuracy from the method based on the normal match‐count problem.