Pub Date : 2000-01-31DOI: 10.1109/ACSC.2000.824384
John Gough
The portability and runtime safety of programs which are executed on the Java Virtual Machine (JVM) makes the JVM an attractive target for compilers of languages other than Java. Unfortunately, the JVM was designed with language Java in mind, and lacks many of the primitives required for a straightforward implementation of other languages. Most fundamental of these obstacles is the limited range of parameter passing modes offered by the JVM. We discuss possible ways of using the JVM to provide parameter passing modes with alternative semantics, and explore one particular architecture in practice. The interaction between these mechanisms and the Java "byte code verifier" is also considered. The open source Gardens Point Component Pascal compiler compiles the entire Component Pascal language, a dialect of Oberon-2, to JVM bytecodes. This compiler achieves runtime efficiencies which are comparable to native-code implementations of procedural languages.
在Java虚拟机(JVM)上执行的程序的可移植性和运行时安全性使JVM成为除Java之外的其他语言编译器的一个有吸引力的目标。不幸的是，JVM在设计时考虑了Java语言，并且缺乏其他语言直接实现所需的许多原语。这些障碍中最基本的是JVM提供的参数传递模式的有限范围。我们将讨论使用JVM提供具有替代语义的参数传递模式的可能方法，并在实践中探索一种特定的体系结构。还考虑了这些机制与Java“字节码验证器”之间的交互。开源的Gardens Point Component Pascal编译器将整个Component Pascal语言(Oberon-2的一种方言)编译为JVM字节码。该编译器的运行时效率可与过程语言的本机代码实现相媲美。
{"title":"Parameter passing for the Java virtual machine","authors":"John Gough","doi":"10.1109/ACSC.2000.824384","DOIUrl":"https://doi.org/10.1109/ACSC.2000.824384","url":null,"abstract":"The portability and runtime safety of programs which are executed on the Java Virtual Machine (JVM) makes the JVM an attractive target for compilers of languages other than Java. Unfortunately, the JVM was designed with language Java in mind, and lacks many of the primitives required for a straightforward implementation of other languages. Most fundamental of these obstacles is the limited range of parameter passing modes offered by the JVM. We discuss possible ways of using the JVM to provide parameter passing modes with alternative semantics, and explore one particular architecture in practice. The interaction between these mechanisms and the Java \"byte code verifier\" is also considered. The open source Gardens Point Component Pascal compiler compiles the entire Component Pascal language, a dialect of Oberon-2, to JVM bytecodes. This compiler achieves runtime efficiencies which are comparable to native-code implementations of procedural languages.","PeriodicalId":304540,"journal":{"name":"Proceedings 23rd Australasian Computer Science Conference. ACSC 2000 (Cat. No.PR00518)","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114946745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-01-31DOI: 10.1109/ACSC.2000.824389
Xiangjian He, T. Hintz
Detection of edge points of 3-dimensional physical object in a 2-dimensional image is one of the main research areas of computer vision. Object contour detection and object recognition rely heavily on edge detection. The Spiral Architecture, a relatively new image structure, possesses powerful computational features that are pertinent to the vision process. In this paper, we present an edge detection scheme using Gaussian Multi-resolution Theory. The detection algorithm reduces noise and unnecessary details of the image. This algorithm is applied to obtain the edge maps of some well-known images for image processing.
{"title":"Refining edge detection within spiral architecture","authors":"Xiangjian He, T. Hintz","doi":"10.1109/ACSC.2000.824389","DOIUrl":"https://doi.org/10.1109/ACSC.2000.824389","url":null,"abstract":"Detection of edge points of 3-dimensional physical object in a 2-dimensional image is one of the main research areas of computer vision. Object contour detection and object recognition rely heavily on edge detection. The Spiral Architecture, a relatively new image structure, possesses powerful computational features that are pertinent to the vision process. In this paper, we present an edge detection scheme using Gaussian Multi-resolution Theory. The detection algorithm reduces noise and unnecessary details of the image. This algorithm is applied to obtain the edge maps of some well-known images for image processing.","PeriodicalId":304540,"journal":{"name":"Proceedings 23rd Australasian Computer Science Conference. ACSC 2000 (Cat. No.PR00518)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115839811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-01-31DOI: 10.1109/ACSC.2000.824385
Paul Gruba, H. Søndergaard
From the social constructivist perspective of education, learning is best achieved when students face complex, real world problems in which there are no clear answers. Faced with a sizeable common goal, students work collaboratively towards outcomes and maintain ownership over key decisions. The role of staff is that of facilitators whose role is to challenge learners to explore multiple aspects of the problem as they go about reaching viable solutions. Such a role contrasts, for example, to an approach which sets out to lead students to a presumed correct solution that is already possessed by the instructor. Based on these principles we designed and implemented a course on communication skills in Computer Science. Here, we describe our experiences using a student-run conference as a means to teach communication skills. In this approach, students were charged with the task of planning and organising a conference, including peer review, publicity, budget, sponsorship, web design, conference program, presentation schedule, speaker support, and catering. We describe the principles and their implementation and reflect on the outcome.
{"title":"Transforming communication skills instruction: the conference approach","authors":"Paul Gruba, H. Søndergaard","doi":"10.1109/ACSC.2000.824385","DOIUrl":"https://doi.org/10.1109/ACSC.2000.824385","url":null,"abstract":"From the social constructivist perspective of education, learning is best achieved when students face complex, real world problems in which there are no clear answers. Faced with a sizeable common goal, students work collaboratively towards outcomes and maintain ownership over key decisions. The role of staff is that of facilitators whose role is to challenge learners to explore multiple aspects of the problem as they go about reaching viable solutions. Such a role contrasts, for example, to an approach which sets out to lead students to a presumed correct solution that is already possessed by the instructor. Based on these principles we designed and implemented a course on communication skills in Computer Science. Here, we describe our experiences using a student-run conference as a means to teach communication skills. In this approach, students were charged with the task of planning and organising a conference, including peer review, publicity, budget, sponsorship, web design, conference program, presentation schedule, speaker support, and catering. We describe the principles and their implementation and reflect on the outcome.","PeriodicalId":304540,"journal":{"name":"Proceedings 23rd Australasian Computer Science Conference. ACSC 2000 (Cat. No.PR00518)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115936236","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-01-31DOI: 10.1109/ACSC.2000.824400
K. Nesbitt, R. J. Gallimore, B. J. Orenstein
Although the concepts of virtual environments or virtual reality have been researched for many years, the industrial application of these concepts is a relatively recent event in the evolution of the human-computer interface. This paper outlines an investigation by a commercial research organization (BHP Research) into the applications of this technology. The major domain under investigation was that of petroleum exploration. The focus of the research was two-fold, namely, the use of virtual environments to enable multi-sensory interpretation of data and the ability of virtual environments to enhance collaboration amongst work teams. Appraisal was conducted by trialing the applications amongst a wide user base. While it is not possible to divulge in full the recommendations that resulted from this work, a number of observations are made about the use of this technology for petroleum exploration. Furthermore, various general implications for the use of this technology are discussed.
{"title":"Investigating the application of virtual environment technology for use in the petroleum exploration industry","authors":"K. Nesbitt, R. J. Gallimore, B. J. Orenstein","doi":"10.1109/ACSC.2000.824400","DOIUrl":"https://doi.org/10.1109/ACSC.2000.824400","url":null,"abstract":"Although the concepts of virtual environments or virtual reality have been researched for many years, the industrial application of these concepts is a relatively recent event in the evolution of the human-computer interface. This paper outlines an investigation by a commercial research organization (BHP Research) into the applications of this technology. The major domain under investigation was that of petroleum exploration. The focus of the research was two-fold, namely, the use of virtual environments to enable multi-sensory interpretation of data and the ability of virtual environments to enhance collaboration amongst work teams. Appraisal was conducted by trialing the applications amongst a wide user base. While it is not possible to divulge in full the recommendations that resulted from this work, a number of observations are made about the use of this technology for petroleum exploration. Furthermore, various general implications for the use of this technology are discussed.","PeriodicalId":304540,"journal":{"name":"Proceedings 23rd Australasian Computer Science Conference. ACSC 2000 (Cat. No.PR00518)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123395763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-01-31DOI: 10.1109/ACSC.2000.824381
Owen de Kretser, Alistair Moffat
Information retrieval systems can be partitioned into two main classes: large-scale systems that make use of an inverted index or some other auxiliary data structure, intended for massive volumes of data; and the small-scale systems based upon sequential pattern matching that most computer users employ when hunting for missing email and news items. In this paper we describe a hybrid approach that offers the ranked queries and similarity matching of a genuine information retrieval system, but does so without any need for an index to be precomputed. This software tool, which we call seft, offers performance that in a retrieval effectiveness sense matches conventional information retrieval systems, and in a resource efficiency sense, while considerably slower than grep-like tools, is fast enough to be useful on hundreds of megabytes of text.
{"title":"Needles and Haystacks: a search engine for personal information collections","authors":"Owen de Kretser, Alistair Moffat","doi":"10.1109/ACSC.2000.824381","DOIUrl":"https://doi.org/10.1109/ACSC.2000.824381","url":null,"abstract":"Information retrieval systems can be partitioned into two main classes: large-scale systems that make use of an inverted index or some other auxiliary data structure, intended for massive volumes of data; and the small-scale systems based upon sequential pattern matching that most computer users employ when hunting for missing email and news items. In this paper we describe a hybrid approach that offers the ranked queries and similarity matching of a genuine information retrieval system, but does so without any need for an index to be precomputed. This software tool, which we call seft, offers performance that in a retrieval effectiveness sense matches conventional information retrieval systems, and in a resource efficiency sense, while considerably slower than grep-like tools, is fast enough to be useful on hundreds of megabytes of text.","PeriodicalId":304540,"journal":{"name":"Proceedings 23rd Australasian Computer Science Conference. ACSC 2000 (Cat. No.PR00518)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125105729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-01-31DOI: 10.1109/ACSC.2000.824373
L. Al-Safadi, J. Getta
This work proposes a semantic data model for video documents based on the story-line structure powerful enough to express various human interpretations of video documents, and introduces a formal query language for video retrieval that facilitates retrieval of users' heterogeneous queries based on the proposed model. The paper identifies the elementary semantic units, composite semantic units, associations and abstraction mechanisms necessary for symbolic modeling of semantic video contents. The method is independent of presentation media and it has its origins in symbolic modeling systems developed for database and complex software systems design.
{"title":"Semantic modeling for video content-based retrieval systems","authors":"L. Al-Safadi, J. Getta","doi":"10.1109/ACSC.2000.824373","DOIUrl":"https://doi.org/10.1109/ACSC.2000.824373","url":null,"abstract":"This work proposes a semantic data model for video documents based on the story-line structure powerful enough to express various human interpretations of video documents, and introduces a formal query language for video retrieval that facilitates retrieval of users' heterogeneous queries based on the proposed model. The paper identifies the elementary semantic units, composite semantic units, associations and abstraction mechanisms necessary for symbolic modeling of semantic video contents. The method is independent of presentation media and it has its origins in symbolic modeling systems developed for database and complex software systems design.","PeriodicalId":304540,"journal":{"name":"Proceedings 23rd Australasian Computer Science Conference. ACSC 2000 (Cat. No.PR00518)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122956192","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-01-31DOI: 10.1109/ACSC.2000.824388
B. Gunther
This paper examines the unique difficulties faced in teaching and learning in computer architecture at 4th-year level especially for computer science students with no engineering background. The University of South Australia's Computer Architecture subject was introduced in 1998 to provide final-year students with an in-depth treatment of computer architecture that will be relevant to software professionals. To explore topics in compiler optimisation, modern superscalar architectures, and high performance computing in a cached environment requires the support of processor simulation software in laboratory assignments. The PPS suite of software (simulator, assembler, C compiler, and utilities) were written to address the lack of suitable existing tools. PPS features sufficient realism to accommodate a broad range of student exercises, but this is offset by simplicity of design and ease of use to make learning enjoyable. Student feedback on the software was positive, especially with regard to enhancing understanding of material.
{"title":"Facilitating learning in advanced computer architecture through appropriate simulation","authors":"B. Gunther","doi":"10.1109/ACSC.2000.824388","DOIUrl":"https://doi.org/10.1109/ACSC.2000.824388","url":null,"abstract":"This paper examines the unique difficulties faced in teaching and learning in computer architecture at 4th-year level especially for computer science students with no engineering background. The University of South Australia's Computer Architecture subject was introduced in 1998 to provide final-year students with an in-depth treatment of computer architecture that will be relevant to software professionals. To explore topics in compiler optimisation, modern superscalar architectures, and high performance computing in a cached environment requires the support of processor simulation software in laboratory assignments. The PPS suite of software (simulator, assembler, C compiler, and utilities) were written to address the lack of suitable existing tools. PPS features sufficient realism to accommodate a broad range of student exercises, but this is offset by simplicity of design and ease of use to make learning enjoyable. Student feedback on the software was positive, especially with regard to enhancing understanding of material.","PeriodicalId":304540,"journal":{"name":"Proceedings 23rd Australasian Computer Science Conference. ACSC 2000 (Cat. No.PR00518)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127055586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-01-31DOI: 10.1109/ACSC.2000.824390
J. Hildebrandt, R. Hollamby
Information repositories are being constructed to manage the increasing volumes of Imagery being collected. In addition to only storing and indexing this information users will want to process the information efficiently to generate new information or new ways of viewing the information. this paper describes the development of a linkage between an experimental Image Management System and an exploitation environment provided by the Java Advanced Imaging toolkit. An application of this linkage is described that delivers a dynamic image mosaic capability of imagery sourced from the underlying repository. The application is delivered by developing a server process that communicates with a map display client via Java Remote Method Invocation.
{"title":"RAPTOR: rapid analysis, processing and transformation from online repositories","authors":"J. Hildebrandt, R. Hollamby","doi":"10.1109/ACSC.2000.824390","DOIUrl":"https://doi.org/10.1109/ACSC.2000.824390","url":null,"abstract":"Information repositories are being constructed to manage the increasing volumes of Imagery being collected. In addition to only storing and indexing this information users will want to process the information efficiently to generate new information or new ways of viewing the information. this paper describes the development of a linkage between an experimental Image Management System and an exploitation environment provided by the Java Advanced Imaging toolkit. An application of this linkage is described that delivers a dynamic image mosaic capability of imagery sourced from the underlying repository. The application is delivered by developing a server process that communicates with a map display client via Java Remote Method Invocation.","PeriodicalId":304540,"journal":{"name":"Proceedings 23rd Australasian Computer Science Conference. ACSC 2000 (Cat. No.PR00518)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130123008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-01-31DOI: 10.1109/ACSC.2000.824398
L. Naish
Declarative debugging has many advantages over conventional approaches to debugging for logic and functional programs. This paper extends a previously defined scheme for declarative debugging in which computations were considered either correct or erroneous. We argue that a third value, "inadmissible", should be supported and show how this can be done. Two classes of bugs are defined: one equivalent to the bugs defined by the two valued scheme, the other associated with inadmissibility: it is shown how different instances of the scheme can be used to diagnose type errors, mode errors, violated assertions and abnormal termination as well as the more familiar classes of bugs detected by declarative debuggers.
{"title":"A three-valued declarative debugging scheme","authors":"L. Naish","doi":"10.1109/ACSC.2000.824398","DOIUrl":"https://doi.org/10.1109/ACSC.2000.824398","url":null,"abstract":"Declarative debugging has many advantages over conventional approaches to debugging for logic and functional programs. This paper extends a previously defined scheme for declarative debugging in which computations were considered either correct or erroneous. We argue that a third value, \"inadmissible\", should be supported and show how this can be done. Two classes of bugs are defined: one equivalent to the bugs defined by the two valued scheme, the other associated with inadmissibility: it is shown how different instances of the scheme can be used to diagnose type errors, mode errors, violated assertions and abnormal termination as well as the more familiar classes of bugs detected by declarative debuggers.","PeriodicalId":304540,"journal":{"name":"Proceedings 23rd Australasian Computer Science Conference. ACSC 2000 (Cat. No.PR00518)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130763360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2000-01-31DOI: 10.1109/ACSC.2000.824380
J. Curran, R. Wong
Research in automatic part of speech (POS) tagging has been dominated by Markov model (MM) taggers. E. Brill (1997) has recently described a transformation-based system with comparable accuracy, and simpler algorithms and representation than MM taggers. We present a set-based formal model of natural language ambiguity and semantic tagging that forms a basis for the generalisation of the transformation-based learning (TBL) and Brill's TBL tagger. We discuss empirical observations of the training algorithm that suggest a new evolutionary transformation learning strategy may dramatically improve learning time without loss of accuracy.
{"title":"Formalisation of transformation-based learning","authors":"J. Curran, R. Wong","doi":"10.1109/ACSC.2000.824380","DOIUrl":"https://doi.org/10.1109/ACSC.2000.824380","url":null,"abstract":"Research in automatic part of speech (POS) tagging has been dominated by Markov model (MM) taggers. E. Brill (1997) has recently described a transformation-based system with comparable accuracy, and simpler algorithms and representation than MM taggers. We present a set-based formal model of natural language ambiguity and semantic tagging that forms a basis for the generalisation of the transformation-based learning (TBL) and Brill's TBL tagger. We discuss empirical observations of the training algorithm that suggest a new evolutionary transformation learning strategy may dramatically improve learning time without loss of accuracy.","PeriodicalId":304540,"journal":{"name":"Proceedings 23rd Australasian Computer Science Conference. ACSC 2000 (Cat. No.PR00518)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134039550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：