Effect of metal ions on the growth and metabolites production of Ganoderma lucidum in submerged culture

The effects of several metal ions on the cell growth, production of polysaccharides by Ganoderma lucidum in submerged fermentation were studied. The results showed that 50 ppm Se2+ and 25 ppm Se2+ was identified to be the most favorable for biomass (11.103 ± 0.6 g/l ) and polysaccharide production (IPS and EPS was 183 ± 10.2 and 248 ± 5.5 mg/l, respectively); 100 ppm of Fe2+ and 50 ppm of Zn2+ were suitable for growth (the biomass was 8.23 ± 0.67 and 8.01 ± 0.29 g/l, respectively) and under the concentration of 50 ppm of Zn2+ and Fe2+, the production of polysaccharide was up to the most (EPS content: 263±4 and 254.3±8.0 mg/l; IPS content : 170±0.8 and 174±5 mg/l); Mg2+ had no obvious effect on biomass and polysaccharide production; Cr2+ was poisonous to the cell under the test concentration. The combination (FeSO4, 50 ppm; NaSeSO3, 25 ppm; ZnSO4, 75 ppm) by A 9 ×3 replicates (27) experiments of L9 (34) orthogonal projects was tested optimal for the cell growth and polysaccharides production. Biomass, EPS and IPS production reached their good value of 14.7 ± 0.5 g/l, 369 ± 6 mg/l and 239 ± 4 mg/g, respectively under the combination, which were higher 130.7, 50 and 50%, respectively than in the basal fermentation medium without metal ions. The validation experiment showed the experimental values agreed with the predicted values well (error <1%).Key words: Ganoderma lucidum, metal ions, biomass, polysaccharide, orthogonal projects

An integrated visual framework for the human-Web interface

© 2002 IEEE. The design of Web sites has been largely ad hoc, with little concern about the effectiveness of navigation and maintenance. This paper presents a general framework with a human-Web interface that supports Web design through visual programming and reverse Web engineering through visualization. The paper describes the framework in the context of a Web tool, known as HWIT which has been developed for a pilot study

Topology-Transparent Scheduling in Mobile Ad Hoc Networks Supporting Heterogeneous Quality of Service Guarantees

Transmission scheduling plays a critical role in mobile ad hoc networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time-division multiple-access (TDMA) frame length. Most algorithms require information on the network topology and cannot adapt to the dynamic topology in mobile scenarios. To overcome this limitation, topology-transparent scheduling algorithms have been proposed. Most of them, based on Galois field theory, Latin square, and block design theory, assign time slots to users and guarantee that there is at least one collision-free slot in each frame for each user. To the best of our knowledge, none of these topology-transparent algorithms support multiple quality of service (QoS) requirements. In this paper, we exploit the variable-weight optical orthogonal codes (VW-OOC) to design a topology-transparent scheduling algorithm in wireless ad hoc networks with multiple QoS levels. We study the performance, in terms of minimum guaranteed throughput and average throughput, of our proposed algorithm analytically and by extensive simulations.published_or_final_versio

Is Topology-Transparent Scheduling Really Inefficient in Static Multihop Networks?

published_or_final_versio

B-spline recurrent neural network and its application to modelling of non-linear dynamic systems

A new recurrent neural network based on B-spline function approximation is presented. The network can be easily trained and its training converges more quickly than that for other recurrent neural networks. Moreover, an adaptive weight updating algorithm for the recurrent network is proposed. It can speed up the training process of the network greatly and its learning speed is more quickly than existing algorithms, e.g., back-propagation algorithm. Examples are presented comparing the adaptive weight updating algorithm and the constant learning rate method, and illustrating its application to modelling of nonlinear dynamic system.published_or_final_versio

State estimation with measurement error compensation using neural network

For a system with redundant sensors, the estimated state from the Kalman filter is biased if sensor mounting error existed. To remove this bias, the mounting errors must be compensated first before using the Kalman filter. It is shown that only the projection part of the sensors errors in the measurement space needs to be compensated. If the state of a system is unavailable, a neurofuzzy network can be used to estimate the compensation term. This method is simpler, as it does not require a model for the errors as that proposed in [2]. A sub-optimal Kalman filter with measurement compensation that restrains each row of the Kalman gain matrix to be in the measurement space is also derived. An example is presented to illustrate the performance of the proposed methods.published_or_final_versio

Performance Improvement of Topology-Transparent Broadcast Scheduling in Mobile Ad Hoc Networks

published_or_final_versio

Topology-Transparent Broadcast Scheduling with Erasure Coding in Wireless Networks

published_or_final_versio

Nonlinear observer design with unknown nonlinearity via B-spline network approach

A novel approach is proposed to the state estimation of a class of nonlinear systems which consist of known linear part and unknown nonlinear part. A linear observer is first designed then a nonlinear compensation term in the nonlinear observer is determined using the proposed “deconvolution method”. The B-spline neural network is used to model the estimated compensation term. Three simulation examples are given to compare the effectiveness of the proposed approach and some analytical approaches.published_or_final_versio

Topology-Transparent Scheduling in Mobile Ad Hoc Networks With Multiple Packet Reception Capability

Recent advances in the physical layer have enabled wireless devices to have multiple packet reception (MPR) capability, which is the capability of decoding more than one packet, simultaneously, when concurrent transmissions occur. In this paper, we focus on the interaction between the MPR physical layer and the medium access control (MAC) layer. Some random access MAC protocols have been proposed to improve the network performance by exploiting the powerful MPR capability. However, there are very few investigations on the schedule-based MAC protocols. We propose a novel m-MPR-l-code topology-transparent scheduling ((m, l)-TTS) algorithm for mobile ad hoc networks with MPR, where m indicates the maximum number of concurrent transmissions being decoded, and l is the number of codes assigned to each user. Our algorithm can take full advantage of the MPR capability to improve the network performance. The minimum guaranteed throughput and average throughput of our algorithm are studied analytically. The improvement of our (m, l)-TTS algorithm over the conventional topology-transparent scheduling algorithms with the collision-based reception model is linear with m. The simulation results show that our proposed algorithm performs better than slotted ALOHA as well.published_or_final_versio