Social and Behavioral Sciences Commons^™

Personal Response Systems Workshop, Brian Murphy, Ciorstan J. Smark

Faculty of Commerce - Papers (Archive)

Personal response systems (PRS) are known under several names. "Clickers"; "Audience Response Systems"; "Group Response Systems"; and "Classroom Performance Systems"; all of these are systems where the audience can respond to questions or give feedback to the presenter of a lecture or workshop whilst that presentation is taking place. This allows for immediate, and (if wished) anonymous feedback to the presenter and to the class.

An Adaptive Channel Tracking Method For Mimo- Ofdm Systems, Jun Tong, Yaohuan Gong, Shengxian Sun

Faculty of Engineering and Information Sciences - Papers: Part A

The tracking of the time-varying channel is crucial for MIMO-OFDM wireless communication systems. Aiming at doubly-selective fading MIMO channels, we present a novel pilot pattern and the corresponding adaptive channel tracking algorithm. Compared with the traditional pilot patterns, the new pattern has higher frequency efficiency and is more suitable for large transmit arrays. The computational complexity, frequency efficiency and BER performance of the system assisted by the proposed channel tracking scheme are analyzed. Simulation results demonstrate that the proposed scheme can track the timevarying channel effectively

Issues For Connection Of Distributed Generation In Rural/Remote Power Systems, Kashem M. Muttaqi, Gerard Ledwich, Michael Negnevitsky

Faculty of Engineering and Information Sciences - Papers: Part A

Connection of distributed generation (DG) into a distribution grid system affects the normal operation, control and protection of the distribution system. This paper addresses some of the technical issues arisen due to the addition of generation to a rural/remote distribution network. In this paper, a voltage controlled rotary DG is modelled to operate in the line of voltage sensitivity for maximum voltage improvement. A scenario-based study on DG operation and control has been conducted and recommendations for effective operation of DG presented. An investigation on barriers to inclusion of utility owned and customer owned DG has been carried out and …

Intersection Type Systems And Logics Related To The Meyer-Routley System B+, Martin W. Bunder

Faculty of Engineering and Information Sciences - Papers: Part A

Some, but not all, closed terms of the lambda calculus have types; these types are exactly the theorems of intuitionistic implicational logic. An extension of these simple (→) types to intersection (or →∧) types allows all closed lambda terms to have types. The corresponding →∧ logic, related to the Meyer–Routley minimal logic B+ (without ∨), is weaker than the →∧ fragment of intuitionistic logic. In this paper we provide an introduction to the above work and also determine the →∧ logics that correspond to certain interesting subsystems of the full →∧ type theory.

Increasing Acceptance Of Managers For The Use Of Marketing Decision Support Systems, Danielle Stern

Faculty of Commerce - Papers (Archive)

There have been many investigations into decision support systems and the range of benefits they can provide to an organisation. Despite the increased use of these systems in professional practice, there remains a lack of acceptance towards marketing decision models, with many managers resisting their full implementation. This paper presents results of a task designed to explore the extent to which decision models are understood. Although findings show low levels of understanding, it appears that relevant ability and skill can be learned. Educational programs could use the task to raise awareness of problems related to human misjudgment and to demonstrate …

A Framework For Case-Based Reasoning Integration On Knowledge Management Systems, Seung Hwan Kang, Sim K. Lau

Faculty of Commerce - Papers (Archive)

To support the sharing and reusing of well-defined knowledge among knowledge management systems, it is useful to use standardised formalisation. It is also common effort to difficulty of knowledge acquisition known as knowledge acquisition bottleneck. In this paper investigates the feasibility of using techniques in case-based reasoning of artificial intelligence for the knowledge acquisition phase in knowledge management systems. The need of an ontological approach of the semantic web for well-defined set of domain knowledge is proposed in order to avoid knowledge acquisition bottleneck. Our viewpoint of this approach is that the ontology-driven mechanism allows us to provide standardised structured …

Rehabilitation Of Mining Sites: Do Taxation And Accounting Systems Legitimize The Privileged Or Serve Community Interests?, Natalie P. Stoianoff, Mary A. Kaidonis

Faculty of Commerce - Papers (Archive)

Accounting and taxation systems are considered as two coexisting institutional practices which claim to be neutral and to function for the benefit of society. These claims are examined with reference to the natural resources industry and the treatment of rehabilitation costs in Australia, as the impact of this industry, both economic and environmental, is significant. By comparing the practice of accounting in financial reporting and in taxation, the use of calculative and representational practices is exposed to identify contradictions, conflicts and disparities.

Product Systems Over Right-Angled Artin Semigroups, Neal J. Fowler, Aidan Sims

Faculty of Engineering and Information Sciences - Papers: Part A

We build upon MacLane's definition of a tensor category to introduce the concept of a product system that takes values in a tensor groupoid G. We show that the existing notions of product systems fit into our categorical framework, as do the k-graphs of Kumjian and Pask. We then specialize to product systems over right-angled Artin semigroups; these are semigroups that interpolate between free semigroups and free abelian semigroups. For such a semigroup we characterize all product systems which take values in a given tensor groupoid G. In particular, we obtain necessary and sufficient conditions under which a collection of …

A Classification Of Intersection Type Systems, Martin W. Bunder

Faculty of Engineering and Information Sciences - Papers: Part A

The first system of intersection types. Coppo and Dezani [3], extended simple types to include intersections and added intersection introduction and elimination rules ((ΛI ) and (ΛE) ) to the type assignment system. The major advantage of these new types was that they were invariant under β-equality, later work by Barendregt, Coppo and Dezani [1], extended this to include an (η) rule which gave types invariant under βη-reduction.

Urzyczyn proved in [6] that for both these systems it is undecidable whether a given intersection type is empty. Kurata and Takahashi however have shown in [5] …

The Effect Of Individual Psychological Characteristics In The Use Of Computerised Information Systems, Farideh Yaghmaie, Peter Caputi, Rohan Jayasuriya

Faculty of Health and Behavioural Sciences - Papers (Archive)

Investments in computerised information systems in the health industry in evident in most parts of the world. In hospitals and other Healthcare settings, increasingly, hands-on computer use is becoming an important behaviour for effective job perfonnance for health professionals. As the pre-employment (professional) training is provided at a number of different settings the exposure health workers have to computing will vary. Providing training and support to such end-users becomes a complex problem. In addition, based on their prior exposure to computer technology in their work place individuals will have different experiences that make implementation of such systems more complex. Individual …

Pure Type Systems With More Liberal Rules, Martin W. Bunder, Wil Dekkers

Faculty of Engineering and Information Sciences - Papers: Part A

Pure Type Systems. PTSs, introduced as a generalisation of the type systems of Barendregt's lambda-cube, provide a foundation for actual proof assistants, aiming at the mechanic verification of formal proofs. In this paper we consider simplifications of some of the rules of PTSs. This is of independent interest for PTSs as this produces more flexible PTS-like systems, but it will also help, in a later paper, to bridge the gap between PTSs and systems of Illative Combinatory Logic.

First we consider a simplification of the start and weakening rules of PTSs. which allows contexts to be sets of statements, and …

Molecular Dynamics Simulation Of Biomolecular Systems, Wilfred Van Gunsteren, Dirk Bakowies, Roland Buergi, Indira Chandrasekhar, Markus Christen, Xavier Daura, Peter Gee, Alice Glaettli, Tomas Hansson, Chris Oostenbrink, Christine Peter, Jed Pitera, Lukas Schuler, Thereza Soares, Haibo Yu

Faculty of Science - Papers (Archive)

The group for computer-aided chemistry at the ETH Zurich focuses its research on the development of methodology to simulate the behavior of biomolecular systems and the use of simulation techniques to analyze and understand biomolecular processes at the atomic level. Here, the current research directions are briefly reviewed and illustrated with a few examples.

Convergence Of Eigenvalues In State-Discretization Of Linear Stochastic Systems, Jose A. De Dona, Graham C. Goodwin, Richard H. Middleton, Iain Raeburn

Faculty of Engineering and Information Sciences - Papers: Part A

The transition operator that describes the time evolution of the state probability distribution for continuous-state linear systems is given by an integral operator. A state-discretization approach is proposed, which consists of a finite rank approximation of this integral operator. As a result of the state-discretization procedure, a Markov chain is obtained, in which case the transition operator is represented by a transition matrix. Spectral properties of the integral operator for the continuous-state case are presented. The relationships between the integral operator and the finite rank approximation are explored. In particular, the limiting properties of the eigenvalues of the transition matrices …

Completeness Of Two Systems Of Illative Combinatory Logic For First-Order Propositional And Predicate Calculus, Wil Dekkers, Martin Bunder, Henk Barendregt

Faculty of Engineering and Information Sciences - Papers: Part A

Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers 4 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus.

Systems Of Illative Combinatory Logic Complete For First Order Propositional And Predicate Calculus, Henk Barendregt, Martin Bunder, Wil Dekkers

Faculty of Engineering and Information Sciences - Papers: Part A

Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators or, in a more direct way, in which derivations are not translated. Both translations are closely related in a canonical way. The two direct translations turn out to be complete. The paper fulfills the …