#### Filter Results:

- Full text PDF available (25)

#### Publication Year

2004

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Brain Region

#### Cell Type

#### Key Phrases

#### Method

Learn More

- R. Gray, N. Ruskuc
- 2009

We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite semigroup. (3) Every group is a maximal subgroup of some free regular idempotent generated semi-group. (4) Every finite… (More)

- Tai Nguyen-Ky, Peng Wen, Yan Li, R. Gray
- IEEE Transactions on Information Technology in…
- 2011

This paper evaluates depth of anesthesia (DoA) monitoring using a new index. The proposed method preconditions raw EEG data using an adaptive threshold technique to remove spikes and low-frequency noise. We also propose an adaptive window length technique to adjust the length of the sliding window. The information pertinent to DoA is then extracted to… (More)

- J.L. Prodger, R. Gray, +8 authors R. Kaul
- Mucosal immunology
- 2012

The foreskin is the main site of heterosexual human immunodeficiency virus (HIV) acquisition in uncircumcised men, but functional data regarding T-cell subsets present at this site are lacking. Foreskin tissue and blood were obtained from Ugandan men undergoing elective adult circumcision. Tissue was treated by mechanical and enzymatic digestion followed by… (More)

- A. D. McDonald, L. R. Little, R. Gray, Elizabeth A. Fulton, K. J. Sainsbury, V. D. Lyne
- Mathematics and Computers in Simulation
- 2008

- R. GRAY
- 2007

The relationship between posets that are cycle-free and graphs that have more than one end is considered. We show that any locally finite bipartite graph corresponding to a cycle-free partial order has more than one end, by showing a correspondence between the ends of the graph and those of the Hasse graph of its Dedekind–MacNeille completion. If, in… (More)

- R. Gray, J. D. Mitchell
- Discrete Mathematics
- 2008

In this paper we are concerned with the following question: for a semigroup S, what is the largest size of a subsemigroup T ≤ S where T has a given property? The semigroups S that we consider are the full transformation semigroups; all mappings from a finite set to itself under composition of mappings. The subsemigroups T that we consider are of one of the… (More)

- M. Artuso, C. Boulahouache, +132 authors Y. S. Gao
- 2005

We extract a relatively precise value for the decay constant of the D

- Yuan Zhang, Rick Gray, +5 authors Chris Progler
- 2005

It has been demonstrated that the write time for 50keV E-beam masks is a function of layout complexity including figure count, vertex count and total line edge. This study is aimed to improve model fitting by utilizing all the variables generated from CATS. A better correlation of R 2 = 0.99 was achieved by including quadratic and interaction terms. The… (More)

- R. Gray
- 2004

A formula for the rank of an arbitrary finite completely 0-simple semigroup, represented as a Rees matrix semigroup M 0 Ruškuc concerning the rank of connected finite completely 0-simple semigroups. The rank is expressed in terms of |I| , |Λ| , the number of connected components k of P and a number rmin which we define. We go on to show that the number rmin… (More)

- R. Gray, N. Ruškuc
- 2011

Given a finitely generated semigroup S and subsemigroup T of S we define the notion of the boundary of T in S which, intuitively, describes the position of T inside the left and right Cayley graphs of S. We prove that if S is finitely generated and T has a finite boundary in S then T is finitely generated. We also prove that if S is finitely presented and T… (More)