Balsys, RJ & Suffern, KG 2001, 'Visualisation of Implicit Surfaces', Computers & Graphics, vol. 25, no. 1, pp. 89-107.
View/Download from: UTS OPUS or Publisher's site
Boyer, LE, Williams, M, Callister, LC & Marshall, ES 2001, 'Hispanic women's perceptions regarding cervical cancer screening.', Journal of obstetric, gynecologic, and neonatal nursing : JOGNN, vol. 30, no. 2, pp. 240-245.
View/Download from: Publisher's site
View description>>
To examine factors affecting cervical cancer screening behaviors.Qualitative, descriptive.Interviews were conducted in participants' homes.Purposive sample of 20 Hispanic women 18 to 65 years of age.Participants accessed the health care system primarily during times of illness or in association with impending marriage, obtaining birth control, or childbearing. Barriers to screening participation included personal/cultural and provider/ system factors. Motivators included personal experience with others having cervical cancer, perceived importance of the Pap smear in maintaining health, reduction of financial barriers, and access to culturally appropriate health care.Factors affecting cervical cancer screening behavior among Hispanic women are identifiable and describable. Knowledge of barriers and motivators can be utilized to design effective nursing interventions and community-based programs.
De Cooman, G, Zhang, G & E. Kerre, E 2001, 'Possibility measures and possibility integrals defined on a complete lattice', Fuzzy Sets and Systems, vol. 120, no. 3, pp. 459-467.
View description>>
We consider the definition of possibility measures on complete lattices rather than on complete Boolean algebras of sets. We give a necessary and sufficient condition for the extendability of any mapping to such a possibility measure. We also associate two types of integrals with these possibility measures, and discuss some of their more important properties, amongst which a monotone convergence theorem. © 2001 Elsevier Science B.V.
Foo, NY & Peppas, P 2001, 'Realization for causal nondeterministic input-output systems', Studia Logica, vol. 67, no. 3, pp. 419-437.
View/Download from: Publisher's site
View description>>
There are two well-developed formalizations of discrete time dynamic systems that evidently share many concerns but suffer from a lack of mutual awareness. One formalization is classical systems and automata theory. The other is the logic of actions in which the situation and event calculi are the strongest representatives. Researchers in artificial intelligence are likely to be familiar with the latter but not the former. This is unfortunate, for systems and automata theory have much to offer by way of insight into problems raised in the logics of action. This paper is an outline of how the input-output view of systems and its associated solution of state realization may be applied to the formalization of dynamics that uses a situation calculus approach. In particular, because the latter usually admits incompletely specified dynamics, which induces a non-deterministic input-output system behavior, we first show that classical state realization can still be achieved if the behavior is causal. This is a novel systems-theoretic result. Then we proceed to indicate how situation calculi dynamic specifications can be understood in systems-theoretic terms, and how automata can be viewed as models of such specifications. As techniques for reasoning about automata are abundant, this will provide yet more tools for reasoning about actions. © 2001 Kluwer Academic Publishers.
J. J., W, S. H., L, Lin, C & J. H., H 2001, 'Modeling the arterial unloaded situation in oscillometric blood pressure waveform measurement using fuzzy logic control'.
Jay, CB 2001, 'Distinguishing Data Structures and Functions: the Constructor Calculus and Functorial Types', Typed Lambda Calculi and Applications: 5th International Conference TLCA 2001, Kraków, Poland, May 2001 Proceedings, vol. 2044, pp. 217-239.
Juang, CF & Lin, CT 2001, 'Noisy speech processing by recurrently adaptive fuzzy filters', IEEE TRANSACTIONS ON FUZZY SYSTEMS, vol. 9, no. 1, pp. 139-152.
View/Download from: Publisher's site
Kennedy, P.J. & Osborn, T. 2001, 'A Model of Gene Expression and Regulation in an Artificial Cellular Organism', Complex Systems, vol. 13, no. 1.
View/Download from: UTS OPUS
View description>>
Gene expression and regulation may be viewed as a parallel parsing algorithm---translation from a genomic language to a phenotype. We describe a model of gene expression and regulation based on the operon model of Jacob and Monod. Operons are groups of genes regulated in the same way. An artificial cellular metabolism expresses operons encoded on a genome in a parallel genomic language. This is accomplished using an abstract entity called a spider. A genetic algorithm is used to evolve the simulated cells to adapt to a simple environment. Genomes are subjected to recombination, mutation, and inversion operators. Observations from this experiment suggest four areas to explore: dynamic environments for the evolution of regulation, advantages of time lags inherent in the expression algorithm, sensitivity of our genomic language, and noncoding regions on the genome. Issues relating to the application of the expression model to evolutionary computation are discussed.
Lin, CT, Chung, IF & Huang, SY 2001, 'Improvement of machining accuracy by fuzzy logic at corner parts for wire-EDM', FUZZY SETS AND SYSTEMS, vol. 122, no. 3, pp. 499-511.
View/Download from: Publisher's site
Liu, DJ & Lin, CT 2001, 'Fundamental frequency estimation based on the joint time-frequency analysis of harmonic spectral structure', IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, vol. 9, no. 6, pp. 609-621.
Liu, SH & Lin, CT 2001, 'A model-based fuzzy logic controller with Kalman filtering for tracking mean arterial pressure', IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, vol. 31, no. 6, pp. 676-686.
View/Download from: Publisher's site
Liu, W & Williams, MA 2001, 'A framework for multi-agent belief revision', Studia Logica, vol. 67, no. 2, pp. 291-312.
View/Download from: Publisher's site
Nein, HW & Lin, CT 2001, 'Incorporating error shaping technique into LSF vector quantization', IEEE Transactions on Speech and Audio Processing, vol. 9, no. 2, pp. 73-86.
View/Download from: Publisher's site
View description>>
This paper presents an error shaping technique for line spectrum frequency (LSF) vector quantization. The error shaping technique based on the weighted logarithm spectral distortion (WLSD) measure can be used for shaping the spectral distortion distribution of quantization error into any different curve depending on what kind of weighting function is used. However, the high computational complexity of the WLSD measure deters this error shaping technique from practical use. To solve this problem, we approximate the WLSD measure by the quadratically weighted measure or the weighted mean squared error (WMSE) measure and propose an optimal error shaping technique of LSF vector quantization. In this proposed error shaping technique, the optimal WMSE weights (i.e., the optimal weights of LSF parameters) are determined based on the theoretical analysis of the WLSD measure. Three experiments are performed to check the performance of the proposed error shaping technique. One experiment is set up by incorporating human perception into the LSF quantization and another is set up by emphasizing the human-sensitivity frequency band in lower frequency bandwidth 0-3 kHz. In the third experiment, we apply the proposed error shaping technique to the LSF quantization of a CELP coder to test how it affects the overall speech quality in an actual speech coding algorithm.
Peppas, P, Koutras, CD & Williams, MA 2001, 'Prolegomena to concise theories of action', Studia Logica, vol. 67, no. 3, pp. 403-418.
View/Download from: Publisher's site
View description>>
A new methodology for developing theories of action has recently emerged which provides means for formally evaluating the correctness of such theories. Yet, for a theory of action to qualify as a solution to the frame problem, not only does it need to produce correct inferences, but moreover, it needs to derive these inferences from a concise representation of the domain at hand. The new methodology however offers no means for assessing conciseness. Such a formal account of conciseness is developed in this paper. Combined with the existing criterion for correctness, our account of conciseness offers a framework where proposed solutions to the frame problem can be formally evaluated. © 2001 Kluwer Academic Publishers.
Redshaw, S 2001, 'Changing driving behaviour - A cultural approach', AUSTRALIAN JOURNAL OF SOCIAL ISSUES, vol. 36, no. 4, pp. 315-331.
View/Download from: Publisher's site
Wang, CH, Liu, HL & Lin, CT 2001, 'Dynamic optimal learning rates of a certain class of fuzzy neural networks and its applications with genetic algorithm.', IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society, vol. 31, no. 3, pp. 467-475.
View/Download from: Publisher's site
View description>>
The stability analysis of the learning rate for a two-layer neural network (NN) is discussed first by minimizing the total squared error between the actual and desired outputs for a set of training vectors. The stable and optimal learning rate, in the sense of maximum error reduction, for each iteration in the training (back propagation) process can therefore be found for this two-layer NN. It has also been proven in this paper that the dynamic stable learning rate for this two-layer NN must be greater than zero. Thus it Is guaranteed that the maximum error reduction can be achieved by choosing the optimal learning rate for the next training iteration. A dynamic fuzzy neural network (FNN) that consists of the fuzzy linguistic process as the premise part and the two-layer NN as the consequence part is then illustrated as an immediate application of our approach. Each part of this dynamic FNN has its own learning rate for training purpose. A genetic algorithm is designed to allow a more efficient tuning process of the two learning rates of the FNN. The objective of the genetic algorithm is to reduce the searching time by searching for only one learning rate, which is the learning rate of the premise part, in the FNN. The dynamic optimal learning rates of the two-layer NN can be found directly using our innovative approach. Several examples are fully illustrated and excellent results are obtained for the model car backing up problem and the identification of nonlinear first order and second order systems.
Wu, GD & Lin, CT 2001, 'A recurrent neural fuzzy network for word boundary detection in variable noise-level environments', IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, vol. 31, no. 1, pp. 84-97.
View/Download from: Publisher's site
Wu, SJ & Lin, CT 2001, 'Optimal fuzzy tracking controller design for discrete-time fuzzy systems', Zidonghua Xuebao/Acta Automatica Sinica, vol. 27, no. 4, pp. 477-494.
View description>>
In this paper, we propose a systematic and theoretically sound way to design a global optimal fuzzy tracking controller for discrete-time fuzzy systems with the aim of solving the discrete-time quadratic tracking problems with moving or model-following targets under finite or infinite horizon (time). A linear-like dynamical system representation of discrete-time fuzzy system is proposed to mature the theoretical design scheme of the discrete-time optimal fuzzy tracking controller which can achieve global minimum effect. A multistage decomposition of optimization scheme is proposed to simplify the computation, and then a segmental recursive Riccati-like equation and a difference equation in tracing the variation of the target are derived. Moreover, in the case of time-invariant fuzzy tracking systems, we show that the optimal tracking controller can be obtained by just solving discrete-time algebraic Riccati-like equations and algebraic matrix equations. An example is given to illustrate the proposed opti mal fuzzy tracker design scheme.
Zhang, G & Wu, Y 2001, 'On lattice-valued functions I: Simple functions on the lattice', Journal of Fuzzy Mathematics, vol. 9, no. 1, pp. 233-243.
Zhang, G & Wu, Y 2001, 'On lattice-valued functions II: Borel functions on the lattice', Journal of Fuzzy Mathematics, vol. 9, no. 2, pp. 373-379.
Zhang, G, Kerre, EE, Wu, Y & Teo, KL 2001, 'Necessity measures and necessity integrals defined on complete lattice', International Journal of General Systems, vol. 30, no. 3, pp. 241-260.
View/Download from: Publisher's site
Zhao, F & Zhang, G 2001, 'Hahn and Jordan decompositions of signed fuzzy number-valued measure on the fuzzy set', The Journal of Fuzzy mathematics, vol. 9, no. 2, pp. 461-471.
Benferhat, S, Kaci, S, Le Berre, D & Williams, MA 2001, 'Weakening conflicting information for iterated revision and knowledge integration', IJCAI International Joint Conference on Artificial Intelligence, pp. 109-115.
View description>>
The ability to handle exceptions, to perform iterated belief revision and to integrate information from multiple sources are essential skills for an intelligent agent. These important skills are related in the sense that they all rely on resolving inconsistent information. We develop a novel and useful strategy for conflict resolution, and compare and contrast it with existing strategies. Ideally the process of conflict resolution should conform with the principle of Minimal Change and should result in the minimal loss of information. Our approach to minimizing the loss of information is to weaken information involved in conflicts rather than completely removing it. We implemented and tested the relative performance of our new strategy in three different ways. We show that it retains more information than the existing Maxi-Adjustment strategy at no extra computational cost. Surprisingly, we are able to demonstrate that it provides a computationally effective compilation of the lexicographical strategy, a strategy which is known to have desirable theoretical properties.
Chung, IF & Lin, CT 2001, 'A neuro-fuzzy combiner for multiobjective control', Annual Conference of the North American Fuzzy Information Processing Society - NAFIPS, pp. 1384-1389.
View description>>
This paper proposes a neuro-fuzzy combiner (NFC) with supervised learning capability for solving multiobjective control problems. The proposed NFC can combine n existing low-level controllers in a hierarchical way to form a multiobjective fuzzy controller. It is assumed that each low-level (fuzzy or nonfuzzy) controller has been well designed to serve a particular objective. The role of the NFC is to fuse the n actions decided by the n low-level controllers and determine a proper action acting on the environment (plant) at each time step. Hence, the NFC can combine low-level controller and achieve multiple objectives (goals) at once. Here a NFC can be designed by proposed architecture and supervised learning scheme. Computer simulations have been conducted to illustrate the performance and applicability of the proposed architecture and learning scheme.
Duh, FB & Lin, CT 2001, 'Tracking a maneuvering target using neural fuzzy network', 10TH IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-3, 10th IEEE International Conference on Fuzzy Systems, IEEE, UNIV MELBOURNE, MELBOURNE, AUSTRALIA, pp. 1255-1258.
Gramann, K & Schonebeck, B 2001, 'Selective activation of subcomponents of the phonological loop as revealed by event-related potentials', JOURNAL OF PSYCHOPHYSIOLOGY, HOGREFE & HUBER PUBLISHERS, pp. 67-67.
Huang, M. 2001, 'Information Visualization of Attributed Relational Data', Proceedings of Australian Symposium on Information Visualization 2001, Australian Symposium on Information Visualisation, Australian Computer Society, Sydney, pp. 143-150.
View/Download from: UTS OPUS
Huang, M. 2001, 'Multi-Ani: A interface for animating multiple graph drawing algorithms', Proceedings of International Conference on Imaging Science, Systems, and Technology (CISST 2001), International Conference Imaging Science, Systems and Technology, CSREA Press, Las Vegas, USA, pp. 581-585.
View/Download from: UTS OPUS
Huang, M. & Zhou, B. 2001, 'Improving the quality of Visual Web Browsing by using weighted graph drawing', Proceedings of 2nd International Conference on Internet Computing (IC 2001), International Conference on Internet Computing, CSREA Press, Las Vegas, USA, pp. 957-962.
View/Download from: UTS OPUS
Huang, M. & Zhou, B. 2001, 'Web-Based multimedia application design using the MOR', Proceedings of 2nd International Conference on Internet Computing (IC 2001), International Conference on Internet Computing, CSREA Press, Las Vegas, USA, pp. 970-975.
View/Download from: UTS OPUS
Kennedy, P.J. & Osborn, T. 2001, 'A double-stranded Encoding Scheme with inversion operator for Genetic Algorithms', Proceedings of Genetic and Evolutionary Computation Conference, Genetic and Evolutionary Computation Conference, Morgan Kaufmann, San Francisco, USA, pp. 398-407.
View/Download from: UTS OPUS
Lang, J, Marquis, P & Williams, MA 2001, 'Updating epistemic states', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 297-308.
View description>>
© Springer-Verlag Berlin Heidelberg 2001. Belief update is usually defined by means of operators acting on belief sets. We propose here belief update operators acting on epistemic states which convey much more information than belief sets since they express the relative plausibilities of the pieces of information believed by the agent. In the following, epistemic states are encoded as rankings on worlds. We extend a class of update operators (dependency- based updates) to epistemic states, by defining an operation playing the same role as knowledge transmutations [21] do for belief revision.
Leaney, J 2001, 'System Composition Strategies, a position paper for an ECBS panel - My position: Analogy questionable, intentions estimable.', EIGHTH ANNUAL IEEE INTERNATIONAL CONFERENCE AND WORKSHOP ON THE ENGINEERING OF COMPUTER BASED SYSTEMS, PROCEEDINGS, 8th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (ECBS), IEEE COMPUTER SOC, WASHINGTON, D.C., pp. 30-31.
Leaney, JR, Rowe, D, O'Neill, T, Hoye, S & Gionis, P 2001, 'Measuring the effectiveness of computer based systems : an open system measurement example', Proceedings of ECBS '01, IEEE International Conference and Workshop on the Engineering of Computer Based Systems, IEEE, Washington DC USA.
View/Download from: UTS OPUS
Lin, CT, Chung, IF & Lin, JY 2001, 'Multipurpose virtual-reality-based motion simulator', Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp. 2846-2851.
View description>>
Public security has become an important issue everywhere. Especially, the safe manipulation and control of various machines and vehicles has gained special attention such that the authorities keep emphasizing the strict training and censoring of human operators. Currently, such training and censoring process usually relies on the actual machines, equipment, or vehicles in the real sites. This not only has high demands in space, time and cost, but also causes another phase of public security problem. In this connection, the world-wide trend is to tackle the above dilemma by using virtual reality (VR). However, the current researches or products on VR are more matured in the software display part of VR. How to combine 3D VR display with motion platform to achieve the aforementioned training and censoring purposes is an important research issue. This paper focuses on this research issue, and the goal is to develop a multipurpose virtual-reality-based motion simulation system to meet the requirements of public security in training and censoring of human operators.
Lister, R 2001, 'Objectives and objective assessment in CS1', SIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education), pp. 292-296.
View/Download from: Publisher's site
View description>>
When designing a first semester "CS1" programming subject, I advocate "truth in sentencing". That is, the objectives should be explicit, and the assessment tasks should reflect the objectives. This may appear to be a statement of the obvious, but few subjects satisfy these criteria. The traditional CS1 approach is to set students the task of writing extensive code, as early as possible. On closer inspection of such subjects, one finds marking schemes for exams and assignments that are generous to the point of being inconsistent with the subject objectives. Instead, students should not write any original code in CS1, and should be examined by multiple choice question.
Lister, R & Jerram, P 2001, 'Design for Web-based on-demand multiple choice exams using XML', Proceedings - IEEE International Conference on Advanced Learning Technologies, ICALT 2001, pp. 383-384.
View/Download from: Publisher's site
View description>>
We describe a Web based system for the delivery and marking of multiple-choice questions. While other Web systems exist that deliver such exams, those systems require either the manual mark-up of static exam questions, or generate different versions of an exam with limited variability. Such approaches result in exams that should only be administered once to a specific student. Our system is more general in how it generates different versions of an exam, using XML. © 2001 IEEE.
Lister, R.F. & Jerram, P. 2001, 'Minimal Mark-Up of multiple choice exams using XML', Proceedings of ASCILITE 2001, Annual Conference of the Australasian Society for Computers in Learning in Tertiary Education, Biomedical Multimedia Unit, University of Melbourne, Melbourne, Victoria, pp. 101-104.
View/Download from: UTS OPUS
View description>>
We describe a minimal XML mark-up for multiple choice exams. In our system, exams may be generated at anytime, by choosing a subset of questions from a pool. Furthermore, the system randomises the order of the choices within each chosen question. Thus a student may sit the exam many times. Our first version of this system has been described elsewhere. In this paper, we discuss the limitations of our first system that led to our current work, and give a description of the new system features, including XML tags for supporting collaborative authoring.
Lister, RF, Smith, I, Ray, M & Hawson, G 2001, 'Naïve Bayesian Prediction of bleeding after heart by-pass surgery', Proceedings of ANZIIS 2001, ANZIIS 2001, Australian Research Centre for Medical Engineering, University of WA, Perth, WA, pp. 317-321.
View/Download from: UTS OPUS
O'Neill, T & Leaney, JR 2001, 'Risk Management of an Open CBS Project', Proceedings of ECBS '01, IEEE International Conference and Workshop on the Engineering of Computer Based Systems, IEEE, Washington DC.
View/Download from: UTS OPUS
Pagnucco, M & Peppas, P 2001, 'Causality and minimal change demystified', IJCAI International Joint Conference on Artificial Intelligence, pp. 125-130.
View description>>
The Principle of Minimal Change is prevalent in various guises throughout the development of areas such as reasoning about action, belief change and nonmonotonic reasoning. Recent literature has witnessed the proposal of several theories of action that adopt an explicit representation of causality. It is claimed that an explicit notion of causality is able to deal with the frame problem in a manner not possible with traditional approaches based on minimal change. However, such claims remain untested by all but representative examples. It is our purpose here to objectively test these claims in an abstract sense; to determine whether an explicit representation of causality is capable of providing something that the Principle of Minimal Change is unable to capture. Working towards this end, we provide a precise characterisation of the limit of applicability of minimal change.
Robertson, TJ, Lueg, CP & Brookes, WC 2001, 'Learning HCI in the Lost World', Proceedings of OZCHI 2001, November 20-23, 2001, Fremantle, WA, Australian Computer Human Interaction Conference, Edith Cowan University, Perth, Australia, Fremantle, WA, pp. 115-120.
View/Download from: UTS OPUS
Sinnappan, S, Williams, MA & Muthaly, S 2001, 'Agent based architecture for internet marketing', Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), pp. 158-169.
View description>>
© 2001 Springer-Verlag Berlin Heidelberg. In the current highly competitive era of e-commerce, many firms are focusing their attention on forging and nurturing customer relationships. Businesses not only need to discover and capitalize actionable marketing intelligence but they also need to manipulate this valuable information to improve their relationship with their customer base. In this paper we describe an agent architecture paired with web mining techniques that provides personalized web sessions to nurture customer relationship by: Merging information from heterogeneous sources. Dealing with change in a dynamic environment. Handling decisions that need to be made with information that is incomplete and/or uncertain. Our agents are based on the BDI1 framework implemented using JACK2. and Java Server Pages. We envisage that our intelligent software agents inhabit a market space where they work for the benefit of businesses engaged in customer-To-business and business-To-business electronic commerce. The key contribution and focus of this paper is the development of an agent framework that ensures successful customer relationship management.
van den Hoven, E & Eggen, B 2001, 'A Graspable User-Interface for an Ambient-Intelligent Photo Browser', I3 Spring Days 2001, I3 Spring Days 2001, I3 Spring Days, Porto, Portugal.
View description>>
A novel intuitive user interface has been created for a context-aware, portable Photo Browser. When brought into an Ambient Intelligent room, the Photo Browser is able to recognize the presence of people and objects, and to discover available output devices and services. Photos can be associated with everyday ornaments, like holiday souvenirs. When such an ornament is placed near the Photo Browser the associated selection of photos is immediately presented.
Williams, M & Gardenfors, P 2001, 'Reasoning about Categories in Conceptual Spaces', Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, International Joint Conference on Artificial Intelligence, Morgan Kaufmann, Seattle Washington, pp. 385-392.
View description>>
IJCAI is the most prestigious international conference in AI. This paper provided the first computational model for conceptual spaces which can be applied in cognitive agents.
Wu, GD & Lin, CT 2001, 'Noisy speech segmentation with multiband analysis and recurrent neural fuzzy network', Annual Conference of the North American Fuzzy Information Processing Society - NAFIPS, pp. 540-544.
View description>>
This paper addresses the problem of automatic word boundary detection in the presence of variable-level background noise. Commonly used algorithms for word boundary detection always assume that the background noise level is fixed. In fact, the background noise level may vary during the procedure of recording. In order to solve this problem, we propose the RTF-MiFre-based RSONFIN (a recurrent neural fuzzy network) algorithm. Since the RTF and MiFre parameters can extract useful frequency energy and RSONFIN can process the temporal relations, this RTF-MiFre-based RSONFIN algorithm can find the variation of the background noise level and detect correct word boundaries in the presence of variable background noise level. Our experiment results have shown that the RTF-MiFre-based RSONFIN algorithm has good performance in the presence of variable background noise level presence.
Zowghi, D, Gervasi, V & McRae, A 2001, 'Using default reasoning to discover inconsistencies in natural language requires', Proceedings of APSEC 2001 Asia Pacific Software Engineering Conference, Asia-Pacific Software Engineering Conference, IEEE, Macau, pp. 133-140.
View/Download from: UTS OPUS
Zowghi, D. & Gervasi, V. 2001, 'Why is RE for web-based software development easier?', Proceedings of 7th International Workshop on Requirements Engineering: Foundation for Software Quality (REFSQ'01), International Workshop on Requirements Engineering: Foundation for Software Quality, Essener Informatik Beitrage, Interlaken-Switzerland, pp. 215-220.
View/Download from: UTS OPUS
Zowghi, D., Damian, D.E. & Offen, R. 2001, 'Field studies of requirements engineering in a multi-site software development organization: research in progress', Proceedings of 6th Australian Workshop on Requirements Engineering, Australian Workshop on Requirements Engineering, UNSW, UNSW, Sydney, pp. 14-20.
View/Download from: UTS OPUS