Biosynthesis of the escherichia coli K4 capsule polysaccharide. A parallel system for studies of glycosyltransferases in chondroitin formation

Escherichia coli K4 bacteria synthesize a capsule polysaccharide (GalNAc-GlcA(fructose))n with the carbohydrate backbone identical to chondroitin. GlcA- and GalNAc-transferase activities from the bacterial membrane were assayed with acceptors derived from the capsule polysaccharide and radiolabeled UDP-[14C]GlcA and UDP-[3H]GalNAc, respectively. It was shown that defructosylated oligosaccharides (chondroitin) could serve as substrates for both the GlcA- and the GalNAc-transferases. The radiolabeled products were completely degraded with chondroitinase AC; the [14C]GlcA unit could be removed by beta-D-glucuronidase, and the [3H]GalNAc could be removed by beta-N-acetylhexosaminidase. A fructosylated oligosaccharide acceptor tested for GlcA-transferase activity was found to be inactive. These results indicate that the chain elongation reaction of the K4 polysaccharide proceeds in the same way as the polymerization of the chondroitin chain, by the addition of the monosaccharide units one by one to the nonreducing end of the polymer. This makes the biosynthesis of the K4 polysaccharide an interesting parallel system for studies of chondroitin sulfate biosynthesis. In the biosynthesis of capsule polysaccharides from E. coli, a similar mechanism has earlier been demonstrated for polysialic acid (NeuNAc)n (Rohr, T. E., and Troy, F. A. (1980) J. Biol. Chem. 255, 2332-2342) and for the K5 polysaccharide (GlcAbeta1-4GlcNAcalpha1-4)n (Lidholt, K., Fjelstad, M., Jann, K., and Lindahl, U. (1994) Carbohydr. Res. 255, 87-101). In contrast, chain elongation of hyaluronan (GlcAbeta1-3GlcNAcbeta1-4)n is claimed to occur at the reducing end (Prehm, P. (1983) Biochem. J. 211, 181-189).     

Evaluating the impact of CASE: an empirical comparison of retrospective and cross-sectional survey approaches

The purpose of this paper is to evaluate two methods of assessing the productivity and quality impact of Computer Aided Software Engineering (CASE) and Fourth Generation Language (4GL) technologies: (1) by the retrospective method; and (2) the cross-sectional method. Both methods involve the use of questionnaire surveys. Developers' perceptions depend on the context in which they are expressed and this includes expectations about the effectiveness of a given software product. Consequently, it is generally not reliable to base inferences about the relative merits of CASE and 4GLs on a cross-sectional comparison of two separate samples of users. The retrospective method that requires each respondent to directly compare different products is shown to be more reliable. However, there may be scope to employ cross-sectional comparisons of the findings from different samples where both sets of respondents use the same reference point for their judgements, and where numerical rather than verbal rating scales are used to measure perceptions.     

Electrical linewidth test structures fabricated in monocrystallinefilms for reference-material applications

The physical widths of reference features incorporated into electrical linewidth test structures patterned in films of monocrystalline silicon have been determined from Kelvin voltage measurements. The films in which the test structures are patterned are electrically insulated from the bulk-silicon substrate by a layer of silicon dioxide provided by SIMOX (Separation by the IMplantation of OXygen) processing. The motivation is to facilitate the development of linewidth reference materials for critical-dimension (CD) metrology-instrument calibration. The selection of the (110) orientation of the starting silicon and the orientation of the structures' features relative to the crystal lattice enable a lattice-plane-selective etch to generate reference-feature properties of rectangular cross section and atomically planar sidewalls. These properties are highly desirable for CD applications in which feature widths are certified with nanometer-level uncertainty for use by a diverse range of CD instruments. End applications include the development and calibration of new generations of CD instruments directed at controlling processes for manufacturing devices having sub-quarter-micrometer features     

Transmission capacity of optical path overhead transfer schemeusing pilot tone for optical path network

Photonic networks based on the optical path concept and wavelength division multiplexing (WDM) technology require unique operation, administration, and maintenance (OAM) functions. In order to realize the required OAM functions, the optical path network must support an effective management information transfer method. The method that superimposes a pilot tone on the optical signal appears very interesting for optical path overhead transfer. The pilot tone transmission capacity is determined by the carrier to noise ratio which depends on the power spectral density of the optical signal. The pilot tone transmission capacity of an optical path network employing WDM technology is elucidated; 4.5 kb/s transmission can be realized when the pilot tone modulation index is set at 3%     

Prolog/Rex-a way to extend Prolog for better knowledgerepresentation

Prolog/Rex represents a powerful amalgamation of the latest techniques for knowledge representation and processing, rich in semantic features that ease the difficult task of encoding heterogeneous knowledge of real-world applications. The Prolog/Rex concept mechanism lets a user represent domain entities in terms of their structural and behavioral properties, including multiple inheritance, arbitrary user-defined relations among entities, annotated values (demons), incomplete knowledge, etc. A flexible rule language helps the knowledge engineer capture human expertise and provide flexible control of the reasoning process. Additional Prolog/Rex strength that cannot be found in any other hybrid language made on top of Prolog is language level support for keeping many potentially contradictory solutions to a problem, allowing possible solutions and their implications to be automatically generated and completely explored before they are committed. The same mechanism is used to model time-states, which are useful in planning and scheduling applications of Prolog/Rex     

Partial indexing for nonuniform data distributions in relationalDBMS's

It is well known that the effectiveness of relational database systems is greatly dependent on the efficiency of the data access strategies. For this reason, much work has been devoted to the development of new access techniques, supported by adequate access structures such as the B⁺trees. The effectiveness of the B ⁺tree also depends on the data distribution characteristics; in particular, poor performance results when the data show strong key value distribution unbalancing. The aim of this paper is to present the partial index: a new access structure that is useful in such cases of unbalancing, as an alternative to the B⁺tree unclustered indexes. The access structures are built in the physical design phase, and at execution (or compilation) time, the optimizer chooses the most efficient access path. Thus, integration of the partial indexing technique in the design and in the optimization process are also described     

Evaluation of a parallel branch-and-bound algorithm on a class ofmultiprocessors

We propose and evaluate a parallel “decomposite best-first” search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial best-first search branch-and-bound algorithm. This analysis is used in predicting the parallel algorithm speed-up. The proposed algorithm initially decomposes a problem into N subproblems, where N is the number of processors available in a multiprocessor. Afterwards, each processor executes the serial best-first search to find a local feasible solution. Local solutions are broadcasted through the network to compute the final solution. A conflict-free mapping scheme, known as the step-by-step spread, is used for subproblem distribution on the MIN. A speedup expression for the parallel algorithm is then derived using the serial best-first search node evaluation model. Our analysis considers both computation and communication overheads for providing realistic speed-up. Communication modeling is also extended for the parallel global best-first search technique. All the analytical results are validated via simulation. For large systems, when communication overhead is taken into consideration, it is observed that the parallel decomposite best-first search algorithm provides better speed-up compared to other reported schemes     

Constant-time parallel algorithms for image labeling on areconfigurable network of processors

A constant-time algorithm for labeling the connected components of an N×N image on a reconfigurable network of N³ processors is presented. The main contribution of the algorithm is a novel constant-time technique for determining the minimum-labeled PE in each component. The number of processors used by the algorithm can be reduced to N/sup 2+(1/d/), for any 1⩽d⩽log N, if O(d) time is allowed     

Processor membership in asynchronous distributed systems

Presents protocols for determining processor membership in asynchronous distributed systems that are subject to processor and communication faults. These protocols depend on the placement of a total order on broadcast messages. The types of systems for which each of these protocols is applicable are characterized by the properties of the communication mechanisms and by the availability of stable storage. In the absence of stable storage or of a mechanism for distinguishing promptly delivered messages, the authors show that no membership protocol can exist. They also discuss their experience in implementing these membership protocols