Primäre Glomerulonephritiden

Ohne Zusammenfassung     

The turning point in 1985. The history of appraisal and disposal of records in Iceland

The article sets off with a brief summary of the history of appraisal and disposal of records as processed at the National Archives of Iceland (NAI) since its establishment in 1882 to present times. Rules on appraisal and disposal of records introduced in 1900, 1911, and 1916 were ignored and all records were kept. Status quo remained until 1985 when a new National Archives Act was passed. The appraisal and disposal process adopted then is described and explained. It included the publication of instructions on records management as well as forms relating to records management. The influence of acts of law on the appraisal and disposal process is explained. Finally the experience with the arrangement of organised appraisal in Iceland is described.     

计算机和校园网在高校基层田径比赛中的应用

运用计算机和校园网对高校基层田径比赛进行管理和操作，具有安全，方便，快捷的特点，可以提高裁判员和工作人员的工作效率，并确保比赛数据统计的准确性，为今后高校基层田径比赛组织和裁判工作的改革提供他一种科学，高效，实用的方法。     

试论高职学院体育师资队伍建设

随着社会和高等教育形势的快速发展，高等职业技术教育成为高等教育的一部分，已成为当前社会关注的一个热点。高职学院要能适应高等教育的要求，适应新的办学模式，全面提高教学质量和办学水平，关键是拥有一支与人才培养目标相一致的数量、质量合格的教师队伍。而目前高职学院体育师资队伍的现状，与高等教育的要求及全面推进学校体育工作深化改革的目标，尚存有较大的差距。因此要针对现状，在加强教师政治思想、德育教育，优化教师知识结构，优化师资队伍结构，提高教学科研能力、水平等几个主要方面，采取积极有效的措施；加强队伍建设，全面提高体育教师的整体素质水平，尽快适应高等教育发展的需要及高校体育教学改革、科学研究的要求。     

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.