Changing pedagogic codes in a class of landscape architects learning 'ecologically sustainable development'

Professional discourse in education has been the focus of research conducted mostly with teachers and professional practitioners but the work of students in the built environment has largely been ignored. This article presents an analysis of students’ visual discourse in the final professional year of a landscape architecture course in Brisbane, Australia. The study has a multi-method design and includes drawings, interviews and documentary materials, but focuses on the drawings in this paper. Using the theory of Bernstein, the analysis considers student representations as interrelations between professional identity and discretionary space for legitimate knowledge formation in landscape planning. It shows a shift in how students persuade the teacher of their expanding views of this field. The discussion of this shift centres on the professional knowledge that students choose rather than need to learn. It points to the differences within a class that a teacher must address in curriculum design in a contemporary professional course.

Distributed orthogonal space-time block codes with adaptive diversity gain

In this paper we present a novel distributed coding protocol for multi-user cooperative networks. The proposed distributed coding protocol exploits the existing orthogonal space-time block codes to achieve higher diversity gain by repeating the code across time and space (available relay nodes). The achievable diversity gain depends on the number of relay nodes that can fully decode the signal from the source. These relay nodes then form space-time codes to cooperatively relay to the destination using number of time slots. However, the improved diversity gain is archived at the expense of the transmission rate. The design principles of the proposed space-time distributed code and the issues related to transmission rate and diversity trade off is discussed in detail. We show that the proposed distributed space-time coding protocol out performs existing distributed codes with a variable transmission rate.

Codes of conduct for mobile device use in meetings : an exploratory analysis

The present paper addresses the findings of a preliminary investigation into policy and codes of conduct pertaining to the use of laptops and PDA’s in business meetings. The purpose of this study was to conduct a review of policies or codes of conduct pertaining to the use of laptops and PDAs in meetings. The investigation included academic literature, policy searches in the public domain of the Internet, as well as personal contact with target industries (large corporations – N=1000 + employees). The results highlight the dearth of policy and codes of conducts pertaining to the use of laptops and PDA’s in business meetings. Consequently, given the growing interdependence between mobile technologies and the contemporary workplace, there exists an opportunity for communication professionals to further research and develop policy and codes of conduct in this area. Implications for corporate communication policies and practices are also discussed.

Design of experiments for bivariate binary responses modelled by Copula functions

Optimal design for generalized linear models has primarily focused on univariate data. Often experiments are performed that have multiple dependent responses described by regression type models, and it is of interest and of value to design the experiment for all these responses. This requires a multivariate distribution underlying a pre-chosen model for the data. Here, we consider the design of experiments for bivariate binary data which are dependent. We explore Copula functions which provide a rich and flexible class of structures to derive joint distributions for bivariate binary data. We present methods for deriving optimal experimental designs for dependent bivariate binary data using Copulas, and demonstrate that, by including the dependence between responses in the design process, more efficient parameter estimates are obtained than by the usual practice of simply designing for a single variable only. Further, we investigate the robustness of designs with respect to initial parameter estimates and Copula function, and also show the performance of compound criteria within this bivariate binary setting.

Face recognition using fractal codes

In this paper we propose a new method for face recognition using fractal codes. Fractal codes represent local contractive, affine transformations which when iteratively applied to range-domain pairs in an arbitrary initial image result in a fixed point close to a given image. The transformation parameters such as brightness offset, contrast factor, orientation and the address of the corresponding domain for each range are used directly as features in our method. Features of an unknown face image are compared with those pre-computed for images in a database. There is no need to iterate, use fractal neighbor distances or fractal dimensions for comparison in the proposed method. This method is robust to scale change, frame size change and rotations as well as to some noise, facial expressions and blur distortion in the image

Domestic and international grantmaking : the comfort of codes

This paper focuses on codes of practice in domestic (in-country) and international (out of country) philanthropic giving/grantmaking, their similarities and differences. Codes of principle and practice are interesting not so much because they accurately reflect differences in practice on the ground, but rather because they indicate what is considered important or relevant, as well as aspirational. Codes tell us what people are most concerned about – what is seen to be in need of regulation or reminder.

Agrobacterium-mediated transformation of indica rice cultivars using binary and superbinary vectors

The Agrobacterium-mediated transformation system was extended to two indica cultivars: a widely cultivated breeding line IR-64 and an elite basmati cultivar Karnal Local. Root tips and shoot tips of seedlings, and scutellar-calli derived from mature seeds showed high-efficiency Agrobacterium tumefaciens infection and stable transformation. In addition to the superbinary vector pTOK233 in Agrobacterium strain LBA4404, almost equally high levels of transformation were achieved with a relatively much smaller (13.1 kb) binary vector (pCAMBIA1301) in a supervirulent host strain AGL1. In both cases, as well as in both cultivars, while 60–90% of the infected explants produced calli resistant to the selectable agent hygromycin, 59–75% of such calli tested positive for GUS. A high level (400 μM) of acetosyringone in the preinduction medium for Agrobacterium and a higher level (500 μM) in the cocultivation medium was necessary for an enhancement in transformation frequency of the binary vector to levels comparable to a superbinary. Hygromycin-resistant calli could be produced from all the explants used. Transformants could be regenerated for both cultivars using the superbinary and binary vector, but only for calli of scutellar origin. In addition to the molecular confirmation of hpt and gus gene transfer and transcription, absence of gene sequences outside the transferred DNA (T-DNA) region confirmed absence of any long T-DNA transfer.

Real, complex, and binary semantic vectors

This paper presents a combined structure for using real, complex, and binary valued vectors for semantic representation. The theory, implementation, and application of this structure are all significant. For the theory underlying quantum interaction, it is important to develop a core set of mathematical operators that describe systems of information, just as core mathematical operators in quantum mechanics are used to describe the behavior of physical systems. The system described in this paper enables us to compare more traditional quantum mechanical models (which use complex state vectors), alongside more generalized quantum models that use real and binary vectors. The implementation of such a system presents fundamental computational challenges. For large and sometimes sparse datasets, the demands on time and space are different for real, complex, and binary vectors. To accommodate these demands, the Semantic Vectors package has been carefully adapted and can now switch between different number types comparatively seamlessly. This paper describes the key abstract operations in our semantic vector models, and describes the implementations for real, complex, and binary vectors. We also discuss some of the key questions that arise in the field of quantum interaction and informatics, explaining how the wide availability of modelling options for different number fields will help to investigate some of these questions.

Optical techniques for real-time binary multiplication

An optical system which performs the multiplication of binary numbers is described and proof-of-principle experiments are performed. The simultaneous generation of all partial products, optical regrouping of bit products, and optical carry look-ahead addition are novel features of the proposed scheme which takes advantage of the parallel operations capability of optical computers. The proposed processor uses liquid crystal light valves (LCLVs). By space-sharing the LCLVs one such system could function as an array of multipliers. Together with the optical carry look-ahead adders described, this would constitute an optical matrix-vector multiplier.

Semi-binary based video features for activity representation

Efficient and effective feature detection and representation is an important consideration when processing videos, and a large number of applications such as motion analysis, 3D scene understanding, tracking etc. depend on this. Amongst several feature description methods, local features are becoming increasingly popular for representing videos because of their simplicity and efficiency. While they achieve state-of-the-art performance with low computational complexity, their performance is still too limited for real world applications. Furthermore, rapid increases in the uptake of mobile devices has increased the demand for algorithms that can run with reduced memory and computational requirements. In this paper we propose a semi binary based feature detectordescriptor based on the BRISK detector, which can detect and represent videos with significantly reduced computational requirements, while achieving comparable performance to the state of the art spatio-temporal feature descriptors. First, the BRISK feature detector is applied on a frame by frame basis to detect interest points, then the detected key points are compared against consecutive frames for significant motion. Key points with significant motion are encoded with the BRISK descriptor in the spatial domain and Motion Boundary Histogram in the temporal domain. This descriptor is not only lightweight but also has lower memory requirements because of the binary nature of the BRISK descriptor, allowing the possibility of applications using hand held devices.We evaluate the combination of detectordescriptor performance in the context of action classification with a standard, popular bag-of-features with SVM framework. Experiments are carried out on two popular datasets with varying complexity and we demonstrate comparable performance with other descriptors with reduced computational complexity.

Quantum direct secret sharing with efficient eavesdropping-check and authentication based on distributed fountain codes

We propose to use a simple and effective way to achieve secure quantum direct secret sharing. The proposed scheme uses the properties of fountain codes to allow a realization of the physical conditions necessary for the implementation of no-cloning principle for eavesdropping-check and authentication. In our scheme, to achieve a variety of security purposes, nonorthogonal state particles are inserted in the transmitted sequence carrying the secret shares to disorder it. However, the positions of the inserted nonorthogonal state particles are not announced directly, but are obtained by sending degrees and positions of a sequence that are pre-shared between Alice and each Bob. Moreover, they can confirm that whether there exists an eavesdropper without exchanging classical messages. Most importantly, without knowing the positions of the inserted nonorthogonal state particles and the sequence constituted by the first particles from every EPR pair, the proposed scheme is shown to be secure.

Identifying steganographic payload location in binary image

In this paper, we propose a steganalysis method that is able to identify the locations of stego bearing pixels in the binary image. In order to do that, our proposed method will calculate the residual between a given stego image and its estimated cover image. After that, we will compute the local entropy difference between these two versions of images as well. Finally, we will compute the mean of residual and mean of local entropy difference across multiple stego images. From these two means, the locations of stego bearing pixels can be identified. The presented empirical results demonstrate that our proposed method can identify the stego bearing locations of near perfect accuracy when sufficient stego images are supplied. Hence, our proposed method can be used to reveal which pixels in the binary image have been used to carry the secret message.