A statistical analysis of audience sound absorption (A)

The absorption produced by the audience in concert halls is considered a random variable. Beranek's proposal [L. L. Beranek, Music, Acoustics and Architecture (Wiley, New York, 1962), p. 543] that audience absorption is proportional to the area they occupy and not to their number is subjected to a statistical hypothesis test. A two variable linear regression model of the absorption with audience area and residual area as regressor variables is postulated for concert halls without added absorptive materials. Since Beranek's contention amounts to the statement that audience absorption is independent of the seating density, the test of the hypothesis lies in categorizing halls by seating density and examining for significant differences among slopes of regression planes of the different categories. Such a test shows that Beranek's hypothesis can be accepted. It is also shown that the audience area is a better predictor of the absorption than the audience number. The absorption coefficients and their 95% confidence limits are given for the audience and residual areas. A critique of the regression model is presented.

DNA Polymerase-β from the pupal ovaries of bombyx mori

The silk glands of Bombyx mori, a highly replicative tissue contains high levels of DNA polymerases α, σ and epsilon (Porson) but not DNA polymerase-β. However, we detected the latter activity in the gonadal tissues, viz. the pupal ovaries and testes of B. mori. The enzyme has been purified to homogeneity from the pupal ovaries by a series of column chromatographic and affinity purification steps. The enzyme satisfied the criteria to be designated as DNA polymerase-β based on its small size, requirement for high concentration of monovalent cations for catalytic activity, sensitivity to ddTTP and insensitivity to aphidicolin. It is a monomeric polypeptide of Mr 40 kDa, and the Km for dNTPs ranges between 8–20 μM. DNA polymerase-β is biochemically and immunologically distinct from DNA polymerase-α from the silk glands of B. mori. The enzyme showed a preference for gapped DNA, and could not elongate ultraviolet irradiated template beyond the pyrimidine dimers. The absence of any associated primase and exonuclease activities from this enzyme, and its conspicuous absence in the highly replicative tissue, imply that it is unlikely to participate in the DNA endoreplication process.

Proposed role of w chromosome inactivation and the absence of dosage compensation in avian sex determination

Three features of avian sex chromosomes - female heterogamety (ZZ male, ZW female), the apparently inactive state of the W chromosome, and dose-dependent expression of Z-linked genes - are examined in regard to their possible relation to sex determination. It is proposed that the W chromosome is facultatively heterochromatic and that the Z and W chromosomes carry one or more homologous sex-determination genes. The absence of dosage compensation in ZZ embryos, and W inactivation in ZW embryos, would then bring about a 2n(ZZ)-n(ZW) inequality in the effective copy number of such genes. The absence of dosage compensation of Z-linked genes in ZZ embryos is viewed as a means by which two copies of Z-W homologous sex determination genes are kept active to meet the requirements of testis determination. W inactivation may promote ovarian development by reducing the effective copy number of these genes from 2n to n. If there is a W-specific gene for femaleness, spread of heterochromatization to this gene in cells forming the right gonadal primordium may explain the latter's normally undifferentiated state; reversal of heterochromatization may similarly explain the development of the right gonad into a testis following left ovariectomy.

Regulation of an 8-kDa peptide involved in testosterone production by luteinizing hormone in rat Leydig cells

Results of Western blot analysis carried out with an interstitial cell extract from male guinea pig and ovarian extract from immature female rats administered equine chorionic gonadotropin (eCG) provide supportive evidence to our earlier suggestion that an 8-kDa peptide is involved in acquisition of steroidogenic capacity by the rat Leydig cells. It was found that though the signal was observed in other tissues such as liver, kidney and lung which do not produce gonadal hormones, the peptide was modulated only by lutenizing hormone (LH) in the rat Leydig cells.

Expression pattern of Cubitus interruptus from the mulberry silkworm Bombyx mori in late developmental stages

A partial genomic clone of Bombyx mori homologue of the segment polarity gene Cubitus interruptus (BmCi), encoding the conserved zinc finger domain and harbouring two introns, has been characterized. BmCi was expressed in the silkglands of B. mori from embryonic to the late larval stages(3rd, 4th and 5th intermoults). The expression was confined to the anterior region of the middle silkglands, overlapping with the domain of sericin-2 expression and excluding the domains of Bm invected expression, namely the middle and posterior regions of the middle silkglands. In the wing discs, the expression was restricted to the anterior compartment, which increased from 4th to 5th larval intermoults and declined later in the pupal wing buds. In gonadal tissues (both ovaries and testes) BmCi was expressed from the larval to pupal stages. The transcripts were localized to the sperm tubes containing spermatogonia in the testis of Bombyx larvae. BmCi expression, however, was not detected in any of these tissues during the moulting stages. Expression of Ci in the wing discs and gonads is evolutionarily conserved, while the silkgland represents a novel domain. Our results imply that BmCi is involved in the specification and maintenance of micro-compartment identity within the middle silkglands.

Impact of Energy Expenditure Rate Constraints on the performance of Multihop Wireless Mesh Networks

In this article we study the problem of joint congestion control, routing and MAC layer scheduling in multi-hop wireless mesh network, where the nodes in the network are subjected to maximum energy expenditure rates. We model link contention in the wireless network using the contention graph and we model energy expenditure rate constraint of nodes using the energy expenditure rate matrix. We formulate the problem as an aggregate utility maximization problem and apply duality theory in order to decompose the problem into two sub-problems namely, network layer routing and congestion control problem and MAC layer scheduling problem. The source adjusts its rate based on the cost of the least cost path to the destination where the cost of the path includes not only the prices of the links in it but also the prices associated with the nodes on the path. The MAC layer scheduling of the links is carried out based on the prices of the links. We study the e�ects of energy expenditure rate constraints of the nodes on the optimal throughput of the network.

Jointly Optimal Power Control and Hop Length for a Single Cell, Dense, Ad hoc Wireless Network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Thetaopt bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form dopt(Pmacrt) x Thetaopt with dopt scaling as Pmacrt 1 /eta, where Pmacrt is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then pro- - vide a simple characterisation of the optimal operating point.

Distributed load adaptive scheduling for throughput and delay guarantees in fading wireless LANs

We consider a problem of providing mean delay and average throughput guarantees in random access fading wireless channels using CSMA/CA algorithm. This problem becomes much more challenging when the scheduling is distributed as is the case in a typical local area wireless network. We model the CSMA network using a novel queueing network based approach. The optimal throughput per device and throughput optimal policy in an M device network is obtained. We provide a simple contention control algorithm that adapts the attempt probability based on the network load and obtain bounds for the packet transmission delay. The information we make use of is the number of devices in the network and the queue length (delayed) at each device. The proposed algorithms stay within the requirements of the IEEE 802.11 standard.

A tropical oviparous lizard, Calotes versicolor, exhibiting a potentially novel FMFM pattern of temperature-dependent sex determination

Among squamate reptiles, lizards exhibit an impressive array of sex-determining modes viz. genotypic sex determination, temperature-dependent sex determination, co-occurrence of both these and those that reproduce parthenogenetically. The oviparous lizard, Calotes versicolor, lacks heteromorphic sex chromosomes and there are no reports on homomorphic chromosomes. Earlier studies on this species presented little evidence to the sex-determining mechanism. Here we provide evidences for the potential role played by incubation temperature that has a significant effect (P<0.01) on gonadal sex and sex ratio. The eggs were incubated at 14 different incubation temperatures. Interestingly, 100% males were produced at low (25.5 +/- 0.5 degrees C) as well as high (34 +/- 0.5 degrees C) incubation temperatures and 100% females were produced at low (23.5 +/- 0.5 degrees C) and high (31.5 +/- 0.5 degrees C) temperatures, clearly indicating the occurrence of TSD in this species. Sex ratios of individual clutches did not vary at any of the critical male-producing or female-producing temperatures within as well as across the seasons. However, clutch sex ratios were female- or male-biased at intermediate temperatures. Thermosensitive period occurred during the embryonic stages 3033. Three pivotal temperatures operate producing 1:1 sex ratio. Histology of gonad and accessory reproductive structures provide additional evidence for TSD. The sex-determining pattern, observed for the first time in this species, that neither compares to Pattern I [Ia (MF) and Ib (FM)] nor to Pattern II (FMF), is being referred to as FMFM pattern of TSD. This novel FMFM pattern of sex ratio exhibited by C. versicolor may have an adaptive significance in maintaining sex ratio. J. Exp. Zool. 317:3246, 2012. (c) 2011 Wiley Periodicals, Inc.

Enhancing Speedup in Network Processing Applications by Exploiting Instruction Reuse with Flow Aggregation

Instruction reuse is a microarchitectural technique that improves the execution time of a program by removing redundant computations at run-time. Although this is the job of an optimizing compiler, they do not succeed many a time due to limited knowledge of run-time data. In this paper we examine instruction reuse of integer ALU and load instructions in network processing applications. Specifically, this paper attempts to answer the following questions: (1) How much of instruction reuse is inherent in network processing applications?, (2) Can reuse be improved by reducing interference in the reuse buffer?, (3) What characteristics of network applications can be exploited to improve reuse?, and (4) What is the effect of reuse on resource contention and memory accesses? We propose an aggregation scheme that combines the high-level concept of network traffic i.e. "flows" with a low level microarchitectural feature of programs i.e. repetition of instructions and data along with an architecture that exploits temporal locality in incoming packet data to improve reuse. We find that for the benchmarks considered, 1% to 50% of instructions are reused while the speedup achieved varies between 1% and 24%. As a side effect, instruction reuse reduces memory traffic and can therefore be considered as a scheme for low power.

State Dependent Attempt Rate modeling of single cell IEEE 802.11 WLANs with homogeneous nodes and Poisson packet arrivals

We study a State Dependent Attempt Rate (SDAR) approximation to model M queues (one queue per node) served by the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol as standardized in the IEEE 802.11 Distributed Coordination Function (DCF). The approximation is that, when n of the M queues are non-empty, the (transmission) attempt probability of each of the n non-empty nodes is given by the long-term (transmission) attempt probability of n saturated nodes. With the arrival of packets into the M queues according to independent Poisson processes, the SDAR approximation reduces a single cell with non-saturated nodes to a Markovian coupled queueing system. We provide a sufficient condition under which the joint queue length Markov chain is positive recurrent. For the symmetric case of equal arrival rates and finite and equal buffers, we develop an iterative method which leads to accurate predictions for important performance measures such as collision probability, throughput and mean packet delay. We replace the MAC layer with the SDAR model of contention by modifying the NS-2 source code pertaining to the MAC layer, keeping all other layers unchanged. By this model-based simulation technique at the MAC layer, we achieve speed-ups (w.r.t. MAC layer operations) up to 5.4. Through extensive model-based simulations and numerical results, we show that the SDAR model is an accurate model for the DCF MAC protocol in single cells. (C) 2012 Elsevier B.V. All rights reserved.

Optimal Hop Distance and Power Control for a Single Cell, Dense, Ad Hoc Wireless Network

We consider a dense, ad hoc wireless network, confined to a small region. The wireless network is operated as a single cell, i.e., only one successful transmission is supported at a time. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organize into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention-based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first motivate that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc wireless network (described above) as a single cell, we study the hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (t) (1/eta), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterization of the optimal operating point. Simulation results are provided comparing the performance of the optimal strategy derived here with some simple strategies for operating the network.

Throughput analysis of primary and secondary networks in a shared IEEE 802.11 system

In this paper, we analyze the coexistence of a primary and a secondary (cognitive) network when both networks use the IEEE 802.11 based distributed coordination function for medium access control. Specifically, we consider the problem of channel capture by a secondary network that uses spectrum sensing to determine the availability of the channel, and its impact on the primary throughput. We integrate the notion of transmission slots in Bianchi's Markov model with the physical time slots, to derive the transmission probability of the secondary network as a function of its scan duration. This is used to obtain analytical expressions for the throughput achievable by the primary and secondary networks. Our analysis considers both saturated and unsaturated networks. By performing a numerical search, the secondary network parameters are selected to maximize its throughput for a given level of protection of the primary network throughput. The theoretical expressions are validated using extensive simulations carried out in the Network Simulator 2. Our results provide critical insights into the performance and robustness of different schemes for medium access by the secondary network. In particular, we find that the channel captures by the secondary network does not significantly impact the primary throughput, and that simply increasing the secondary contention window size is only marginally inferior to silent-period based methods in terms of its throughput performance.

En Masse relay selection algorithms for multi-source, multi-relay, decode-and-forward cooperative systems

Opportunistic relay selection in a multiple source-destination (MSD) cooperative system requires quickly allocating to each source-destination (SD) pair a suitable relay based on channel gains. Since the channel knowledge is available only locally at a relay and not globally, efficient relay selection algorithms are needed. For an MSD system, in which the SD pairs communicate in a time-orthogonal manner with the help of decode-and-forward relays, we propose three novel relay selection algorithms, namely, contention-free en masse assignment (CFEA), contention-based en masse assignment (CBEA), and a hybrid algorithm that combines the best features of CFEA and CBEA. En masse assignment exploits the fact that a relay can often aid not one but multiple SD pairs, and, therefore, can be assigned to multiple SD pairs. This drastically reduces the average time required to allocate an SD pair when compared to allocating the SD pairs one by one. We show that the algorithms are much faster than other selection schemes proposed in the literature and yield significantly higher net system throughputs. Interestingly, CFEA is as effective as CBEA over a wider range of system parameters than in single SD pair systems.

Performance Evaluation of OBS Networks with INI Signaling Technique

In this paper, we evaluate the performance of a burst retransmission method for an optical burst switched network with intermediate-node-initiation (INI) signaling technique. The proposed method tries to reduce the burst contention probability at the intermediate core nodes. We develop an analytical model to get the burst contention probability and burst loss probability for an optical burst switched network with intermediate-node-initiation signaling technique. The proposed method uses the optical burst retransmission method. We simulate the performance of the optical burst retransmission. Simulation results show that at low traffic loads the loss probability is low compared to the conventional burst retransmission in the OBS network. Result also show that the retransmission method for OBS network with intermediate-node-initiation signaling technique significantly reduces the burst loss probability.