Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Business (16)
- Computer Sciences (15)
- Business Administration, Management, and Operations (11)
- E-Commerce (9)
- Engineering (7)
-
- Management Information Systems (7)
- Technology and Innovation (7)
- Computer Engineering (4)
- Business Law, Public Responsibility, and Ethics (3)
- Graphics and Human Computer Interfaces (2)
- International Business (2)
- Operations Research, Systems Engineering and Industrial Engineering (2)
- Organizational Behavior and Theory (2)
- Strategic Management Policy (2)
- Applied Mathematics (1)
- Computer and Systems Architecture (1)
- Digital Communications and Networking (1)
- Finance and Financial Management (1)
- Health and Medical Administration (1)
- Industrial Engineering (1)
- Legal Studies (1)
- Marketing (1)
- Mathematics (1)
- Medicine and Health Sciences (1)
- Numerical Analysis and Scientific Computing (1)
- Other Computer Sciences (1)
- Other Legal Studies (1)
- Other Operations Research, Systems Engineering and Industrial Engineering (1)
- Social and Behavioral Sciences (1)
- Keyword
-
- For (67)
- Analysis (43)
- Era2015 (39)
- Systems (34)
- System (32)
-
- Power (30)
- Based (29)
- Modelling (24)
- Approach (23)
- Data (23)
- Control (20)
- Model (20)
- Models (20)
- RFID (20)
- Using (20)
- Time (18)
- Study (17)
- Human (16)
- Image (16)
- Information (16)
- Networks (16)
- Application (15)
- Australia (15)
- Estimation (15)
- Performance (15)
- Adaptive (14)
- Algorithm (14)
- Frequency (14)
- Method (14)
- Space (14)
- Publication Year
Articles 1891 - 1920 of 2013
Full-Text Articles in Physical Sciences and Mathematics
Key Scheduling Des Type Cryptosystems, Lawrence Brown, Jennifer Seberry
Key Scheduling Des Type Cryptosystems, Lawrence Brown, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
This paper reviews some possible design criteria for the key schedule in a DES style cryptosystem. The key schedule involves a Key Rotation component. and the permutation PC2. Together these provide for a diffusion of dependency of ciphertext bits on key bits. Some empirical rules which seem to account for the derivation of the key schedule used in the DES are first presented. A number of trials were run with various key schedules. and some further design rules were derived. An alternative form of key schedule was then tested. This used either a null PC2, or one in which permutations …
Relative Compromise Of Statistical Databases, M Miller, Jennifer Seberry
Relative Compromise Of Statistical Databases, M Miller, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
Statistical databases are databases in which only statistical type of queries are allowed. The results of the statistical queries are intended for statistical use only. However, it has been shown that using only statistical queries it is often possible to infer an individuals's value of a protected field (e.g, using various types of trackers). In such a case we say that the database has been (positively) compromised. Various types of compromise have been studied but until now attention has centred on the inference of exact information from permitted queries. In this paper we introduce a new type of compromise, the …
Sbibd(4k², 2k² + K, K² + K) And Hadamard Matrices Of Order 4k² With Maximal Excess Are Equivalent, Jennifer Seberry
Sbibd(4k², 2k² + K, K² + K) And Hadamard Matrices Of Order 4k² With Maximal Excess Are Equivalent, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We show that an SBIBD(4k², 2k² + k, k² + k) is equivalent to a regular Hadamard matrix of order 4k² which is equivalent to an Hadamard matrix of order 4k² with maximal excess. We find many new SBIBD(4k², 2k² + k, k² + k) including those for even k when there is an Hadamard matrix of order 2k (in particular all 2k ≤ 210) and k є {1, 3, 5,...,29,33,...,41,45,51,53,61,...69,75,81,83,89,95,99,625,32m,25. 32m, m ≥ 0}.
User Unique Identification, Terry Jones, Mike Newberry, Jennifer Seberry
User Unique Identification, Terry Jones, Mike Newberry, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
Traditionally, users have been authenticated by asking them to provide some form of password. This password has been stored securely in the computer and used to check the identity of the user at various times, such as when they first log on. However such authentication only proves that the challenged user knows the password - it doesn't identify the user. This has often been a security problem in time-shared computer installations, when unauthorised users (the proverbial "hackers") have obtained the passwords of valid users and used these to penetrate the site's security. This has led to much work to identify …
A Survey Of Base Sequences, Disjoint Complementary Sequences And Od(4t; T, T, T, T), Gavin Cohen, David Rubie, Jennifer Seberry, Christos Koukouvinos, Stratis Kounias, Mieko Yamada
A Survey Of Base Sequences, Disjoint Complementary Sequences And Od(4t; T, T, T, T), Gavin Cohen, David Rubie, Jennifer Seberry, Christos Koukouvinos, Stratis Kounias, Mieko Yamada
Faculty of Informatics - Papers (Archive)
We survey the existence of base sequences, that is four sequences of lengths m + p, m + p, m, m, p odd with zero auto correlation function which can be used with Yang numbers and four disjoint complementary sequences (and matrices) with zero non-periodic (periodic) autocorrelation function to form longer sequences. We survey their application to make orthogonal designs OD(4t; t, t, t, t). We give the method of construction of OD(4t; t, t, t, t) for t = 1,3,..., 41, 45,...,65, 67, 69, 75, 77, 81, 85, 87, 91, 93, 95, 99, 101, 105, 111, 115, 117, 119, …
Experience Of Using A Type Signature Password System For User Authentication In A Heavily Used Computing Environment, Mike Newberry, Jennifer Seberry
Experience Of Using A Type Signature Password System For User Authentication In A Heavily Used Computing Environment, Mike Newberry, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
This paper describes a user authentication system based around the user's type signature, a statistical measure of the user's typing style. It was tested on two heavily loaded computers.
A Multilevel Encryption Scheme For Database Security, Thomas Hardjono, Jennifer Seberry
A Multilevel Encryption Scheme For Database Security, Thomas Hardjono, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
An encryption scheme is proposed which allows a hierarchical organization of keys used to encrypt and decrypt data stored in databases. The scheme uses the same method as the RSA cryptosystem [RISH78] to encrypt and decrypt data, with additional restrictions on the availability of the encryption information to the public. Its security is based on the Discrete Logarithm problem [DIHE76] which is known to be NPI. Each user is issued a key which is used for decryption and user clearance verification.
Pseudo-Random Sequence Generators Using Structured Noise, R S. Safavi-Naini, Jennifer Seberry
Pseudo-Random Sequence Generators Using Structured Noise, R S. Safavi-Naini, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
Stream ciphers use the output of a Pseudo-Random (PR) generator to mask the information stream. The security of these cipher systems ultimately depends on the structure of the PR generator. There are some minimum necessary criteria such as long period, flat statistical distribution and high linear complexity that the PR generator of a stream cipher system should satisfy to resist the basic cryptanalytic attacks on such systems. We propose a class of PR generators using the coset elements of a Reed-Muller code. The linear Complexity of these generators is analysed and conditions that assure the highest possible linear complexity for …
Cryptographic Techniques, Jennifer Seberry
Cryptographic Techniques, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
The public key cryptosystem published by Diffie and Hellman in 1976 is still of great interest today. Of the public key systems that have been proposed the RSA scheme of Rivest, Shamir and Adelman is of most current interest. We shall briefly describe this system (more can be found in references 2 and 7) and then describe a method to obtain suitable primes for use in the scheme.
Products Of Hadamard Matrices, Williamson Matrices And Other Orthogonal Matrices Using M-Structures, Jennifer Seberry, Mieko Yamada
Products Of Hadamard Matrices, Williamson Matrices And Other Orthogonal Matrices Using M-Structures, Jennifer Seberry, Mieko Yamada
Faculty of Informatics - Papers (Archive)
The new concept of M-structures is used to unify and generalize a number of concepts in Hadamard matrices including Williamson matrices, Goethals-Seidel matrices, Wallis-Whiteman matrices and generalized quaternion matrices. The concept is used to find many new symmetric Williamson-type matrices, both in sets of four and eight, and many new Hadamard matrices. We give as corollaries "that the existence of Hadamard matrices of orders 4g and 4h implies the existence of an Hadamard matrix of order 8gh" and "the existence of 'Williamson type matrices of orders u and v implies the existence of 'Williamson type matrices of order 2uu". This …
On Weighing Matrices With Square Weights, D G. Sarvate, Jennifer Seberry
On Weighing Matrices With Square Weights, D G. Sarvate, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We give a new construction for a known family of weighing matrices using the 2-adjugate method of Vartak and Patwardhan. We review the existence of W(n,k²), k = 1,.. ,12, giving new results for k = 8,...12.
Bhaskar Rao Designs Over Small Groups, William D. Palmer, Jennifer Seberry
Bhaskar Rao Designs Over Small Groups, William D. Palmer, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We show that for each of the groups S3, D4, Q4, Z4 x Z2 and D6 the necessary conditions are sufficient for the existence of a generalized Bhaskar Rao design. That is, we show that: (i) a GBRD (v, 3, λ; S3) exists if and only if λ ≡ O (mod 6 ) and λv(v - 1) ≡ O(mod 24); (ii) if G is one of the groups D4, Q4, and Z4 x Z2, a GBRD (v, 3, λ; G) exists if and only …
New Hadamard Matrices And Conference Matrices Obtained Via Mathon's Construction, Jennifer Seberry, Albert L. Whiteman
New Hadamard Matrices And Conference Matrices Obtained Via Mathon's Construction, Jennifer Seberry, Albert L. Whiteman
Faculty of Informatics - Papers (Archive)
We give a formulation, via (1, - 1) matrices, of Mathon's construction for conference matrices and derive a new family of conference matrices of order 5·9²r+1 + 1, t ≥ 0. This family produces a new conference matrix of order 3646 and a new Hadamard matrix of order 7292. In addition we construct new families of Hadamard matrices of orders 6.9²r+1+ 2, 10.9²t+1 + 2, 8·49·9², t ≥ 0; q2(q + 3) + 2 where q ≡ 3 (mod 4) is a prime power and 1/2(q + 5) is the order of a skew-Hadamard matrix); (q + 1)q².9t, t ≥ …
Some Results On The Excesses Of Hadamard Matrices, Brett A. Jenkins, C Koukouvinos, S Kounias, Jennifer Seberry, Ralph Seberry
Some Results On The Excesses Of Hadamard Matrices, Brett A. Jenkins, C Koukouvinos, S Kounias, Jennifer Seberry, Ralph Seberry
Faculty of Informatics - Papers (Archive)
We give some results on the excess of Hadamard matrices. We give a list for Hadamard matrices of order ≤1000 of the smallest upper bounds known for the excess for each order. A construction is indicated for the maximal known excess.
A Robust-Resistant Spatial Analysis Of Soil Water Infiltration., Noel A. Cressie, R Horton
A Robust-Resistant Spatial Analysis Of Soil Water Infiltration., Noel A. Cressie, R Horton
Faculty of Informatics - Papers (Archive)
Concentrates on estimating the spatial correlations between soil water infiltration observations, with special emphasis on resistant methods to remove nonstationarity. After this removal, robust semivariogram estimators are used to examine the spatial dependencies for various tillage treatments. There is some indication that infiltration characteristics inherit different types of spatial dependency, depending on the tillage treatment applied.-from Authors
Random Set Theory And Problems Of Modeling, Noel A. Cressie, G M. Laslett
Random Set Theory And Problems Of Modeling, Noel A. Cressie, G M. Laslett
Faculty of Informatics - Papers (Archive)
The three- or four-dimensional world in which we live is full of objects to be measured and summarized. Very often a parsimonious finite collection of measurements is enough for scientific investigation into an object’s genesis and evolution. There is a growing need, however, to describe and model objects through their form as well as their size. The purpose of this article is to show the potentials and limitations of a probabilistic and statistical approach. Collections of objects (the data) are assimilated to a random set (the model), whose parameters provide description and/or explanation.
Coloured Designs, New Group Divisible Designs And Pairwise Balanced Designs, C A. Rodger, Dinesh G. Sarvate, Jennifer Seberry
Coloured Designs, New Group Divisible Designs And Pairwise Balanced Designs, C A. Rodger, Dinesh G. Sarvate, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
Many new families of group divisible designs, balanced incomplete block designs and pairwise balanced designs can be obtained by using constructions based on coloured designs (CD). This paper gives one such construction in each case together with an existence theorem for coloured designs.
Generalized Hadamard Matrices And Colourable Designs In The Construction Of Regular Gdds With Two And Three Association Classes, Jennifer Seberry
Generalized Hadamard Matrices And Colourable Designs In The Construction Of Regular Gdds With Two And Three Association Classes, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
Generalized Hadamard matrices and colourable designs are used to construct many new group divisible designs.
A Note On Orthogonal Designs, J Hammer, D G. Sarvate, Jennifer Seberry
A Note On Orthogonal Designs, J Hammer, D G. Sarvate, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We extend a method of Kharaghani and obtain some new constructions for weighing matrices and orthogonal designs. In particular we show that if there exists an OD(s1,...,sr), where w = ∑si, of order n, then there exists an OD(s1w,s2w,...,8rw) of order n(n+k) for k ≥ 0 an integer. If there is an OD(t,t,t,t) in order n, then there exists an OD(12t,12t,12t,12t) in order 12n. If there exists an OD(s,s,s,s) in order 4s and an OD(t,t,t,t) in order 4t there exists an OD(12s²t,12s²t,12s²t,12s²t) in order 48s²t and an OD(20s²t,20s²t,20s²t20s²) in order 80s²t.
On Hadamard Matrices Of Order 2t Pq:I, Jennifer Seberry
On Hadamard Matrices Of Order 2t Pq:I, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We prove a new result for orthogonal designs showing if all full orthogonal designs, OD (r; a, b, r - a - b), exist, where gcd(a, b, r - a - b) = 2t, then all full orthogonal designs, OD(s; c, d, s - c - d), exist, where gcd(c, d, s - c - d) = 2t+u, u ≥ 0. It is known that,for infinitely many numbers r = 2wp,such OD(r; a, b, r - a - b) exist. In particular we show OD(4; x, y, 4 - x - y), OD(24; x, y, 24 - x - y) …
Vanstone's Construction Applied To Bhaskar Rao Designs, Jennifer Seberry
Vanstone's Construction Applied To Bhaskar Rao Designs, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We show how Vanstone's construction, given in his paper "A note on a construction for BIBD's", Utilitas Mathematica, 7(1975), 321-322, can be applied to symmetric GBRD(v, k, λ; │G│). │G│ odd, can be used to obtain GBRD(v, (v2), (k2), λ, (λ2); G) and hence many families of BIBD.
Electronic Funds Transfer Point Of Sale In Australia, Ralph Gyoery, Jennifer Seberry
Electronic Funds Transfer Point Of Sale In Australia, Ralph Gyoery, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
The Australia wide eftpos systems was developed by the Australian Retail Banks to meet Australian conditions including a small population, which overwhehningly uses cash for transactions, a small number of banks capable of "exchange of value" settlements and enormous distances. This paper discusses the system that has evolved first involving only ATM's and banks, then extending to POS systems for retailers and non bank fmancial institutions.
Public Key Cryptography, Jennifer Seberry
Public Key Cryptography, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We are going to devote most of our attention in this talk to the RSA Public Key Cryptosystem because it not only remains unbroken but it has some other useful features for digital signatures and authentication. We will briefly mention some other methods which have been compromised to some degree, and one, McEliece's which has not, but which are still valid when both keys are kept secret and some have other features which may be useful.
Ff-Pade Method Of Model Reduction In Frequency Domain, H. Xiheng
Ff-Pade Method Of Model Reduction In Frequency Domain, H. Xiheng
Faculty of Informatics - Papers (Archive)
In this note the FF-Pade method based upon some new concepts in model reduction is presented. The new method will overcome the chief drawbacks of the current methods. Some typical examples are used to show convincingly that one has to break free from the conventional approaches in order to obtain better results in model reduction.
Constructing Hadamard Matrices Via Orthogonal Designs, Jennifer Seberry
Constructing Hadamard Matrices Via Orthogonal Designs, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
Orthogonal designs were created to give a unifying approach to the construction of Hadamard matrices. Recent work has been concerned with Hadamard matrices of order 2tpq, where t ≤ 5 and one of p and q is small. This paper obtains many new constructions for Hadamard matrices of such orders and works toward a more general construction theory.
A Construction For Orthogonal Designs With Three Variables, Jennifer Seberry
A Construction For Orthogonal Designs With Three Variables, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We show how orthogonal designs OD(48p²t;16p²t, 16p²t,16p²t) can be constructed from an Hadamard matrix of order 4p and an OD(4t;t,t,t,t). This allows us to assert that OD(48p²t; 16p²t,16p²t,16p²t) exist for all t,p ≤ 102 except possibly for tє{67,71,73,77,79,83,86,89,91,97}. These designs are new.
Encryption Methods Based On Combinatorial Designs, Dinesh G. Sarvate, Jennifer Seberry
Encryption Methods Based On Combinatorial Designs, Dinesh G. Sarvate, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
We explore the use of some combinatorial designs for possible use as secret codes. We are motivated to use designs as (1) combinatorial designs are often hard to find, (2) the algorithms for encryption ond decryption are of reasonable length, (3) combinatorial designs have very large numbers of designs in each equivalence class lending themselves readily to selection using a secret key.
A New Construction For Williamson-Type Matrices, Jennifer Seberry
A New Construction For Williamson-Type Matrices, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
It is shown that if q is a prime power then there are Williamson-type matrices of order (i) 1/2q2(q + 1) when q ≡ 1 (mod 4), (ii)1/4q2(q + 1) when q ≡ 3 (mod 4) and there are Williamson-type matrices of order l/4(q + 1). This gives Williamson-type matrices for the new orders 363, 1183, 1805, 2601, 3174, 5103. The construction can be combined with known results on orthogonal designs to give an Hadamard matrix of the new order 33396 = 4·8349.
Authentication Without Secrecy, Terry C. Jones, Jennifer Seberry
Authentication Without Secrecy, Terry C. Jones, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
Recently, Seberry proposed a method for subliminal message transmission over an insecure channel in the case where authentication but not secrecy is required. Here we examine her ideas in some detail, and propose certain changes to the method that would be necessary for implementation.
On Inequivalent Weighing Matrices, H C. Chan, C A. Rodger, Jennifer Seberry
On Inequivalent Weighing Matrices, H C. Chan, C A. Rodger, Jennifer Seberry
Faculty of Informatics - Papers (Archive)
A weighing matrix W = W(n,k) of order n and weight k is a square matrix of order n, with entries 0, +1 aud -1 which satisfies WWT = kIn. Tools such as Smith Normal Form, profile, maximum integer and some group theoretic and coding theory methods are used to classify some matrices for 1 ≤ k ≤ n ≤ 20, into equivalence classes under pre-and post-multiplication by monomial matrices(permutation matrices where the non-zero elements are +1 or -1). The inequivalent weighing matrices are classified for k ≤ 5.