Secretion of endocrine signals by the primate embryo during the peri-implantation period

Development of preimplantation embryos and blastocyst implantation are critical early events in the establishment of pregnancy. In primates, embryonic signals, secreted during the peri-implantation period, are believed to play a major role in the regulation of embryonic differentiation and implantation. However, only limited progress has been made in the molecular and functional characterization of embryonic signals, partly due to severe paucity of primate embryos and the lack of optimal culture conditions to obtain viable embryo development. Two embryonic (endocrine) secretions, i.e. chorionic gonadotrophin (CG) and gonadotrophin releasing hormone (GnRH) are being studied. This article reviews the current status of knowledge on the recovery and culture of embryos, their secretion of CG, GnRH and other potential endocrine signals and their regulation and physiological role(s) during the peri-implantation period in primates, including humans.

The precision of regulation in Dictyostelium discoideum: implications for cell-type proportioning in the absence of spatial pattern

We have made careful counts of the exact number of spore, stalk and basal disc cells in small fruiting bodies of Dictyostelium discoideum (undifferentiated amoebae are found only rarely and on average their fraction is 4.96 x 10(-4)). (i) Within aggregates of a given size, the relative apportioning of amoebae to the main cell types occurs with a remarkable degree of precision. In most cases the coefficient of variation (c.v.) in the mean fraction of cells that form spores is within 4.86%. The contribution of stalk and basal disc cells is highly variable when considered separately (c.v.'s upto 25% and 100%, respectively), but markedly less so when considered together. Calculations based on theoretical models indicate that purely cell-autonomous specification of cell, fate cannot account for die observed accuracy of proportioning. Cell-autonomous determination to a prestalk or prespore condition followed by cell type interconversion, and stabilised by feedbacks, suffices to explain the measured accuracy. (ii) The fraction of amoebae that differentiates into spores increases monotonically with the total number of cells. This fraction rises from an average of 73.6% for total cell numbers below 30 and reaches 86.0% for cell numbers between 170 and 200 (it remains steady thereafter at around 86%). Correspondingly, the fraction of amoebae differentiating into stalk or basal disc decreases viith total size. These trends are in accordance with evolutionary expectations and imply that a mechanism for sensing the overall size of the aggregate also plays an essential role in the determination of cell-type proportions.

In vitro and in vivo regulation of assimilatory nitrite reductase from Candida utilis

The nitrate assimilation pathway in Candida utilis, as in other assimilatory organisms, is mediated by two enzymes: nitrate reductase and nitrite reductase. Purified nitrite reductase has been shown to be a heterodimer consisting of 58- and 66-kDa subunits. In the present study, nitrite reductase was found to be capable of utilising both NADH and NADPH as electron donors. FAD, which is an essential coenzyme, stabilised the enzyme during the purification process. The enzyme was modified by cysteine modifiers, and the inactivation could be reversed by thiol reagents. One cysteine was demonstrated to be essential for the enzymatic activity. In vitro, the enzyme was inactivated by ammonium salts, the end product of the path way, proving that the enzyme is assimilatory in function. In vivo, the enzyme was induced by nitrate and repressed by ammonium ions. During induction and repression, the levels of nitrite reductase mRNA, protein, and enzyme activity were modulated together, which indicated that the primary level of regulation of this enzyme was at the transcriptional level. When the enzyme was incubated with ammonium salts in vitro or when the enzyme was assayed in cells grown with the same salts as the source of nitrogen, the residual enzymatic activities were similar. Thus, a study of the in vitro inactivation can give a clue to understanding the mechanism of in vivo regulation of nitrite reductase in Candida utilis.

Regulation of progesterone biosynthesis in the human placenta by estradiol 17 beta and progesterone

Ex vivo addition of estradiol 17 beta to first trimester or term human placental minces caused a significant increase in the quantity of progesterone produced. Addition of an aromatase inhibitor, CGS 16949 A or the estrogen receptor antagonist, ICI 182780, significantly inhibited progesterone production confirming the role of estradiol 17 beta in the regulation of progesterone synthesis in human placenta. RU 486 and ZK 98299, which are antagonists of progesterone receptor, significantly modulated progesterone synthesis in the human placenta but exhibited paradoxical effects on the first trimester and term placenta We conclude that progesterone synthesis in the human placenta is regulated by estradiol 17 beta and progesterone. This is the first report providing evidence for autoregulation of progesterone synthesis in the human placenta.

Mean first passage time approach to the problem of optimal barrier subdivision for Kramer's escape rate

We consider the effect of subdividing the potential barrier along the reaction coordinate on Kramer's escape rate for a model potential, Using the known supersymmetric potential approach, we show the existence of an optimal number of subdivisions that maximizes the rate, We cast the problem as a mean first passage time problem of a biased random walker and obtain equivalent results, We briefly summarize the results of our investigation on the increase in the escape rate by placing a blow-torch in the unstable part of one of the potential wells. (C) 1999 Elsevier Science B.V. All rights reserved.

Optimal control of a stochastic hybrid system with discounted cost

We address the optimal control problem of a very general stochastic hybrid system with both autonomous and impulsive jumps. The planning horizon is infinite and we use the discounted-cost criterion for performance evaluation. Under certain assumptions, we show the existence of an optimal control. We then derive the quasivariational inequalities satisfied by the value function and establish well-posedness. Finally, we prove the usual verification theorem of dynamic programming.

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.

Jointly Optimal MMSE design for non-redundant FIR precoding and equalization

We provide a filterbank precoding framework (FBP) for frequency selective channels using the minimum mean squared error (MMSE) criterion. The design obviates the need for introducing a guard interval between successive blocks, and hence can achieve the maximum possible bandwidth efficiency. This is especially useful in cases where the channel is of a high order. We treat both the presence and the absence of channel knowledge at the transmitter. In the former case, we obtain the jointly optimal precoder-equalizer pair of the specified order. In the latter case, we use a zero padding precoder, and obtain the MMSE equalizer. No restriction on the dimension or nature of the channel matrix is imposed. Simulation results indicate that the filterbank approach outperforms block based methods like OFDM and eigenmode precoding.

Delay constrained optimal relay placement for planned wireless sensor networks

In this paper, we study the problem of wireless sensor network design by deploying a minimum number of additional relay nodes (to minimize network design cost) at a subset of given potential relay locationsin order to convey the data from already existing sensor nodes (hereafter called source nodes) to a Base Station within a certain specified mean delay bound. We formulate this problem in two different ways, and show that the problem is NP-Hard. For a problem in which the number of existing sensor nodes and potential relay locations is n, we propose an O(n) approximation algorithm of polynomial time complexity. Results show that the algorithm performs efficiently (in over 90% of the tested scenarios, it gave solutions that were either optimal or exceeding optimal just by one relay) in various randomly generated network scenarios.

A Complete Characterization of an Optimal Timer Based Selection Scheme

Timer-based mechanisms are often used in several wireless systems to help a given (sink) node select the best helper node among many available nodes. Specifically, a node transmits a packet when its timer expires, and the timer value is a function of its local suitability metric. In practice, the best node gets selected successfully only if no other node's timer expires within a `vulnerability' window after its timer expiry. In this paper, we provide a complete closed-form characterization of the optimal metric-to-timer mapping that maximizes the probability of success for any probability distribution function of the metric. The optimal scheme is scalable, distributed, and much better than the popular inverse metric timer mapping. We also develop an asymptotic characterization of the optimal scheme that is elegant and insightful, and accurate even for a small number of nodes.

Delay and energy optimal two-hop relaying in delay tolerant networks

We study the trade-off between delivery delay and energy consumption in delay tolerant mobile wireless networks that use two-hop relaying. The source may not have perfect knowledge of the delivery status at every instant. We formulate the problem as a stochastic control problem with partial information, and study structural properties of the optimal policy. We also propose a simple suboptimal policy. We then compare the performance of the suboptimal policy against that of the optimal control with perfect information. These are bounds on the performance of the proposed policy with partial information. Several other related open loop policies are also compared with these bounds.

Damped Belief Propagation Based Near-Optimal Equalization of Severely Delay-Spread UWB MIMO-ISI Channels

In this paper, we present a belief propagation (BP) based equalizer for ultrawideband (UWB) multiple-input multiple-output (MIMO) inter-symbol interference (ISI) channels characterized by severe delay spreads. We employ a Markov random field (MRF) graphical model of the system on which we carry out message passing. The proposed BP equalizer is shown to perform increasingly closer to optimal performance for increasing number of multipath components (MPC) at a much lesser complexity than that of the optimum equalizer. The proposed equalizer performs close to within 0.25 dB of SISO AWGN performance at 10-3 bit error rate on a severely delay-spread MIMO-ISI channel with 20 equal-energy MPCs. We point out that, although MIMO/UWB systems are characterized by fully/densely connected graphical models, the following two proposed features are instrumental in achieving near-optimal performance for large number of MPCs at low complexities: i) use of pairwise compatibility functions in densely connected MRFs, and ii) use of damping of messages.

On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems

We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.

Optimal allocation of carbon credits to emitting agents in a carbon economy

Reduction of carbon emissions is of paramount importance in the context of global warming. Countries and global companies are now engaged in understanding systematic ways of achieving well defined emission targets. In fact, carbon credits have become significant and strategic instruments of finance for countries and global companies. In this paper, we formulate and suggest a solution to the carbon allocation problem, which involves determining a cost minimizing allocation of carbon credits among different emitting agents. We address this challenge in the context of a global company which is faced with the challenge of determining an allocation of carbon credit caps among its divisions in a cost effective way. The problem is formulated as a reverse auction problem where the company plays the role of a buyer or carbon planning authority and the different divisions within the company are the emitting agents that specify cost curves for carbon credit reductions. Two natural variants of the problem: (a) with unlimited budget and (b) with limited budget are considered. Suitable assumptions are made on the cost curves and in each of the two cases we show that the resulting problem formulation is a knapsack problem that can be solved optimally using a greedy heuristic. The solution of the allocation problem provides critical decision support to global companies engaged seriously in green programs.

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.