The influence of project complexity on estimating accuracy

With the rapid development in technology over recent years, construction, in common with many areas of industry, has become increasingly complex. It would, therefore, seem to be important to develop and extend the understanding of complexity so that industry in general and in this case the construction industry can work with greater accuracy and efficiency to provide clients with a better service. This paper aims to generate a definition of complexity and a method for its measurement in order to assess its influence upon the accuracy of the quantity surveying profession in UK new build office construction. Quantitative data came from an analysis of twenty projects of varying size and value and qualitative data came from interviews with professional quantity surveyors. The findings highlight the difficulty in defining and measuring project complexity. The correlation between accuracy and complexity was not straightforward, being subjected to many extraneous variables, particularly the impact of project size. Further research is required to develop a better measure of complexity. This is in order to improve the response of quantity surveyors, so that an appropriate level of effort can be applied to individual projects, permitting greater accuracy and enabling better resource planning within the profession.

Interfacial structure of wild-type and mutant forms of puroindoline-b bound to DPPG monolayers

The interaction of wild-type puroindoline-b (Pin-b+) and two mutant forms having single residue substitutions (G46S or W44R) with L-alpha-dipalmitoylphosphatidyl-dl-glycerol (DPPG) as a Langmuir monolayer at the air/water interface was investigated by neutron reflectivity (NR) and Brewster angle microscopy (BAM). NR profiles were fitted using a three-layer model to enable differences in penetration of protein between the lipid headgroup and acyl regions to be determined. The data showed similar surface excesses for each of the three proteins at the interface; however, it was revealed that the depth of penetration of protein into the lipid region differed for each protein with Pin-b+ penetrating further into the acyl region of the lipid compared to the mutant forms of the protein that interacted with the headgroup region only. BAM images revealed that the domain structure of the DPPG monolayers was disrupted when Pin-b+ adsorption had reached equilibrium, suggesting protein penetration had led to compression of the lipid region. In contrast, the domain structure was unaffected by the W44R mutant, suggesting no change in compression of the lipid region and hence little or no penetration of protein into the lipid layer.

The importance of sward architectural complexity in structuring predatory and phytophagous invertebrate assemblages

1. Although the importance of plant community assemblages in structuring invertebrate assemblages is well known, the role that architectural complexity plays is less well understood. In particular, direct empirical data for a range of invertebrate taxa showing how functional groups respond to plant architecture is largely absent from the literature. 2. The significance of sward architectural complexity in determining the species richness of predatory and phytophagous functional groups of spiders, beetles, and true bugs, sampled from 135 field margin plots over 2 years was tested. The present study compares the relative importance of sward architectural complexity to that of plant community assemblage. 3. Sward architectural complexity was found to be a determinant of species richness for all phytophagous and predatory functional groups. When individual species responses were investigated, 62.5% of the spider and beetle species, and 50.0% of the true bugs responded to sward architectural complexity. 4. Interactions between sward architectural complexity and plant community assemblage indicate that the number of invertebrate species supported by the plant community alone could be increased by modification of sward architecture. Management practices could therefore play a key role in diversifying the architectural structure of existing floral assemblages for the benefit of invertebrate assemblages. 5. The contrasting effects of sward architecture on invertebrate functional groups characterised by either direct (phytophagous species) or indirect (predatory species) dependence on plant communities is discussed. It is suggested that for phytophagous taxa, plant community assemblage alone is likely to be insufficient to ensure successful species colonisation or persistence without appropriate development of sward architecture.

The structure of echovirus type 12 bound to a two-domain fragment of its cellular attachment protein decay-accelerating factor (CD 55)

Echovirus type 12 (EV12), an enterovirus of the Picornaviridae family, uses the complement regulator, decay-accelerating factor (DAF, CD55) as a cellular receptor. We have calculated a three-dimensional reconstruction of EV12 bound to a fragment of DAF, consisting of short consensus repeat domains 3 and 4, from cryo-negative stain electron microscopy data (EMD #1057). This shows that, as for an earlier reconstruction of the related echovirus type 7 bound to DAF, attachment is not within the viral canyon but occurs close to the two-fold symmetry axes. Despite this general similarity, our reconstruction reveals a receptor interaction that is quite different from that observed for EV7. Fitting of the crystallographic co-ordinates for DAF34 and EV11 into the reconstruction shows a close agreement between the crystal structure of the receptor fragment and the density for the virus-bound receptor, allowing unambiguous positioning of the receptor with respect to the virion (PDB #1UPN). Our finding that the mode of virus-receptor interaction in EV12 is distinct from that seen for EV7 raises interesting questions regarding the evolution and biological significance of the DAF-binding phenotype in these viruses.

Glutathione and related thiol compounds II: the importance of protein bound glutathione and related protein-bound compounds in gluten proteins

Protein-bound glutathione (PSSG) and protein-bound related thiol compounds, i.e. cysteine (PSSCys), glutamyl-cysteine (PSSGlu-Cys) and cysteinyl-glycine (PSSCys-Gly), were analysed in proteins of Osborne fractions, i.e. gliadin, glutenin and gliadin-, glutenin-subfractions separated by gel filtration chromatography, gel protein and the total gluten proteins separated from wheat varieties with varying breadmaking performances. The results showed that PSSG and some protein-bound related thiol compounds were found in monomeric gliadins, indicating that glutathione and some related thiol compounds are able to form disulphide bonds (SS) with sulphydryl group (SH) of those proteins and the formation of those disulphide bonds may prevent those monomeric proteins from binding to other proteins. It was also observed that a larger amount of PSSG in glutenin proteins was negatively correlated with the molecular weight (M-w) distribution of glutenin polymers, suggesting that PSSG and protein-bound related thiol compounds may play an important role in controlling polymerisation of glutenin. Furthermore, it was found that the level of PSSG in gel protein from flours with poor breadmaking performances was constantly higher and significantly different (p < 0.05) from that of flours with good breadmaking performance. The same trend was observed with gluten samples from breadmaking and biscuitmaking flours. (C) 2003 Elsevier Ltd. All rights reserved.

Computational complexity of weighted splitting schemes on parallel computers

In models of complicated physical-chemical processes operator splitting is very often applied in order to achieve sufficient accuracy as well as efficiency of the numerical solution. The recently rediscovered weighted splitting schemes have the great advantage of being parallelizable on operator level, which allows us to reduce the computational time if parallel computers are used. In this paper, the computational times needed for the weighted splitting methods are studied in comparison with the sequential (S) splitting and the Marchuk-Strang (MSt) splitting and are illustrated by numerical experiments performed by use of simplified versions of the Danish Eulerian model (DEM).

Complexity of Monte Carlo algorithms for a class of integral equations

In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the integral equation by a system of algebraic equations. Then the Markov chain iterative Monte Carlo is used to solve the system. The assumption here is that the corresponding Neumann series for the iterative matrix does not necessarily converge or converges slowly. We use a special technique to accelerate the convergence. An estimate of the computational complexity of Monte Carlo algorithm using the considered approach is obtained. The estimate of the complexity is compared with the corresponding quantity for the complexity of the grid-free Monte Carlo algorithm. The conditions under which the class of grid Monte Carlo algorithms is more efficient are given.

A-optimality orthogonal forward regression algorithm using branch and bound

In this brief, we propose an orthogonal forward regression (OFR) algorithm based on the principles of the branch and bound (BB) and A-optimality experimental design. At each forward regression step, each candidate from a pool of candidate regressors, referred to as S, is evaluated in turn with three possible decisions: 1) one of these is selected and included into the model; 2) some of these remain in S for evaluation in the next forward regression step; and 3) the rest are permanently eliminated from S. Based on the BB principle in combination with an A-optimality composite cost function for model structure determination, a simple adaptive diagnostics test is proposed to determine the decision boundary between 2) and 3). As such the proposed algorithm can significantly reduce the computational cost in the A-optimality OFR algorithm. Numerical examples are used to demonstrate the effectiveness of the proposed algorithm.

A lower bound on the size of k-neighborhood in generalized cubes

The determination of the minimum size of a k-neighborhood (i.e., a neighborhood of a set of k nodes) in a given graph is essential in the analysis of diagnosability and fault tolerance of multicomputer systems. The generalized cubes include the hypercube and most hypercube variants as special cases. In this paper, we present a lower bound on the size of a k-neighborhood in n-dimensional generalized cubes, where 2n + 1 <= k <= 3n - 2. This lower bound is tight in that it is met by the n-dimensional hypercube. Our result is an extension of two previously known results. (c) 2005 Elsevier Inc. All rights reserved.

Deciphering the complexity of sainfoin (Onobrychis viciifolia) proanthocyanidins by MALDI-TOF mass spectrometry with a judicious choice of isotope patterns and matrixes

Use of superdihydroxybenzoic acid as the matrix enabled the analysis of highly complex mixtures of proanthocyanidins from sainfoin (Onobrychis viciifolia) by MALDI-TOF mass spectrometry. Proanthocyanidins contained predominantly B-type homopolymers and heteropolymers up to 12- mers (3400 Da). Use of another matrix, 2,6-dihydroxyacetophenone, revealed the presence of A-type glycosylated dimers. In addition, we report here how a comparison of the isotopic adduct patterns, which resulted from Li and Na salts as MALDI matrix additives, could be used to confirm the presence of A-type linkages in complex proanthocyanidin mixtures. Preliminary evidence suggested the presence of A-type dimers in glycosylated prodelphinidins and in tetrameric procyanidins and prodelphinidins.