In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

We present a method to address the challenging problem of segmentation of multi-modality isointense infant brain MR images into white matter (WM), gray matter (GM), and cerebrospinal fluid (CSF). Our method is based on contextguided, multi-stream fully convolutional networks (FCN), which after training, can directly map a whole volumetric data to its volume-wise labels. In order to alleviate th...

This paper presents a fast method for computing whether or not two convex polygons in three dimensions intersect. The test relies exclusively on the sign of 4 4 determinants. The source code is available online.

Some techniques which average multiple AMSR satellite data passes into daily sets create images with diminished temporal resolution. This results from averaging data of multiple overlapping passes separated by many hours. Overlap can be reduced by instead grouping data according to local time of day. This new method maximizes temporal resolution by decreasing both the number and the temporal va...

Phonological priming between spoken words was examined using CVCVC bisyllabic pseudoword primes and word or pseudoword targets. The influence of different types of overlap was compared, prime and target sharing the coda, the rime or the final syllable. The task was target shadowing. Two priming conditions were used, the auditory targets being preceded by auditory primes in unimodal and by visua...