bluuebunny/crossref_metadata_2025_split huggingface dataset:
The effects of surface moisture on aeolian sediment transport threshold and mass flux on a beach
Authors: Davidson‐Arnott Robin G. D. , Yang Yanqi , Ollerhead Jeff , Hesp Patrick A. , Walker Ian J. 
Published: June 2007

AbstractThis paper presents results from a study designed to explore the effects of beach surface moisture and fetch effects on the threshold of movement, intensity of sand transport by wind and mass flux. The experiment was carried out over a period of five weeks at Greenwich Dunes, Prince Edward Island, Canada in May and June 2002. Moisture content was measured with a Delta‐T moisture probe over a 50 m by 25 m grid established on the beach. Measurements of wind speed and direction were made with arrays of cup anemometers and a two‐dimensional sonic anemometer. Transport intensity was measured at a height of 2–4 cm above the bed using omnidirectional saltation probes which count the impact of saltating grains on a piezoelectric crystal. Anemometers and saltation probes were sampled at 1 Hz. Sand transport was measured with vertical integrating sand traps over periods of 10–20 minutes. Results show that where there is a considerable supply of dry sand the saltation system responds very rapidly (1–2 s) to fluctuations in wind speed, i.e. to wind gusts. Where sand supply from the surface is limited by moisture, mean transport rates are much lower and this reflects in both a reduction in the instantaneous transport rate and in a transport system that becomes increasingly intermittent. Threshold wind speed is significantly correlated with an increase in surface moisture content near the upwind end of the beach fetch, but the relationship is not significant at the downwind end where sediment transport is initiated primarily by saltation impact from upwind. Mass flux increases with increasing fetch length and the relationship is described best by a power function. Further work is necessary to develop a theoretical function to predict the increase in transport with fetch distance as well as the critical fetch distance. Copyright © 2007 John Wiley & Sons, Ltd.
Modified MMF (Morgan–Morgan–Finney) model for evaluating effects of crops and vegetation cover on soil erosion
Authors: Morgan R. P. C. , Duzant J. H. 
Published: June 2007

AbstractModifications are made to the revised Morgan–Morgan–Finney erosion prediction model to enable the effects of vegetation cover to be expressed through measurable plant parameters. Given the potential role of vegetation in controlling water pollution by trapping clay particles in the landscape, changes are also made to the way the model deals with sediment deposition and to allow the model to incorporate particle‐size selectivity in the processes of erosion, transport and deposition. Vegetation effects are described in relation to percentage canopy cover, percentage ground cover, plant height, effective hydrological depth, density of plant stems and stem diameter. Deposition is modelled through a particle fall number, which takes account of particle settling velocity, flow velocity, flow depth and slope length. The detachment, transport and deposition of soil particles are simulated separately for clay, silt and sand. Average linear sensitivity analysis shows that the revised model behaves rationally. For bare soil conditions soil loss predictions are most sensitive to changes in rainfall and soil parameters, but with a vegetation cover plant parameters become more important than soil parameters. Tests with the model using field measurements under a range of slope, soil and crop covers from Bedfordshire and Cambridgeshire, UK, give good predictions of mean annual soil loss. Regression analysis of predicted against observed values yields an intercept value close to zero and a line slope close to 1·0, with a coefficient of efficiency of 0·81 over a range of values from zero to 38·6 t ha−1. Copyright © 2007 John Wiley & Sons, Ltd.
Organizational learning as an organization development intervention in six high‐technology firms in Taiwan: An exploratory case study
Authors: Lien Bella Ya‐Hui , Hung Richard Y. , McLean Gary N. 
Published: June 2007

AbstractOrganizational learning (OL) is about how individuals collect, absorb, and transform information into organizational memory and knowledge. This case study explored how six high‐technology firms in Taiwan chose OL as an organization development intervention strategy. Issues included how best to implement OL; how individuals, teams, and organizations learn; and the extent to which OL activities contributed to organizational performance. Five themes emerged as findings: (1) using language with which employees are familiar, (2) implementing OL concepts that are congruent with employees' work or personal life, (3) putting individual learning first and diffusing it to team learning and organizational learning, (4) using the knowledge management system to create an opportunity for individuals, teams, and the organization to learn, and (5) linking OL to organizational strategy to improve organizational performance.
Where to now? Race and ethnicity in workplace learning and development research: 1980–2005
Authors: Brooks Ann K. , Clunis Tamara 
Published: June 2007

AbstractThis review of research focuses on the impact of race and on learning and development in the U.S. workplace from 1980 to 2005. Specifically, we take a historical perspective on race and ethnicity in the United States; summarize and synthesize research in the areas of career development, training, promotion, performance appraisals, mentoring, and social networking; and make recommendations regarding research questions, theory, and research design.
The primacy of octacalcium phosphate collagen composites in bone regeneration
Authors: Kamakura Shinji , Sasaki Kazuo , Homma Takahiro , Honda Yoshitomo , Anada Takahisa , Echigo Seishi , Suzuki Osamu 
Published: June 2007

AbstractWe have engineered a scaffold constructed of synthetic octacalcium phosphate (OCP) and porcine collagen sponge (OCP/Col), and reported that OCP/Col drastically enhanced bone regeneration. In this study, we investigated whether OCP/Col would enhance bone regeneration more than β‐tricalcium phosphate (β‐TCP) collagen composite (β‐TCP/Col) or hydroxyapatite (HA) collagen composite (HA/Col). Discs of OCP/Col, β‐TCP/Col, or HA/Col were implanted into critical‐sized defects in rat crania and fixed at 4 or 12 weeks after implantation. The newly formed bone and the remaining granules of implants in the defect were determined by histomorphometrical analysis, and radiographic and histological examinations were performed. Statistical analysis showed that the newly formed bone by the implantation of OCP/Col was significantly more than that of β‐TCP/Col or HA/Col. In contrast, the remaining granules in OCP/Col were significantly lower than those in β‐TCP/Col or HA/Col. Bone regeneration by OCP/Col was based on secured calcified collagen and bone nucleation by OCP, whereas bone regeneration by β‐TCP/Col or HA/Col was initiated by poorly calcified collagen and osteoconductivity by β‐TCP or HA. This study showed that the implantation of OCP/Col in a rat cranial defect enhanced more bone regeneration than β‐TCP/Col and HA/Col. © 2007 Wiley Periodicals, Inc. J Biomed Mater Res, 2007
Human monocyte adhesion onto RGD and PHSRN peptides delivered to the surface of a polycarbonate polyurethane using bioactive fluorinated surface modifiers
Authors: Ernsting Mark J. , Labow Rosalind S. , Santerre J. Paul 
Published: June 2007

AbstractFluorinated oligomers, when blended into polyurethane, have been shown to migrate to the surface and generate an interface that minimizes protein denaturation and reduces cell activation. This type of surface modification can be achieved with ppm quantities of a bioactive fluorinated surface modifier (BFSM), enabling the introduction of bioactive agents onto a surface in one manufacturing step. In the current study, two BFSMs were synthesized with covalently conjugated RGD and PHSRN peptides near the fluorine terminal groups, and were shown to be surface active in polyurethane blends. CyQuant cell enumeration, scanning electron microscopy, and cell viability assays all indicated that the bioactive (and fluorinated) substrates supported enhanced monocyte interaction. The simplicity of the surface modification technique and the demonstrated ability of the peptide BFSMs to influence cell attachment and spreading indicate the potential benefits and practical value of the BFSM technology in tailoring surfaces for biomaterial applications. This was specifically highlighted for human blood monocytes, a key cell involved in the early stages of wound healing. © 2007 Wiley Periodicals, Inc. J Biomed Mater Res, 2007
Embryonic undifferentiated cells show scattering activity on a surface coated with immobilized E‐cadherin
Authors: Nagaoka Masato , Ise Hirohiko , Harada Ichiro , Koshimizu Uichi , Maruyama Atsushi , Akaike Toshihiro 
Published: June 2007

AbstractRearrangement of cell–cell adhesion is a critical event in embryonic development and tissue formation. We investigated the regulatory function of E‐cadherin, a key adhesion protein, in the developmental process by using E‐cadherin/IgG Fc fusion protein as an adhesion matrix in cell culture. F9 embryonal carcinoma cells usually form colonies when cultured on gelatin or fibronectin matrices. However, F9 cells cultured on the E‐cadherin/IgG Fc fusion protein matrix formed a scattered distribution, with a different cytoskeletal organization and E‐cadherin‐rich protrusions that were regulated by Rac1 activity. The same scattering activity was observed in P19 embryonal carcinoma cells. In contrast, three types of differentiated cells, NMuMG mammary gland cells, MDCK kidney epithelial cells, and mouse primary isolated hepatocytes, did not show the scattering activity observed in F9 and P19 cells. These results suggest that migratory behavior on an E‐cadherin‐immobilized surface is only observed in embryonic cells, and that the regulatory mechanisms underlying E‐cadherin‐mediated cell adhesion vary with the state of differentiation. J. Cell. Biochem. 103: 296–310, 2008. © 2007 Wiley‐Liss, Inc.
Nuclear localization of magphinins, alternative splicing products of the human trophinin gene
Authors: Aoyama Junya , Akazawa Yusuke , Kasahara Kousuke , Higashiyama Yukihiro , Kikuchi Ikue , Fukumoto Yasunori , Saburi Sakura , Nakayama Yuji , Fukuda Michiko N. , Yamaguchi Naoto 
Published: June 2007

AbstractHuman magphinin proteins are translation products of differentially spliced transcripts from the 5′ region of the human trophinin gene (TRO), whose 3′ region encodes trophinin, a unique cell adhesion molecule involved in human embryo implantation. Magphinins belong to the MAGE (melanoma‐associated antigen) family, and a previous study of mouse magphinins showed their expression in male and female germ cells, suggesting a role in germ cell development. Here, we characterized the structure and subcellular localization of human magphinins. Confocal microscopy analysis of ectopically expressed magphinins revealed that magphinin‐α and ‐β localize in the cytoplasm, whereas magphinin‐γ lacking the peptide encoded by exon‐3 is nuclear. Following Triton X‐100 extraction, DNA digestion, and high salt extraction magphinin‐γ remained nuclear, suggesting strong association with the nuclear matrix. A series of magphinin‐γ deletion mutants were generated and assayed for localization, which showed that the N‐terminal region of the MAGE homology domain is necessary for nuclear localization. When magphinin‐γ was expressed in NIH3T3 cells, cells underwent G1 arrest. These results suggest that human magphinin‐γ inhibits cell cycle progression through nuclear activity. J. Cell. Biochem. 103: 765–777, 2008. © 2007 Wiley‐Liss, Inc.
Exercise‐induced modulation of calcineurin activity parallels the time course of myofibre transitions
Authors: Grondard Clément , Biondi Olivier , Pariset Claude , Lopes Philippe , Deforges Séverine , Lécolle Sylvie , Gaspera Bruno Della , Gallien Claude‐Louis , Chanoine Christophe , Charbonnier Frédéric 
Published: June 2007

AbstractThis study establishes a causal link between the limitation of myofibre transitions and modulation of calcineurin activity, during different exercise paradigms. We have designed a new swimming‐based training protocol in order to draw a comparison between a high frequency and amplitude exercise (swimming) and low frequency and amplitude exercise (running). We initially analysed the time course of muscle adaptations to a 6‐ or 12‐week swimming‐ or running‐based training exercise program, on two muscles of the mouse calf, the slow‐twitch soleus and the fast‐twitch plantaris. The magnitude of exercise‐induced muscle plasticity proved to be dependent on both the muscle type and the exercise paradigm. In contrast to the running‐based training which generated a continuous increase of the slow phenotype throughout a 12‐week training program, swimming induced transitions to a slower phenotype which ended after 6 weeks of training. We then compared the time course of the exercise‐induced changes in calcineurin activity during muscle adaptation to training. Both exercises induced an initial activation followed by the inhibition of calcineurin. In the muscles of animals submitted to a 12‐week swimming‐based training, this inhibition was concomitant with the end of myofibre transition. Calcineurin inhibition was a consequence of the inhibition of its catalytic subunit gene expression on one hand, and of the expression increase of the modulatory calcineurin interacting proteins 1 gene (MCIP1), on the other. The present study provides the first experimental cues for an interpretation of muscle phenotypic variation control. J. Cell. Physiol. 214:126–135, 2008. © 2007 Wiley‐Liss, Inc.
Purified mouse egg zona pellucida glycoproteins polymerize into homomeric fibrils under non‐denaturing conditions
Authors: Litscher Eveline S. , Janssen William G. , Darie Costel C. , Wassarman Paul M. 
Published: June 2007

AbstractThe mouse egg's zona pellucida (ZP) is composed of three glycoproteins, called ZP1, ZP2, and ZP3, that migrate as relatively broad, single bands on SDS–PAGE. The glycoproteins are organized within the ZP as a network of long interconnected fibrils that exhibit a structural periodicity. Here, ZP2 and ZP3 were purified by HPLC to homogeneity and analyzed by Blue Native‐ (BN‐) PAGE and transmission electron microscopy (TEM), as well as by SDS–PAGE. As opposed to SDS–PAGE, BN–PAGE, and TEM permit analysis of ZP2 and ZP3 under non‐denaturing conditions. ZP2 and ZP3 migrate on BN–PAGE, not as single bands, but as several discrete oligomers that give rise to larger structures which remain at the origin of the gel. Consistent with this, ZP2 and ZP3 are visualized by TEM as long interconnected fibrils that consist of contiguous beads. Therefore, under non‐denaturing conditions both purified ZP2 and ZP3 polymerize into higher order structures. These findings are of interest since purified ZP3 inhibits binding of mouse sperm to eggs and induces sperm to undergo the acrosome reaction in vitro. Results presented here suggest that these biological effects of ZP3 are due to binding of homomeric fibrils of ZP3 to sperm. J. Cell. Physiol. 214:153–157, 2008. © 2007 Wiley‐Liss, Inc.
Non‐overlapping expression patterns of the clustered Dll‐A/B genes in the ascidian Ciona Intestinalis
Authors: Irvine Steven Q. , Cangiano Michelle C. , Millette Brad J. , Gutter Erika S. 
Published: June 2007

AbstractThe Ci‐Dll‐A and Ci‐Dll‐B genes of Ciona intestinalis are arranged in a convergently transcribed gene cluster. This genomic arrangement is similar to that of the multiple bigene clusters of the Dlx homologs in vertebrates. Analysis of whole genome sequences showed that linkage to the Hox cluster is conserved with the vertebrate clusters. Phylogenetic analysis supports gene trees consistent with homology of the ascidian and vertebrate Dlx clusters, and in combination with the apparent conservation of genomic arrangement, it is concluded that the ascidian cluster is most likely homologous with the vertebrate clusters. Using whole‐mount in situ hybridization, Ci‐Dll‐B transcripts were detected in all ectodermal lineages through gastrulation. Expression is radically downregulated in the neurula with detectable expression disappearing around the time that Ci‐Dll‐A expression appears in the anterior ectoderm. By the late tailbud stage Ci‐Dll‐Atranscripts were detected in the bilateral atrial primordia and persisted in the atrial rudiments to the larval stage, suggesting a role in development of these neural placode‐like structures. This non‐overlapping expression contradicts a common pattern seen in clustered genes, where as adjacent paralogs have largely overlapping expression domains. Enhancer sharing is often proposed as an explanation for the overlapping expression of gene cluster members. For this case of non‐overlapping expression a model is proposed in which repressors acting at different stages override one or more shared enhancers. The enhancer sharing prevents breakup of the cluster while the independent temporal suppressors hide the presence of the shared enhancers. J. Exp. Zool. (Mol. Dev. Evol.) 308B:428–441, 2007. © 2007 Wiley‐Liss, Inc.
Path chromatic numbers of graphs
Authors: Akiyama Jin , Era Hiroshi , Gervacio Severino V. , Watanabe Mamoru 
Published: June 2007

AbstractLet the finite, simple, undirected graph G = (V(G), E(G)) be vertex‐colored. Denote the distinct colors by 1,2,…,c. Let Vi be the set of all vertices colored j and let <Vi be the subgraph of G induced by Vi. The k‐path chromatic number of G, denoted by χ(G; Pk), is the least number c of distinct colors with which V(G) can be colored such that each connected component of Vi is a path of order at most k, 1 ⩽ i ⩽ c. We obtain upper bounds for χ(G; Pk) and χ(G; P∞) for regular, planar, and outerplanar graphs.
Maximal planar graphs of diameter two
Authors: Seyffarth Karen 
Published: June 2007

AbstractA maximal planar graph is a simple planar graph in which every face is a triangle. We show here that such graphs with maximum degree Δ and diameter two have no more than 3/2Δ + 1 vertices. We also show that there exist maximal planar graphs with diameter two and exactly [3/2Δ + 1] vertices.
On longest cycles and strongly linking vertex sets
Authors: Fassbender Bert 
Published: June 2007

AbstractLet G be a simple non‐hamiltonian graph, let C be a longest cycle in G, and let p be a positive integer. By considering a special form of connectivity, we obtain a sufficient condition on degrees for the nonexistence of (p ‐ 1)‐path‐connected components in G ‐ C.
Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
Authors: Harary Frank , Plantholt Michael J. 
Published: June 2007

AbstractWe say that a graphical invariant i of a graph interpolates over a family F of graphs if i satisfies the following property: If m and M are the minimum and maximum values (respectively) of i over all graphs in F then for each k, m ⩽ k ⩽ M, there is a graph H in F for which i(H)= k. In previous works it was shown that when F is the set of spanning trees of a connected graph G, a large number of invariants interpolate (some of these invariants require the additional assumption that G be 2‐connected). Although the proofs of all these results use the same basic idea of gradually transforming one tree into another via a sequence of edge exchanges, some of these processes require sequences that use more properties of trees than do others. We show that the edge exchange proofs can be divided into three types, in accordance with the extent to which the exchange sequence depends upon properties of spanning trees. This idea is then used to obtain new interpolation results for some invariants, and to show how the exchange methods and interpolation results on spanning trees can be extended to other families of spanning subgraphs.
The size of strength‐maximal graphs
Authors: Lai Hong‐Jian 
Published: June 2007

AbstractLet G be a graph and let k′(G) be the edge‐connectivity of G. The strength of G, denoted by k̄′(G), is the maximum value of k′(H), where H runs over all subgraphs of G. A simple graph G is called k‐maximal if k̄′(G) ≤ k but for any edge e ∈ E(Gc), k̄′(G + e) ≥ k + 1. Let G be a k‐maximal graph of order n. In [3], Mader proved |E(G)| ≤ (n ‐ k)k + (). In this note, we shall show (n ‐ 1)k ‐ () In⌊n/k + 2)⌋ ≤ |E(G|, and characterize the extremal graphs. We shall also give a characterization of all k‐maximal graphs.
The phase transition in the evolution of random digraphs
Authors: Łuczak Tomasz 
Published: June 2007

AbstractLet \documentclass{article}\pagestyle{empty}\begin{document}$ \mathop {\rm D}\limits^ \to $\end{document}(n, M) denote a digraph chosen at random from the family of all digraphs on n vertices with M arcs. We shall prove that if M/n ≤ c < 1 and ω(n) → ∞, then with probability tending to 1 as n → ∞ all components of \documentclass{article}\pagestyle{empty}\begin{document}$ \mathop {\rm D}\limits^ \to $\end{document}(n, M) are smaller than ω(n), whereas when M/n ≥ c > 1 the largest component of \documentclass{article}\pagestyle{empty}\begin{document}$ \mathop {\rm D}\limits^ \to $\end{document}(n, M) is of the order n with probability 1 ‐ o(1).
The distance spectrum of a tree
Authors: Merris Russell 
Published: June 2007

AbstractLet T be a tree with line graph T*. Define K = 2I + A(T*), where A denotes the adjacency matrix. Then the eigenvalues of ‐2K−1 interlace the eigenvalues of the distance matrix D. This permits numerous results about the spectrum of K to be transcribed for the less tractable D.
Locally semicomplete digraphs: A generalization of tournaments
Authors: Bang‐Jensen Jørgen 
Published: June 2007

AbstractIn this paper we introduce a new class of directed graphs called locally semicomplete digraphs. These are defined to be those digraphs for which the following holds: for every vertex x the vertices dominated by x induce a semicomplete digraph and the vertices that dominate x induce a semicomplete digraph. (A digraph is semicomplete if for any two distinct vertices u and ν, there is at least one arc between them.) This class contains the class of semicomplete digraphs, but is much more general. In fact, the class of underlying graphs of the locally semi‐complete digraphs is precisely the class of proper circular‐arc graphs (see [13], Theorem 3). We show that many of the classic theorems for tournaments have natural analogues for locally semicomplete digraphs. For example, every locally semicomplete digraph has a directed Hamiltonian path and every strong locally semicomplete digraph has a Hamiltonian cycle. We also consider connectivity properties, domination orientability, and algorithmic aspects of locally semicomplete digraphs. Some of the results on connectivity are new, even when restricted to semicomplete digraphs.
Quasi‐random tournaments
Authors: Chung F. R. K. , Graham R. L. 
Published: June 2007

AbstractWe introduce a large class of tournament properties, all of which are shared by almost all random tournaments. These properties, which we term “quasi‐random,” have the property that tournaments possessing any one of the properties must of necessity possess them all. In contrast to random tournaments, however, it is often very easy to verify that a particular family of tournaments satisfies one of the quasi‐random properties, thereby giving explicit tournaments with “random‐like” behavior. This paper continues an approach initiated in several earlier papers of the authors where analogous results for graphs (with R.M. Wilson) and hypergraphs are proved.