Larval rearing and fry raising of Pangasius sutchi(Fowler)

Pangasius sutchi were artificially bred for determining the hatching success and larval growth response to live food in relation to varying stocking densities. The fertilized eggs were hatched out with successful hatching rates ranging between 60 and 63%. Newly hatched larvae of 4.4 mm average length were reared using Tubifex as live food in metallic trays with water temperature of 27 to 29.5°C and dissolved oxygen level of 3.88 to 6.22 mg/1 for 6-day with an average survival rate of75.56±13.25%. The P. sutchifry of9- day old were further reared using Tubifex in the polythene covered metallic trays at the stocking densities of 2-7 fry per litre of water for a period of 14 day. P. sutchi fry raising at 4 individual per litre of water for 14 day gives better results in terms of survival and growth.

Vowel normalisation: Time-domain processing of the internal dynamics of speech

Human listeners can identify vowels regardless of speaker size, although the sound waves for an adult and a child speaking the ’same’ vowel would differ enormously. The differences are mainly due to the differences in vocal tract length (VTL) and glottal pulse rate (GPR) which are both related to body size. Automatic speech recognition machines are notoriously bad at understanding children if they have been trained on the speech of an adult. In this paper, we propose that the auditory system adapts its analysis of speech sounds, dynamically and automatically to the GPR and VTL of the speaker on a syllable-to-syllable basis. We illustrate how this rapid adaptation might be performed with the aid of a computational version of the auditory image model, and we propose that an auditory preprocessor of this form would improve the robustness of speech recognisers.

A new method of Laminaria japonica strain selection and sporeling raising by the use of gametophyte clones

One-celled female and male gametophytes of three Laminaria japonica strains were isolated, cultured and gametophyte clones were formed. A technique combining strain selection with sporeling raising by the use of these female and male gametophyte clones was studied. Experiments on 9 different crossing combinations was conducted in November of 1997 in Qingdao, P. R. China. The main economic characteristics, frond length and fresh weight, of sporophytes of different crossing combinations were measured. F-1 sporophytes of No. 2 showed a higher fresh weight and longer length, therefore, No. 2 (Wh860 + x Lid) was selected as a good combination. Its parental female and male gametophyte clones are being mass cultured for sporeling production. By this method, the time needed for strain selection was shortened from 5-6 to 2 years. As compared with the routine method of sporeling raising by the collection of zoospores, the time of sporeling raising of this method decrease by 50%, and the production cost is also reduced by 50%. It is believed that this method will be labour and time saving and a more economic way for strain selection and sporeling raising in L. japonica cultivation industry.

Speaker Normalization Using Cortical Strip Maps: A Neural Model for Steady State Vowel Identification

Auditory signals of speech are speaker-dependent, but representations of language meaning are speaker-independent. Such a transformation enables speech to be understood from different speakers. A neural model is presented that performs speaker normalization to generate a pitchindependent representation of speech sounds, while also preserving information about speaker identity. This speaker-invariant representation is categorized into unitized speech items, which input to sequential working memories whose distributed patterns can be categorized, or chunked, into syllable and word representations. The proposed model fits into an emerging model of auditory streaming and speech categorization. The auditory streaming and speaker normalization parts of the model both use multiple strip representations and asymmetric competitive circuits, thereby suggesting that these two circuits arose from similar neural designs. The normalized speech items are rapidly categorized and stably remembered by Adaptive Resonance Theory circuits. Simulations use synthesized steady-state vowels from the Peterson and Barney [J. Acoust. Soc. Am. 24, 175-184 (1952)] vowel database and achieve accuracy rates similar to those achieved by human listeners. These results are compared to behavioral data and other speaker normalization models.

Evaluation of Speaker Normalization Methods for Vowel Recognition Using Fuzzy ARTMAP and K-NN

A procedure that uses fuzzy ARTMAP and K-Nearest Neighbor (K-NN) categorizers to evaluate intrinsic and extrinsic speaker normalization methods is described. Each classifier is trained on preprocessed, or normalized, vowel tokens from about 30% of the speakers of the Peterson-Barney database, then tested on data from the remaining speakers. Intrinsic normalization methods included one nonscaled, four psychophysical scales (bark, bark with end-correction, mel, ERB), and three log scales, each tested on four different combinations of the fundamental (Fo) and the formants (F1 , F2, F3). For each scale and frequency combination, four extrinsic speaker adaptation schemes were tested: centroid subtraction across all frequencies (CS), centroid subtraction for each frequency (CSi), linear scale (LS), and linear transformation (LT). A total of 32 intrinsic and 128 extrinsic methods were thus compared. Fuzzy ARTMAP and K-NN showed similar trends, with K-NN performing somewhat better and fuzzy ARTMAP requiring about 1/10 as much memory. The optimal intrinsic normalization method was bark scale, or bark with end-correction, using the differences between all frequencies (Diff All). The order of performance for the extrinsic methods was LT, CSi, LS, and CS, with fuzzy AHTMAP performing best using bark scale with Diff All; and K-NN choosing psychophysical measures for all except CSi.

Speaker Normalization Methods for Vowel Cognition: Comparative Analysis Using Neural Network and Nearest Neighbor Classifiers

Intrinsic and extrinsic speaker normalization methods are systematically compared using a neural network (fuzzy ARTMAP) and L1 and L2 K-Nearest Neighbor (K-NN) categorizers trained and tested on disjoint sets of speakers of the Peterson-Barney vowel database. Intrinsic methods include one nonscaled, four psychophysical scales (bark, bark with endcorrection, mel, ERB), and three log scales, each tested on four combinations of F0 , F1, F2, F3. Extrinsic methods include four speaker adaptation schemes, each combined with the 32 intrinsic methods: centroid subtraction across all frequencies (CS), centroid subtraction for each frequency (CSi), linear scale (LS), and linear transformation (LT). ARTMAP and KNN show similar trends, with K-NN performing better, but requiring about ten times as much memory. The optimal intrinsic normalization method is bark scale, or bark with endcorrection, using the differences between all frequencies (Diff All). The order of performance for the extrinsic methods is LT, CSi, LS, and CS, with fuzzy ARTMAP performing best using bark scale with Diff All; and K-NN choosing psychophysical measures for all except CSi.

"Call for prices": Strategic implications of raising consumers' costs

Many consumer durable retailers often do not advertise their prices and instead ask consumers to call them for prices. It is easy to see that this practice increases the consumers' cost of learning the prices of products they are considering, yet firms commonly use such practices. Not advertising prices may reduce the firm's advertising costs, but the strategic effects of doing so are not clear. Our objective is to examine the strategic effects of this practice. In particular, how does making price discovery more difficult for consumers affect competing retailers' price, service decisions, and profits? We develop a model in which a manufacturer sells its product through a high-service retailer and a low-service retailer. Consumers can purchase the retail service at the high-end retailer and purchase the product at the competing low-end retailer. Therefore, the high-end retailer faces a free-riding problem. A retailer first chooses its optimal service levels. Then, it chooses its optimal price levels. Finally, a retailer decides whether to advertise its prices. The model results in four structures: (1) both retailers advertise prices, (2) only the low-service retailer advertises price, (3) only the high-service retailer advertises price, and (4) neither retailer advertises price. We find that when a retailer does not advertise its price and makes price discovery more difficult for consumers, the competition between the retailers is less intense. However, the retailer is forced to charge a lower price. In addition, if the competing retailer does advertise its prices, then the competing retailer enjoys higher profit margins. We identify conditions under which each of the above four structures is an equilibrium and show that a low-service retailer not advertising its price is a more likely outcome than a high-service retailer doing so. We then solve the manufacturer's problem and find that there are several instances when a retailer's advertising decisions are different from what the manufacturer would want. We describe the nature of this channel coordination problem and identify some solutions. © 2010 INFORMS.

Computational Journalism: from Answering Question to Questioning Answers and Raising Good Questions

Our media is saturated with claims of ``facts'' made from data. Database research has in the past focused on how to answer queries, but has not devoted much attention to discerning more subtle qualities of the resulting claims, e.g., is a claim ``cherry-picking''? This paper proposes a Query Response Surface (QRS) based framework that models claims based on structured data as parameterized queries. A key insight is that we can learn a lot about a claim by perturbing its parameters and seeing how its conclusion changes. This framework lets us formulate and tackle practical fact-checking tasks --- reverse-engineering vague claims, and countering questionable claims --- as computational problems. Within the QRS based framework, we take one step further, and propose a problem along with efficient algorithms for finding high-quality claims of a given form from data, i.e. raising good questions, in the first place. This is achieved to using a limited number of high-valued claims to represent high-valued regions of the QRS. Besides the general purpose high-quality claim finding problem, lead-finding can be tailored towards specific claim quality measures, also defined within the QRS framework. An example of uniqueness-based lead-finding is presented for ``one-of-the-few'' claims, landing in interpretable high-quality claims, and an adjustable mechanism for ranking objects, e.g. NBA players, based on what claims can be made for them. Finally, we study the use of visualization as a powerful way of conveying results of a large number of claims. An efficient two stage sampling algorithm is proposed for generating input of 2d scatter plot with heatmap, evalutaing a limited amount of data, while preserving the two essential visual features, namely outliers and clusters. For all the problems, we present real-world examples and experiments that demonstrate the power of our model, efficiency of our algorithms, and usefulness of their results.