Comparison of measured sleeping metabolic rate and predicted basal metabolic rate during the first year of life : evidence of a bias changing with increasing metabolic rate

Objective: To compare measurements of sleeping metabolic rate (SMR) in infancy with predicted basal metabolic rate (BMR) estimated by the equations of Schofield. Methods: Some 104 serial measurements of SMR by indirect calorimetry were performed in 43 healthy infants at 1.5, 3, 6, 9 and 12 months of age. Predicted BMR was calculated using the weight only (BMR-wo) and weight and height (BMR-wh) equations of Schofield for 0-3-y-olds. Measured SMR values were compared with both predictive values by means of the Bland-Altman statistical test. Results: The mean measured SMR was 1.48 MJ/day. The mean predicted BMR values were 1.66 and 1.47 MJ/day for the weight only and weight and height equations, respectively. The Bland-Altman analysis showed that BMR-wo equation on average overestimated SMR by 0.18 MJ/day (11%) and the BMR-wh equation underestimated SMR by 0.01 MJ/day (1%). However the 95% limits of agreement were wide: -0.64 to + 0.28 MJ/day (28%) for the former equation and -0.39 to + 0.41 MJ/day (27%) for the latter equation. Moreover there was a significant correlation between the mean of the measured and predicted metabolic rate and the difference between them. Conclusions: The wide variation seen in the difference between measured and predicted metabolic rate and the bias probably with age indicates there is a need to measure actual metabolic rate for individual clinical care in this age group.

Genetic response to growth rate selection in pigs measured on two feeding levels

From the findings of McPhee et al. (1988), there is an expectation that selection in the growing pig for bodyweight gain measured on restricted feeding will result in favourable responses in the rate and efficiency of growth of lean pork on different levels of feeding. This paper examines this in two lines of Australian Large White pigs which have undergone 3 years of selection for high and for low growth rate over a 6-week period starting at 50 kg liveweight. Over this test period, pigs of both lines are all fed the same total amount of grower food, restricted to an estimated 80% of average ad libitum intake. 'Animal production for a consuming world': proceedings of 9th Congress of the AAAAP Societies and 23rd Biennial Conference of the ASAP and 17th Annual Symposium of the University of Sydney, Dairy Research Foundation, (DRF). Sydney, Australia.

Genetic variation and responses in reproductive performance of sows in lines selected for growth rate under restricted feeding

The objective of this study was to examine genetic changes in reproduction traits in sows (total number born (TNB), number born alive (NBA), average piglet birth weight (ABW) and number of piglets weaned (NW), body weight prior to mating (MW), gestation length (GL) and daily food intake during lactation (DFI)) in lines of Large White pigs divergently selected over 4 years for high and low post-weaning growth rate on a restricted ration. Heritabilities and repeatabilities of the reproduction traits were also determined. The analyses were carried out on 913 litter records using average information-restricted maximum likelihood method applied to single trait animal models. Estimates of heritability for most traits were small, except for ABW (0·33) and MW (0·35). Estimates of repeatability were slightly higher than those of heritability for TNB, NBA and NW, but they were almost identical for ABW, MW, GL and DFI. After 4 years of selection, the high growth line sows had significantly heavier body weight prior to mating and produced significantly more piglets born alive with heavier average birth weight than the low line sows. There were, however, no statistical differences between the selected lines in TNB or NW. The lower food intake of high relative to low line sows during lactation was not significant, indicating that daily food intake differences found between grower pigs in the high and low lines (2·71 v. 2·76 kg/day, s.e.d. 0·024) on ad libitum feeding were not fully expressed in lactating sows. It is concluded that selection for growth rate on the restricted ration resulted in beneficial effects on important measures of reproductive performance of the sows.

Assessment of the underreporting rate of death cause data in Shandong province using capture-mark-recapture method [应用捕获再捕获方法评估山东省死因登记漏报率水平]

To evaluate the underreporting rate of death -cause data in Shandong province during 2012 to 2013 by capture -mark -recapture method and to provide the base for health strategy. Methods All counties were divided into 5 stratifications according the death rates of 2012, and 14 counties were selected, then 3 towns or streets were selected in each country, 10 villages or neighborhood committees were selected in each town （street）. The death data collected from security bureau and civil affairs bureau were compared with the reporting death data from the National Cause of Death Surveillance, and the underreporting rate was calculated. Results In present study, 6 929 death cases were collected, it was found that 1 556 cases were underreported. The death cases estimated by CMR method were 6 227 cases （95%CI: 7 593-7 651）, and the average underreporting rate was 23.15%. There were significantly differences between different stratifications （P<0.01）. The underreporting rate in 0-4 years old group was 56.93%, the male underreporting rate was 22.31% and the female underreporting rate was 24.09%. There was no significant difference between male and female groups （P>0.05）. Conclusion There is an obvious underreport in the cause of death surveillance of Shandong province, and the underreporting rates are different among the 5 stratifications. The underreporting rate is higher in 0-4 years old group, and the investigation of the death cause surveillance for young residents is not perfect in some countries. The investigation quality of the death cause surveillance should be improved, increasing the integrity of the report data and adjusting the mortalities in different stratifications for obtaining a accurate mortality in Shandong province.

Growth analysis and biomass partitioning of Cyperus iria in response to rice planting density and nitrogen rate

Cyperus iria is a weed of rice with widespread occurrence throughout the world. Because of concerns about excessive and injudicious use of herbicides, cultural weed management approaches that are safe and economical are needed. Developing such approaches will require a better understanding of weed biology and ecology, as well as of weed response to increases in crop density and nutrition. Knowledge of the effects of nitrogen (N) fertilizer on crop-weed competitive interactions could also help in the development of integrated weed management strategies. The present study was conducted in a screenhouse to determine the effects of rice planting density (0, 5, 10, and 20 plants pot−1) and N rate (0, 50, 100, and 150 kg ha−1) on the growth of C. iria. Tiller number per plant decreased by 73–88%, leaf number by 85–94%, leaf area by 85–98%, leaf biomass by 92–99%, and inflorescence biomass by 96–99% when weed plants were grown at 20 rice plants pot−1 (i.e., 400 plants m−2) compared with weed plants grown alone. All of these parameters increased when N rates were increased. On average, weed biomass increased by 118–389% and rice biomass by 121–275% with application of 50–150 kg N ha−1, compared to control. Addition of N favored weed biomass production relative to rice biomass. Increased N rates reduced the root-to-shoot weight ratio of C. iria. Rice interference reduced weed growth and biomass and completely suppressed C. iria when no N was applied at high planting densities (i.e., 20 plants pot−1). The weed showed phenotypic plasticity in response to N application, and the addition of N increased the competitive ability of the weed over rice at densities of 5 and 10 rice plants pot−1 compared with 20 plants pot−1. The results of the present study suggest that high rice density (i.e., 400 plants m−2) can help suppress C. iria growth even at high N rates (150 kg ha−1).

A Novel Construction of Complex Orthogonal Designs with Maximal Rate and Low-PAPR

Space-time block codes based on orthogonal designs are used for wireless communications with multiple transmit antennas which can achieve full transmit diversity and have low decoding complexity. However, the rate of the square real/complex orthogonal designs tends to zero with increase in number of antennas, while it is possible to have a rate-1 real orthogonal design (ROD) for any number of antennas.In case of complex orthogonal designs (CODs), rate-1 codes exist only for 1 and 2 antennas. In general, For a transmit antennas, the maximal rate of a COD is 1/2 + l/n or 1/2 + 1/n+1 for n even or odd respectively. In this paper, we present a simple construction for maximal-rate CODs for any number of antennas from square CODs which resembles the construction of rate-1 RODs from square RODs. These designs are shown to be amenable for construction of a class of generalized CODs (called Coordinate-Interleaved Scaled CODs) with low peak-to-average power ratio (PAPR) having the same parameters as the maximal-rate codes. Simulation results indicate that these codes perform better than the existing maximal rate codes under peak power constraint while performing the same under average power constraint.

Power Management and Data Rate Maximization in Wireless Energy Harvesting Sensors

This paper considers the problem of power management and throughput maximization for energy neutral operation when using Energy Harvesting Sensors (EHS) to send data over wireless links. It is assumed that the EHS are designed to transmit data at a constant rate (using a fixed modulation and coding scheme) but are power-controlled. A framework under which the system designer can optimize the performance of EHS when the channel is Rayleigh fading is developed. For example, the highest average data rate that can be supported over a Rayleigh fading channel given the energy harvesting capability, the battery power storage efficiency and the maximum allowed transmit energy per slot is derived. Furthermore, the optimum transmission scheme that guarantees a particular data throughput is derived. The usefulness of the framework developed is illustrated through simulation results for specific examples.

Profile-Based Load Scheduling in Wireless Energy Harvesting Sensors for Data Rate Maximization

In this paper, power management algorithms for energy harvesting sensors (EHS) that operate purely based on energy harvested from the environment are proposed. To maintain energy neutrality, EHS nodes schedule their utilization of the harvested power so as to save/draw energy into/from an inefficient battery during peak/low energy harvesting periods, respectively. Under this constraint, one of the key system design goals is to transmit as much data as possible given the energy harvesting profile. For implementational simplicity, it is assumed that the EHS transmits at a constant data rate with power control, when the channel is sufficiently good. By converting the data rate maximization problem into a convex optimization problem, the optimal load scheduling (power management) algorithm that maximizes the average data rate subject to energy neutrality is derived. Also, the energy storage requirements on the battery for implementing the proposed algorithm are calculated. Further, robust schemes that account for the insufficiency of battery storage capacity, or errors in the prediction of the harvested power are proposed. The superior performance of the proposed algorithms over conventional scheduling schemes are demonstrated through computations using numerical data from solar energy harvesting databases.

Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks

Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dataflow graphs have been widely regarded as a powerful programming model for DSP applications. In this paper we propose a method to minimize buffer storage requirement in constructing rate-optimal compile-time (MBRO) schedules for multi-rate dataflow graphs. We demonstrate that the constraints to minimize buffer storage while executing at the optimal computation rate (i.e. the maximum possible computation rate without storage constraints) can be formulated as a unified linear programming problem in our framework. A novel feature of our method is that in constructing the rate-optimal schedule, it directly minimizes the memory requirement by choosing the schedule time of nodes appropriately. Lastly, a new circular-arc interval graph coloring algorithm has been proposed to further reduce the memory requirement by allowing buffer sharing among the arcs of the multi-rate dataflow graph. We have constructed an experimental testbed which implements our MBRO scheduling algorithm as well as (i) the widely used periodic admissible parallel schedules (also known as block schedules) proposed by Lee and Messerschmitt (IEEE Transactions on Computers, vol. 36, no. 1, 1987, pp. 24-35), (ii) the optimal scheduling buffer allocation (OSBA) algorithm of Ning and Gao (Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, Jan. 10-13, 1993, pp. 29-42), and (iii) the multi-rate software pipelining (MRSP) algorithm (Govindarajan and Gao, in Proceedings of the 1993 International Conference on Application Specific Array Processors, Venice, Italy, Oct. 25-27, 1993, pp. 77-88). Schedules generated for a number of random dataflow graphs and for a set of DSP application programs using the different scheduling methods are compared. The experimental results have demonstrated a significant improvement (10-20%) in buffer requirements for the MBRO schedules compared to the schedules generated by the other three methods, without sacrificing the computation rate. The MBRO method also gives a 20% average improvement in computation rate compared to Lee's Block scheduling method.

Power and Discrete Rate Adaptation for Energy Harvesting Wireless Nodes

Energy Harvesting (EH) nodes, which harvest energy from the environment in order to communicate over a wireless link, promise perpetual operation of a wireless network with battery-powered nodes. In this paper, we address the throughput optimization problem for a rate-adaptive EH node that chooses its rate from a set of discrete rates and adjusts its power depending on its channel gain and battery state. First, we show that the optimal throughput of an EH node is upper bounded by the throughput achievable by a node that is subject only to an average power constraint. We then propose a simple transmission scheme for an EH node that achieves an average throughput close to the upper bound. The scheme's parameters can be made to account for energy overheads such as battery non-idealities and the energy required for sensing and processing. The effect of these overheads on the average throughput is also analytically characterized.

Low-Delay, High-Rate Nonsquare Complex Orthogonal Designs

The maximal rate of a nonsquare complex orthogonal design for transmit antennas is 1/2 + 1/n if is even and 1/2 + 1/n+1 if is odd and the codes have been constructed for all by Liang (2003) and Lu et al. (2005) to achieve this rate. A lower bound on the decoding delay of maximal-rate complex orthogonal designs has been obtained by Adams et al. (2007) and it is observed that Liang's construction achieves the bound on delay for equal to 1 and 3 modulo 4 while Lu et al.'s construction achieves the bound for n = 0, 1, 3 mod 4. For n = 2 mod 4, Adams et al. (2010) have shown that the minimal decoding delay is twice the lower bound, in which case, both Liang's and Lu et al.'s construction achieve the minimum decoding delay. For large value of, it is observed that the rate is close to half and the decoding delay is very large. A class of rate-1/2 codes with low decoding delay for all has been constructed by Tarokh et al. (1999). In this paper, another class of rate-1/2 codes is constructed for all in which case the decoding delay is half the decoding delay of the rate-1/2 codes given by Tarokh et al. This is achieved by giving first a general construction of square real orthogonal designs which includes as special cases the well-known constructions of Adams, Lax, and Phillips and the construction of Geramita and Pullman, and then making use of it to obtain the desired rate-1/2 codes. For the case of nine transmit antennas, the proposed rate-1/2 code is shown to be of minimal delay. The proposed construction results in designs with zero entries which may have high peak-to-average power ratio and it is shown that by appropriate postmultiplication, a design with no zero entry can be obtained with no change in the code parameters.

A weighted average based external clock synchronization protocol for wireless sensor networks

Clock synchronization is an extremely important requirement of wireless sensor networks(WSNs). There are many application scenarios such as weather monitoring and forecasting etc. where external clock synchronization may be required because WSN itself may consists of components which are not connected to each other. A usual approach for external clock synchronization in WSNs is to synchronize the clock of a reference node with an external source such as UTC, and the remaining nodes synchronize with the reference node using an internal clock synchronization protocol. In order to provide highly accurate time, both the offset and the drift rate of each clock with respect to reference node are estimated from time to time, and these are used for getting correct time from local clock reading. A problem with this approach is that it is difficult to estimate the offset of a clock with respect to the reference node when drift rate of clocks varies over a period of time. In this paper, we first propose a novel internal clock synchronization protocol based on weighted averaging technique, which synchronizes all the clocks of a WSN to a reference node periodically. We call this protocol weighted average based internal clock synchronization(WICS) protocol. Based on this protocol, we then propose our weighted average based external clock synchronization(WECS) protocol. We have analyzed the proposed protocols for maximum synchronization error and shown that it is always upper bounded. Extensive simulation studies of the proposed protocols have been carried out using Castalia simulator. Simulation results validate our theoretical claim that the maximum synchronization error is always upper bounded and also show that the proposed protocols perform better in comparison to other protocols in terms of synchronization accuracy. A prototype implementation of the proposed internal clock synchronization protocol using a few TelosB motes also validates our claim.

Tradeoff of average power and average delay for a point-to-point link with fading

We consider a discrete time system with packets arriving randomly at rate lambda per slot to a fading point-to-point link, for which the transmitter can control the number of packets served in a slot by varying the transmit power. We provide an asymptotic characterization of the minimum average delay of the packets, when average transmitter power is a small positive quantity V more than the minimum average power required for queue stability. We show that the minimum average delay will grow either as log (1/V) or 1/V when V down arrow 0, for certain sets of values of lambda. These sets are determined by the distribution of fading gain, the maximum number of packets which can be transmitted in a slot, and the assumed transmit power function, as a function of the fading gain and the number of packets transmitted. We identify a case where the above behaviour of the tradeoff differs from that obtained from a previously considered model, in which the random queue length process is assumed to evolve on the non-negative real line.

Tradeoff of average service cost and average delay for the state dependent M/M/1 queue

The optimal tradeoff between average service cost rate and average delay, is addressed for a M/M/1 queueing model with queue-length dependent service rates, chosen from a finite set. We provide an asymptotic characterization of the minimum average delay, when the average service cost rate is a small positive quantity V more than the minimum average service cost rate required for stability. We show that depending on the value of the arrival rate, the assumed service cost rate function, and the possible values of the service rates, the minimum average delay either a) increases only to a finite value, b) increases without bound as log(1/V), or c) increases without bound as 1/V, when V down arrow 0. We apply the analysis to a flow-level resource allocation model for a wireless downlink. We also investigate the asymptotic tradeoff for a sequence of policies which are obtained from an approximate fluid model for the M/M/1 queue.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.