Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 46 - 60 of 312.

Add to Quick Collection   All 312 Results

Sort:
 Add All Items to Quick Collection
Date: 2010
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/322833
Description: Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be available between a ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148080
Description: This paper considers a generalized form for Hessian curves. The family of generalized Hessian curves covers more isomorphism classes of elliptic curves. Over a finite field $mathbb{F}_q$, it is shown ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/153193
Description: Memorable teaching–teaching that makes memorable not only the teacher but also what the student has learned–is necessarily strong in both the cognitive and the affective domain. University statistics ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148162
Description: 18 page(s)
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/109691
Description: The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multihop paths may not exist and communicat ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1228448
Description: We present a constraint-based method for automatically generating quantitative invariants for linear probabilistic programs, and we show how it can be used, in combination with proof-based methods, to ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148105
Description: In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchronously. In particular ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/126837
Description: In this paper we investigate the asymptotic effectiveness of the Gaudry–Hess–Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic- ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/125235
Description: In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degree growth of these iterations. We use these estimates to bound exponential ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/125241
Description: Recently, multisequences have gained increasing interest for applications in cryptography and quasi-Monte Carlo methods. We study the (generalized) joint linear complexity of a class of nonlinear pseu ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/130338
Description: We give explicit formulas for the number of distinct elliptic curves over a finite field (up to isomorphism over the algebraic closure of the ground field) in several families of curves of cryptograph ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.14/120200
Description: In this chapter we review a category theoretic approach to ontology engineering. Using ideas from universal algebra, we carefully distinguish presentations of ontologies from the ontologies themselves ... More
Date: 2010
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.14/125649
Description: 21 page(s)
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/130893
Description: Dynamical systems generated by iterations of multivariate polynomials with slow degree growth have proved to admit good estimates of exponential sums along their orbits which in turn lead to rather st ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/91338
Description: We identify a refinement algebra for reasoning about probabilistic program transformations in a total-correctness setting. The algebra is equipped with operators that determine whether a program is en ... More
Reviewed: Reviewed