Search

Your search keyword '"Colbourn, Charles J."' showing total 41 results
Start Over Author "Colbourn, Charles J." Publication Year Range Last 3 years
41 results on '"Colbourn, Charles J."'

1. Sets of mutually orthogoval projective and affine planes

Author

Colbourn, Charles J., Ingalls, Colin, Jedwab, Jonathan, Saaltink, Mark, Smith, Ken W., and Stevens, Brett

Subjects
Finite geometry, projective planes, affine planes, covering arrays, orthogoval planes
Abstract

A pair of planes, both projective or both affine, of the same order and on the same point set are orthogoval if each line of one plane intersects each line of the other plane in at most two points. In this paper we prove new constructions for sets of mutually orthogoval planes, both projective and affine, and review known results that are equivalent to sets of more than two mutually orthogoval planes. We also discuss the connection between sets of mutually orthogoval planes and covering arrays.Mathematics Subject Classifications: 05B25, 05B40, 51E20, 51E21Keywords: Finite geometry, projective planes, affine planes, covering arrays, orthogoval planes

Published
2024

2. Guaranteeing Anonymity in Attribute-Based Authorization

Author

Lanus, Erin, Colbourn, Charles J., and Ahn, Gail-Joon

Subjects
Computer Science - Cryptography and Security
Abstract

Attribute-based methods, such as attribute-based access control and attribute-based encryption, make decisions based on attributes possessed by a subject rather than the subject's identity. While this allows for anonymous authorization -- determining that a subject is authorized without knowing the identity of the subject -- it does not guarantee anonymity. If a policy can be composed such that few subjects possess attributes satisfying the policy, then when the policy is used for access control, in addition to making a grant or deny decision, the system can also guess with high probability the identity of the subject making the request. Other approaches to achieving anonymity in attribute-based authorization do not address this attribute distribution problem. Suppose polices contain conjunctions of at most $t$ attributes and the system must not be able to guess with probability greater than $\frac{1}{r}$ the identity of a subject using a policy for authorization. We say the anonymity guarantee is $r$ for maximum credential size $t$. An anonymizing array is a combinatorial array proposed as an abstraction to address the underlying attribute distribution problem by ensuring that any assignment of values to $t$ attributes appearing in the array appears at least $r$ times. Anonymizing arrays are related to covering arrays with higher coverage, but have an additional desired property, homogeneity, due to their application domain. In this work, we discuss the application of anonymizing arrays to guarantee anonymous authorization in attribute-based methods. Additionally, we develop metrics, local and global homogeneity, to compare anonymizing arrays with the same parameters.

Published
2023

3. An Efficient Screening Method for Identifying Parameters and Interactions that Impact Wireless Network Performance

Author

Syrotiuk, Violet R., Colbourn, Charles J., De Poorter, Eli, Mehari, Michael Tetemke, Moerman, Ingrid, Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

4. Asymptotic Existence of Egalitarian Steiner 2-Designs

Author

Colbourn, Charles J., Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

7. Sets of mutually orthogoval projective and affine planes

Author

Colbourn, Charles J., Ingalls, Colin, Jedwab, Jonathan, Saaltink, Mark, Smith, Ken W., and Stevens, Brett

Subjects
Mathematics - Combinatorics, Computer Science - Discrete Mathematics, 51E15, 51E21, 05B25 (Primary) 05B15, 05B40 (Secondary)
Abstract

A pair of planes, both projective or both affine, of the same order and on the same pointset are orthogoval if each line of one plane intersects each line of the other plane in at most two points. In this paper we prove new constructions for sets of mutually orthogoval planes, both projective and affine, and review known results that are equivalent to sets of more than two mutually orthogoval planes. We also discuss the connection between sets of mutually orthogoval planes and covering arrays., Comment: 20 pages

Published
2022

20. Scalable level-wise screening experiments using locating arrays

Author

Akhtar, Yasmeen, Zhang, Fan, Colbourn, Charles J., Stufken, John, and Syrotiuk, Violet R.

Abstract

Alternative design and analysis methods for screening experiments based on locating arrays are presented. The number of runs in a locating array grows logarithmically based on the number of factors, providing efficient methods for screening complex engineered systems, especially those with large numbers of categorical factors having different numbers of levels. Our analysis method focuses on levels of factors in the identification of important main effects and two-way interactions. We demonstrate the validity of our design and analysis methods on both well-studied and synthetic data sets and investigate both statistical and combinatorial properties of locating arrays that appear to be related to their screening capability.

Published
2023
Full Text
View/download PDF

21. Mixed covering arrays on graphs of small treewidth.

Author

Maity, Soumen and Colbourn, Charles J.

Subjects
*WEIGHTED graphs, *SYSTEMS software, *CHARTS, diagrams, etc., *COMPUTER software testing, *TEST systems, *TEST design
Abstract

Covering arrays are combinatorial objects that have been successfully applied in design of test suites for testing systems such as software, hardware, and networks where failures can be caused by the interaction between their parameters. Let n and k be positive integers with k ≥ 3. Two vectors x ∈ ℤ g 1 n and y ∈ ℤ g 2 n are qualitatively independent if for any ordered pair (a , b) ∈ ℤ g 1 × ℤ g 2 , there exists an index j ∈ { 0 , 1 , ... , n − 1 } such that (x (j) , y (j)) = (a , b). Let G be a graph with k vertices v 1 , v 2 , ... , v k with respective vertex weights g 1 , g 2 , ... , g k . A mixed covering array on G , denoted by CA (n , G , ∏ i = 1 k g i) , is a k × n array such that row i corresponds to vertex v i , entries in row i are from Z g i ; and if { v x , v y } is an edge in G , then the rows x , y are qualitatively independent. The parameter n is the size of the array. Given a weighted graph G , a mixed covering array on G with minimum size is optimal. In this paper, we introduce some basic graph operations to provide constructions for optimal mixed covering arrays on the family of graphs with treewidth at most three. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

22. A Survey of Heffter Arrays

Author

Pasotti, Anita, Dinitz, Jeffrey H., Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

23. Constructing Random Steiner Triple Systems: An Experimental Study

Author

Heinlein, Daniel, Östergård, Patric R. J., Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

24. Small Transitive Homogeneous Designs

Author

Epstein, Michael, Kreher, Donald L., Magliveras, Spyros S., Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

25. Colourings of Path Systems

Author

Darijani, Iren, Pike, David A., Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

28. Private Computations on Set Intersection

Author

D’Arco, Paolo, Santis, Alfredo De, Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

29. Tight Heffter Arrays from Finite Fields

Author

Buratti, Marco, Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

30. Orthogonal and Strong Frame Starters: Revisited

Author

Stinson, Douglas R., Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

31. Mutually Orthogonal Binary Frequency Squares of Mixed Type

Author

Bodkin, Carly, Wanless, Ian M., Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

33. Quaternary Legendre Pairs

Author

Kotsireas, Ilias S., Winterhof, Arne, Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

34. On a Class of Optimal Constant Weight Codes

Author

Kharaghani, Hadi, Suda, Sho, Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

36. Block Size Five: Quo Vadis?

Author

Meszka, Mariusz, Rosa, Alexander, Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

37. An Alternative Existence Proof for LSTS

Author

Ji, Lijun, Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

38. Self-Orthogonal Latin Squares and Room Squares

Author

Lamken, Esther R., Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

39. Group Rings and Character Sums: Tricks of the Trade

Author

Jedwab, Jonathan, Li, Shuxing, Haskell, Deirdre, Editorial Board Member, Jeffrey, Lisa C., Editorial Board Member, Li, Winnie, Editorial Board Member, Murty, V. Kumar, Editorial Board Member, Vakil, Ravi, Editorial Board Member, Colbourn, Charles J., editor, and Dinitz, Jeffrey H., editor

Published
2024
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results