Search

Minimum cost path problems are considered for time-varying networks which possess piecewise linear travel costs/transit delays on edges and constant parking costs/enterable-unenterable restrictions on nodes. The arrival characteristics and departure characteristics are formulated, and their computation algorithms are designed. These characteristics are not values but curves with respect to generic time, which are novel features contrasted with the conventional time-invariant problems. Piecewise linearity of costs and delays drastically reduces the computational complexity. >

Mutual exclusion is treated in distributed autonomous environments. The most important property of the autonomous network treated here is its membership variability, that is, frequency occurrence of entries of new nodes and exits of old nodes. Thus, when the network is large-scale, it is not possible for each node to keep up the information of all other nodes. The authors have previously designed a mutual exclusion algorithm of the single shared resource case for distributed environments of autonomous nodes, based on the Chandy-Misra protocol for Dining Philosopher (diners) problems (K. M. Chandy and J. Misra, 1984). Mutual exclusion of multiple shared resource cases is considered. The condition that no more than k nodes can use the shared resource is given. Since the acyclic graph model used in the model can be represented by a marked graph model, this model is used in analysis. >

In this paper we consider a sex-fair matching in the stable marriage problem. The sex-fair stable matching defined in this paper has a property that the sum of the partner's rank of each man in his preference list is as close as possible to the sum of the partner's rank of each woman in her preference list. We transform the sex-fair marriage problem into a graph problem which is suitable for a genetic algorithm. We propose a genetic algorithm for the sex-fair stable matching. The transformation into the graph problem makes application of the GA easier and effective. Computer experiments show the effectiveness of the proposed genetic algorithm.

Object-stacking is a model for structuring object based systems. The main feature of object-stacking is that layers of objects with a uniform interface are constructed, and the functions of these objects are integrated. The effectiveness of object-stacking has been shown for file systems of distributed operating systems. The paper presents the application of the object-stacking model to the World-Wide Web, an information exploring/providing system on the Internet. Object-stacking gives powerful tools to information providers who use the World-Wide Web. The paper describes the implementation method of object-stacking in the World-Wide Web. The paper proposes the new concepts of demand stacking, virtual stackable objects, and pointer swizzling in the World-Wide Web.

SUMMARY Four patients with untreated congenital virilizing adrenal hyper-plasia (partial 21-hydroxylase deficiency) were studied by bilateral adrenal vein catheterization. Simultaneous right and left adrenal and peripheral blood samples were collected for determination of oestrone (E1) and oestradiol (E2. The concentrations of both were higher in the adrenal effluents than in the peripheral blood samples, indicating their secretion by the adrenals. All patients were also studied during a sequential test of suppression (0.5 h after i.v. administration of 4 mg dexamethasone) and stimulation (5 min after i.v. administration of 250 μg ACTH 1–24; Synacthen). Mean peripheral E2 concentrations did not change significantly whereas E1 increased above control levels after stimulation. In contrast, suppression of adrenal venous blood concentrations with dexamethasone, and stimulation with ACTH, was demonstrated for every patient. The results indicate that in congenital adrenal hyperplasia the adrenal glands secrete significant amounts of E1 and E2.

Matrix acetylglutamate of uncoupled rat liver mitochondria increased about 10-fold, to 4.3 nmol/microliters, upon incubation with 5 mM concentrations of that compound. Uncoupled mitochondria incubated with the reagents needed for carbamyl phosphate and citrulline synthesis and 5 mM acetylglutamate synthesized citrulline at velocities which reached 99 nmol/min/mg of protein; simultaneously, as much as 47 nmol/min/mg of carbamyl phosphate accumulated and was distributed between matrix and medium. Maximal total carbamyl phosphate synthesis was, therefore, 146 nmol/min/mg, similar to the activity measured in liver homogenates. Without added acetylglutamate, some carbamyl phosphate accumulated when citrulline synthesis was about 40 nmol/min/mg. The finding that ornithine transcarbamylase can be limiting for citrulline synthesis shows that the activity of this enzyme is greatly restricted in mitochondria. The stimulation by ornithine of mitochondrial carbamyl phosphate synthesis was prevented when ornithine transcarbamylase was inhibited more than 96% by 5 mM delta-N-phosphonacetyl-L-ornithine, suggesting that the normal stimulatory effect of ornithine on carbamyl phosphate synthetase occurs via ornithine transcarbamylase. Lower concentrations of delta-N-phosphonacetyl-L-ornithine were required to achieve a given inhibition of citrulline synthesis from added carbamyl phosphate from endogenously synthesized carbamyl phosphate. The results reported suggest the existence of interactions between carbamyl phosphate synthetase and ornithine transcarbamylase in the matrix.