Further results in d-antimagic labelings of antiprisms
- Authors: Lin, Yuqing , Ahmad, Abeed , Miller, Mirka , Sugeng, Kiki Ariyanti , Baca, Martin
- Date: 2004
- Type: Text , Conference paper
- Relation: Paper presented at AWOCA 2004: Fifteenth Australasian Workshop on Combinatorial Algorithms, Ballina, New South Wales : 6-9th July, 2004
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003000900
On d-antimagic labelings of prisms
- Authors: Lin, Yuqing , Slamin, , Baca, Martin , Miller, Mirka
- Date: 2004
- Type: Text , Journal article
- Relation: Ars Combinatoria: A Canadian Journal of Combinatorics Vol. 72, no. (2004), p. 65-76
- Full Text: false
- Reviewed:
- Description: C1
- Description: 2003000907
On non-polynomiality of XOR over Zn2
- Authors: Grosek, Otokar , Miller, Mirka , Ryan, Joe
- Date: 2004
- Type: Text , Journal article
- Relation: Tatra Mountains Mathematical Publications Vol. 29, no. (2004), p. 183-191
- Full Text: false
- Reviewed:
- Description: C1
- Description: 2003000905
On the structure of (d,3)-digraphs containing selfrepeats
- Authors: Baskoro, Edy , Cholily, Yus Mochamad , Miller, Mirka
- Date: 2004
- Type: Text , Conference paper
- Relation: Paper presented at AWOCA 2004: Fifteenth Australasian Workshop on Combinatorial Algorithms, Ballina, New South Wales : 6-9th July, 2004
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003000901
Security issues in statistical databases and implementation of audit expert
- Authors: Ahmad, Abeed , Miller, Mirka
- Date: 2004
- Type: Text , Conference paper
- Relation: Paper presented at ICCC 2004: International Conference on Computers and Communications, Baile Felix Spa-Oradea, Romania : 27th - 29th May, 2004
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003000899
Shield privacy Hippocratic security method for virtual community
- Authors: Skinner, Geoff , Chang, E. , McMahon, M. , Aisbett, J. , Miller, Mirka
- Date: 2004
- Type: Text , Conference paper
- Relation: Paper presented at IECON '04: The 30th Annual Conference of the IEEE Industrial Electronics Society, Busan, Korea : 2nd November, 2004
- Full Text: false
- Reviewed:
- Description: Pearlman et al., (2002) defines a virtual community as a large, multiinstitutional group of individuals who use a set of rules, a policy, to specify how to share their resources. With such a large collection of data stores in these resources, each of which could be data mined to different degrees, the privacy of each of the individuals needs to be protected. Within a virtual community, especially one also used to facilitate knowledge discovery, there are a number of privacy issues that must be addressed and resolved in ways other than through privacy laws and policies alone. This is due to the fact that, as to date, these laws have proved mainly ineffective and there is an ever growing concern by individuals about their privacy. Web surveys Srikant R. (2002) have identified that 82% of users have said improved privacy policies and methods would matter in Web environments. Agarwal R. (2002) highlights the fact that a secure collaborative environment, such as a virtual community, needs to provide authentication, authorization, privacy and data integrity. In this paper, we identify the technology issues, followed by the presentation of our proposed solution. We provide a conceptual framework of the Hippocratic security method to provide information security for shield privacy in virtual communities and we describe the architecture and design of the proposed solution. We outline the implementation, testing and evaluation strategies of our solutions. The proposed solution shall monitor the use of personal information as it is passed around the virtual community and protected information paths, data at rest, database and information resources through the use of the Hippocratic database principle to enforce Hippocratic security policies and procedures together with privacy preserving data mining Evfimievski et al., (2003) method for excellent information security in a virtual community environment.
- Description: E1
- Description: 2003000903
Super vertex-magic total labelings of graphs
- Authors: MacDougall, James , Miller, Mirka , Sugeng, Kiki Ariyanti
- Date: 2004
- Type: Text , Conference paper
- Relation: Paper presented at AWOCA 2004: Fifteenth Australasian Workshop on Combinatorial Algorithms, Ballina, New South Wales : 6th - 9th July, 2004 p. 222–229
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003000902
(a,d)-edge-antimagic total labelings of caterpillars
- Authors: Miller, Mirka , Sugeng, Kiki Ariyanti , Slamin, , Baca, Martin
- Date: 2005
- Type: Text , Journal article
- Relation: Combinatorial Geometry and Graph Theory, LNCS 3330, Lecture Notes in Computer Science, Indonesia-Japan Joint Conference IJCCGGT 2003, Bandung, Indonesia, September 2003, Revised Selected Papers Vol. 3330, no. (2005), p. 169-180
- Full Text: false
- Reviewed:
- Description: For a graph G = (V,E), a bijection g from V (G)∪E(G) into {1, 2, ..., |V (G)|+|E(G)|} is called (a, d)-edge-antimagic total labeling of G if the edge-weights w(xy) = g(x) + g(y) + g(xy), xy ∈ E(G), form an arithmetic progression with initial term a and common difference d. An (a, d)-edge-antimagic total labeling g is called super (a, d)-edge-antimagic total if g(V (G)) = {1, 2, ..., |V (G)|}. We study super (a, d)-edge-antimagic total properties of stars Sn and caterpillar Sn1,n2,...,nr .
- Description: C1
- Description: 2003001412
A survey on the connectivity of cages
- Authors: Miller, Mirka , Lin, Yuqing
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at the Sixteenth Australasian Workshop on Combinatorial Algorithms, 18-21 September 2005, Ballarat, Australia, Ballarat, Victoria : 18th -21st September, 2005
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003001393
All (k;g)-cages are k-edge-connected
- Authors: Lin, Yuqing , Miller, Mirka , Rodger, Chris
- Date: 2005
- Type: Text , Journal article
- Relation: Journal of Graph Theory Vol. 48, no. 3 (2005), p. 219-227
- Full Text: false
- Reviewed:
- Description: A (k;g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In this paper, we prove that (k;g)-cages are k-edge-connected if g is even. Earlier, Wang, Xu, and Wang proved that (k;g)-cages are k-edge-connected if g is odd. Combining our results, we conclude that the (k;g)-cages are k-edge-connected. © 2005 wiley Periodicals, Inc.
- Description: C1
An application of sum labeling for the access structure in a secret sharing scheme
- Authors: Miller, Mirka , Sugeng, Kiki Ariyanti , Slamet, Surjadi
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at INACISC Indonesia Cryptology and Information Security Conference, Jakarta, Indonesia : 30th - 31st March, 2005
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003001405
Antimagic valuations for the special class of plane graphs
- Authors: Baca, Martin , Baskoro, Edy , Miller, Mirka
- Date: 2005
- Type: Text , Journal article
- Relation: Lecture Notes in Computer Science Vol. 3350, no. (2005), p. 58-64
- Full Text: false
- Reviewed:
- Description: We deal with the problem of labeling the vertices, edges and faces of a special class of plane graphs with 3-sided internal faces in such a way that the label of a face and the labels of the vertices and edges surrounding that face all together add up to the weight of that face. These face weights then form an arithmetic progression with common difference d.
- Description: C1
- Description: 2003001410
Complete characterization of almost moore digraphs of degree three
- Authors: Baskoro, Edy , Miller, Mirka , Siran, Jozef , Sutton, Martin
- Date: 2005
- Type: Text , Journal article
- Relation: Journal of Graph Theory Vol. 48, no. 2 (2005), p. 112-126
- Full Text: false
- Reviewed:
- Description: It is well known that Moore digraphs do not exist except for trivial cases (degree 1 or diameter 1), but there are digraphs of diameter two and arbitrary degree which miss the Moore bound by one. No examples of such digraphs of diameter at least three are known, although several necessary conditions for their existence have been obtained. In this paper, we prove that digraphs of degree three and diameter k ≥ 3 which miss the Moore bound by one do not exist. © 2004 Wiley Periodicals, Inc.
- Description: C1
- Description: 2003000904
Conjectures and open problems on face antimagic evaluations of graphs
- Authors: Miller, Mirka , Baca, Martin , Baskoro, Edy , Cholily, Yus Mochamad , Jendrol, Stanislav , Lin, Yuqing , Ryan, Joe , Simanjuntak, Rinovia , Slamin, , Sugeng, Kiki Ariyanti
- Date: 2005
- Type: Text , Journal article
- Relation: Journal of Indonesian Mathematical Society MIHMI Vol. 11, no. 2 (2005), p. 175-192
- Full Text: false
- Reviewed:
- Description: C1
- Description: 2003001408
Context-dependent security enforcement of statistical databases
- Authors: Ryan, Joe , Mishra, Vivek , Stranieri, Andrew , Miller, Mirka
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at the 4th WSEAS International Conference on Information Security, Communications and Computers, Tenerife, Spain, 16-18 December 2005, Tenerife, Spain : 16th December, 2005
- Full Text:
- Reviewed:
- Description: E1
- Description: 2003001390
Delta-optimum exclusive sum labeling of certain graphs with radius one
- Authors: Tuga, Mauritsius , Miller, Mirka
- Date: 2005
- Type: Text , Journal article
- Relation: Lecture Notes in Computer Science Vol. 3330, no. (2005), p. 216-225
- Full Text: false
- Reviewed:
- Description: A mapping
- Description: C1
- Description: 2003001413
Exclusive sum labeling of graphs
- Authors: Miller, Mirka , Patel, Deval , Ryan, Joe , Sugeng, Kiki Ariyanti , Slamin, , Tuga, Mauritsius
- Date: 2005
- Type: Text , Journal article
- Relation: The Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 55, no. (2005), p. 137-148
- Full Text: false
- Reviewed:
- Description: C1
- Description: 2003001402
Exclusive sum labelings of trees
- Authors: Miller, Mirka , Tuga, Mauritsius , Ryan, Joe , Ryjacek, Zdenek
- Date: 2005
- Type: Text , Journal article
- Relation: The Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 55, no. (2005), p. 109-121
- Full Text: false
- Reviewed:
- Description: The notions of
- Description: C1
- Description: 2003001406
Graph representation of access controls for managing privacy, trust and security requirements
- Authors: Miller, Mirka , Skinner, Geoff
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper presented at the 4th WSEAS International Conference on Information Security, Communications and Computers, Tenerife, Spain : 16th -18th December, 2005
- Full Text: false
- Reviewed:
- Description: E1
- Description: 2003001396
Hybrid simulated annealing and genetic algorithm for degree/diameter problem
- Authors: Tang, Jianmin , Miller, Mirka , Lin, Yuqing
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper pesented at Sixteenth Australasian Workshop on Combinatorial Algorithms, AWOCA 2005, Ballarat, Victoria : 18th-21st September 2005 p. 321-331
- Full Text: false
- Description: The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. This paper deals with directed graphs. General upper bounds, called Moore bounds, exist for the largest possible order of such digraphs of maximum degree d and diameter k. It is known that simulated annealing and genetic algorithm are effective techniques to identify global optimization solutions. This paper describes our attempt to build a Hybrid Simulated Annealing and Genetic Algorithm (HSAGA) that can be used to construct larger digraphs, and displays our preliminary results obtained by HSAGA.
- Description: 2003001438