993 resultados para K. Michael Haywood
Resumo:
Back Row: asst. coach Bill Frieder, coach John Orr, Joel Thompson, K. Michael Robinson, Len Lillard, co-captain Phil Hubbard, Tom Bergen, Paul Heuerman, Alan Hardy, asst. coach Jim Boyce, asst. coach Dan Fife
Front Row: Mngr. Mitchell Kaufman, Marty Bodnar, Mark Lozier, Cornel Williams, co-captain David Baxter, Mike McGee, John Johnson, Tom Staton, Mark Bodnar, ?, mngr. John Anderson
Resumo:
Back Row: Joel Thompson, K. Michael Robinson, Len Lillard, co-captain Phil Hubbard, Tom Bergen, Paul Heuerman, Alan Hardy
Middle Row: asst. coach Bill Frieder, head coach Johnny Orr, Marty Bodnar, Joh Lozier, Mark Bodnar, asst. coach Jim Boyce, asst. coach Dan Fife
Front Row: Mngr. Mitchell Kaufman, Cornel Williams, Thomas Staton, co-captain David Baxter, Mike McGee, John Johnson, ?, mngr. John Anderson
Resumo:
We introduce K-tree in an information retrieval context. It is an efficient approximation of the k-means clustering algorithm. Unlike k-means it forms a hierarchy of clusters. It has been extended to address issues with sparse representations. We compare performance and quality to CLUTO using document collections. The K-tree has a low time complexity that is suitable for large document collections. This tree structure allows for efficient disk based implementations where space requirements exceed that of main memory.
Resumo:
Digital collections are growing exponentially in size as the information age takes a firm grip on all aspects of society. As a result Information Retrieval (IR) has become an increasingly important area of research. It promises to provide new and more effective ways for users to find information relevant to their search intentions. Document clustering is one of the many tools in the IR toolbox and is far from being perfected. It groups documents that share common features. This grouping allows a user to quickly identify relevant information. If these groups are misleading then valuable information can accidentally be ignored. There- fore, the study and analysis of the quality of document clustering is important. With more and more digital information available, the performance of these algorithms is also of interest. An algorithm with a time complexity of O(n2) can quickly become impractical when clustering a corpus containing millions of documents. Therefore, the investigation of algorithms and data structures to perform clustering in an efficient manner is vital to its success as an IR tool. Document classification is another tool frequently used in the IR field. It predicts categories of new documents based on an existing database of (doc- ument, category) pairs. Support Vector Machines (SVM) have been found to be effective when classifying text documents. As the algorithms for classifica- tion are both efficient and of high quality, the largest gains can be made from improvements to representation. Document representations are vital for both clustering and classification. Representations exploit the content and structure of documents. Dimensionality reduction can improve the effectiveness of existing representations in terms of quality and run-time performance. Research into these areas is another way to improve the efficiency and quality of clustering and classification results. Evaluating document clustering is a difficult task. Intrinsic measures of quality such as distortion only indicate how well an algorithm minimised a sim- ilarity function in a particular vector space. Intrinsic comparisons are inherently limited by the given representation and are not comparable between different representations. Extrinsic measures of quality compare a clustering solution to a “ground truth” solution. This allows comparison between different approaches. As the “ground truth” is created by humans it can suffer from the fact that not every human interprets a topic in the same manner. Whether a document belongs to a particular topic or not can be subjective.
Resumo:
Resolving a noted open problem, we show that the Undirected Feedback Vertex Set problem, parameterized by the size of the solution set of vertices, is in the parameterized complexity class Poly(k), that is, polynomial-time pre-processing is sufficient to reduce an initial problem instance (G, k) to a decision-equivalent simplified instance (G', k') where k' � k, and the number of vertices of G' is bounded by a polynomial function of k. Our main result shows an O(k11) kernelization bound.
Resumo:
A new strategy for the total synthesis of (±)-seychellene which involves (i) a regiospecific construction of a bicyclo(2.2.2)octene moiety having a methyl group at the bridgehead and (ii) a vinyl radical induced intramolecular Michael addition is described.
Resumo:
Thirty largemouth bass ( Micropterus salmoide s Lacepde) were implanted with radio tags in late October 2003 in two coves of Lake Seminole, Georgia, and tracked over a 24-hour period about every 10 days to determine their response to herbicide application. After five weeks of tracking, hydrilla ( Hydrilla verticillata Royle) in each cove was treated in early December 2003 with dipotassium salt of endothall (Aquathol K; 7-oxabicyclo [2.2.1] heptane-2,3-dicarboxylic acid) at a rate of 3.5 ppm. Largemouth bass were tracked during application and tracking continued for three months post treatment to assess effects of herbicide treatment on activity patterns. The treatment in Desser Cove successfully reduced hydrilla in approximately half the cove. However, the treatment in Peacock Lake completely eliminated all submersed aquatic vegetation (SAV) by April 2004. Movement and activity centers remained similar between treatment periods in Desser Cove, but increased after treatment in Peacock Lake. Depth occupied by telemetered fish decreased after Aquathol K treatment in both coves. In general, behavior of largemouth bass did not change appreciably during treatment, and only minor changes were observed in the posttreatment period in Peacock Lake, where all SAV was eliminated. Fish showed little attraction to or movement away from treatment areas, and fish migration from either cove was nil after treatment. Application of Aquathol K and subsequent reduction of SAV had little effect on largemouth bass behavior or movement. (PDF has 8 pages.)
Resumo:
The time distribution of the decays of an initially pure K beam into π+π-π° has been analyzed to determine the complex parameter W (also known as Ƞ+-° and (x + iy)). The K beam was produced in a brass target by the interactions of a 2.85 GeV/c π- beam which was generated on an internal target in the Lawrence Radiation Laboratory (LRL) Bevatron. The counters and hodoscopes in the apparatus selected for events with a neutral (K) produced in the brass target, two charged secondaries passing through a magnet spectrometer and a ɣ-ray shower in a shower hodoscope.
From the 275K apparatus triggers, 148 K → π+π-π° events were isolated. The presence of a ɣ-ray shower in the optical shower chambers and a two-prong vee in the optical spark chambers were devices used to isolate the events. The backgrounds were further reduced by reconstructing the momenta of the two charged secondaries and applying kinematic constraints.
The best fit to the final sample of 148 events distributed between .3 and 7.0 K<sub>S lifetimes gives:
ReW = -.05 ±.17
ImW = +.39 +.35/-.37
This result is consistent with both CPT invariance (ReW = 0) and CP invariance (W = 0). Backgrounds are estimated to be less than 10% and systematic effects have also been estimated to be negligible.
An analysis of the present data on CP violation in this decay mode and other K decay modes has estimated the phase of ɛ to be 45.3 ± 2.3 degrees. This result is consistent with the super weak theories of CP violation which predicts the phase of ɛ to be 43°. This estimate is in turn used to predict the phase of Ƞ°° to be 48.0 ± 7.9 degrees. This is a substantial improvement on presently available measurements. The largest error in this analysis comes from the present limits on W from the world average of recent experiments. The K → πuʋ mode produces the next largest error. Therefore further experimentation in these modes would be useful.
Resumo:
Recenzje i sprawozdania z książek
Resumo:
Wzz is a membrane protein that determines the chain length distribution of the O-antigen lipopolysaccharide by an unknown mechanism. Wzz proteins consist of two transmembrane helices separated by a large periplasmic loop. The periplasmic loop of Escherichia coli K-12 Wzz (244 amino acids from K65 to A308) was purified and found to be a monomer with an extended conformation, as determined by gel filtration chromatography and analytical ultracentrifugation. Circular dichroism showed that the loop has a 60% helical content. The Wzz periplasmic loop also contains three regions with predicted coiled coils. To probe the function of the predicted coiled coils, we constructed amino acid replacement mutants of the E. coli K-12 Wzz protein, which were designed so that the coiled coils could be separate without compromising the helicity of the individual molecules. Mutations in one of the regions, spanning amino acids 108 to 130 (region I), were associated with a partial defect in O-antigen chain length distribution, while mutants with mutations in the region spanning amino acids 209 to 223 (region III) did not have an apparent functional defect. In contrast, mutations in the region spanning amino acids 153 to 173 (region II) eliminated the Wzz function. This phenotype was associated with protein instability, most likely due to conformational changes caused by the amino acid replacements, which was confirmed by limited trypsin proteolysis. Additional mutagenesis based on a three-dimensional model of region I demonstrated that the amino acids implicated in function are all located at the same face of a predicted alpha-helix, suggesting that a coiled coil actually does not exist in this region. Together, our results suggest that the regions predicted to be coiled coils are important for Wzz function because they maintain the native conformation of the protein, although the existence of coiled coils could not be demonstrated experimentally.