Australasian Computer Science Conference最新文献_第7页

Extensible detection and indexing of highlight events in broadcasted sports video 可扩展的检测和索引的重点事件在广播体育视频

Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/1151699.1151726

D. Tjondronegoro, Yi-Ping Phoebe Chen, Binh Pham

引用次数: 2

Enhanced Word-Based Block-Sorting Text Compression 增强的基于单词的块排序文本压缩

Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/563857.563817

R. Isal, Alistair Moffat, A. Ngai

引用次数: 25

Memory efficient state-space analysis in software model-checking 软件模型检查中的内存高效状态空间分析

Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1002/9781118720103.CH6

A. Mukherjee, Z. Tari, P. Bertók

{"title":"Memory efficient state-space analysis in software model-checking","authors":"A. Mukherjee, Z. Tari, P. Bertók","doi":"10.1002/9781118720103.CH6","DOIUrl":"https://doi.org/10.1002/9781118720103.CH6","url":null,"abstract":"Formal methods have an unprecedented ability to endorse the correctness of a system. In spite of that, it has been limited to safety-critical and mission-critical systems owing to significant time and memory costs involved. Lately, our ever increasing dependency on software in all walks of our life has necessitated using formal methods for a wider range of softwares. In this paper, we propose an algorithm to make this possible by reducing the memory requirement for model checking, a widely used formal method. A modelchecker stores all explored states in memory to ensure termination. The proposed algorithm slash memory costs by storing these states in compressed form. In compressed form, a state is stored as how different it is from its previous state. Our experiments report a memory reduction of 95% with only doubling of computation delay. Aforesaid reduction allows model checking in a machine with only a fraction of memory needed otherwise. Consequently the advantage is twofold, 1) enormous savings as only a small physical memory is required and 2) as more states can now be stored in a memory of same size, the chances of complete state-space analysis is exceedingly high.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127830833","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}

引用次数: 6

Neural Networks and Financial Trading and the Efficient Markets Hypothesis 神经网络与金融交易和有效市场假说

Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/563857.563829

A. Skabar, I. Cloete

{"title":"Neural Networks and Financial Trading and the Efficient Markets Hypothesis","authors":"A. Skabar, I. Cloete","doi":"10.1145/563857.563829","DOIUrl":"https://doi.org/10.1145/563857.563829","url":null,"abstract":"The efficient markets hypothesis asserts that the price of an asset reflects all of the information that can be obtained from past prices of the asset. A direct corollary of this hypothesis is that stock prices follow a random walk, and that any profits derived from timing the market are due entirely to chance. In the absence of any ability to predict the market, the most appropriate strategy---according to proponents of the efficient markets hypothesis---is to buy and hold. In this paper we describe a methodology by which neural networks can be trained indirectly, using a genetic algorithm based weight optimisation procedure, to determine buy and sell points for financial commodities traded on a stock exchange. In order to test the significance of the returns achieved using this methodology, we compare the returns on four financial price series with returns achieved on random walk data derived from each of these series using a bootstrapping procedure. These bootstrapped samples contain exactly the same distribution of daily returns as the original series, but lack any serial dependence present in the original. Our results indicate that on some price series the return achieved is significantly greater than that which can be achieved on the bootstrapped samples. This lends support to the claim that some financial time series are not entirely random, and that---contrary to the predictions of the efficient markets hypothesis---a trading strategy based solely on historical price data can be used to achieve returns better than those achieved using a buy-and-hold strategy.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126861636","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}

引用次数: 47

Using formal concept analysis with an incremental knowledge acquisition system for web document management 采用形式化概念分析与增量式知识获取系统进行网络文档管理

Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/1151699.1151727

Timothy J. Everts, Sung Sik Park, B. Kang

{"title":"Using formal concept analysis with an incremental knowledge acquisition system for web document management","authors":"Timothy J. Everts, Sung Sik Park, B. Kang","doi":"10.1145/1151699.1151727","DOIUrl":"https://doi.org/10.1145/1151699.1151727","url":null,"abstract":"It is necessary to provide a method to store Web information effectively so it can be utilised as a future knowledge resource. A commonly adopted approach is to classify the retrieved information based on its content. A technique that has been found to be suitable for this purpose is Multiple Classification Ripple-Down Rules (MCRDR). The MCRDR system constructs a classification knowledge base over time using an incremental learning process. This incremental method of acquiring classification knowledge suits the nature of Web information because it is constantly evolving and being updated. However, despite this advantage, the classification knowledge of the MCRDR system is not often utilised for browsing the classified information. This is because it does not directly organise the knowledge in a way that is suitable for browsing. As a result, often an alternate structure is utilised for browsing the information which is usually based on a user's abstract understanding of the information domain. This study investigated the feasibility of utilising the classification knowledge acquired through the use of the MCRDR system as a resource for browsing information retrieved from the WWW. A system was implemented that used the concept lattice-based browsing scheme of Formal Concept Analysis (FCA) to support the browsing of documents based on the MCRDR classification knowledge. The feasibility of utilising classification knowledge as a resource for browsing documents was evaluated statistically. This was achieved by comparing the concept lattice-based browsing approach to a standard one that utilises abstract knowledge of a domain as a resource for browsing the same documents.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"19 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115422734","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}

引用次数: 5

Reducing Cognitive Overhead on the World Wide Web 减少万维网上的认知开销

Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/563857.563837

R. J. Witt, S. Tyerman

{"title":"Reducing Cognitive Overhead on the World Wide Web","authors":"R. J. Witt, S. Tyerman","doi":"10.1145/563857.563837","DOIUrl":"https://doi.org/10.1145/563857.563837","url":null,"abstract":"HyperScout, a Web application, is an intermediary between a server and a client. It intercepts a page to the client, gathers information on each link, and annotates each link with the discovered information. This paper reports on the development of HyperScout var UniSA, a development of the HyperScout model and application, that dramatically extends static and dynamic link annotations. Annotations provide the user with additional information, which they use to make better navigational choices. On the web, it is common for long lists of hyperlinks to be presented to the user, from which they select links to follow or ignore. The user's mental state in this situation is termed cognitive overhead, a potentially overwhelming condition. To assist the user in making their choice, various characteristics of a link may be presented to the user. Despite these characteristics being readily available from a number of sources, current web servers and browsers do not attempt to retrieve, let alone display, such attributes. To show that cognitive overhead is easily, and immediately, reducible, a number of techniques were explored. Development progressed from statically created annotations, through to dynamically generated annotations. The static annotations were implemented with a combination of tools available to every web author. It was found that, while simple enough for every author to implement, static annotations bearing static information would not be accurate or timely enough to guide the user. Therefore, information must be gathered dynamically. The solution is either an intermediary between server and client, or a more sophisticated browser.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116823185","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}

引用次数: 3

An efficient hash-based algorithm for minimal k-anonymity 最小k匿名的高效哈希算法

Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/1378279.1378297

Xiaoxun Sun, Min Li, Hua Wang, A. Plank

{"title":"An efficient hash-based algorithm for minimal k-anonymity","authors":"Xiaoxun Sun, Min Li, Hua Wang, A. Plank","doi":"10.1145/1378279.1378297","DOIUrl":"https://doi.org/10.1145/1378279.1378297","url":null,"abstract":"A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes of microdata that clearly identify individuals, such as name and medical care card number, are generally removed, these databases can sometimes be joined with other public databases on attributes such as Zip code, Gender and Age to re-identify individuals who were supposed to remain anonymous. \"Linking\" attacks are made easier by the availability of other complementary databases over the Internet. \u0000 \u0000k-anonymity is a technique that prevents \"linking\" attacks by generalizing and/or suppressing portions of the released microdata so that no individual can be uniquely distinguished from a group of size k. In this paper, we investigate a practical model of k-anonymity, called full-domain generalization. We examine the issue of computing minimal k-anonymous table based on the definition of minimality described by Samarati. We introduce the hash-based technique previously used in mining associate rules and present an efficient hash-based algorithm to find the minimal k-anonymous table, which improves the previous binary search algorithm first proposed by Samarati.","PeriodicalId":136130,"journal":{"name":"Australasian Computer Science Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121721180","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}

引用次数: 55

Employing Hierarchical Federation Communities in the Virtual Ship Architecture 在虚拟船舶体系结构中采用分层联邦社区

Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/563857.563807

A. Cramp, M. Oudshoorn

引用次数: 11

A semantic approach to boost passage retrieval effectiveness for question answering 一种提高问答段落检索效率的语义方法

Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/1151699.1151711

B. Ofoghi, J. Yearwood, R. Ghosh

引用次数: 18

On pedagogically sound examples in public-key cryptography 论公钥密码学中教学上可靠的例子

Australasian Computer Science Conference Pub Date : 1900-01-01 DOI: 10.1145/1151699.1151707

S. Chong, G. Farr, Laura Frost, Simon Hawley

引用次数: 3