奥运冠军米斯蒂·海曼的训练特点

美国运动员米斯蒂·海曼在悉尼奥运会女子200m蝶泳比赛中击败了该项世界纪录保持者澳大利亚苏珊 ?奥尼尔,爆出了2000年一大新闻。米斯蒂的成功,首先在于确立训练目标:增强肌肉力量,改善身体组成成份。虽然,那时她的体魄已经非常健康、匀称了,体内只有16%的脂肪,但计划要她降到12%。教练员探索她发展肌肉的突破口,为她制订了符合饮食习惯的各组食谱。训练中,主要做带有力量性、平衡性、多关节的和全身的练习,如:下蹲,静力举重,大步行进中的扩胸等练习,以增大肺活量。教练员还为她设计了提高肩后部和上背部的力量、提高腰腹部的力量和改善四头…     

The value of structured abstracts in information retrieval from MEDLINE

Objective: To determine whether information retrieval might be enhanced by making each component of a structured abstract a separately searchable field. Design: Parallel searches on records arranged so that each abstract could either be searched in its entirety or as a collection of structured fields. Subjects: Records about cardiovascular disease downloaded from MEDLINE and tested against clinical questions derived from a concurrent survey of CD-ROM use in three health science libraries. Intervention: The investigators identified terms used to structure abstracts on MEDLINE and imported the abstracts into an Idealist database prior to searching using keywords from clinical questions. Measurements and main results: recall and precision rates are given for each question in the ‘structured’ and the ‘unstructured’ set of records. Conclusions: Use of structured, rather than unstructured, abstracts improves precision at the ex-pense of recall and places heavier demands upon the searcher’s skill in choosing the correct fields within the abstract to search. Further investigation requires more accurate simulation of MEDLINE software that utilizes features such as MeSH terms, explode, facilities and delimiters.     

Copyright complicance in the electronic age: Conceptual issues

This article focuses on several conceptual and structural issues that are central to copyright compliance in the electronic age. It presumes the development of a national electronic network for storing, organizing, accessing, managing, and charging for information. The article first discusses the implications of constructing a comprehensive electronic “highway,” or Digital Library System (DLS), which would link information to the widespread community of users. It then presents the ramifications of a highly decentralized set of subsystems serving rights holders and users, linked by protocols established by the DLS. A discussion of the implications of digital interchangeability for copyright follows. The article ends with an analysis of alternatives to existing intellectual property rights conveyance systems, and concludes that current ownership structures, and systems for conveying rights and royalties, will remain the foundation for copyright in the electronic world. This article appeared in a slightly different form in theProceedings of the Twelfth National Online Meeting—1991, and is published here with the permission of Learned Information, Inc., Medford, N.J.     

A Pastoral Care Teacher's Theory of Action, Interactive Thinking and Effective Teaching Practice

Through the employment of a hybrid research model blending concept mapping and stimulated recall methodologies, this study explored the nature of a Pastoral Care Teacher's theory of action; the relationship between those beliefs and ideals and interactive thinking; and specific actions in effectively teaching a Pastoral Care issue. In undertaking the research a group of Year Eight boys at the Anglican Church Grammar School (Churchie) provided the context. The study shows that: (i) the teacher possessed a broad knowledge and understanding of the nature of Pastoral Care at Churchie; and (ii) the lessons undertaken, the pedagogy employed, and the knowledge elicited closely resembled the teacher's philosophies and thinking.     

Quantum algorithms: A?survey of some recent results

Quantum algorithms are a field of growing interest within the theoretical computer science as well as the physics community. Surprisingly, although the number of researchers working on the subject is ever-increasing, the number of quantum algorithms found so far is quite small. In fact, the task of designing new quantum algorithms has been proven to be extremely difficult. In this paper we give an overview of the known quantum algorithms and briefly describe the underlying ideas. Roughly, the algorithms presented are divided into hidden subgroup type algorithms and in amplitude amplification type algorithms. While the former deal with problems of group-theoretical nature and have the promise to yield strong separations of classical and quantum algorithms, the latter have been proved to be a prolific source of algorithms in which a polynomial speed-up as compared to classical algorithms can be achieved. We also discuss quantum algorithms which do not fall under these two categories and give a survey of techniques of general interest in quantum computing such as adiabatic computing, lower bounds for quantum algorithms, and quantum interactive proofs.