Excellence in doctoral supervision: an examination of authoritative sources across four countries in search of performance higher than competence

Supervision is generally recognised as playing a crucial role in the quality of a research student’s doctoral experience and their academic outcomes and, in common with most areas of higher education, there is an oft-stated desire to pursue excellence in this important area. Excellence in research degree supervision is, however, an elusive concept and on close scrutiny most of the discussions of high-quality supervision, even those that purport to be identifying excellence, refer to competence rather than excellence. This paper examines two potentially national authoritative perspectives from which excellence in research degree supervision might be explicated (codes of practice and learning and teaching awards) from Australia, New Zealand, South Africa and the United Kingdom but concludes that the complex nature of the activity and the complexity of the concept itself mean that rather than identifying excellence in supervision we can only respond to claims for excellence.     

遗传算法在高校排课问题中的应用

排课问题是一个多因素的优化决策,是组合规划中的典型问题,属于NP完全类问题。根据高校课表的特点,采用遗传算法,给出染色体编码和适应度函数,提供了利用遗传算法解决排课问题的方法。     

Computer ethics: Future directions

Changes in information technologylead to new topics and new emphases in computerethics. The present article examines a varietyof such issues, and argues that computer ethicsmust become more rigorous and develop astronger theoretical base. The articleconcludes with a discussion of ways to makecomputer ethics more effective in bringinghelpful changes to the world.     

Adapting the Knuth–Morris–Pratt algorithm for pattern matching in Huffman encoded texts

In the present work we perform compressed pattern matching in binary Huffman encoded texts [Huffman, D. (1952). A method for the construction of minimum redundancy codes, Proc. of the IRE, 40, 1098–1101]. A modified Knuth–Morris–Pratt algorithm is used in order to overcome the problem of false matches, i.e., an occurrence of the encoded pattern in the encoded text that does not correspond to an occurrence of the pattern itself in the original text. We propose a bitwise KMP algorithm that can move one extra bit in the case of a mismatch since the alphabet is binary. To avoid processing any bit of the encoded text more than once, a preprocessed table is used to determine how far to back up when a mismatch is detected, and is defined so that we are always able to align the start of the encoded pattern with the start of a codeword in the encoded text. We combine our KMP algorithm with two practical Huffman decoding schemes which handle more than a single bit per machine operation; skeleton trees defined by Klein [Klein, S. T. (2000). Skeleton trees for efficient decoding of huffman encoded texts. Information Retrieval, 3, 7–23], and numerical comparisons between special canonical values and portions of a sliding window presented in Moffat and Turpin [Moffat, A., & Turpin, A. (1997). On the implementation of minimum redundancy prefix codes. IEEE Transactions on Communications, 45, 1200–1207]. Experiments show rapid search times of our algorithms compared to the “decompress then search” method, therefore, files can be kept in their compressed form, saving memory space. When compression gain is important, these algorithms are better than cgrep [Ferragina, P., Tommasi, A., & Manzini, G. (2004). C Library to search over compressed texts, http://roquefort.di.unipi.it/~ferrax/CompressedSearch], which is only slightly faster than ours.     

Study on one-dimensional consolidation of saturated soil with semi-pervious boundaries and under cyclic loading

The variation of effective stress ratio of stratfied soil with semi-pervious boundaries and under cyclic loading was analyzed on the basis of Terzagh's one-dimensional consolidation assumptions. A solution by Laplace Transform was obtained for the case when the soil was under time-varied loading. With numerical inversion of Laplace Transform, some useful results were obtained for several kinds of commonly encountered loadings. The results can be meaningful in engineering practice. Project supported by the National Natural Science Foundation of China (No. 59908012) and Fok Ying Tung Education Fundation (No. 81067), Education Ministry of China.     

环ZP^m上的循环码

环Zp^m上的循环码定义为环Rm=Zp^m／（X^n-1〉的理想。本文考虑环Zp^m上的n=p^k长（k为任意正整数）的循环码结构,并确定了Zp^m上循环码的生成元。     

Serving two masters: how vocational educators experience marketisation reforms

Contemporary education reforms that draw ideas from the political and economic fields are said to be altering the nature of vocational education. While there are substantial policy studies on the effects of marketisation reforms, fewer analyse the perspectives of vocational educators on such reforms. How vocational educators negotiate the potential clash of values when marketisation reforms are enacted within the sector remains relatively unexplored. This paper aims to incorporate these perspectives in order to explore and help explain the responses of vocational educators to such changes. To do so the paper draws on concepts from Legitimation Code Theory, a sociological framework for analysing practices and beliefs. Specifically, it enacts ‘autonomy codes’, which reveal how external forces impact upon the internal practices of a social field. These concepts are used to analyse the beliefs and perceptions of a group of vocational educators in Australia who are undergoing marketisation reforms. The analysis suggests that many educators are experiencing a growing ‘code clash’ between the goals they attribute to reforms and their own beliefs about public education and the expectations of their students, one which problematises their capacity to reconcile these sets of values and colours their views of changes in the sector.     

不同境况下会计政策选择与税收筹划

由于在不同境况下会计政策的可选择性,纳税人在履行法律义务的前提下,运用税法赋予的权利,通过企业经营、投资、理财等活动的事先筹划和安排,企业选择不同的会计政策来寻求节约税收成本,进行税收筹划以便少纳税或延期纳税。     

On constructing symmetrical reversible variable-length codes independent of the Huffman code

Reversible variable length codes (RVLCs) have received much attention due to their excellent error resilient capabilities. In this paper, a novel construction algorithm for symmetrical RVLC is proposed which is independent of the Huffman code. The proposed algorithm's codeword assignment is only based on symbol occurrence probability. It has many advantages over symmetrical construction algorithms available for easy realization and better code performance. In addition, the proposed algorithm simplifies the codeword selection mechanism dramatically.