Generation Speed in Raven's Progressive Matrices Test.
Verguts, Tom; De Boeck, Paul; Maris, Eric
1999-01-01
Studied the role of response fluency on results of the Raven's Advanced Progressive Matrices (APM) Test by comparing scores on a test of generation speed (speed of generating rules that govern the items) with APM test performance for 127 Belgian undergraduates. Discusses the importance of generation speed in intelligence. (SLD)
Generation speed in Raven's Progressive Matrices Test
Verguts, T.; Boeck, P. De; Maris, E.G.G.
1999-01-01
In this paper, we investigate the role of response fluency on a well-known intelligence test, Raven's (1962) Advanced Progressive Matrices (APM) test. Critical in solving this test is finding rules that govern the items. Response fluency is conceptualized as generation speed or the speed at which a
Age differences on Raven's Coloured Progressive Matrices.
Panek, P E; Stoner, S B
1980-06-01
Raven's Coloured Progressive Matrices was administered to 150 subjects (75 males, 75 females) ranging in age from 20 to 86 yr. Subjects were placed into one of three age groups: adult (M age = 27.04 yr.), middle-age (M age = 53.36 yr.), old (M age = 73.78 yr.), with 25 males and 25 females in each age group. Significant differences between age groups on the matrices were obtained after partialing out the effects of educational level, while sex of subject was not significant.
Factor structure of Raven's Coloured Progressive Matrices
Muniz, Monalisa; Gomes, Cristiano Mauro Assis; Pasian, Sonia Regina
2016-01-01
Abstract This study's objective was to verify the factor structure of Raven's Coloured Progressive Matrices (CPM). The database used included the responses of 1,279 children, 50.2% of which were males with an average age of 8.48 years old and a standard deviation of 1.49 yrs. Confirmatory factor analyses were run to test seven models based on CPM theory and on a Brazilian study addressing the test's structure. The results did not confirm the CPM theoretical proposition concerning the scales b...
Variation in Raven's Progressive Matrices Scores across Time and Place
Brouwers, Symen A.; Van de Vijver, Fons J. R.; Van Hemert, Dianne A.
2009-01-01
The paper describes a cross-cultural and historical meta-analysis of Raven's Progressive Matrices. Data were analyzed of 798 samples from 45 countries (N = 244,316), which were published between 1944 and 2003. Country-level indicators of educational permeation (which involves a broad set of interrelated educational input and output factors that…
A Kenya Standardization of the Raven's Coloured Progressive Matrices.
Costenbader, Virginia; Ngari, Stephen Mbugua
2001-01-01
Establishes a Kenyan standardization of the Raven's Coloured Progressive Matrices (RCPM), a nonverbal instrument widely used to assess academic aptitude in young children. Data was gathered from a sample of 1,370 children between the ages of 6 and 10 years. Using the current data, the RCPM appears to be a reliable and valid instrument for use in…
Rock, Daniel L.; Nolen, Patricia A.
1982-01-01
Children aged 7 to 14 years were administered a computerized version of the Raven's Coloured Progressive Matrices test. Computer and traditional version performance was found to be similar in terms of total mean score, correlation with the WISC-R, Raven's subscale intercorrelations, and Raven's total mean score composition. (Author/RD)
Comparative study of factor structure of Raven's Coloured Progressive Matrices.
Schmidtke, A; Schaller, S
1980-12-01
The Raven Coloured Progressive Matrices were administered on group or individual bases to children ranging in age from 4 yr. 9 mo. to 11 yr. 0 mo. (N = 728). Factor analysis yielded three factors: 1. Perceptual closure involving complex figures and patterns with heterogeneous inner structures, 2. Concrete and abstract reasoning, 3. Completion of homogeneous patterns and recognition of given elements. Factor matrix comparisons across age groups resulted in a mean similarity coefficient of .75. Comparisons of data with earlier analyses also resulted in high similarity. This supports the hypothesis of a three-factor structure rather than a four-factor solution or a simple dual classification into items which can be solved by perceptual processes and those which require conceptual solutions.
Researchers' Bibliography for Raven's Progressive Matrices and Mill Hill Vocabulary Scales.
Court, J. H., Comp.
This annotated bibliography enables researchers who are using Raven's Progressive Matrices or the Mill Hill Vocabulary Scales to become familiar with other work that used these tests. The bibliography derives from Raven's own collection of sources, updated to the end of 1971. The major division of material is by tests rather than subject areas;…
Raven's progressive matrices performance in adults with traumatic brain injury.
Hiscock, Merrill; Inch, Roxanne; Gleason, Angela
2002-01-01
Raven's Progressive Matrices (RPM), a widely used test of reasoning, is sensitive to aging, but it has not proven to be helpful in the assessment of acquired focal or lateralized brain damage. Clinical experience suggests that the test is insensitive to traumatic brain injury (TBI), but the data are difficult to interpret because of rapid inflation of norms over time (the Flynn effect). In examining data from 64 adult patients with TBI who were administered the Standard RPM between 1981 and 1989, we used previous and subsequent norms conjointly to adjust for the Flynn effect. Anterograde and retrograde adjustment of norms led to highly convergent results. After adjustment for the Flynn effect, RPM performance was comparable to Wechsler IQ, significantly below estimated premorbid IQ, and nearly 2 SD above performance on 2 TBI-sensitive neuropsychological tests. We conclude that RPM performance is neither more nor less sensitive than Wechsler IQ to the consequences of TBI in the adult, but erroneous conclusions are likely to be reached if the Flynn effect is not taken into account.
Fermino Fernandes Sisto; Fabián Javier Marín Rueda; Daniel Bartholomeu
2006-01-01
This study assessed the adjustment of the Rasch model concerning unidimensionality of Raven's Colored Standard Progressive Matrices. Four hundred and forty-one (441) elementary school children, of both genders, attending first to fourth grade were investigated. Considering that residuals may be enough to violate the intrinsic unidimensionality of the items, residual principal component analysis was used to assess the possibility of this violation. Items with higher factorial loading relating ...
Normative data for Raven's Coloured Progressive Matrices scale in Yemen.
Khaleefa, Omar; Lynn, Richard
2008-08-01
Results are reported for a standardization sample of 986 6- to 1-yr.-olds for the Coloured Progressive Matrices in Yemen. Younger children performed better than older children relative to British norms, and there was no significant sex difference in means or variability. In relation to a British IQ of 100 (SD=15), the sample obtained an average IQ of approximately 81.
Raven's Coloured Progressive Matrices as a Measure of Cognitive Functioning in Cerebral Palsy
Pueyo, R.; Junque, C.; Vendrell, P.; Narberhaus, A.; Segarra, D.
2008-01-01
Background: Cognitive dysfunction is frequent in Cerebral Palsy (CP). CP motor impairment and associated speech deficits often hinder cognitive assessment, with the result being that not all CP studies consider cognitive dysfunction. Raven's Coloured Progressive Matrices is a simple, rapid test which can be used in persons with severe motor…
Element Salience as a Predictor of Item Difficulty for Raven's Progressive Matrices
Meo, Maria; Roberts, Maxwell J.; Marucci, Francesco S.
2007-01-01
Raven's Progressive Matrices is a frequently used intelligence test, and it has been suggested that the major determinant of difficulty for each item is its numbers of elements and rules, and its rule complexity. The current study investigated another potential source of difficulty--element salience--items are harder where their elements are…
Item and Error Analysis on Raven's Coloured Progressive Matrices in Williams Syndrome
Van Herwegen, Jo; Farran, Emily; Annaz, Dagmara
2011-01-01
Raven's Coloured Progressive Matrices (RCPM) is a standardised test that is commonly used to obtain a non-verbal reasoning score for children. As the RCPM involves the matching of a target to a pattern it is also considered to be a visuo-spatial perception task. RCPM is therefore frequently used in studies in Williams Syndrome (WS), in order to…
Carlson, Jerry S.
1973-01-01
The results of this study support the notion that different parts of Raven's Coloured Progressive Matrices Test tap different processes. Sets A and Ab employ the rationale of the Inhelder-Piaget Test and rely on solution by graphic processes, whereas set B involves solution by opeational means. Total score results may be less appropriate than the…
Garrity, Linda I.; Donoghue, James T.
1976-01-01
The Peabody Picture Vocabulary Test and the Raven's Coloured Progressive Matrices were given to two samples of preschool children to investigate differences between problem children and nonproblem children as well as sex differences. Some comparisons were significant. Tables are presented and results are discussed. (JKS)
The WISC-III and Raven Coloured Progressive Matrices Test: A Pilot Study of Relationships.
Kluever, Raymond C.; And Others
The relationship between scores on Raven's Coloured Progressive Matrices (CPM) scores and subtest scores and IQs from the Wechsler Intelligence Scale for Children-III (WISC-III) was studied for 28 children aged 6 to 11 years. Subjects had been referred to a university assessment center because they were believed to have exceptional learning…
Raven's coloured progressive matrices: normative values on 305 adult normal controls.
Basso, A; Capitani, E; Laiacona, M
1987-01-01
The use of Raven's Coloured Progressive Matrices (PM 47) in experiments with brain-damaged patients is briefly reviewed. Because norms for adults are still not available, normative data were calculated on 305 normals; corrections for age and education and centile allocation of the scores are furnished.
Raven's Coloured Progressive Matrices as a Measure of Cognitive Functioning in Cerebral Palsy
Pueyo, R.; Junque, C.; Vendrell, P.; Narberhaus, A.; Segarra, D.
2008-01-01
Background: Cognitive dysfunction is frequent in Cerebral Palsy (CP). CP motor impairment and associated speech deficits often hinder cognitive assessment, with the result being that not all CP studies consider cognitive dysfunction. Raven's Coloured Progressive Matrices is a simple, rapid test which can be used in persons with severe motor…
Wiley, Jennifer; Jarosz, Andrew F.; Cushen, Patrick J.; Colflesh, Gregory J. H.
2011-01-01
The correlation between individual differences in working memory capacity and performance on the Raven's Advanced Progressive Matrices (RAPM) is well documented yet poorly understood. The present work proposes a new explanation: that the need to use a new combination of rules on RAPM problems drives the relation between performance and working…
Solving and creating Raven Progressive Matrices: reasoning in well- and ill-defined problem spaces
Jaarsveld, S.; Lachmann, T.; Hamel, R.; van Leeuwen, C.
2010-01-01
We studied the development of creative cognition in children ranging from nursery school to Grade 6 (4-12 yr old, N¼511), performing a problem generation task. The task involved inventing a novel item for a classical problem solving task they had completed beforehand: the Raven Progressive Matrices
Training effects on Raven's progressive matrices in young, middle-aged, and elderly adults.
Denney, N W; Heidrich, S M
1990-03-01
Previous training studies of fluid intellectual abilities have involved training on either figural relations or induction tasks. In the present study, young, middle-aged, and elderly adults were given training on another measure of fluid ability--Raven's Progressive Matrices. The training involved a strategy-modeling technique that lasted no more than a few minutes. The results indicated that (a) performance on the Raven decreased with increasing age, (b) training significantly improved performance, and (c) the effect of training did not differ as a function of the age or sex of the subjects. Thus, the results indicate that performance on the Raven can be significantly improved in a single, brief training session.
Criterion-related validity of Raven's Progressive Matrices with deaf residential school students.
Blennerhassett, L; Strohmeier, S J; Hibbett, C
1994-03-01
Criterion-related validity of Raven's Progressive Matrices (RPM) was investigated using a sample of 107 deaf residential adolescents. Data collection involved retrieval of psychoeducational test scores (RPM; WISC-R Performance IQ; VMI-R; Bender-Gestalt; and SAT-HI Reading Comprehension, Spelling, and Language) from student files. Concurrent validity between the Standard Progressive Matrices (SPM) and WISC-R PIQ was established, with significant (p .001) correlations of .598 (using WISC-R deaf norms) and .616 (using WISC-R hearing norms). Predictive validity was supported by significant correlations between the SPM and SAT-HI Reading Comprehension, Spelling, and Language scores.
The Raven's progressive matrices: change and stability over culture and time.
Raven, J
2000-08-01
Data relating to the stability and variation in the norms for the Raven's Progressive Matrices Test (a well-validated measure of basic cognitive functioning) for different cultural, ethnic, and socioeconomic groups on a worldwide and within-country basis are first summarized. Subsequent sections deal with variation over time. A possible explanation for the variation in norms over time and between ethnic groups within countries is offered.
Psychometric Study of the Raven Progressive Matrices Tests in elementary students from Lima
Delgado Vásquez, Ana; Facultad de Psicología, Universidad Nacional Mayor de San Marcos, Lima, Perú; Escurra Mayaute, Luis M.; Facultad de Psicología, Universidad Nacional Mayor de San Marcos, Lima, Perú; Bulnes Bedón, Mario; Facultad de Psicología, Universidad Nacional Mayor de San Marcos, Lima, Perú; Quesada Murillo, María Rosario; Facultad de Psicología, Universidad Nacional Mayor de San Marcos, Lima, Perú
2014-01-01
It was made a psychometric study of Raven Coloured Progressive Matrices Test, which is a non verbal instrument that evaluates abilities related to make comparisons, thinking for analogy and spatial perceptions organization. It was designed mainly as a measure of factor "g" of Spearman or general intelligence, composed by two abilities, named educational and reproductive. The participants were 2496 students obtained at random considering all school districts (USE) of the city of Lima, Peru. Th...
Fermino Fernandes Sisto
2006-01-01
Full Text Available This study assessed the adjustment of the Rasch model concerning unidimensionality of Raven's Colored Standard Progressive Matrices. Four hundred and forty-one (441 elementary school children, of both genders, attending first to fourth grade were investigated. Considering that residuals may be enough to violate the intrinsic unidimensionality of the items, residual principal component analysis was used to assess the possibility of this violation. Items with higher factorial loading relating to the positive and negative dimensions on the first factor were selected, in respect to the test as a whole and to each subset in particular. These items were re-analyzed with the Rasch model within each data group. Then the positive and negative factor measures were correlated. Results suggested the possibility of other dimensions besides those extracted by Rasch model based on the test and subset B, though the correlation coefficients of the other subsets were close to rejection.
Raven's Progressive Matrices in the Lexicon of Dynamic Mapping of the Brain (MRI).
Mazhirina, K G; Mel'nikov, M E; Pokrovskii, M A; Petrovskii, E D; Savelov, A A; Shtark, M B
2016-04-01
Using functional magnetic resonance imaging, we studied intracerebral dynamics during completion of Raven's Progressive Matrices test. Solving the test organized in sets of progressively increasing difficulty cause changes in cerebellar activation functionally related to cognitive activities and operations. As the tasks became more complicated, we observed gradual suppression of the activity of default mode network (DMN). The most pronounced changes in cerebral activation patterns occurred the second set of the test and involved associative somatosensory area and Wernicke's area that is known to play an important role in cognitive processes associated with synthesis and analysis of information.
Raven's progressive matrices test: scale construction and verification of "Flynn effect"
Lopetegui, María Susana; Neer, Rosa Haydée; Rossi Casé, Lilia Elba
2002-01-01
In this paper, the scales of Raven's Progressive Matrices Test, General Scale and Advanced Scale, Series II, for the student population (third cycle of EGB and Polimodal ) in the city of La Plata are presented. Considerations are made as regards both the increase in scores (Flynn effect) observed in relation to the previous scale (1964) and the different mean scores according to two age groups (13-16 and 17-18 years of age) and education mode. The findings enabled inferences related to the si...
Norms for an abbreviated Raven's Coloured Progressive Matrices in an older sample.
Smits, C H; Smit, J H; van den Heuvel, N; Jonker, C
1997-11-01
Percentile age norms for ages 55 to 85 using overlapping intervals at specified age midpoints are presented for the sum scores of sections A and B of Raven's Coloured Progressive Matrices (RCPM). The representative age and gender stratified sample (N = 2,815) used is derived from the Longitudinal Aging Study Amsterdam (the Netherlands). As RCPM scores appear to be strongly associated with education, percentile norms for three educational levels are presented: low (0-9 years), middle (10-15 years) and high (16 years and more).
Paul, Steven M.
1986-01-01
Normative data for the Advanced Raven's Progressive Matrices are presented based on 300 University of California, Berkeley, students. Correlations with the Wechsler Adult Intelligence Scale and the Terman Concept Mastery Test are explored. The relationship between the Advanced Raven's Progressive Matrices and Spearman's g is explored. (Author)
Roberds, Jeannette
The scores of 79 second-grade pupils on the Ravens Colored Progressive Matrices and the Bender Gestalt were factor-analyzed using six different factor-analytic procedures. Sex, age, and vocabulary test scores were included in the analysis as marker variables. The original factor solutions were subjected to oblique transformation and the…
Valencia, Richard R.
1979-01-01
Compares the nonverbal intellectual performance as measured by the Raven's Coloured Progressive Matrices of Chicano and Anglo third-grade boys. When language status and cultural content of the testing instrument are controlled, mean group differences become negligible. This is a sound intelligence measure for use with Chicano children. (Author)
A normative study of a shorter version of Raven's progressive matrices 1938.
Caffarra, P; Vezzadini, G; Zonato, F; Copelli, S; Venneri, A
2003-12-01
A shorter four-set (A, B, C, D) version of Raven's progressive matrices 1938 (PM38) has gained increasing use in neuropsychological assessment. No normative data spanning across a wide age range are, however, available. This study collected norms for the shorter version of PM38, established an inferential cut-off value and derived equivalent scores in a sample of 248 individuals from 20 to 89 years of age, evenly distributed across sex, age and education levels. Results showed significant effects of age and education but no effect of sex on performance. These normative data will complement existing norms for other tests, will increase the wealth of neuropsychological tools for which normative data are available for the Italian population, and may be useful in the early detection of individuals at risk of developing dementia.
Rushton, J. Philippe; Bons, Trudy Ann; Vernon, Philip A; Čvorović, Jelena
2007-01-01
We carried out two studies to test the hypothesis that genetic and environmental influences explain population group differences in general mental ability just as they do individual differences within a group. We estimated the heritability and environmentality of scores on the diagrammatic puzzles of the Raven's Coloured and/or Standard Progressive Matrices (CPM/SPM) from two independent twin samples and correlated these estimates with group differences on the same items. In Study 1, 199 pair...
Somatotype and intellectual ability (Raven progressive matrices test in Chilean school-age children
Liliana U. Tapia
2013-10-01
Full Text Available Objectives: The aim of this study was to determine the relationship between somatotype and intellectual ability (IA in 11-12 and 15-16 year-old students (n = 1,015 in the Chile's Metropolitan Region from a representative sample of 33 educational establishments chosen at random. Methods: The Heath-Carter somatotype and the IA assessed through the Raven Progressive Matrices Test were measured. Results: The endomorph was observed in 59% of the students; 28% had a mesomorph and 13% ectomorph. The IA was distributed in: 11.2% Grade I, 26.8% Grade II, 41% Grade III, 17.6% Grade IV and 3.2% Grade V. A positive and significant correlation of IA with the endo-morphic component (r = 0.074, p = 0.02 was found in the total sample and only in females (r = 0.109, p = 0.02; at the same time, a positive and significant correlation with the ectomorph component was also observed (r = 0.067, p < 0.05. Conclusions: This suggests that other variables would influence more strongly the IA for which further research is needed to quantitate this multifactorial problem.
An Item Analysis of Raven's Colored Progressive Matrices among Participants with Down Syndrome
Facon, Bruno; Nuchadee, Marie-Laure
2010-01-01
Standardized tests are widely used in intellectual disability research, either as dependent or control variables. Yet, it is not certain that their items give rise to the same performance in various groups under study. In the present work, 48 participants with Down syndrome were matched on their raw score on Raven's Colored Progressive Matrices…
Tapia, Liliana U; Lizana, Pablo A; Orellana, Yasna Z; Villagrán, Francisca S; Arias, Vanessa F; Almagià, Atilio F; Burrows, Raquel A; Ivanovic, Daniza M
2013-01-01
Objetivos: El objetivo de este estudio fue determinar la relación entre el somatotipo y la habilidad intelectual (HA) en estudiantes de 11-12 y 15-16 años de edad de la Región Metropolitana, Chile. Métodos: Se registró una muestra representativa de 1.015 escolares de acuerdo a los resultados del sistema de medición de la calidad de la educación (SIMCE) 2009. Se evaluó el somatotipo de Heath-Carter y la HA de acuerdo al Test de Matrices Progresivas de Raven. Resultados: Un 59% presentó un somatotipo endomórfico, 28% mesomórfico y 13% ectomorfo. La HA se distribuyó en: 11,2% Grado I, 26,8% Grado II, 41% Grado III, 17,6% Grado IV y 3,2% Grado V. Se presenta una correlación significativa positiva con el componente endomórfico (r = 0,074 p = 0,02), y sólo en mujeres (r = 0,109 p = 0,02), a la vez se observa una relación significativa positiva con el componente ectomorfo (r = 0,067 p < 0,05). Conclusiones: Esto sugiere que otras variables estarían influyendo más fuertemente en la HA, además de apoyar la no discriminación por biotipo en los establecimientos educacionales.
Desert, Michel; Preaux, Marie; Jund, Robin
2009-01-01
The aim of this study was to verify whether children from low socio-economic status (SES) are victims of stereotype threat. Children in first grade (6 to 7 years old) and third grade (8 to 9 years old) performed Raven's progressive matrices, an intellectual ability test commonly used by psychologists. The test was presented either with the…
Denise Ruschel Bandeira
2004-12-01
Full Text Available O Teste das Matrizes Progressivas Coloridas de Raven destina-se à avaliação do desenvolvimento intelectual de crianças de 5 a 11 anos de idade. O presente trabalho teve como objetivo estabelecer normas para as crianças de Porto Alegre - RS. A amostra foi composta por 779 crianças matriculadas em escolas estaduais, de 4 anos e 9 meses a 11 anos e 9 meses. Foi constatado aumento progressivo nas médias de pontos com o aumento da idade e não foram encontradas diferenças entre meninos e meninas. Na comparação com as crianças de escolas públicas de São Paulo, as médias das crianças de Porto Alegre foram mais altas, mas em geral foram inferiores às das escolas particulares de São Paulo. Foram estabelecidas as normas em percentis para cada faixa etária. Os resultados reforçam a necessidade do estabelecimento de normas distintas para as diferentes regiões do Brasil, principalmente em relação aos testes de inteligência.The Raven's Coloured Progressive Matrices was proposed standards to Porto Alegre (RS children. The sample was composed by 779 children from Porto Alegre state public schools, aged from 4 years and 9 months to 11 years and 9 months. It was found a progressive increase in average scores as age increased and it was not verified differences between boys and girls. Comparing average scores between children from São Paulo and Porto Alegre public schools we found that the average scores from Porto Alegre children was higher, but they were lower than the scores from São Paulo private schools children. Percentile ranks were obtained to each age level with range of six months. Research results show the need to establish specific norms to different Brazilian regions, mainly concerning intelligence tests.
Diesfeldt, H F; Vink, M T
1989-12-06
Sixty-five non-demented elderly adults, born between 1895 and 1918 (mean age +/- sd: 80.0 +/- 5.4) were tested with Raven's Coloured Progressive Matrices (CPM). Subjects were recruited from homes for the aged and were rated by the staff as free from any symptoms of dementia or other psychiatric disease. Mean number of years of education was 8.2 (range 5 to 18). CPM scores ranged from 9 to 35 with mean +/- sd of 25.9 +/- 5.9. Subjects who had received more formal education performed better on the CPM (Pearson's r: 0.49). When education was controlled for in the analysis, the correlation between age and performance was attenuated and did not reach statistical significance (Pearson's r: -0.24). Test results appeared to be specific for generations, regardless of age. Mean performance in this sample was significantly higher than less recently published norms suggest. Analysis of item content revealed that the CPM consists of three main types of problems: two of a predominantly visuospatial type (12 items of simple continuous pattern-completion and 15 concrete items showing progressive changes in one or two directions) and 9 items of an abstract reasoning type. The concrete visuospatial items appear very useful in the assessment of visuoperceptive dysfunction, as for example in visual apperceptive agnosia. The abstract matrices were very difficult for most of our elderly subjects, so that these items cannot be used to detect deviations from normal old age.
Savage-McGlynn, Emily
2011-01-01
Approved hardbound copy has subtitle "a psychometric investigation of group differences in mean and variability as measured by the Raven's Standard Progressive Matrices Plus" Researchers and the general public alike continue to debate ‘which is the smarter sex?’ Research to date suggests that males outperform females, females outperform males, while others find no differences in mean or variance. These inconsistent results are thought to occur for two reasons. First, studies rely on opport...
Soukup, V M; Harrell, E H; Clark, T
1994-07-01
Despite the substantial experimental literature that has accrued on factors associated with a reduction in neglect, few empirical studies have attempted to extrapolate these findings to clinical assessment and evaluate the efficacy of neglect-reducing strategies on patient performance. The current study developed a modified version of the Raven's Coloured Progressive Matrices (RCPM) by aligning the response alternatives in a column, in the right hemispace. Three groups of patients (right brain-damaged (RBD) with neglect, RBD without neglect, and orthopaedic controls) were administered abbreviated versions of the revised format, and performance was compared to the standard presentation format. The efficacy of left cues with the revised format was also investigated. Presence of neglect was assessed via the Schenkenberg Line Bisection Task and the Bells Test. Results showed a significant performance decrement among RBD neglect patients under all conditions. However, contrary to predictions, RBD neglect patients did not reveal significantly better performance on the revised version as compared to the standard presentation format. No significant effects associated with left side cueing were observed. The finding that no significant performance changes emerged as a function of stimulus modification and verbal prompts suggests that, although these manipulations may be employed by clinicians to maximize patient performance, empirical support for the efficacy of these procedures is lacking.
Raven's Matrices Performance in Down Syndrome: Evidence of Unusual Errors
Gunn, Deborah M.; Jarrold, Christopher
2004-01-01
The aim of this study was to investigate the types of errors produced by three participant groups (individuals with Down syndrome, with moderate learning disability, and typically developing children) whilst completing the Raven's Coloured Progressive Matrices task. An analysis of error categories revealed that individuals with Down syndrome…
Vakil, Eli; Lifshitz-Zehavi, Hefziba
2012-01-01
Raven matrices are used for assessing fluid intelligence and the intellectual level of groups with low intelligence. Our study addresses qualitative analysis of information processing in Raven matrices performance among individuals with intellectual disability with that of their typically developed (TD) counterparts. Twenty-three adults with…
Vakil, Eli; Lifshitz-Zehavi, Hefziba
2012-01-01
Raven matrices are used for assessing fluid intelligence and the intellectual level of groups with low intelligence. Our study addresses qualitative analysis of information processing in Raven matrices performance among individuals with intellectual disability with that of their typically developed (TD) counterparts. Twenty-three adults with…
Rushton, J Philippe; Bons, Trudy Ann; Vernon, Philip A; Cvorović, Jelena
2007-07-22
We carried out two studies to test the hypothesis that genetic and environmental influences explain population group differences in general mental ability just as they do individual differences within a group. We estimated the heritability and environmentality of scores on the diagrammatic puzzles of the Raven's Coloured and/or Standard Progressive Matrices (CPM/SPM) from two independent twin samples and correlated these estimates with group differences on the same items. In Study 1, 199 pairs of 5- to 7-year-old monozygotic (MZ) and dizygotic (DZ) twins reared together provided estimates of heritability and environmentality for 36 puzzles from the CPM. These estimates correlated with the differences between the twins and 94 Serbian Roma (both rs=0.32; Ns=36; psadult MZ and DZ twins reared apart provided estimates of heritability and environmentality for 58 puzzles from the SPM. These estimates correlated with the differences among 11 diverse samples including (i) the reared-apart twins, (ii) another sample of Serbian Roma, and (iii) East Asian, White, South Asian, Coloured and Black high school and university students in South Africa. In 55 comparisons, group differences were more pronounced on the more heritable and on the more environmental items (mean rs=0.40 and 0.47, respectively; Ns=58; ps<0.05). After controlling for measurement reliability and variance in item pass rates, the heritabilities still correlated with the group differences, although the environmentalities did not. Puzzles found relatively difficult (or easy) by the twins were those found relatively difficult (or easy) by the others (mean r=0.87). These results suggest that population group differences are part of the normal variation expected within a universal human cognition.
Skills Underlying Coloured Progressive Matrices
Kirby, J. R.; Das, J. P.
1978-01-01
Raven's Coloured Progressive Matrices and a battery of ability tests were administered to a sample of 104 male fourth graders for purposes of investigating the relationships between 2 previously identified subscales of the Raven and the ability tests. Results indicated use of a spatial strategy and to a lesser extent, use of reasoning, indicating…
Denise Ruschel Bandeira; Irai Cristina Boccato Alves; Angélica Elisa Giacomel; Luciano Lorenzatto
2004-01-01
O Teste das Matrizes Progressivas Coloridas de Raven destina-se à avaliação do desenvolvimento intelectual de crianças de 5 a 11 anos de idade. O presente trabalho teve como objetivo estabelecer normas para as crianças de Porto Alegre - RS. A amostra foi composta por 779 crianças matriculadas em escolas estaduais, de 4 anos e 9 meses a 11 anos e 9 meses. Foi constatado aumento progressivo nas médias de pontos com o aumento da idade e não foram encontradas diferenças entre meninos e meninas. N...
Skuy, Mervyn; Gewer, Anthony; Osrin, Yael; Khunou, David; Fridjhon, Peter; Rushton, J. Philippe
2002-01-01
Studied whether mediated learning experience would improve the scores of African students on Raven's Standard Progressive Matrices. Seventy African and 28 non-African college students in South Africa were given the Raven's Progressive Matrices on 2 occasions, and some subjects were exposed to the mediated learning experience. Both groups improved…
Ivison, David
1990-01-01
Raven's Progressive Matrices and the Simpson Adult Vocabulary Scale were administered to 400 Australian hospitalized adults without psychiatric or neurological impairment in 4 age groups from 30 to 69 years. Compared to pre-1964 data, the subjects did not show gains in intelligence quotient as did younger age groups. (SLD)
Fugard, Andrew J. B.; Stewart, Mary E.; Stenning, Keith
2011-01-01
People with autism spectrum condition (ASC) perform well on Raven's matrices, a test which loads highly on the general factor in intelligence. However, the mechanisms supporting enhanced performance on the test are poorly understood. Evidence is accumulating that milder variants of the ASC phenotype are present in typically developing individuals,…
Fugard, Andrew J. B.; Stewart, Mary E.; Stenning, Keith
2011-01-01
People with autism spectrum condition (ASC) perform well on Raven's matrices, a test which loads highly on the general factor in intelligence. However, the mechanisms supporting enhanced performance on the test are poorly understood. Evidence is accumulating that milder variants of the ASC phenotype are present in typically developing individuals,…
A Comparison between Element Salience versus Context as Item Difficulty Factors in Raven's Matrices
Perez-Salas, Claudia P.; Streiner, David L.; Roberts, Maxwell J.
2012-01-01
The nature of contextual facilitation effects for items derived from Raven's Progressive Matrices was investigated in two experiments. For these, the original matrices were modified, creating either abstract versions with high element salience, or versions which comprised realistic entities set in familiar contexts. In order to replicate and…
A Comparison between Element Salience versus Context as Item Difficulty Factors in Raven's Matrices
Perez-Salas, Claudia P.; Streiner, David L.; Roberts, Maxwell J.
2012-01-01
The nature of contextual facilitation effects for items derived from Raven's Progressive Matrices was investigated in two experiments. For these, the original matrices were modified, creating either abstract versions with high element salience, or versions which comprised realistic entities set in familiar contexts. In order to replicate and…
Zhu, Bi; Chen, Chuansheng; Xue, Gui; Moyzis, Robert K; Dong, Qi; Chen, Chunhui; Li, Jin; He, Qinghua; Lei, Xuemei; Wang, Yunxin; Lin, Chongde
2014-03-01
The Allen Brain Atlas shows that the semaphorin 5A (SEMA5A) gene, which encodes an important protein for neurogenesis and neuronal apoptosis, is predominantly expressed in the human hippocampus. Structural and functional neuroimaging studies have further shown that the hippocampus plays an important role in the performance on Raven's Progressive Matrices (RPM), a measure of reasoning ability and general fluid intelligence. Thus far, however, no study has examined the relationships between the SEMA5A gene polymorphism, hippocampal volume, and RPM performance. The current study collected both structural MRI, genetic, and behavioral data in 329 healthy Chinese adults, and examined associations between SEMA5A variants, hippocampal volume, and performance on RAPM (the advanced form of RPM). After controlling for intracranial volume (ICV), sex, and age, SEMA5A genetic polymorphism at the SNP rs42352 had the strongest association with hippocampal volume (p=0.00000552 and 0.000103 for right and left hippocampal volumes, respectively), with TT homozygotes having higher hippocampal volume than the other genotypes. Furthermore, there was a high correlation between right hippocampal volume and RAPM performance (r=0.42, p=0.0000509) for SEMA5A rs42352 TT homozygotes. This study provides the first evidence for the involvement of the SEMA5A gene in hippocampal structure and their interaction on RAPM performance. Future studies of the hippocampus-RPM associations should consider genetic factors as potential moderators.
Prabhakaran, V; Smith, J A; Desmond, J E; Glover, G H; Gabrieli, J D
1997-06-01
We examined brain activation, as measured by functional magnetic resonance imaging, during problem solving in seven young, healthy participants. Participants solved problems selected from the Raven's Progressive Matrices Test, a test known to predict performance on a wide range of reasoning tasks. In three conditions, participants solved problems requiring (1) analytic reasoning; (2) figural or visuospatial reasoning; or (3) simple pattern matching that served as a perceptual-motor control. Right frontal and bilateral parietal regions were activated more by figural than control problems. Bilateral frontal and left parietal, occipital, and temporal regions were activated more by analytic than figural problems. All of these regions were activated more by analytic than match problems. Many of these activations occurred in regions associated with working memory. Figural reasoning activated areas involved in spatial and object working memory. Analytic reasoning activated additional areas involved in verbal working memory and domain-independent associative and executive processes. These results suggest that fluid reasoning is mediated by a composite of working memory systems.
Tanaka, F; Kachi, T; Yamada, T; Sobue, G
1998-01-01
We investigated possible correlations among neurophysiological examinations [auditory and visual event-related potentials (A-ERPs, V-ERPs), and flash visual evoked potentials (F-VEPs)] and neuropsychological tests [Mini-Mental State Examination (MMSE) and Raven's Coloured Progressive Matrices (RCPM)] in 15 subjects with probable or possible Alzheimer's disease (AD) according to the National Institute of Neurological and Communicative Disorders and Stroke and the Alzheimer's Disease and Related Disorders Association (NINCDS-ADRDA) criteria. The P300 latency of A-ERPs was correlated with the scores of MMSE but not with those of RCPM. The P300 latency of V-ERPs was more significantly correlated with the scores of RCPM than with those of MMSE. The P2 latency of F-VEPs was more significantly correlated with the scores of RCPM than with those of MMSE. The P2 latency of F-VEPs was not correlated with the P300 latency of A-ERPs but was correlated with the P300 latency of V-ERPs. The close relationship among V-ERPs, F-VEPs and RCPM suggests that these examinations at least partly reflect the functions of visual association areas in AD. Furthermore, discrepancy between P300 latency by A-ERPs and V-ERPs suggests that the mechanism responsible for P300 generation is not identical between these two stimulus modalities.
Lilienthal, Lindsey; Tamez, Elaine; Myerson, Joel; Hale, Sandra
2013-01-01
Previous studies have shown that performance on Williams and Pearlberg's (2006) complex associative learning task is a good predictor of fluid intelligence. This task is similar in structure to that used in studying the fan effect (Anderson, 1974), as both tasks involve forming multiple associations and require retrieval in the face of interference. The purpose of the present study was to investigate the relations among complex associative learning, working memory, and fluid intelligence. Specifically, we asked whether retrieval efficiency, as measured by the fan effect, could account for the relation between complex associative learning and performance on Raven's Advanced Progressive Matrices. Consistent with previous findings, complex associative learning predicted Raven's performance, but the fan effect did not account for this relation. Notably, the learning phase of the fan effect task was significantly correlated with both complex associative learning and Raven's performance, providing further support for the importance of learning as a predictor of fluid intelligence.
Denise R. Bandeira
2012-01-01
Full Text Available Diferentes estudios han mostrado un aumento en las puntuaciones de los tests de inteligencia a lo largo de las últimas décadas - el "efecto Flynn". Sin embargo, el hecho de que este efecto no se haya observado consistentemente cuando las fuentes de habilidad cognitiva son utilizadas, hace que éste sea uno de los principales temas de discusión. Por tanto, la presente investigación tuvo como objetivo arrojar algo de luz sobre esta cuestión. Dos estudios que utilizaron diferentes medidas de habilidad cognitiva fueron diseñados con el fin de controlar los efectos de medición potencial. En el estudio participaron niños brasileños con edades comprendidas entre 6-12 años. El primer estudio tenía la prueba Dibujo de la figura humana como medida de la inteligencia; 294 niños fueron evaluados durante la década de 1980, mientras que 203 fueron evaluadosdurante la década del 2000. El segundo estudio utilizo las matrices de colores progresivas de Raven. Un total de 562 niños fueron evaluados durante la década de 1990, y 243 en la década del 2000. Los resultados no mostraronefectos significativos de generación, independientemente de la medida utilizada. Los aspectos educativos y sociales son considerados para explicar estos resultados.
Software infrastructure progress in the RAVEN code
Cogliati, Joshua J. [Idaho National Lab. (INL), Idaho Falls, ID (United States); Rabiti, Cristian [Idaho National Lab. (INL), Idaho Falls, ID (United States); Permann, Cody J. [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2015-03-01
The milestones have been achieved. RAVEN has been migrated to Gitlab which adds new abilities for code review and management. Standalone RAVEN framework packages have been created for OSX and two Linux distributions.
Crookes, T. G.; And Others
1981-01-01
Anthony's theory of the development of extraversion in children requires that there should be a negative correlation between extraversion and intelligence after age 13 or 14. To test this Raven's Progressive Matrices and the Junior Eysenck Personality Inventory were administered to 801 adolescents. Findings did not support Anthony's theory.…
2002-01-01
En una muestra de 30 sujetos (12 varones y 18 mujeres) se registraron los potenciales evocados endógenos (PEE) (cognitivos) auditivos y se aplicó el Test de Matrices Progresivas de Raven (TMPR), escala general. Se encontró una correlación entre TMPR y la latencia de P3, la amplitud de P3 y la latencia de N2. Además, se halló una correlación entre el tiempo (T) empleado en la ejecución del TMPR y la latencia de P3 y la amplitud de P3. También se encontró una correlación entre P/...
Miguel de Bortoli
2002-01-01
Full Text Available En una muestra de 30 sujetos (12 varones y 18 mujeres se registraron los potenciales evocados endógenos (PEE (cognitivos auditivos y se aplicó el Test de Matrices Progresivas de Raven (TMPR, escala general. Se encontró una correlación entre TMPR y la latencia de P3, la amplitud de P3 y la latencia de N2. Además, se halló una correlación entre el tiempo (T empleado en la ejecución del TMPR y la latencia de P3 y la amplitud de P3. También se encontró una correlación entre P/T y la latencia de P3, la latencia de P2 y la amplitud de P2. No existe correlación entre P y P/T. Los resultados sugieren una fuerte relación entre los PEE y el TMPR. El cociente P/T indicaría eficiencia (igual puntuación en menos tiempo, mayor eficiencia que es un parámetro que complementaría el diagnóstico del TMPR.
Wenjing Yang
Full Text Available Raven's Matrices test (RMT is a non-verbal test designed to assess individuals' ability to reason and solve new problems without relying extensively on declarative knowledge derived from schooling or previous experience. Despite a large number of behavioral studies that demonstrated gender differences in Raven's Matrices reasoning ability, no neural evidence supported this difference. In this study, voxel-based morphometry (VBM was used in an attempt to uncover the gender-specific neural basis of Raven's Matrices reasoning ability as measured by the combined Raven's Matrices test (CRT in 370 healthy young adults. The behavioral results showed no difference between males and females. However, the VBM results showed that the relationship between reasoning ability and regional gray matter volume (rGMV differed between sexes. The association between CRT scores and rGMV in the dorsolateral prefrontal cortex (associated with visuospatial ability was significantly greater in males than in females, whereas the reverse was true for the inferior frontal cortex (relating to verbal reasoning ability and the medial frontal cortex (engaged in information binding where the association was greater in females. These findings suggest that males and females use differently structured brains in different ways to achieve similar levels of overall Raven's Matrices reasoning ability.
Test de matrices progresivas de Raven: construcción de baremos y constatación del "efecto Flynn"
2002-01-01
En este trabajo se presentan los baremos del Test de Matrices Progresivas de Raven, Escala General y Escala Avanzada, Serie II, para la población estudiantil (Tercer ciclo EGB y Polimodal) de la ciudad de La Plata. Se hacen consideraciones sobre el incremento de puntajes (efecto Flynn)que se observa respecto del baremo anterior (1964); sobre las diferencias de las puntuaciones medias según dos grupos etareos (13-16 y 17-18 años) y según modalidad educativa. Los resultados encontrados permiten...
Chiesi, Francesca; Ciancaleoni, Matteo; Galli, Silvia; Morsanyi, Kinga; Primi, Caterina
2012-01-01
Item Response Theory (IRT) models were applied to investigate the psychometric properties of the Arthur and Day's Advanced Progressive Matrices-Short Form (APM-SF; 1994) [Arthur and Day (1994). "Development of a short form for the Raven Advanced Progressive Matrices test." "Educational and Psychological Measurement, 54," 395-403] in order to test…
Wicherts, Jelte M.; Dolan, Conor V.; Carlson, Jerry S.; van der Maas, Han L. J.
2010-01-01
This paper presents a systematic review of published data on the performance of sub-Saharan Africans on Raven's Progressive Matrices. The specific goals were to estimate the average level of performance, to study the Flynn Effect in African samples, and to examine the psychometric meaning of Raven's test scores as measures of general intelligence.…
Lynn, Richard; Chen, Hsin-Yi; Chen, Yung-Hua
2011-07-01
Data for Raven's Progressive Matrices are reported for a sample of 6290 6- to 17-year-olds in Taiwan. The Taiwanese obtained a mean IQ of 109.5, in relation to a British mean of 100. There was no difference in mean scores of boys and girls at age 7 years. At age 10 years girls obtained significantly higher scores than boys, and at ages 13 and 16 years boys obtained significantly higher scores than girls. There was no sex difference in variance at age 7 years. At ages 10, 13 and 16 years variance was significantly greater in boys.
Analysis of the Raven CPM Subtest Scores for a Sample of Gifted Children.
Kluever, Raymond C.; Green, Kathy E.
The inter-subject/intra-subject subtest patterns (profiles) of the same sample of gifted children were examined based on factors found in a previous study of the Raven Coloured Progressive Matrices Test (CPM) that investigated structural properties with specific application to a sample of gifted children. The sample consisted of 166 children (78…
Otermann, Bente; Berg, van den Stephanie M.
2016-01-01
An abundance of research shows significant resemblance in standardized IQ scores in children and their biological parents. Twin and family studies based on such standardized scores suggest that a large proportion of the resemblance is due to genetic transmission, rather than cultural transmission. H
Otermann, Bente; van den Berg, Stéphanie Martine
2016-01-01
An abundance of research shows significant resemblance in standardized IQ scores in children and their biological parents. Twin and family studies based on such standardized scores suggest that a large proportion of the resemblance is due to genetic transmission, rather than cultural transmission.
Rabiti, Cristian [Idaho National Lab. (INL), Idaho Falls, ID (United States); Alfonsi, Andrea [Idaho National Lab. (INL), Idaho Falls, ID (United States); Cogliati, Joshua Joseph [Idaho National Lab. (INL), Idaho Falls, ID (United States); Mandelli, Diego [Idaho National Lab. (INL), Idaho Falls, ID (United States); Kinoshita, Robert Arthur [Idaho National Lab. (INL), Idaho Falls, ID (United States); Wang, Congjian [Idaho National Lab. (INL), Idaho Falls, ID (United States); Maljovec, Daniel Patrick [Idaho National Lab. (INL), Idaho Falls, ID (United States); Talbot, Paul William [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2016-02-01
This documents the release of the Risk Analysis Virtual Environment (RAVEN) code. A description of the RAVEN code is provided, and discussion of the release process for the M2LW-16IN0704045 milestone. The RAVEN code is a generic software framework to perform parametric and probabilistic analysis based on the response of complex system codes. RAVEN is capable of investigating the system response as well as the input space using Monte Carlo, Grid, or Latin Hyper Cube sampling schemes, but its strength is focused toward system feature discovery, such as limit surfaces, separating regions of the input space leading to system failure, using dynamic supervised learning techniques. RAVEN has now increased in maturity enough for the Beta 1.0 release.
Gender Difference on the Raven Progressive Matrices%瑞文推理测验上的性别差异
李春花; 罗献明; 王腾飞; 徐芬
2011-01-01
瑞文推理测验上是否存在性别差异？与较早期的研究结果不同,较近的一系列研究发现在瑞文推理测验上存在性别差异,且性别差异具有发展性.当前可以解释该性别差异的观点主要有两种,其一是污染观,即认为瑞文推理测验中发现的性别差异实质上是由于测验中其他成分的“污染”所致,而在它所主要代表的g因素的发展中并不存在性别差异；其二,较新的研究提示,“污染”可能存在,但在g因素上仍然具有性别差异,这种差异是由生理上的原因造成的.研究者由此提出了智力性别差异的发展理论.本文主要从儿童青少年发展的角度回顾了有关瑞文推理测验性别差异的研究,综述并分析了关于性别差异研究结果不一致的可能原因.
RAVEN Quality Assurance Activities
Cogliati, Joshua Joseph [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2015-09-01
This report discusses the quality assurance activities needed to raise the Quality Level of Risk Analysis in a Virtual Environment (RAVEN) from Quality Level 3 to Quality Level 2. This report also describes the general RAVEN quality assurance activities. For improving the quality, reviews of code changes have been instituted, more parts of testing have been automated, and improved packaging has been created. For upgrading the quality level, requirements have been created and the workflow has been improved.
Products of rectangular random matrices: singular values and progressive scattering.
Akemann, Gernot; Ipsen, Jesper R; Kieburg, Mario
2013-11-01
We discuss the product of M rectangular random matrices with independent Gaussian entries, which have several applications, including wireless telecommunication and econophysics. For complex matrices an explicit expression for the joint probability density function is obtained using the Harish-Chandra-Itzykson-Zuber integration formula. Explicit expressions for all correlation functions and moments for finite matrix sizes are obtained using a two-matrix model and the method of biorthogonal polynomials. This generalizes the classical result for the so-called Wishart-Laguerre Gaussian unitary ensemble (or chiral unitary ensemble) at M=1, and previous results for the product of square matrices. The correlation functions are given by a determinantal point process, where the kernel can be expressed in terms of Meijer G-functions. We compare the results with numerical simulations and known results for the macroscopic level density in the limit of large matrices. The location of the end points of support for the latter are analyzed in detail for general M. Finally, we consider the so-called ergodic mutual information, which gives an upper bound for the spectral efficiency of a MIMO communication channel with multifold scattering.
Alfonsi, Andrea [Idaho National Lab. (INL), Idaho Falls, ID (United States); Rabiti, Cristian [Idaho National Lab. (INL), Idaho Falls, ID (United States); Mandelli, Diego [Idaho National Lab. (INL), Idaho Falls, ID (United States); Cogliati, Joshua Joseph [Idaho National Lab. (INL), Idaho Falls, ID (United States); Wang, Congjian [Idaho National Lab. (INL), Idaho Falls, ID (United States); Maljovec, Daniel Patrick [Idaho National Lab. (INL), Idaho Falls, ID (United States); Talbot, Paul William [Idaho National Lab. (INL), Idaho Falls, ID (United States); Smith, Curtis Lee [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2016-06-01
RAVEN is a software framework able to perform parametric and stochastic analysis based on the response of complex system codes. The initial development was aimed at providing dynamic risk analysis capabilities to the thermohydraulic code RELAP-7, currently under development at Idaho National Laboratory (INL). Although the initial goal has been fully accomplished, RAVEN is now a multi-purpose stochastic and uncertainty quantification platform, capable of communicating with any system code. In fact, the provided Application Programming Interfaces (APIs) allow RAVEN to interact with any code as long as all the parameters that need to be perturbed are accessible by input files or via python interfaces. RAVEN is capable of investigating system response and explore input space using various sampling schemes such as Monte Carlo, grid, or Latin hypercube. However, RAVEN strength lies in its system feature discovery capabilities such as: constructing limit surfaces, separating regions of the input space leading to system failure, and using dynamic supervised learning techniques. The development of RAVEN started in 2012 when, within the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the need to provide a modern risk evaluation framework arose. RAVEN’s principal assignment is to provide the necessary software and algorithms in order to employ the concepts developed by the Risk Informed Safety Margin Characterization (RISMC) program. RISMC is one of the pathways defined within the Light Water Reactor Sustainability (LWRS) program. In the RISMC approach, the goal is not just to identify the frequency of an event potentially leading to a system failure, but the proximity (or lack thereof) to key safety-related events. Hence, the approach is interested in identifying and increasing the safety margins related to those events. A safety margin is a numerical value quantifying the probability that a safety metric (e.g. peak pressure in a pipe) is exceeded under
Mandelli, Diego [Idaho National Lab. (INL), Idaho Falls, ID (United States); Rabiti, Cristian [Idaho National Lab. (INL), Idaho Falls, ID (United States); Cogliati, Joshua Joseph [Idaho National Lab. (INL), Idaho Falls, ID (United States); Kinoshita, Robert Arthur [Idaho National Lab. (INL), Idaho Falls, ID (United States); Alfonsi, Andrea [Idaho National Lab. (INL), Idaho Falls, ID (United States); Sen, Ramazan Sonat [Idaho National Lab. (INL), Idaho Falls, ID (United States); Wang, Congjian [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2016-02-01
RAVEN is a generic software framework to perform parametric and probabilistic analysis based on the response of complex system codes. The initial development was aimed to provide dynamic risk analysis capabilities to the Thermo-Hydraulic code RELAP-7, currently under development at the Idaho National Laboratory (INL). Although the initial goal has been fully accomplished, RAVEN is now a multi-purpose probabilistic and uncertainty quantification platform, capable to agnostically communicate with any system code. This agnosticism includes providing Application Programming Interfaces (APIs). These APIs are used to allow RAVEN to interact with any code as long as all the parameters that need to be perturbed are accessible by input files or via python interfaces. RAVEN is capable of investigating the system response, and investigating the input space using Monte Carlo, Grid, or Latin Hyper Cube sampling schemes, but its strength is focused toward system feature discovery, such as limit surfaces, separating regions of the input space leading to system failure, using dynamic supervised learning techniques. The development of RAVEN started in 2012, when, within the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the need to provide a modern risk evaluation framework became stronger. RAVEN principal assignment is to provide the necessary software and algorithms in order to employ the concept developed by the Risk Informed Safety Margin Characterization (RISMC) program. RISMC is one of the pathways defined within the Light Water Reactor Sustainability (LWRS) program. In the RISMC approach, the goal is not just the individuation of the frequency of an event potentially leading to a system failure, but the closeness (or not) to key safety-related events. Hence, the approach is interested in identifying and increasing the safety margins related to those events. A safety margin is a numerical value quantifying the probability that a safety metric (e.g. for an
Mandelli, Diego [Idaho National Lab. (INL), Idaho Falls, ID (United States); Rabiti, Cristian [Idaho National Lab. (INL), Idaho Falls, ID (United States); Cogliati, Joshua Joseph [Idaho National Lab. (INL), Idaho Falls, ID (United States); Kinoshita, Robert Arthur [Idaho National Lab. (INL), Idaho Falls, ID (United States); Alfonsi, Andrea [Idaho National Lab. (INL), Idaho Falls, ID (United States); Sen, Ramazan Sonat [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2015-10-01
RAVEN is a generic software framework to perform parametric and probabilistic analysis based on the response of complex system codes. The initial development was aimed to provide dynamic risk analysis capabilities to the Thermo-Hydraulic code RELAP-7, currently under development at the Idaho National Laboratory (INL). Although the initial goal has been fully accomplished, RAVEN is now a multi-purpose probabilistic and uncertainty quantification platform, capable to agnostically communicate with any system code. This agnosticism includes providing Application Programming Interfaces (APIs). These APIs are used to allow RAVEN to interact with any code as long as all the parameters that need to be perturbed are accessible by inputs files or via python interfaces. RAVEN is capable of investigating the system response, and investigating the input space using Monte Carlo, Grid, or Latin Hyper Cube sampling schemes, but its strength is focused toward system feature discovery, such as limit surfaces, separating regions of the input space leading to system failure, using dynamic supervised learning techniques. The development of RAVEN has started in 2012, when, within the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the need to provide a modern risk evaluation framework became stronger. RAVEN principal assignment is to provide the necessary software and algorithms in order to employ the concept developed by the Risk Informed Safety Margin Characterization (RISMC) program. RISMC is one of the pathways defined within the Light Water Reactor Sustainability (LWRS) program. In the RISMC approach, the goal is not just the individuation of the frequency of an event potentially leading to a system failure, but the closeness (or not) to key safety-related events. Hence, the approach is interested in identifying and increasing the safety margins related to those events. A safety margin is a numerical value quantifying the probability that a safety metric (e.g. for
Mandelli, Diego [Idaho National Lab. (INL), Idaho Falls, ID (United States); Rabiti, Cristian [Idaho National Lab. (INL), Idaho Falls, ID (United States); Cogliati, Joshua Joseph [Idaho National Lab. (INL), Idaho Falls, ID (United States); Kinoshita, Robert Arthur [Idaho National Lab. (INL), Idaho Falls, ID (United States); Alfonsi, Andrea [Idaho National Lab. (INL), Idaho Falls, ID (United States); Sen, Ramazan Sonat [Idaho National Lab. (INL), Idaho Falls, ID (United States); Wang, Congjian [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2017-03-01
RAVEN is a generic software framework to perform parametric and probabilistic analy- sis based on the response of complex system codes. The initial development was aimed to provide dynamic risk analysis capabilities to the Thermo-Hydraulic code RELAP-7, currently under development at the Idaho National Laboratory (INL). Although the initial goal has been fully accomplished, RAVEN is now a multi-purpose probabilistic and uncer- tainty quantification platform, capable to agnostically communicate with any system code. This agnosticism includes providing Application Programming Interfaces (APIs). These APIs are used to allow RAVEN to interact with any code as long as all the parameters that need to be perturbed are accessible by inputs files or via python interfaces. RAVEN is capable of investigating the system response, and investigating the input space using Monte Carlo, Grid, or Latin Hyper Cube sampling schemes, but its strength is focused to- ward system feature discovery, such as limit surfaces, separating regions of the input space leading to system failure, using dynamic supervised learning techniques. The development of RAVEN has started in 2012, when, within the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the need to provide a modern risk evaluation framework became stronger. RAVEN principal assignment is to provide the necessary software and algorithms in order to employ the concept developed by the Risk Informed Safety Margin Characterization (RISMC) program. RISMC is one of the pathways defined within the Light Water Reactor Sustainability (LWRS) program. In the RISMC approach, the goal is not just the individuation of the frequency of an event potentially leading to a system failure, but the closeness (or not) to key safety-related events. Hence, the approach is in- terested in identifying and increasing the safety margins related to those events. A safety margin is a numerical value quantifying the probability that a safety metric (e
Ritchie, Brian
2013-01-01
RavenDB High Performance is comprehensive yet concise tutorial that developers can use to.This book is for developers & software architects who are designing systems in order to achieve high performance right from the start. A basic understanding of RavenDB is recommended, but not required. While the book focuses on advanced topics, it does not assume that the reader has a great deal of prior knowledge of working with RavenDB.
van den Berg, Esther; Nys, Gudrun M S; Brands, Augustina M A; Ruis, Carla; van Zandvoort, Martine J E; Kessels, Roy P C
2013-01-01
Previous studies have shown that the discrepancy between performance on "fluid" and "crystallized" intelligence measures may serve as an indicator for intellectual decline. The validity of this procedure in older persons is unknown. The present study developed a multiple regression equation, to predict the Raven Advanced Progressive Matrices (APM) score from the National Adult Reading Test (NART) score and demographic variables in a large sample of healthy older persons (n = 270). The discrepancy between the predicted and observed Raven APM scores was transformed into a percentile distribution as an indicator of intellectual decline, which can be used in clinical practice. The validity of the procedure was further examined by comparing the proportion of persons with a significant decline (at the -1 and -1.65 SD level) between two older patient samples (87 patients with cerebral stroke and 387 patients with diabetes mellitus) by means of χ(2) tests. There was a significantly higher rate of intellectual decline at the -1 SD ("below average") and -1.65 SD ("impaired") cutoff levels for patients with stroke compared with patients with diabetes (stroke, 34% and 14%; diabetes, 16% and 5%, p < .05). These findings suggest that the Raven APM-NART discrepancy may be a useful measure of intellectual decline in older persons.
Cristina Alarcón Paz
2012-12-01
ção das novas características desse período vital.The assessment of intelligence in the elderly population has increased its importance in terms of increased life expectancy. The present study focuses its interest on the relevance of available norms for Raven Progressive Matrices Test in the evaluation of elderly population. Standards were used Colchester (1942, en Raven, Court y Raven, 2008, the most comprehensive available. The non-probability sample involved 102 elderly (aged over 60 years old who were volunteers. The study used a non-experimental cross-correlation design. The results indicate that the current norms are not very demanding for the aging population, and that there are significant differences between adults of the third and fourth age, better for the first group. Moreover, the discrepancy index showed high sensitivity, indicating that the expected distribution of scores does not correspond to the general population. Results are discussed regarding the need to update the norms and the consideration of the new features involved in this vital period.
LAZAR STANKOV; KARL SCHWEIZER
2007-01-01
This paper examines the effects of complexity-enhancing manipulations of two cognitive tasks – Swaps and Triplet Numbers tests (Stankov, 2000) – on their relationship with Raven’s Progressive Matrices test representing aspects of fluid intelligence. The complexity manipulations involved four treatment levels, each requiring an increasing number of components and relationships among these components. The accuracy, speed of processing, and confidence measures were decomposed into experimental a...
Ravens satellite mission concept study
Donovan, Eric F
2011-01-01
The concept for Ravens satellite mission was proposed in response to a CSA AO for potential Canadian mission contributions to the International Living With a Star (ILWS) program. Ravens was conceived of to fill an important gap in the ILWS program: global imaging. Ravens will build on the heritage of world-class global imaging carried out in Canada. It would do much more than provide global observations to complete the system level capabilities of ILWS. Ravens would be comprised of two satellites on elliptical polar orbits, relatively phased on those orbits to provide the first-ever continuous (ie., 24 hours per day 7 days per week) global imaging of the northern hemisphere auroral and polar cap regions. This would provide the first-ever unbroken sequences of global images of the auroral response during long duration geomagnetic processes like storms and steady magnetospheric convection events. Ravens could track the spatio-temporal evolution of the global electron and proton auroral distribution, and would o...
FrankenRaven: A New Platform for Remote Sensing
Dahlgren, R. P.; Fladeland, M. M.; Pinsker, E. A.; Jasionowicz, J. P.; Jones, L. L.; Mosser, C. D.; Pscheid, M. J.; Weidow, N. L.; Kelly, P. J.; Kern, C.; Werner, C. A.; Johnson, M. S.
2016-12-01
Small, modular aircraft are an emerging technology with a goal to maximize flexibility and enable multi-mission support. This reports the progress of an unmanned aerial system (UAS) project conducted at the NASA Ames Research Center (ARC) in 2016. This interdisciplinary effort builds upon the success of the 2014 FrankenEye project to apply rapid prototyping techniques to UAS, to develop a variety of platforms to host remote sensing instruments. In 2016, ARC received AeroVironment RQ-11A and RQ-11B Raven UAS from the US Department of the Interior, Office of Aviation Services. These aircraft have electric propulsion, a wingspan of roughly 1.3m, and have demonstrated reliability in challenging environments. The Raven airframe is an ideal foundation to construct more complex aircraft, and student interns using 3D printing were able to graft multiple Raven wings and fuselages into "FrankenRaven" aircraft. Aeronautical analysis shows that the new configuration has enhanced flight time, payload capacity, and distance compared to the original Raven. The FrankenRaven avionics architecture replaces the mil-spec avionics with COTS technology based upon the 3DR Pixhawk PX4 autopilot with a safety multiplexer for failsafe handoff to 2.4 GHz RC control and 915 MHz telemetry. This project demonstrates how design reuse, rapid prototyping, and modular subcomponents can be leveraged into flexible airborne platforms that can host a variety of remote sensing payloads and even multiple payloads. Modularity advances a new paradigm: mass-customization of aircraft around given payload(s). Multi-fuselage designs are currently under development to host a wide variety of payloads including a zenith-pointing spectrometer, a magnetometer, a multi-spectral camera, and a RGB camera. After airworthiness certification, flight readiness review, and test flights are performed at Crows Landing airfield in central California, field data will be taken at Kilauea volcano in Hawaii and other locations.
瑞文标准推理测验因子结构探析%Factors Structure Research of Raven's Progressive Matrices Test
赵广平
2008-01-01
为了探索瑞文标准推理测验的因子结构,运用认知成分分析技术和结构方程模型,建立瑞文标准推理测验的二阶潜在因子结构模型.并对528名被试进行瑞文标准测验,结果表明,新模型总体上优于其他竞争模型,有一定的合理性.新模型显示了测验项目与三个潜在因子的对应关系,为解释被试个体差异提供了更可靠的认知心理学依据,补充和完善了原来的一阶单因子结构模型.
Denise R. Bandeira; Angelo Costa; Adriane Arteche
2012-01-01
Diferentes estudios han mostrado un aumento en las puntuaciones de los tests de inteligencia a lo largo de las últimas décadas - el "efecto Flynn". Sin embargo, el hecho de que este efecto no se haya observado consistentemente cuando las fuentes de habilidad cognitiva son utilizadas, hace que éste sea uno de los principales temas de discusión. Por tanto, la presente investigación tuvo como objetivo arrojar algo de luz sobre esta cuestión. Dos estudios que utilizaron diferentes medidas de habi...
Denise R. Bandeira; Angelo Costa; Adriane Arteche
2012-01-01
Diferentes estudios han mostrado un aumento en las puntuaciones de los tests de inteligencia a lo largo de las últimas décadas - el "efecto Flynn". Sin embargo, el hecho de que este efecto no se haya observado consistentemente cuando las fuentes de habilidad cognitiva son utilizadas, hace que éste sea uno de los principales temas de discusión. Por tanto, la presente investigación tuvo como objetivo arrojar algo de luz sobre esta cuestión. Dos estudios que utilizaron diferentes medidas de habi...
De Cock, D; Vanderschueren, G; Meyfroidt, S; Joly, J; Van der Elst, K; Westhovens, R; Verschueren, P
2014-04-01
To compare in daily clinical practice the reliability of matrices that forecast rapid radiologic progression (RRP) at year one, at year two, and over 2 years in patients with early rheumatoid arthritis (RA). Overall, 74 early RA patients with X-rays of hands and feet at baseline, year one, and year two were included. Initial DMARD combination therapy with steroids (ICTS) or DMARD monotherapy (IMT) was initiated according to patients' RA severity, based on rheumatologist opinion. The images were scored via the modified Sharp/van der Heijde (SvH) method. A total Sharp score progression of equal or higher than five per year was considered RRP. Six matrices were tested: ASPIRE CRP/ESR matrices, the BEST matrix, two SWEFOT matrices, and the ESPOIR matrix. Patients were placed in each of them yielding a RRP probability. The performance was tested by Area Under the Curve analysis reflecting the predictive value. Four patients developed RRP in year one, five in year two, and four over 2 years. With regard to face validity, the predicted probability did not correspond to the risk in reality: the one ICTS patient who developed RRP over 2 years was always found in the lowest RRP categories of all matrices. The ASPIRE CRP matrix yielded at least a moderate predicting value for the three time points. The other matrices showed moderate to no predicting value. The performance of all matrices was disappointing and it is impossible to fully rely on the existing matrices in daily clinical practice. © 2013 Published by Elsevier Inc.
Ravens attribute visual access to unseen competitors.
Bugnyar, Thomas; Reber, Stephan A; Buckner, Cameron
2016-02-02
Recent studies purported to demonstrate that chimpanzees, monkeys and corvids possess a basic Theory of Mind, the ability to attribute mental states like seeing to others. However, these studies remain controversial because they share a common confound: the conspecific's line of gaze, which could serve as an associative cue. Here, we show that ravens Corvus corax take into account the visual access of others, even when they cannot see a conspecific. Specifically, we find that ravens guard their caches against discovery in response to the sounds of conspecifics when a peephole is open but not when it is closed. Our results suggest that ravens can generalize from their own perceptual experience to infer the possibility of being seen. These findings confirm and unite previous work, providing strong evidence that ravens are more than mere behaviour-readers.
Dynamic Event Tree Analysis Through RAVEN
A. Alfonsi; C. Rabiti; D. Mandelli; J. Cogliati; R. A. Kinoshita; A. Naviglio
2013-09-01
Conventional Event-Tree (ET) based methodologies are extensively used as tools to perform reliability and safety assessment of complex and critical engineering systems. One of the disadvantages of these methods is that timing/sequencing of events and system dynamics is not explicitly accounted for in the analysis. In order to overcome these limitations several techniques, also know as Dynamic Probabilistic Risk Assessment (D-PRA), have been developed. Monte-Carlo (MC) and Dynamic Event Tree (DET) are two of the most widely used D-PRA methodologies to perform safety assessment of Nuclear Power Plants (NPP). In the past two years, the Idaho National Laboratory (INL) has developed its own tool to perform Dynamic PRA: RAVEN (Reactor Analysis and Virtual control ENvironment). RAVEN has been designed in a high modular and pluggable way in order to enable easy integration of different programming languages (i.e., C++, Python) and coupling with other application including the ones based on the MOOSE framework, developed by INL as well. RAVEN performs two main tasks: 1) control logic driver for the new Thermo-Hydraulic code RELAP-7 and 2) post-processing tool. In the first task, RAVEN acts as a deterministic controller in which the set of control logic laws (user defined) monitors the RELAP-7 simulation and controls the activation of specific systems. Moreover, RAVEN also models stochastic events, such as components failures, and performs uncertainty quantification. Such stochastic modeling is employed by using both MC and DET algorithms. In the second task, RAVEN processes the large amount of data generated by RELAP-7 using data-mining based algorithms. This paper focuses on the first task and shows how it is possible to perform the analysis of dynamic stochastic systems using the newly developed RAVEN DET capability. As an example, the Dynamic PRA analysis, using Dynamic Event Tree, of a simplified pressurized water reactor for a Station Black-Out scenario is presented.
First RAVEN flight set for September
Anon
2002-08-01
An unmanned aerial vehicle called RAVEN, said to be capable of remote tracking of onshore and offshore oil and gas facilities, has been developed by a group of graduate students from Memorial University of Newfoundland. RAVEN is claimed to be capable of performing a number of tasks under its own control without the need for human intervention, including checking onshore pipelines for damage, or scouting the path of hazardous icebergs offshore. The RAVEN was created to meet the need for real time iceberg tracking and early hazard detection, supplementing or replacing the present method of RADARSAT images and tracking by manned aircraft. The RAVEN can be launched from any platform; it can fly under conditions that would be too dangerous for a manned aircraft. Currently in the prototype stage, the first trial flight for the RAVEN is expected to take place in September 2002. The first flight will consist of five GPS waypoints set relatively close together in a pattern to allow testing of the autopilot and the camera simultaneously. The second flight will be similar, but will also include tracking a section of a pipeline and record images at programmed GPS waypoints.
Chiesi, Francesca; Ciancaleoni, Matteo; Galli, Silvia; Primi, Caterina
2012-01-01
This article is aimed at evaluating the possibility that Set I of the Advanced Progressive Matrices (APM-Set I) can be employed to assess fluid ability in a short time frame. The APM-Set I was administered to a sample of 1,389 primary and secondary school students. Confirmatory factor analysis attested to the unidimensionality of the scale. Item…
Chiesi, Francesca; Ciancaleoni, Matteo; Galli, Silvia; Primi, Caterina
2012-01-01
This article is aimed at evaluating the possibility that Set I of the Advanced Progressive Matrices (APM-Set I) can be employed to assess fluid ability in a short time frame. The APM-Set I was administered to a sample of 1,389 primary and secondary school students. Confirmatory factor analysis attested to the unidimensionality of the scale. Item…
Performing Probabilistic Risk Assessment Through RAVEN
A. Alfonsi; C. Rabiti; D. Mandelli; J. Cogliati; R. Kinoshita
2013-06-01
The Reactor Analysis and Virtual control ENviroment (RAVEN) code is a software tool that acts as the control logic driver and post-processing engine for the newly developed Thermal-Hydraulic code RELAP-7. RAVEN is now a multi-purpose Probabilistic Risk Assessment (PRA) software framework that allows dispatching different functionalities: Derive and actuate the control logic required to simulate the plant control system and operator actions (guided procedures), allowing on-line monitoring/controlling in the Phase Space Perform both Monte-Carlo sampling of random distributed events and Dynamic Event Tree based analysis Facilitate the input/output handling through a Graphical User Interface (GUI) and a post-processing data mining module
Tannir, Khaled
2013-01-01
Written in a friendly, example-driven Beginner's Guide format, there are plenty of step-by-step instructions and examples that are designed to help you get started with RavenDB. If you are a .NET developer, new to document-oriented databases, and you wish to learn how to build applications using NoSQL databases, then this book is for you. Experience with relational database systems will be helpful, but not necessary.
Ravens intervene in others' bonding attempts.
Massen, Jorg J M; Szipl, Georgine; Spreafico, Michela; Bugnyar, Thomas
2014-11-17
The competition for power in a complex social world is hypothesized to be a driving force in the evolution of intelligence. More specifically, power may be obtained not only by brute force but also by social strategies resembling human politics. Most empirical evidence comes from primate studies that report unprovoked aggression by dominants to maintain power by spreading fear and third-party interventions in conflicts. Coalitionary support has also been described in other animals and is often linked to social bonding. As coalitions can lead to a gain in power and fitness benefits, individuals may try to prevent coalitionary support or indirectly prevent others from forming social bonds that might lead to coalitions. Although there is some empirical evidence that coalitionary support can be manipulated, little is known about the indirect strategy. We show here that wild ravens (Corvus corax) regularly intervene in affiliative interactions of others even though such interventions are potentially risky and without immediate benefits. Moreover, the identities of both interveners and intervened pairs are not randomly distributed. Ravens with existing ties initiate most interventions, and ravens that are creating new ties are most likely to be the targets of interventions. These patterns are consistent with the idea that interventions function to prevent others from forming alliances and consequently becoming future competitors. We thus show previously undescribed social maneuvers in the struggle for power. These maneuvers are likely to be of importance in other social species as well.
The Young Man’s Madness in The Raven
WANG Chao
2015-01-01
The raven is a narrative poem written by American writer Edgar Allan Poe. It tells of a talking raven ’s mysterious visit in a midnight to a distraught lover, tracing the lover’s slow fall into madness. The lover is lamenting the loss of his beloved, Le⁃nore. The raven, sitting on a bust of Pallas, seems to further instigate his distress with its constant repetition of the word“Never⁃more”.
Rossi Casé, Lilia Elba; Doná, Stella Maris; Garzaniti, Ramiro
2015-01-01
Se presenta el análisis de los resultados obtenidos al estudiar la confiabilidad en el uso de la Escala Paralela del Test de Raven, como forma alternativa de la Escala General. Por el constructo a medir, el diseño del instrumento, su confiabilidad y validez, el Test de Matrices Progresivas de Raven es uno de los instrumentos más difundidos y utilizados a nivel mundial. El Test mide la capacidad intelectual para educir relaciones. De manera reglada, asigna un número a la habilidad de los...
System Reliability Analysis Capability and Surrogate Model Application in RAVEN
Rabiti, Cristian; Alfonsi, Andrea; Huang, Dongli; Gleicher, Frederick; Wang, Bei; Adbel-Khalik, Hany S.; Pascucci, Valerio; Smith, Curtis L.
2015-11-01
This report collect the effort performed to improve the reliability analysis capabilities of the RAVEN code and explore new opportunity in the usage of surrogate model by extending the current RAVEN capabilities to multi physics surrogate models and construction of surrogate models for high dimensionality fields.
Time Dependent Data Mining in RAVEN
Cogliati, Joshua Joseph [Idaho National Lab. (INL), Idaho Falls, ID (United States); Chen, Jun [Idaho National Lab. (INL), Idaho Falls, ID (United States); Patel, Japan Ketan [Idaho National Lab. (INL), Idaho Falls, ID (United States); Mandelli, Diego [Idaho National Lab. (INL), Idaho Falls, ID (United States); Maljovec, Daniel Patrick [Idaho National Lab. (INL), Idaho Falls, ID (United States); Alfonsi, Andrea [Idaho National Lab. (INL), Idaho Falls, ID (United States); Talbot, Paul William [Idaho National Lab. (INL), Idaho Falls, ID (United States); Rabiti, Cristian [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2016-09-01
RAVEN is a generic software framework to perform parametric and probabilistic analysis based on the response of complex system codes. The goal of this type of analyses is to understand the response of such systems in particular with respect their probabilistic behavior, to understand their predictability and drivers or lack of thereof. Data mining capabilities are the cornerstones to perform such deep learning of system responses. For this reason static data mining capabilities were added last fiscal year (FY 15). In real applications, when dealing with complex multi-scale, multi-physics systems it seems natural that, during transients, the relevance of the different scales, and physics, would evolve over time. For these reasons the data mining capabilities have been extended allowing their application over time. In this writing it is reported a description of the new RAVEN capabilities implemented with several simple analytical tests to explain their application and highlight the proper implementation. The report concludes with the application of those newly implemented capabilities to the analysis of a simulation performed with the Bison code.
Common raven juvenile survival in a human-augmented landscape
Webb, William C.; Boarman, William I.; Rotenberry, John T.
2004-01-01
Anthropogenic resource subsidies have contributed to the dramatic increase in the abundance of Common Ravens (Corvus corax) in the western Mojave Desert, California, during the past 30 years. To better understand the effects of these subsidies on raven demography, we examined whether survival to juvenile departure from the natal territory could be predicted by a set of environmental and morphological variables, such as nest proximity to anthropogenic resources and juvenile condition. We captured 240 juvenile ravens over 2 years and marked them prior to fledging. Nest proximity to anthropogenic resources and earlier fledging dates significantly predicted raven juvenile survival to departure from the natal territory. The best-fitting mark-recapture models predicted postdeparture survival as a function of time since fledging, nest proximity to anthropogenic resources, and year hatched. The positive effect of nest proximity to anthropogenic resources influenced postdeparture survival for at least 9 months after fledging, as revealed by the mark-recapture analysis. Annual survival was 47% for first-year, 81% for second-year, and 83% for third-year birds. Our results support the hypothesis that anthropogenic resources contribute to increasing raven numbers via increased juvenile survival to departure as well as increased postdeparture survival. We expect raven numbers to grow in concert with the growing human presence in the Mojave Desert unless raven access to anthropogenic resources is diminished.
The Raven,a Loner’s Psychological Accompanier
商滔
2015-01-01
Edgar Allan Poe’s The Raven is well-known to the world for its detailed psychological descriptions in the author’s eyes of this essay.Whereas,the Raven is the only one accompanie and the best listener listening to Poe’s psychological cry for his lover.The author will try to present the scene of the sadness from Poe by employing Carl G.Jung’s theories about consciousness and unconsciousness.
The Raven,a Loner’s Psychological Accompanier
商滔
2015-01-01
Edgar Allan Poe’s The Raven is well-known to the world for its detailed psychological descriptions in the author’s eyes of this essay.Whereas,the Raven is the only one accompanier and the best listener listening to Poe’s psychological cry for his lover.The author will try to present the scene of the sadness from Poe by employing Carl G.Jung’s theories about consciousness and unconsciousness.
"The raven", by Machado de Assis "The raven", by Machado de Assis
Sérgio Luiz Prado Bellei
2008-04-01
Full Text Available The Brazilian critic José Guilherme Merquior once claimed that Machado de Assis's translation of "The Raven" should not be considered inferior to the well known translation of the Portuguese poet Fernando Pessoa. 1 Unfortunately Merquior does not seem to find necessary to give reasons for this evaluation. And yet even the most cursory reading of the two translations will show that some sort of explanation is necessary because Machado and Pessoa are obviously doing something radically different with Poe's poem. Consider, for example, the two renderings of the first stanza in relation to Poe's original: The Brazilian critic José Guilherme Merquior once claimed that Machado de Assis's translation of "The Raven" should not be considered inferior to the well known translation of the Portuguese poet Fernando Pessoa. 1 Unfortunately Merquior does not seem to find necessary to give reasons for this evaluation. And yet even the most cursory reading of the two translations will show that some sort of explanation is necessary because Machado and Pessoa are obviously doing something radically different with Poe's poem. Consider, for example, the two renderings of the first stanza in relation to Poe's original:
Mehta, Madan Lal
1990-01-01
Since the publication of Random Matrices (Academic Press, 1967) so many new results have emerged both in theory and in applications, that this edition is almost completely revised to reflect the developments. For example, the theory of matrices with quaternion elements was developed to compute certain multiple integrals, and the inverse scattering theory was used to derive asymptotic results. The discovery of Selberg's 1944 paper on a multiple integral also gave rise to hundreds of recent publications. This book presents a coherent and detailed analytical treatment of random matrices, leading
Social networks predict selective observation and information spread in ravens
Rubenstein, Daniel I.; Bugnyar, Thomas; Hoppitt, William; Mikus, Nace; Schwab, Christine
2016-01-01
Animals are predicted to selectively observe and learn from the conspecifics with whom they share social connections. Yet, hardly anything is known about the role of different connections in observation and learning. To address the relationships between social connections, observation and learning, we investigated transmission of information in two raven (Corvus corax) groups. First, we quantified social connections in each group by constructing networks on affiliative interactions, aggressive interactions and proximity. We then seeded novel information by training one group member on a novel task and allowing others to observe. In each group, an observation network based on who observed whose task-solving behaviour was strongly correlated with networks based on affiliative interactions and proximity. Ravens with high social centrality (strength, eigenvector, information centrality) in the affiliative interaction network were also central in the observation network, possibly as a result of solving the task sooner. Network-based diffusion analysis revealed that the order that ravens first solved the task was best predicted by connections in the affiliative interaction network in a group of subadult ravens, and by social rank and kinship (which influenced affiliative interactions) in a group of juvenile ravens. Our results demonstrate that not all social connections are equally effective at predicting the patterns of selective observation and information transmission. PMID:27493780
Application of the Raven UAV for chemical and biological detection
Altenbaugh, Ryan; Barton, Jeff; Chiu, Christopher; Fidler, Ken; Hiatt, Dan; Hawthorne, Chad; Marshall, Steven; Mohos, Joe; McHugh, Vince; Nicoloff, Bill
2010-04-01
This paper presents the plume tracking algorithms developed for a series of outdoor chemical-stimulant testing conducted at Dugway Proving Ground in 2008 and 2009 employing a Raven UAV equipped with a real-time chemical sensor. The flights were conducted as part of the a program under the sponsorship of the Army JPM NBC Contamination Avoidance and in conjunction with the Army PM-Unmanned Aircraft Systems, the Defense Threat Reduction Agency, and Edgewood Chemical Biological Center. This test demonstrated the Raven's ability to autonomously detect and track a chemical plume during a variety of atmospheric conditions. During the testing, the Raven conducted over a dozen flights, tracking outdoor releases of simulated chemical weapons over significant distances. The Raven was cued to the releases with standoff detection systems through Cursor on Target messages. Upon reaching the plume, the Raven used on-board sensors and on-board meteorological data to track the plume autonomously and determine the extent of the plume. Results were provided in real-time to the UAV operator.
Social networks predict selective observation and information spread in ravens.
Kulahci, Ipek G; Rubenstein, Daniel I; Bugnyar, Thomas; Hoppitt, William; Mikus, Nace; Schwab, Christine
2016-07-01
Animals are predicted to selectively observe and learn from the conspecifics with whom they share social connections. Yet, hardly anything is known about the role of different connections in observation and learning. To address the relationships between social connections, observation and learning, we investigated transmission of information in two raven (Corvus corax) groups. First, we quantified social connections in each group by constructing networks on affiliative interactions, aggressive interactions and proximity. We then seeded novel information by training one group member on a novel task and allowing others to observe. In each group, an observation network based on who observed whose task-solving behaviour was strongly correlated with networks based on affiliative interactions and proximity. Ravens with high social centrality (strength, eigenvector, information centrality) in the affiliative interaction network were also central in the observation network, possibly as a result of solving the task sooner. Network-based diffusion analysis revealed that the order that ravens first solved the task was best predicted by connections in the affiliative interaction network in a group of subadult ravens, and by social rank and kinship (which influenced affiliative interactions) in a group of juvenile ravens. Our results demonstrate that not all social connections are equally effective at predicting the patterns of selective observation and information transmission.
Raven-II: an open platform for surgical robotics research.
Hannaford, Blake; Rosen, Jacob; Friedman, Diana W; King, Hawkeye; Roan, Phillip; Cheng, Lei; Glozman, Daniel; Ma, Ji; Kosari, Sina Nia; White, Lee
2013-04-01
The Raven-II is a platform for collaborative research on advances in surgical robotics. Seven universities have begun research using this platform. The Raven-II system has two 3-DOF spherical positioning mechanisms capable of attaching interchangeable four DOF instruments. The Raven-II software is based on open standards such as Linux and ROS to maximally facilitate software development. The mechanism is robust enough for repeated experiments and animal surgery experiments, but is not engineered to sufficient safety standards for human use. Mechanisms in place for interaction among the user community and dissemination of results include an electronic forum, an online software SVN repository, and meetings and workshops at major robotics conferences.
Raven surgical robot training in preparation for da vinci.
Glassman, Deanna; White, Lee; Lewis, Andrew; King, Hawkeye; Clarke, Alicia; Glassman, Thomas; Comstock, Bryan; Hannaford, Blake; Lendvay, Thomas S
2014-01-01
The rapid adoption of robotic assisted surgery challenges the pace at which adequate robotic training can occur due to access limitations to the da Vinci robot. Thirty medical students completed a randomized controlled trial evaluating whether the Raven robot could be used as an alternative training tool for the Fundamentals of Laparoscopic Surgery (FLS) block transfer task on the da Vinci robot. Two groups, one trained on the da Vinci and one trained on the Raven, were tested on a criterion FLS block transfer task on the da Vinci. After robotic FLS block transfer proficiency training there was no statistically significant difference between path length (p=0.39) and economy of motion scores (p=0.06) between the two groups, but those trained on the da Vinci did have faster task times (p=0.01). These results provide evidence for the value of using the Raven robot for training prior to using the da Vinci surgical system for similar tasks.
RAVEN, a New Software for Dynamic Risk Analysis
Cristian Rabiti; Andrea Alfonsi; Joshua Cogliati; Diego Mandelli; Robert Kinoshita
2014-06-01
RAVEN is a generic software driver to perform parametric and probabilistic analysis of code simulating complex systems. Initially developed to provide dynamic risk analysis capabilities to the RELAP-7 code [1] is currently being generalized with the addition of Application Programming Interfaces (APIs). These interfaces are used to extend RAVEN capabilities to any software as long as all the parameters that need to be perturbed are accessible by inputs files or directly via python interfaces. RAVEN is capable to investigate the system response probing the input space using Monte Carlo, grid strategies, or Latin Hyper Cube schemes, but its strength is its focus toward system feature discovery like limit surfaces separating regions of the input space leading to system failure using dynamic supervised learning techniques. The paper will present an overview of the software capabilities and their implementation schemes followed by same application examples.
DAKOTA reliability methods applied to RAVEN/RELAP-7.
Swiler, Laura Painton; Mandelli, Diego; Rabiti, Cristian; Alfonsi, Andrea
2013-09-01
This report summarizes the result of a NEAMS project focused on the use of reliability methods within the RAVEN and RELAP-7 software framework for assessing failure probabilities as part of probabilistic risk assessment for nuclear power plants. RAVEN is a software tool under development at the Idaho National Laboratory that acts as the control logic driver and post-processing tool for the newly developed Thermal-Hydraulic code RELAP-7. Dakota is a software tool developed at Sandia National Laboratories containing optimization, sensitivity analysis, and uncertainty quantification algorithms. Reliability methods are algorithms which transform the uncertainty problem to an optimization problem to solve for the failure probability, given uncertainty on problem inputs and a failure threshold on an output response. The goal of this work is to demonstrate the use of reliability methods in Dakota with RAVEN/RELAP-7. These capabilities are demonstrated on a demonstration of a Station Blackout analysis of a simplified Pressurized Water Reactor (PWR).
Enhancements to the RAVEN code in FY16
Alfonsi, Andrea [Idaho National Lab. (INL), Idaho Falls, ID (United States); Rabiti, Cristian [Idaho National Lab. (INL), Idaho Falls, ID (United States); Maljovec, Daniel Patrick [Idaho National Lab. (INL), Idaho Falls, ID (United States); Mandelli, Diego [Idaho National Lab. (INL), Idaho Falls, ID (United States); Smith, Curtis Lee [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2016-09-01
The RAVEN code has been under development at the Idaho National Laboratory since 2012. Its main goal is to create a multi-purpose platform for the deploying of all the capabilities needed for Probabilistic Risk Assessment, uncertainty quantification, data mining analysis and optimization studies. RAVEN has currently reached a good level of maturity in terms of deployed state-of-art and advanced capabilities. The main subject of this report is to show the activities that have been recently accomplished: • Implementation of ensemble modeling for time-series, and • initial implementation of model validation for surrogate models, and • advanced visualization capability for topology based data analysis The development of ensemble modeling for time-series has been performed in order to begin tackling the needs of those RISMC applications that need to communicate 1-Dimensional information (e.g. power histories, etc.) among different models. In this document the implementation details and an application example is reported. The second subject of this report is about the initial development of methods, within the RAVEN framework, to assess the validity of the predictive capabilities of surrogate models. Indeed, after the construction of a surrogate tight to a certain physical model, it is crucial to assess the goodness of its representation, in order to be confident with its prediction. In this initial activity, a cross-validation technique has been employed. This report will highlight the implementation details and proof its correct implementation by an application example. The final subject of this report is about the implementation of advanced visualization capability in RAVEN, for interactive data analysis. Indeed, RAVEN offers several post-processing capabilities that can structurally decompose data extracted from experimental results offering both data clustering/partitioning and dimensionality reduction techniques. A disadvantage of the workflow available in
The Raven and the Crow: A Makah Story Coloring Book.
Makah Cultural and Research Center, Neah Bay, WA.
The Makah coloring book tells the story of how the raven twice tricked the crow and her hungry children out of a meal. The captions tell the story in English with some Makah words inserted in the text. The book contains a Makah-English glossary of 11 words. (SB)
RAVEN and Dynamic Probabilistic Risk Assessment: Software overview
Andrea Alfonsi; Cristian Rabiti; Diego Mandelli; Joshua Cogliati; Robert Kinoshita; Antonio Naviglio
2014-09-01
RAVEN is a generic software framework to perform parametric and probabilistic analysis based on the response of complex system codes. The initial development was aimed to provide dynamic risk analysis capabilities to the Thermo-Hydraulic code RELAP-7 [], currently under development at the Idaho National Laboratory. Although the initial goal has been fully accomplished, RAVEN is now a multi-purpose probabilistic and uncertainty quantification platform, capable to agnostically communicate with any system code. This agnosticism has been employed by providing Application Programming Interfaces (APIs). These interfaces are used to allow RAVEN to interact with any code as long as all the parameters that need to be perturbed are accessible by inputs files or via python interfaces. RAVEN is capable to investigate the system response, investigating the input space using Monte Carlo, Grid, or Latin Hyper Cube sampling schemes, but its strength is focused toward system feature discovery, such as limit surfaces, separating regions of the input space leading to system failure, using dynamic supervised learning techniques. The paper presents an overview of the software capabilities and their implementation schemes followed by some application examples.
A Comprehensive Validation Approach Using The RAVEN Code
Alfonsi, Andrea; Rabiti, Cristian; Cogliati, Joshua J; Rinaldi, Ivan; Giannetti, Fabio; Caruso, Gianfranco
2015-06-01
The RAVEN computer code , developed at the Idaho National Laboratory, is a generic software framework to perform parametric and probabilistic analysis based on the response of complex system codes. RAVEN is a multi-purpose probabilistic and uncertainty quantification platform, capable to communicate with any system code. A natural extension of the RAVEN capabilities is the imple- mentation of an integrated validation methodology, involving several different metrics, that represent an evolution of the methods currently used in the field. The state-of-art vali- dation approaches use neither exploration of the input space through sampling strategies, nor a comprehensive variety of metrics needed to interpret the code responses, with respect experimental data. The RAVEN code allows to address both these lacks. In the following sections, the employed methodology, and its application to the newer developed thermal-hydraulic code RELAP-7, is reported.The validation approach has been applied on an integral effect experiment, representing natu- ral circulation, based on the activities performed by EG&G Idaho. Four different experiment configurations have been considered and nodalized.
Implementation of Stochastic Polynomials Approach in the RAVEN Code
Cristian Rabiti; Paul Talbot; Andrea Alfonsi; Diego Mandelli; Joshua Cogliati
2013-10-01
RAVEN, under the support of the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, has been tasked to provide the necessary software and algorithms to enable the application of the conceptual framework developed by the Risk Informed Safety Margin Characterization (RISMC) [1] path. RISMC is one of the paths defined under the Light Water Reactor Sustainability (LWRS) DOE program.
Developing and Implementing the Data Mining Algorithms in RAVEN
Sen, Ramazan Sonat [Idaho National Lab. (INL), Idaho Falls, ID (United States); Maljovec, Daniel Patrick [Idaho National Lab. (INL), Idaho Falls, ID (United States); Alfonsi, Andrea [Idaho National Lab. (INL), Idaho Falls, ID (United States); Rabiti, Cristian [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2015-09-01
The RAVEN code is becoming a comprehensive tool to perform probabilistic risk assessment, uncertainty quantification, and verification and validation. The RAVEN code is being developed to support many programs and to provide a set of methodologies and algorithms for advanced analysis. Scientific computer codes can generate enormous amounts of data. To post-process and analyze such data might, in some cases, take longer than the initial software runtime. Data mining algorithms/methods help in recognizing and understanding patterns in the data, and thus discover knowledge in databases. The methodologies used in the dynamic probabilistic risk assessment or in uncertainty and error quantification analysis couple system/physics codes with simulation controller codes, such as RAVEN. RAVEN introduces both deterministic and stochastic elements into the simulation while the system/physics code model the dynamics deterministically. A typical analysis is performed by sampling values of a set of parameter values. A major challenge in using dynamic probabilistic risk assessment or uncertainty and error quantification analysis for a complex system is to analyze the large number of scenarios generated. Data mining techniques are typically used to better organize and understand data, i.e. recognizing patterns in the data. This report focuses on development and implementation of Application Programming Interfaces (APIs) for different data mining algorithms, and the application of these algorithms to different databases.
Stephanov, M A; Wettig, T
2005-01-01
We review elementary properties of random matrices and discuss widely used mathematical methods for both hermitian and nonhermitian random matrix ensembles. Applications to a wide range of physics problems are summarized. This paper originally appeared as an article in the Wiley Encyclopedia of Electrical and Electronics Engineering.
Simes, Matthew; Johnson, Diego R.; Streit, Justin; Longshore, Kathleen; Nussear, Kenneth E.; Esque, Todd C.
2017-01-01
The Common Raven (Corvus corax) is a ubiquitous species in the Mojave Desert of southern Nevada and California. From 5 to 24 May 2014, using remote trail cameras, we observed ravens repeatedly kleptoparasitizing food resources from the nest of a pair of Golden Eagles (Aquila chyrsaetos) in the Spring Mountains of southern Nevada. The ravens fed on nine (30%) of the 30 prey items delivered to the nest during the chick rearing period. Kleptoparasitic behavior by the ravens decreased as the eagle nestling matured to seven weeks of age, suggesting a narrow temporal window in which ravens can successfully engage in kleptoparasitic behavior at eagle nests. The observation of kleptoparasitism by Common Ravens at the nest suggests potential risks to young Golden Eagles from Common Ravens.
RAVEN: Dynamic Event Tree Approach Level III Milestone
Andrea Alfonsi; Cristian Rabiti; Diego Mandelli; Joshua Cogliati; Robert Kinoshita
2013-07-01
Conventional Event-Tree (ET) based methodologies are extensively used as tools to perform reliability and safety assessment of complex and critical engineering systems. One of the disadvantages of these methods is that timing/sequencing of events and system dynamics are not explicitly accounted for in the analysis. In order to overcome these limitations several techniques, also know as Dynamic Probabilistic Risk Assessment (DPRA), have been developed. Monte-Carlo (MC) and Dynamic Event Tree (DET) are two of the most widely used D-PRA methodologies to perform safety assessment of Nuclear Power Plants (NPP). In the past two years, the Idaho National Laboratory (INL) has developed its own tool to perform Dynamic PRA: RAVEN (Reactor Analysis and Virtual control ENvironment). RAVEN has been designed to perform two main tasks: 1) control logic driver for the new Thermo-Hydraulic code RELAP-7 and 2) post-processing tool. In the first task, RAVEN acts as a deterministic controller in which the set of control logic laws (user defined) monitors the RELAP-7 simulation and controls the activation of specific systems. Moreover, the control logic infrastructure is used to model stochastic events, such as components failures, and perform uncertainty propagation. Such stochastic modeling is deployed using both MC and DET algorithms. In the second task, RAVEN processes the large amount of data generated by RELAP-7 using data-mining based algorithms. This report focuses on the analysis of dynamic stochastic systems using the newly developed RAVEN DET capability. As an example, a DPRA analysis, using DET, of a simplified pressurized water reactor for a Station Black-Out (SBO) scenario is presented.
RAVEN. Dynamic Event Tree Approach Level III Milestone
Alfonsi, Andrea [Idaho National Lab. (INL), Idaho Falls, ID (United States); Rabiti, Cristian [Idaho National Lab. (INL), Idaho Falls, ID (United States); Mandelli, Diego [Idaho National Lab. (INL), Idaho Falls, ID (United States); Cogliati, Joshua [Idaho National Lab. (INL), Idaho Falls, ID (United States); Kinoshita, Robert [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2014-07-01
Conventional Event-Tree (ET) based methodologies are extensively used as tools to perform reliability and safety assessment of complex and critical engineering systems. One of the disadvantages of these methods is that timing/sequencing of events and system dynamics are not explicitly accounted for in the analysis. In order to overcome these limitations several techniques, also know as Dynamic Probabilistic Risk Assessment (DPRA), have been developed. Monte-Carlo (MC) and Dynamic Event Tree (DET) are two of the most widely used D-PRA methodologies to perform safety assessment of Nuclear Power Plants (NPP). In the past two years, the Idaho National Laboratory (INL) has developed its own tool to perform Dynamic PRA: RAVEN (Reactor Analysis and Virtual control ENvironment). RAVEN has been designed to perform two main tasks: 1) control logic driver for the new Thermo-Hydraulic code RELAP-7 and 2) post-processing tool. In the first task, RAVEN acts as a deterministic controller in which the set of control logic laws (user defined) monitors the RELAP-7 simulation and controls the activation of specific systems. Moreover, the control logic infrastructure is used to model stochastic events, such as components failures, and perform uncertainty propagation. Such stochastic modeling is deployed using both MC and DET algorithms. In the second task, RAVEN processes the large amount of data generated by RELAP-7 using data-mining based algorithms. This report focuses on the analysis of dynamic stochastic systems using the newly developed RAVEN DET capability. As an example, a DPRA analysis, using DET, of a simplified pressurized water reactor for a Station Black-Out (SBO) scenario is presented.
Application of hierarchical genetic models to Raven and WAIS subtests: a Dutch twin study.
Rijsdijk, Frühling V; Vernon, P A; Boomsma, Dorret I
2002-05-01
Hierarchical models of intelligence are highly informative and widely accepted. Application of these models to twin data, however, is sparse. This paper addresses the question of how a genetic hierarchical model fits the Wechsler Adult Intelligence Scale (WAIS) subtests and the Raven Standard Progressive test score, collected in 194 18-year-old Dutch twin pairs. We investigated whether first-order group factors possess genetic and environmental variance independent of the higher-order general factor and whether the hierarchical structure is significant for all sources of variance. A hierarchical model with the 3 Cohen group-factors (verbal comprehension, perceptual organisation and freedom-from-distractibility) and a higher-order g factor showed the best fit to the phenotypic data and to additive genetic influences (A), whereas the unique environmental source of variance (E) could be modeled by a single general factor and specifics. There was no evidence for common environmental influences. The covariation among the WAIS group factors and the covariation between the group factors and the Raven is predominantly influenced by a second-order genetic factor and strongly support the notion of a biological basis of g.
Krylov, Piotr
2017-01-01
This monograph is a comprehensive account of formal matrices, examining homological properties of modules over formal matrix rings and summarising the interplay between Morita contexts and K theory. While various special types of formal matrix rings have been studied for a long time from several points of view and appear in various textbooks, for instance to examine equivalences of module categories and to illustrate rings with one-sided non-symmetric properties, this particular class of rings has, so far, not been treated systematically. Exploring formal matrix rings of order 2 and introducing the notion of the determinant of a formal matrix over a commutative ring, this monograph further covers the Grothendieck and Whitehead groups of rings. Graduate students and researchers interested in ring theory, module theory and operator algebras will find this book particularly valuable. Containing numerous examples, Formal Matrices is a largely self-contained and accessible introduction to the topic, assuming a sol...
Coates, Peter S.; Howe, Kristy B.; Casazza, Michael L.; Delehanty, David J.
2014-01-01
Energy-related infrastructure and other human enterprises within sagebrush steppe of the American West often results in changes that promote common raven (Corvus corax; hereafter, raven) populations. Ravens, a generalist predator capable of behavioral innovation, present a threat to many species of conservation concern. We evaluate the effects of detailed features of an altered landscape on the probability of raven occurrence using extensive raven survey (n= 1045) and mapping data from southern Idaho, USA. We found nonlinear relationships between raven occurrence and distances to transmission lines, roads, and facilities. Most importantly, raven occurrence was greater with presence of transmission lines up to 2.2 km from the corridor.We further explain variation in raven occurrence along anthropogenic features based on the amount of non-native vegetation and cover type edge, such that ravens select fragmented sagebrush stands with patchy, exotic vegetative introgression. Raven occurrence also increased with greater length of edge formed by the contact of big sagebrush (Artemisia tridentate spp.) with non-native vegetation cover types. In consideration of increasing alteration of sagebrush steppe, these findings will be useful for planning energy transmission corridor placement and other management activities where conservation of sagebrush obligate species is a priority.
Parkinson's disease showing progressive conduction aphasia.
Sakai, Kenji; Ono, Kenjiro; Harada, Hiromi; Shima, Keisuke; Notoya, Masako; Yamada, Masahito
2012-04-01
Patients with Parkinson's disease (PD) may develop progressive dementia late in their clinical course. Dementia in PD is mostly related to neuropathological findings of extensive Lewy bodies (LBs), with or without the coexistence of Alzheimer's disease (AD) pathology. Aphasia has been reported in patients with LB diseases with AD pathology; however, there have been no reports of typical PD patients developing progressive aphasia during their clinical course. We describe a female PD patient who later developed progressive conduction aphasia characterized by phonemic paraphasia and disturbance in repetition of short sentences without disturbance in writing or auditory comprehension. No episodes of fluctuations of attention, memory complaints, or planning errors were observed. She experienced episodes of visual hallucination. Her low scores on the Mini-Mental State Examination suggested impairment of orientation and attention, and her scores on Raven's Coloured Progressive Matrices test indicated impaired visuospatial functions. However, her cognitive deficits were not sufficiently severe to impair her daily life. Brain magnetic resonance images revealed atrophy of the left superior temporal gyrus and widening of the left sylvian fissure. [(18)F]-fluorodeoxyglucose positron emission tomography revealed glucose hypometabolism in the left cerebral hemisphere. These findings may be related to conduction aphasia. During the progression of PD lesions, the brainstem LB is assumed to take an upward course, extend to the limbic system, and then extend to the neocortex. Conduction aphasia observed in our patient may be associated with an unusual progression of the LB pathology from the brainstem to the left temporoparietal lobe.
2013-01-01
El presente trabajo tiene como primer objetivo la presentación de los resultados obtenidos de una muestra parcial para la construcción de normas validas y actualizadas del Test de Matrices Progresivas de Raven, para las características de la población de la ciudad de La Plata; y luego realizar la comparación con las normas obtenidas anteriormente observando la tendencia dada. Se seleccionó una muestra de 420 sujetos de ambos sexos, con edades comprendidas entre los 13 y 18 años, alumnos de di...
REACTOR ANALYSIS AND VIRTUAL CONTROL ENVIRONMENT (RAVEN) FY12 REPORT
Cristian Rabiti; Andrea Alfonsi; Joshua Cogliati; Diego Mandelli; Robert Kinoshita
2012-09-01
RAVEN is a complex software tool that will have tasks spanning from being the RELAP-7 user interface, to using RELAP-7 to perform Risk Informed Safety Characterization (RISMC), and to controlling RELAP-7 calculation execution. The goal of this document is to: 1. Highlight the functional requirements of the different tasks of RAVEN 2. Identify shared functions that could be aggregate in modules so to obtain a minimal software redundancy and maximize software utilization. RAVEN is in fact a software framework that will allow exploiting the following functionalities: • Derive and actuate the control logic required to: o Simulate the plant control system o Simulate the operator (procedure guided) actions o Perform Monte Carlo sampling of random distributed events o Perform event three based analysis • Provide a GUI to: o Input a plant description to RELAP-7 (component, control variable, control parameters) o Concurrent monitoring of Control Parameters o Concurrent alteration of control parameters • Provide Post Processing data mining capability based on o Dimensionality reduction o Cardinality reduction In this document it will be shown how an appropriate mathematical formulation of the control logic and probabilistic analysis leads to have most of the software infrastructure leveraged between the two main tasks. Further, this document will go through the development accomplished this year, including simulation results, and priorities for the next years development
Coates, Peter S.; Brussee, Brianne E.; Howe, Kristy; Gustafson, K. Ben; Casazza, Michael L.; Delehanty, David J.
2016-01-01
Common raven (Corvus corax; hereafter, raven) population abundance in the sagebrush steppe of the American West has increased threefold during the previous four decades, largely as a result of unintended resource subsidies from human land-use practices. This is concerning because ravens frequently depredate nests of species of conservation concern, such as greater sage-grouse (Centrocercus urophasianus; hereafter, sage-grouse). Grazing by livestock in sagebrush ecosystems is common practice on most public lands, but associations between livestock and ravens are poorly understood. The primary objective of this study was to identify the effects of livestock on raven occurrence while accounting for landscape characteristics within human-altered sagebrush steppe habitat, particularly in areas occupied by breeding sage-grouse. Using data from southeastern Idaho collected during spring and summer across 3 yr, we modeled raven occurrence as a function of the presence of livestock while accounting for multiple landscape covariates, including land cover features, topographical features, and proximity to sage-grouse lek sites (breeding grounds), as well as site-level anthropogenic features. While accounting for landscape characteristics, we found that the odds of raven occurrence increased 45.8% in areas where livestock were present. In addition, ravens selected areas near sage-grouse leks, with the odds of occurrence decreasing 8.9% for every 1-km distance, increase away from the lek. We did not find an association between livestock use and distance to lek. We also found that ravens selected sites with relatively lower elevation containing increased amounts of cropland, wet meadow, and urbanization. Limiting raven access to key anthropogenic subsidies and spatially segregating livestock from sage-grouse breeding areas would likely reduce exposure of predatory ravens to sage-grouse nests and chicks.
Analysis of the Space Propulsion System Problem Using RAVEN
diego mandelli; curtis smith; cristian rabiti; andrea alfonsi
2014-06-01
This paper presents the solution of the space propulsion problem using a PRA code currently under development at Idaho National Laboratory (INL). RAVEN (Reactor Analysis and Virtual control ENviroment) is a multi-purpose Probabilistic Risk Assessment (PRA) software framework that allows dispatching different functionalities. It is designed to derive and actuate the control logic required to simulate the plant control system and operator actions (guided procedures) and to perform both Monte- Carlo sampling of random distributed events and Event Tree based analysis. In order to facilitate the input/output handling, a Graphical User Interface (GUI) and a post-processing data-mining module are available. RAVEN allows also to interface with several numerical codes such as RELAP5 and RELAP-7 and ad-hoc system simulators. For the space propulsion system problem, an ad-hoc simulator has been developed and written in python language and then interfaced to RAVEN. Such simulator fully models both deterministic (e.g., system dynamics and interactions between system components) and stochastic behaviors (i.e., failures of components/systems such as distribution lines and thrusters). Stochastic analysis is performed using random sampling based methodologies (i.e., Monte-Carlo). Such analysis is accomplished to determine both the reliability of the space propulsion system and to propagate the uncertainties associated to a specific set of parameters. As also indicated in the scope of the benchmark problem, the results generated by the stochastic analysis are used to generate risk-informed insights such as conditions under witch different strategy can be followed.
Effects of anthropogenic developments on common raven nesting biology in the West Mojave Desert.
Kristan, William B; Boarman, William I
2007-09-01
Subsidized predators may affect prey abundance, distribution, and demography. Common Ravens (Corvus corax) are anthropogenically subsidized throughout their range and, in the Mojave Desert, have increased in number dramatically over the last 3-4 decades. Human-provided food resources are thought to be important drivers of raven population growth, but human developments add other features as well, such as nesting platforms. From 1996 to 2000, we examined the nesting ecology of ravens in the Mojave Desert, relative to anthropogenic developrhent. Ravens nested disproportionately near point sources of food and water subsidies (such as towns, landfills, and ponds) but not near roads (sources of road-killed carrion), even though both sources of subsidy enhanced fledging success. Initiation of breeding activity was more likely when a nest from the previous year was present at the start of a breeding season but was not affected by access to food. The relative effect of environmental modifications on fledging success varied from year to year, but the effect of access to human-provided resources was comparatively consistent, suggesting that humans provide consistently high-quality breeding habitat for ravens. Anthropogenic land cover types in the desert are expected to promote raven population growth and to allow ravens to occupy parts of the desert that otherwise would not support them. Predatory impacts of ravens in the Mojave Desert can therefore be considered indirect effects of anthropogenic development.
Effects of anthropogenic developments on common Raven nesting biology in the west Mojave Desert
Kristan, W. B.; Boarman, W.I.
2007-01-01
Subsidized predators may affect prey abundance, distribution, and demography. Common Ravens (Corvus corax) are anthropogenically subsidized throughout their range and, in the Mojave Desert, have increased in number dramatically over the last 3-4 decades. Human-provided food resources are thought to be important drivers of raven population growth, but human developments add other features as well, such as nesting platforms. From 1996 to 2000, we examined the nesting ecology of ravens in the Mojave Desert, relative to anthropogenic development. Ravens nested disproportionately near point sources of food and water subsidies (such as towns, landfills, and ponds) but not near roads (sources of road-killed carrion), even though both sources of subsidy enhanced fledging success. Initiation of breeding activity was more likely when a nest from the previous year was present at the start of a breeding season but was not affected by access to food. The relative effect of environmental modifications on fledging success varied from year to year, but the effect of access to humanprovided resources was comparatively consistent, suggesting that humans provide consistently high-quality breeding habitat for ravens. Anthropogenic land cover types in the desert are expected to promote raven population growth and to allow ravens to occupy parts of the desert that otherwise would not support them. Predatory impacts of ravens in the Mojave Desert can therefore be considered indirect effects of anthropogenic development. ?? 2007 by the Ecological Society of America.
Inverse m-matrices and ultrametric matrices
Dellacherie, Claude; San Martin, Jaime
2014-01-01
The study of M-matrices, their inverses and discrete potential theory is now a well-established part of linear algebra and the theory of Markov chains. The main focus of this monograph is the so-called inverse M-matrix problem, which asks for a characterization of nonnegative matrices whose inverses are M-matrices. We present an answer in terms of discrete potential theory based on the Choquet-Deny Theorem. A distinguished subclass of inverse M-matrices is ultrametric matrices, which are important in applications such as taxonomy. Ultrametricity is revealed to be a relevant concept in linear algebra and discrete potential theory because of its relation with trees in graph theory and mean expected value matrices in probability theory. Remarkable properties of Hadamard functions and products for the class of inverse M-matrices are developed and probabilistic insights are provided throughout the monograph.
On-sky MOAO performance evaluation of RAVEN
Ono, Y. H.; Correia, Carlos M.; Lardière, O.; Andersen, D. R.; Oya, S.; Akiyama, M.; Gamroth, D.; Jackson, K.; Martin, O.; Bradley, C.
2016-07-01
This paper presents the AO performance we got on-sky with RAVEN, a Multi-Object Adaptive Optics (MOAO) technical and science demonstrator installed and tested at the Subaru telescope. We report Ensquared-Energy (EE) and Full Width at Half Maximum (FWHM) measured from science images on Subaru's IRCS taken during all of the on-sky observing runs. We show these metrics as function of different AO modes and atmospheric conditions for two asterisms of natural guide stars. The performances of the MOAO and Ground-Layer AO (GLAO) modes are between the classical Single-Conjugate AO (SCAO) and seeing-limited modes. We achieve the EE of 30% in H-band with the MOAO correction, which is a science requirement for RAVEN. The MOAO provides sightly better performance than the GLAO mode in both asterisms. One of the reasons which cause this small difference between the MOAO and GLAO modes may be the strong GL contribution. Also, the performance of the MOAO modes is affected by the accuracy of the on-sky turbulence profiling by the SLOpe Detection And Ranging (SLODAR) method.
An Exploration of Play Behaviors in Raven Nestlings
Mathias Osvath
2014-05-01
Full Text Available Play is widespread among vertebrates. Some animal groups stand out in their play behaviors in levels of complexity, innovativeness, sociality, and volume. Despite the vast phylogenetic distance between corvids, parrots, great apes, and dolphins, all are usually identified as among the most playful. These groups also have several complex cognitive skills in common. There is growing agreement that play has evolved multiple times under different selective pressures in different lineages. As these groups appear similar in their complex play but are separated by considerable evolutionary distance, the similarity is unlikely to result from homology. Far more probable is that the similarity has arisen from convergent or parallel evolution. It is important to conduct comparative ontogenetic play studies on these groups to learn more about what basic processes underlie complex play and whether such play is, indeed, related to complex cognition. Toward that end, we explored the play behavior of raven nestlings over the last ten days before they fledged. We found high levels of play both in terms of instances initiated and duration. The play behaviors were at level with – or above – maintenance behaviors and flight training. Most of the play was object play, but social object play and apparent play contagion was also recorded. The importance of play in developing young ravens is clear. The reasons might be less clear, however play could underlie both object-related and social development.
Tomography and calibration for Raven: from simulations to laboratory results
Jackson, Kate; Correia, Carlos; Lardière, Olivier; Andersen, Dave; Bradley, Colin; Pham, Laurie; Blain, Célia; Nash, Reston; Gamroth, Darryl; Véran, Jean-Pierre
2014-07-01
This paper discusses static and dynamic tomographic wave-front (WF) reconstructors tailored to Multi-Object Adaptive Optics (MOAO) for Raven, the first MOAO science and technology demonstrator recently installed on an 8m telescope. We show the results of a new minimum mean- square error (MMSE) solution based on spatio-angular (SA) correlation functions, which extends previous work in Correia et al, JOSA-A 20131 to adopt a zonal representation of the wave-front and its associated signals. This solution is outlined for the static reconstruction and then extended for the use of stand-alone temporal prediction and as a prediction model in a pupil plane based Linear Quadratic Gaussian (LQG) algorithm. We have fully tested our algorithms in the lab and compared the results to simulations of the Raven system. These simulations have shown that an increase in limiting magnitude of up to one magnitude can be expected when prediction is implemented and up to two magnitudes when the LQG is used.
Zyczkowski, Karol [Centrum Fizyki Teoretycznej, Polska Akademia Nauk, Al. Lotnikow 32/44, 02-668 Warsaw (Poland); Kus, Marek [Centrum Fizyki Teoretycznej, Polska Akademia Nauk, Al. Lotnikow 32/44, 02-668 Warsaw (Poland); Slomczynski, Wojciech [Instytut Matematyki, Uniwersytet Jagiellonski, ul. Reymonta 4, 30-059 Cracow (Poland); Sommers, Hans-Juergen [Fachbereich 7 Physik, Universitaet Essen, 45117 Essen (Germany)
2003-03-28
An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U(N) (or O(N)). An ensemble of symmetric unistochastic matrices is obtained with use of unitary symmetric matrices pertaining to the circular orthogonal ensemble. We study the distribution of complex eigenvalues of bistochastic, unistochastic and orthostochastic matrices in the complex plane. We compute averages (entropy, traces) over the ensembles of unistochastic matrices and present inequalities concerning the entropies of products of bistochastic matrices.
Zyczkowski, K.; Slomczynski, W.; Kus, M.; Sommers, H. -J.
2001-01-01
An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U(N) (or O(N), respectively). An ensemble of symmetric unistochastic matrices is obtained with use of unitary symmetric matrices pertaining to the circular orthogonal ensemble. We study the distribution of complex eigenvalues of bistochastic, unistochastic and ortostochastic matrices in the complex p...
Observations of territorial breeding common ravens caching eggs of greater sage-grouse
Howe, Kristy B.; Coates, Peter S.
2015-01-01
Previous investigations using continuous video monitoring of greater sage-grouse Centrocercus urophasianus nests have unambiguously identified common ravens Corvus corax as an important egg predator within the western United States. The quantity of greater sage-grouse eggs an individual common raven consumes during the nesting period and the extent to which common ravens actively hunt greater sage-grouse nests are largely unknown. However, some evidence suggests that territorial breeding common ravens, rather than nonbreeding transients, are most likely responsible for nest depredations. We describe greater sage-grouse egg depredation observations obtained opportunistically from three common raven nests located in Idaho and Nevada where depredated greater sage-grouse eggs were found at or in the immediate vicinity of the nest site, including the caching of eggs in nearby rock crevices. We opportunistically monitored these nests by counting and removing depredated eggs and shell fragments from the nest sites during each visit to determine the extent to which the common raven pairs preyed on greater sage-grouse eggs. To our knowledge, our observations represent the first evidence that breeding, territorial pairs of common ravens cache greater sage-grouse eggs and are capable of depredating multiple greater sage-grouse nests.
Free probability and random matrices
Mingo, James A
2017-01-01
This volume opens the world of free probability to a wide variety of readers. From its roots in the theory of operator algebras, free probability has intertwined with non-crossing partitions, random matrices, applications in wireless communications, representation theory of large groups, quantum groups, the invariant subspace problem, large deviations, subfactors, and beyond. This book puts a special emphasis on the relation of free probability to random matrices, but also touches upon the operator algebraic, combinatorial, and analytic aspects of the theory. The book serves as a combination textbook/research monograph, with self-contained chapters, exercises scattered throughout the text, and coverage of important ongoing progress of the theory. It will appeal to graduate students and all mathematicians interested in random matrices and free probability from the point of view of operator algebras, combinatorics, analytic functions, or applications in engineering and statistical physics.
Advanced probabilistic risk analysis using RAVEN and RELAP-7
Rabiti, Cristian [Idaho National Lab. (INL), Idaho Falls, ID (United States); Alfonsi, Andrea [Idaho National Lab. (INL), Idaho Falls, ID (United States); Mandelli, Diego [Idaho National Lab. (INL), Idaho Falls, ID (United States); Cogliati, Joshua [Idaho National Lab. (INL), Idaho Falls, ID (United States); Kinoshita, Robert [Idaho National Lab. (INL), Idaho Falls, ID (United States)
2014-06-01
RAVEN, under the support of the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program [1], is advancing its capability to perform statistical analyses of stochastic dynamic systems. This is aligned with its mission to provide the tools needed by the Risk Informed Safety Margin Characterization (RISMC) path-lead [2] under the Department Of Energy (DOE) Light Water Reactor Sustainability program [3]. In particular this task is focused on the synergetic development with the RELAP-7 [4] code to advance the state of the art on the safety analysis of nuclear power plants (NPP). The investigation of the probabilistic evolution of accident scenarios for a complex system such as a nuclear power plant is not a trivial challenge. The complexity of the system to be modeled leads to demanding computational requirements even to simulate one of the many possible evolutions of an accident scenario (tens of CPU/hour). At the same time, the probabilistic analysis requires thousands of runs to investigate outcomes characterized by low probability and severe consequence (tail problem). The milestone reported in June of 2013 [5] described the capability of RAVEN to implement complex control logic and provide an adequate support for the exploration of the probabilistic space using a Monte Carlo sampling strategy. Unfortunately the Monte Carlo approach is ineffective with a problem of this complexity. In the following year of development, the RAVEN code has been extended with more sophisticated sampling strategies (grids, Latin Hypercube, and adaptive sampling). This milestone report illustrates the effectiveness of those methodologies in performing the assessment of the probability of core damage following the onset of a Station Black Out (SBO) situation in a boiling water reactor (BWR). The first part of the report provides an overview of the available probabilistic analysis capabilities, ranging from the different types of distributions available, possible sampling
Brains, tools, innovation and biogeography in crows and ravens
Jønsson, Knud Andreas; Fabre, Pierre-Henri Fréderic; Irestedt, Martin
2012-01-01
alone does not explain tool use, innovative feeding strategies and dispersal success within crows.CONCLUSIONS:Our study supports monophyly of the genus Corvus and further demonstrates the direction and timing of colonization from the area of origin in the Palaearctic to other continents and archipelagos......BACKGROUND:Crows and ravens (Passeriformes: Corvus) are large-brained birds with enhanced cognitive abilities relative to other birds. They are among the few non-hominid organisms on Earth to be considered intelligent and well-known examples exist of several crow species having evolved innovative...... in applying tools when foraging and (ii) has some correlative role in the success of colonization of islands. Our results demonstrate that crows originated in the Palaearctic in the Miocene from where they dispersed to North America and the Caribbean, Africa and Australasia. We find that relative brain size...
Brains, tools, innovation and biogeography in crows and ravens.
Jønsson, Knud A; Fabre, Pierre-Henri; Irestedt, Martin
2012-05-29
Crows and ravens (Passeriformes: Corvus) are large-brained birds with enhanced cognitive abilities relative to other birds. They are among the few non-hominid organisms on Earth to be considered intelligent and well-known examples exist of several crow species having evolved innovative strategies and even use of tools in their search for food. The 40 Corvus species have also been successful dispersers and are distributed on most continents and in remote archipelagos. This study presents the first molecular phylogeny including all species and a number of subspecies within the genus Corvus. We date the phylogeny and determine ancestral areas to investigate historical biogeographical patterns of the crows. Additionally, we use data on brain size and a large database on innovative behaviour and tool use to test whether brain size (i) explains innovative behaviour and success in applying tools when foraging and (ii) has some correlative role in the success of colonization of islands. Our results demonstrate that crows originated in the Palaearctic in the Miocene from where they dispersed to North America and the Caribbean, Africa and Australasia. We find that relative brain size alone does not explain tool use, innovative feeding strategies and dispersal success within crows. Our study supports monophyly of the genus Corvus and further demonstrates the direction and timing of colonization from the area of origin in the Palaearctic to other continents and archipelagos. The Caribbean was probably colonized from North America, although some North American ancestor may have gone extinct, and the Pacific was colonized multiple times from Asia and Australia. We did not find a correlation between relative brain size, tool use, innovative feeding strategies and dispersal success. Hence, we propose that all crows and ravens have relatively large brains compared to other birds and thus the potential to be innovative if conditions and circumstances are right.
GENERALIZED NEKRASOV MATRICES AND APPLICATIONS
Mingxian Pang; Zhuxiang Li
2003-01-01
In this paper, the concept of generalized Nekrasov matrices is introduced, some properties of these matrices are discussed, obtained equivalent representation of generalized diagonally dominant matrices.
Introduction into Hierarchical Matrices
Litvinenko, Alexander
2013-12-05
Hierarchical matrices allow us to reduce computational storage and cost from cubic to almost linear. This technique can be applied for solving PDEs, integral equations, matrix equations and approximation of large covariance and precision matrices.
P.E. Lederle
1998-05-08
In response to the Nuclear Waste Policy Act of 1982 and the Nuclear Waste Policy Amendments Act of 1987, the U.S. Department of Energy (DOE) developed and is implementing the Yucca Mountain Site Characterization Project. Raven abundance was measured from August 1991 through August 1995 along treatment and control routes to evaluate whether site characterization activities resulted in increased raven abundance at Yucca Mountain. This study fulfills the requirement set forth in the incidental take provisions of the Biological Opinion that DOE monitor the abundance of ravens at Yucca Mountain. Ravens were more abundant at Yucca Mountain than in the control area, and raven abundance in both areas increased over time. However, the magnitude of differences between Yucca Mountain and control surveys did not change over time, indicating that the increase in raven abundance observed during this study was not related to site characterization activities. Increases over time on both Yucca Mountain and control routes are consistent with increases in raven abundance in the Mojave Desert reported by the annual Breeding Bird Survey of the US. Fish and Wildlife Service. Evidence from the Desert Tortoise Monitoring Program at Yucca Mountain suggests that ravens are not a significant predator of small tortoises in this locale. Carcasses of small tortoises (less than 110 mm in length) collected during the study showed little evidence of raven predation, and 59 radiomarked hatchlings that were monitored on a regular basis were not preyed upon by ravens. Overall, no direct evidence of raven predation on tortoises was observed during this study. Small tortoises are probably encountered so infrequently by ravens that they are rarely exploited as a food source. This is likely due to the relatively low abundance of both desert tortoises and ravens in the Yucca Mountain area.
BLOCK H-MATRICES AND SPECTRUM OF BLOCK MATRICES
黄廷祝; 黎稳
2002-01-01
The block H-matrices are studied by the concept of G-functions, several concepts of block matrices are introduced. Equivalent characters of block H-matrices are obtained. Spectrum localizations claracterized by Gfunctions for block matrices are got.
MATHEMATICAL FRAMEWORK FOR THE ANALYSIS OF DYNAMC STOCHASTIC SYSTEMS WITH THE RAVEN CODE
C. Rabiti; D. Mandelli; J. Cogliati; R. Kinoshita
2013-05-01
RAVEN (Reactor Analysis and Virtual control Environment) is a software code under development at Idaho National Laboratory aimed at performing probabilistic risk assessment and uncertainty quantification using RELAP-7, for which it acts also as a simulation controller. In this paper we will present the equations characterizing a dynamic stochastic system and we will then discuss the behavior of each stochastic term and how it is accounted for in the RAVEN software design. Moreover we will present preliminary results of the implementation.
Circulant conference matrices for new complex Hadamard matrices
Dita, Petre
2011-01-01
The circulant real and complex matrices are used to find new real and complex conference matrices. With them we construct Sylvester inverse orthogonal matrices by doubling the size of inverse complex conference matrices. When the free parameters take values on the unit circle the inverse orthogonal matrices transform into complex Hadamard matrices. The method is used for $n=6$ conference matrices and in this way we find new parametrisations of Hadamard matrices for dimension $ n=12$.
Fission-fusion dynamics over large distances in raven non-breeders.
Loretto, Matthias-Claudio; Schuster, Richard; Itty, Christian; Marchand, Pascal; Genero, Fulvio; Bugnyar, Thomas
2017-03-23
The influence of fission-fusion dynamics, i.e., temporal variation in group size and composition, on social complexity has been studied in large-brained mammals that rely on social bonds. Little is known about birds, even though some species like ravens have recently received attention for their socio-cognitive skills and use of social bonds. While raven breeders defend territories year-round, non-breeders roam through large areas and form groups at food sources or night roosts. We here examined the fission-fusion patterns of non-breeding ravens over years, investigating whether birds meet repeatedly either at the same or at different locations. We combined four large datasets: presence-absence observations from two study sites (Austria, Italy) and GPS-tracking of ravens across two study areas (Austria, France). As expected, we found a highly dynamic system in which individuals with long phases of temporary settlement had a high probability of meeting others. Although GPS-tagged ravens spread out over thousands of square kilometres, we found repeated associations between almost half of the possible combinations at different locations. Such a system makes repeated interactions between individuals at different sites possible and likely. High fission-fusion dynamics may thus not hinder but shape the social complexity of ravens and, possibly, other long-term bonded birds.
Mandelli, Diego; Rabiti, Cristian; Cogliati, Joshua; Alfonsi, Andrea; Askin Guler; Tunc Aldemir
2014-11-01
environment such as RELAP-7. • Identify the risk-significant passive components, their failure modes and anticipated rates of degradation • Incorporate surveillance and maintenance activities and their effects into the plant state and into component aging progress. • Asses aging affects in a dynamic simulation environment 1. C. L. SMITH, V. N. SHAH, T. KAO, G. APOSTOLAKIS, “Incorporating Ageing Effects into Probabilistic Risk Assessment –A Feasibility Study Utilizing Reliability Physics Models,” NUREG/CR-5632, USNRC, (2001). 2. T. ALDEMIR, “A Survey of Dynamic Methodologies for Probabilistic Safety Assessment of Nuclear Power Plants, Annals of Nuclear Energy, 52, 113-124, (2013). 3. C. RABITI, A. ALFONSI, J. COGLIATI, D. MANDELLI and R. KINOSHITA “Reactor Analysis and Virtual Control Environment (RAVEN) FY12 Report,” INL/EXT-12-27351, (2012). 4. D. ANDERS et.al, "RELAP-7 Level 2 Milestone Report: Demonstration of a Steady State Single Phase PWR Simulation with RELAP-7," INL/EXT-12-25924, (2012).
Cappellini, Valerio [' Mark Kac' Complex Systems Research Centre, Uniwersytet Jagiellonski, ul. Reymonta 4, 30-059 Krakow (Poland); Sommers, Hans-Juergen [Fachbereich Physik, Universitaet Duisburg-Essen, Campus Duisburg, 47048 Duisburg (Germany); Bruzda, Wojciech; Zyczkowski, Karol [Instytut Fizyki im. Smoluchowskiego, Uniwersytet Jagiellonski, ul. Reymonta 4, 30-059 Krakow (Poland)], E-mail: valerio@ictp.it, E-mail: h.j.sommers@uni-due.de, E-mail: w.bruzda@uj.edu.pl, E-mail: karol@cft.edu.pl
2009-09-11
Ensembles of random stochastic and bistochastic matrices are investigated. While all columns of a random stochastic matrix can be chosen independently, the rows and columns of a bistochastic matrix have to be correlated. We evaluate the probability measure induced into the Birkhoff polytope of bistochastic matrices by applying the Sinkhorn algorithm to a given ensemble of random stochastic matrices. For matrices of order N = 2 we derive explicit formulae for the probability distributions induced by random stochastic matrices with columns distributed according to the Dirichlet distribution. For arbitrary N we construct an initial ensemble of stochastic matrices which allows one to generate random bistochastic matrices according to a distribution locally flat at the center of the Birkhoff polytope. The value of the probability density at this point enables us to obtain an estimation of the volume of the Birkhoff polytope, consistent with recent asymptotic results.
Cappellini, V; Bruzda, W; Zyczkowski, K
2009-01-01
Ensembles of random stochastic and bistochastic matrices are investigated. While all columns of a random stochastic matrix can be chosen independently, the rows and columns of a bistochastic matrix have to be correlated. We evaluate the probability measure induced into the Birkhoff polytope of bistochastic matrices by applying the Sinkhorn algorithm to a given ensemble of random stochastic matrices. For matrices of order N=2 we derive explicit formulae for the probability distributions induced by random stochastic matrices with columns distributed according to the Dirichlet distribution. For arbitrary $N$ we construct an initial ensemble of stochastic matrices which allows one to generate random bistochastic matrices according to a distribution locally flat at the center of the Birkhoff polytope. The value of the probability density at this point enables us to obtain an estimation of the volume of the Birkhoff polytope, consistent with recent asymptotic results.
Complex Hadamard matrices from Sylvester inverse orthogonal matrices
Dita, Petre
2009-01-01
A novel method to obtain parametrizations of complex inverse orthogonal matrices is provided. These matrices are natural generalizations of complex Hadamard matrices which depend on non zero complex parameters. The method we use is via doubling the size of inverse complex conference matrices. When the free parameters take values on the unit circle the inverse orthogonal matrices transform into complex Hadamard matrices, and in this way we find new parametrizations of Hadamard matrices for dim...
Matrices and linear transformations
Cullen, Charles G
1990-01-01
""Comprehensive . . . an excellent introduction to the subject."" - Electronic Engineer's Design Magazine.This introductory textbook, aimed at sophomore- and junior-level undergraduates in mathematics, engineering, and the physical sciences, offers a smooth, in-depth treatment of linear algebra and matrix theory. The major objects of study are matrices over an arbitrary field. Contents include Matrices and Linear Systems; Vector Spaces; Determinants; Linear Transformations; Similarity: Part I and Part II; Polynomials and Polynomial Matrices; Matrix Analysis; and Numerical Methods. The first
A Simple Cocyclic Jacket Matrices
Moon Ho Lee
2008-01-01
Full Text Available We present a new class of cocyclic Jacket matrices over complex number field with any size. We also construct cocyclic Jacket matrices over the finite field. Such kind of matrices has close relation with unitary matrices which are a first hand tool in solving many problems in mathematical and theoretical physics. Based on the analysis of the relation between cocyclic Jacket matrices and unitary matrices, the common method for factorizing these two kinds of matrices is presented.
Short-term observational spatial memory in Jackdaws (Corvus monedula) and Ravens (Corvus corax).
Scheid, Christelle; Bugnyar, Thomas
2008-10-01
Observational spatial memory (OSM) refers to the ability of remembering food caches made by other individuals, enabling observers to find and pilfer the others' caches. Within birds, OSM has only been demonstrated in corvids, with more social species such as Mexican jays (Aphelocoma ultramarine) showing a higher accuracy of finding conspecific' caches than less social species such as Clark's nutcrackers (Nucifraga columbiana). However, socially dynamic corvids such as ravens (Corvus corax) are capable of sophisticated pilfering manoeuvres based on OSM. We here compared the performance of ravens and jackdaws (Corvus monedula) in a short-term OSM task. In contrast to ravens, jackdaws are socially cohesive but hardly cache and compete over food caches. Birds had to recover food pieces after watching a human experimenter hiding them in 2, 4 or 6 out of 10 possible locations. Results showed that for tests with two, four and six caches, ravens performed more accurately than expected by chance whereas jackdaws did not. Moreover, ravens made fewer re-visits to already inspected cache sites than jackdaws. These findings suggest that the development of observational spatial memory skills is linked with the species' reliance on food caches rather than with a social life style per se.
On greedy and submodular matrices
Faigle, U.; Kern, Walter; Peis, Britta; Marchetti-Spaccamela, Alberto; Segal, Michael
2011-01-01
We characterize non-negative greedy matrices, i.e., 0-1 matrices $A$ such that max $\\{c^Tx|Ax \\le b,\\,x \\ge 0\\}$ can be solved greedily. We identify submodular matrices as a special subclass of greedy matrices. Finally, we extend the notion of greediness to $\\{-1,0,+1\\}$-matrices. We present
Gaussian Fibonacci Circulant Type Matrices
Zhaolin Jiang
2014-01-01
Full Text Available Circulant matrices have become important tools in solving integrable system, Hamiltonian structure, and integral equations. In this paper, we prove that Gaussian Fibonacci circulant type matrices are invertible matrices for n>2 and give the explicit determinants and the inverse matrices. Furthermore, the upper bounds for the spread on Gaussian Fibonacci circulant and left circulant matrices are presented, respectively.
Poe, between cinema and literature: an intermedial reading of The Raven
Caio Antônio de Medeiros Nóbrega Nunes Gomes
2017-01-01
In The Raven (2012, film directed by James McTeigue, in addition to having Edgar Allan Poe as protagonist and allusions to many of his texts, the relation between cinema and literature is deepened by the presence of issues regarding the medium of literature and its materiality, sociality and economy. This article proposes an intermedial reading of The Raven, aiming to investigate the process of intermedial referencing accomplished by the cinema in relation to literature. Our analysis is supported by theoretical principles drawn especially from Rajewski (2012 and Moser (2006. Finally, two conclusions were established: i. the film, while making the literary medium opaque, concealed its own audiovisual mediality; ii. The Raven associates itself to a series of discourses concerning the contemporary relevance of the American author, contributing to the consolidation of Edgar Allan Poe as a cultural signifier.
Justino, Júlia
2017-06-01
Matrices with coefficients having uncertainties of type o (.) or O (.), called flexible matrices, are studied from the point of view of nonstandard analysis. The uncertainties of the afore-mentioned kind will be given in the form of the so-called neutrices, for instance the set of all infinitesimals. Since flexible matrices have uncertainties in their coefficients, it is not possible to define the identity matrix in an unique way and so the notion of spectral identity matrix arises. Not all nonsingular flexible matrices can be turned into a spectral identity matrix using Gauss-Jordan elimination method, implying that that not all nonsingular flexible matrices have the inverse matrix. Under certain conditions upon the size of the uncertainties appearing in a nonsingular flexible matrix, a general theorem concerning the boundaries of its minors is presented which guarantees the existence of the inverse matrix of a nonsingular flexible matrix.
On the tensor Permutation Matrices
Rakotonirina, Christian
2011-01-01
A property that tensor permutation matrices permutate tensor product of rectangle matrices is shown. Some examples, in the particular case of tensor commutation matrices, for studying some linear matricial equations are given.
Britz, Thomas
Bipartite graphs and digraphs are used to describe algebraic operations on a free matrix, including Moore-Penrose inversion, finding Schur complements, and normalized LU factorization. A description of the structural properties of a free matrix and its Moore-Penrose inverse is proved, and necessa...... and sufficient conditions are given for the Moore-Penrose inverse of a free matrix to be free. Several of these results are generalized with respect to a family of matrices that contains both the free matrices and the nearly reducible matrices....
Britz, Thomas
Bipartite graphs and digraphs are used to describe algebraic operations on a free matrix, including Moore-Penrose inversion, finding Schur complements, and normalized LU factorization. A description of the structural properties of a free matrix and its Moore-Penrose inverse is proved, and necessa...... and sufficient conditions are given for the Moore-Penrose inverse of a free matrix to be free. Several of these results are generalized with respect to a family of matrices that contains both the free matrices and the nearly reducible matrices....
Narendra Singh
2003-01-01
Assuming a relation between the quark mass matrices of the two sectors a unique solution can be obtained for the CKM ﬂavor mixing matrix. A numerical example is worked out which is in excellent agreement with experimental data.
Strube, Matthew; Henry, Ross; Skeleton, Eugene; Eepoel, John Van; Gill, Nat; McKenna, Reed
2015-01-01
Since the last Hubble Servicing Mission five years ago, the Satellite Servicing Capabilities Office (SSCO) at the NASA Goddard Space Flight Center (GSFC) has been focusing on maturing the technologies necessary to robotically service orbiting legacy assets-spacecraft not necessarily designed for in-flight service. Raven, SSCO's next orbital experiment to the International Space Station (ISS), is a real-time autonomous non-cooperative relative navigation system that will mature the estimation algorithms required for rendezvous and proximity operations for a satellite-servicing mission. Raven will fly as a hosted payload as part of the Space Test Program's STP-H5 mission, which will be mounted on an external ExPRESS Logistics Carrier (ELC) and will image the many visiting vehicles arriving and departing from the ISS as targets for observation. Raven will host multiple sensors: a visible camera with a variable field of view lens, a long-wave infrared camera, and a short-wave flash lidar. This sensor suite can be pointed via a two-axis gimbal to provide a wide field of regard to track the visiting vehicles as they make their approach. Various real-time vision processing algorithms will produce range, bearing, and six degree of freedom pose measurements that will be processed in a relative navigation filter to produce an optimal relative state estimate. In this overview paper, we will cover top-level requirements, experimental concept of operations, system design, and the status of Raven integration and test activities.
Mete, Aslı; Rogers, Krysta; Houston, Robin
2017-01-01
A hatch-year Common Raven ( Corvus corax ) with subcutaneous and internal pseudocysts, filled with fluid, containing a pair of adult trematodes and numerous eggs consistent with Collyriclum faba, died near a riverbank in California, US. While C. faba is incidental in many Passeriformes, this case was a fatal systemic infection.
Oak Ridge National Laboratory — The data are results of clinical necropsies of raptors and common ravens (Corvus corax) done in cooperation with pathologists at the Veterinary Teaching Hospital and...
U.S. Geological Survey, Department of the Interior — The data are results of clinical necropsies of raptors and common ravens (Corvus corax) done in cooperation with pathologists at the Veterinary Teaching Hospital and...
Matrices in Engineering Problems
Tobias, Marvin
2011-01-01
This book is intended as an undergraduate text introducing matrix methods as they relate to engineering problems. It begins with the fundamentals of mathematics of matrices and determinants. Matrix inversion is discussed, with an introduction of the well known reduction methods. Equation sets are viewed as vector transformations, and the conditions of their solvability are explored. Orthogonal matrices are introduced with examples showing application to many problems requiring three dimensional thinking. The angular velocity matrix is shown to emerge from the differentiation of the 3-D orthogo
Pruett, Christin L.; Wan, Leping; Li, Tianyu; Spern, Cory; Lance, Stacey L.; Glenn, Travis; Faircloth, Brant; Winker, Kevin
2015-01-01
Background A priority for conservation is the identification of endemic populations. We developed microsatellite markers for common raven (Corvus corax), a bird species with a Holarctic distribution, to identify and assess endemic populations in Alaska. Results From a total of 50 microsatellite loci, we isolated and characterized 15 loci. Eight of these loci were polymorphic and readily scoreable. Eighteen to 20 common ravens from Fairbanks, Alaska were genotyped showing the following variabi...
Infinite matrices and sequence spaces
Cooke, Richard G
2014-01-01
This clear and correct summation of basic results from a specialized field focuses on the behavior of infinite matrices in general, rather than on properties of special matrices. Three introductory chapters guide students to the manipulation of infinite matrices, covering definitions and preliminary ideas, reciprocals of infinite matrices, and linear equations involving infinite matrices.From the fourth chapter onward, the author treats the application of infinite matrices to the summability of divergent sequences and series from various points of view. Topics include consistency, mutual consi
RAVEN AS A TOOL FOR DYNAMIC PROBABILISTIC RISK ASSESSMENT: SOFTWARE OVERVIEW
Alfonsi Andrea; Mandelli Diego; Rabiti Cristian; Joshua Cogliati; Robert Kinoshita
2013-05-01
RAVEN is a software tool under development at the Idaho National Laboratory (INL) that acts as the control logic driver and post-processing tool for the newly developed Thermo-Hydraylic code RELAP- 7. The scope of this paper is to show the software structure of RAVEN and its utilization in connection with RELAP-7. A short overview of the mathematical framework behind the code is presented along with its main capabilities such as on-line controlling/monitoring and Monte-Carlo sampling. A demo of a Station Black Out PRA analysis of a simplified Pressurized Water Reactor (PWR) model is shown in order to demonstrate the Monte-Carlo and clustering capabilities.
What you see is what you get? Exclusion performances in ravens and keas.
Christian Schloegl
Full Text Available Among birds, corvids and parrots are prime candidates for advanced cognitive abilities. Still, hardly anything is known about cognitive similarities and dissimilarities between them. Recently, exclusion has gained increasing interest in comparative cognition. To select the correct option in an exclusion task, one option has to be rejected (or excluded and the correct option may be inferred, which raises the possibility that causal understanding is involved. However, little is yet known about its evolutionary history, as only few species, and mainly mammals, have been studied.We tested ravens and keas in a choice task requiring the search for food in two differently shaped tubes. We provided the birds with partial information about the content of one of the two tubes and asked whether they could use this information to infer the location of the hidden food and adjust their searching behaviour accordingly. Additionally, this setup allowed us to investigate whether the birds would appreciate the impact of the shape of the tubes on the visibility of food. The keas chose the baited tube more often than the ravens. However, the ravens applied the more efficient strategy, choosing by exclusion more frequently than the keas. An additional experiment confirmed this, indicating that ravens and keas either differ in their cognitive skills or that they apply them differently.To our knowledge, this is the first study to demonstrate that corvids and parrots may perform differently in cognitive tasks, highlighting the potential impact of different selection pressures on the cognitive evolution of these large-brained birds.
Ontogeny of Social Relations and Coalition Formation in Common Ravens (Corvus corax).
Loretto, Matthias-Claudio; Fraser, Orlaith N; Bugnyar, Thomas
The social intelligence hypothesis, originally developed for primates to explain their high intelligence and large relative brain size, assumes that challenges posed by social life in complex societies with many group members lead to the evolution of advanced cognitive abilities. In birds, pair-bonded species have larger brains than non-pair bonded species, indicating that the quality of social relationships better predicts social complexity than group size. Ravens are a long-term monogamous and territorial species, renowned for their sophisticated socio-cognitive skills and complex social relationships. Notably, during their early years they live in fission-fusion-like non-breeder societies in which social relationships could be of particular importance. Here we observed the development of dominance and affiliative relationships in 12 hand-raised captive ravens, examining the influence of age, sex and kinship on social interactions. Furthermore, we investigated at which developmental step a stable hierarchy emerged, whether third-party interventions played a role and how selectively birds intervened in others' conflicts. At 4-5 months post-fledging, we found an increase in socio-positive behaviour and a decrease in aggression, along with the establishment of a linear dominance rank hierarchy. In line with kin selection theory, siblings exhibited a greater degree of tolerance and engaged in more socio-positive behaviour. In their first few months, ravens frequently intervened in others' conflicts but supported mainly the aggressor; later on, their support became more selective towards kin and close social partners. These findings indicate that ravens engage in sophisticated social behaviours and form stable relationships already in their first year of life.
Introduction to matrices and vectors
Schwartz, Jacob T
2001-01-01
In this concise undergraduate text, the first three chapters present the basics of matrices - in later chapters the author shows how to use vectors and matrices to solve systems of linear equations. 1961 edition.
Miller, Rachael; Laskowski, Kate L; Schiestl, Martina; Bugnyar, Thomas; Schwab, Christine
2016-01-01
Consistent individual differences in behaviour, or 'personality', are likely to be influenced by development, social context, and species ecology, though few comparative, longitudinal studies exist. Here, we investigated the role of development and social context on personality variation in two identically reared, social corvids: common ravens and carrion crows. We repeatedly presented subjects with a variety of novel food and objects, while alone and in a primarily sibling subgroup, from fledging to sub-adulthood. We predicted that consistent individual differences would emerge later in development, and that conspecific presence would facilitate behavioural similarities. In contrast to our predictions, we found that individuals of both species were highly inconsistent in their behavioural responses throughout the development period. In line with our predictions, though in the ravens only, conspecific presence promoted behavioural similarities as individuals were strongly shaped by their subgroup, and it is likely that these effects were driven by social context rather than relatedness. We discuss these findings in relation to developmental steps and the role of social relations in these species. Overall, our findings highlight that these two species are highly adaptable in their behaviour, and the ravens in particular are strongly influenced by their social environment, which may facilitate cooperation and social learning.
Paraunitary matrices and group rings
Barry Hurley
2014-03-01
Full Text Available Design methods for paraunitary matrices from complete orthogonal sets of idempotents and related matrix structuresare presented. These include techniques for designing non-separable multidimensional paraunitary matrices. Properties of the structures are obtained and proofs given. Paraunitary matrices play a central role in signal processing, inparticular in the areas of filterbanks and wavelets.
Domcke, Valerie
2016-01-01
We study natural lepton mass matrices, obtained assuming the stability of physical flavour observables with respect to the variations of individual matrix elements. We identify all four possible stable neutrino textures from algebraic conditions on their entries. Two of them turn out to be uniquely associated to specific neutrino mass patterns. We then concentrate on the semi-degenerate pattern, corresponding to an overall neutrino mass scale within the reach of future experiments. In this context we show that i) the neutrino and charged lepton mixings and mass matrices are largely constrained by the requirement of stability, ii) naturalness considerations give a mild preference for the Majorana phase most relevant for neutrinoless double-beta decay, $\\alpha \\sim \\pi/2$, and iii) SU(5) unification allows to extend the implications of stability to the down quark sector. The above considerations would benefit from an experimental determination of the PMNS ratio $|U_{32}/U_{31}|$, i.e. of the Dirac phase $\\delta...
Bapat, Ravindra B
2014-01-01
This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...
Gil, José J; José, Ignacio San
2015-01-01
Singular Mueller matrices play an important role in polarization algebra and have peculiar properties that stem from the fact that either the medium exhibits maximum diattenuation and/or polarizance, or because its associated canonical depolarizer has the property of fully randomizing, the circular component (at least) of the states of polarization of light incident on it. The formal reasons for which the Mueller matrix M of a given medium is singular are systematically investigated, analyzed and interpreted in the framework of the serial decompositions and the characteristic ellipsoids of M. The analysis allows for a general classification and geometric representation of singular Mueller matrices, of potential usefulness to experimentalists dealing with such media.
Nanoceramic Matrices: Biomedical Applications
Willi Paul
2006-01-01
Full Text Available Natural bone consisted of calcium phosphate with nanometer-sized needle-like crystals of approximately 5-20 nm width by 60 nm length. Synthetic calcium phosphates and Bioglass are biocompatible and bioactive as they bond to bone and enhance bone tissue formation. This property is attributed to their similarity with the mineral phase of natural bone except its constituent particle size. Calcium phosphate ceramics have been used in dentistry and orthopedics for over 30 years because of these properties. Several studies indicated that incorporation of growth hormones into these ceramic matrices facilitated increased tissue regeneration. Nanophase calcium phosphates can mimic the dimensions of constituent components of natural tissues; can modulate enhanced osteoblast adhesion and resorption with long-term functionality of tissue engineered implants. This mini review discusses some of the recent developments in nanophase ceramic matrices utilized for bone tissue engineering.
On Random Correlation Matrices
1988-10-28
the spectral features of the resulting matrices are unknown. Method 2: Perturbation about a Mean This method is discussed by Marsaglia and Okin,10...complete regressor set. Finally, Marsaglia and Olkin (1984, Reference 10) give a rigorous mathematical description of Methods 2 through 4 described in the...short paper by Marsaglia 46 has a review of these early contributions, along with an improved method. More recent references are the pragmatic paper
Concentration for noncommutative polynomials in random matrices
2011-01-01
We present a concentration inequality for linear functionals of noncommutative polynomials in random matrices. Our hypotheses cover most standard ensembles, including Gaussian matrices, matrices with independent uniformly bounded entries and unitary or orthogonal matrices.
Schneider, Hans
1989-01-01
Linear algebra is one of the central disciplines in mathematics. A student of pure mathematics must know linear algebra if he is to continue with modern algebra or functional analysis. Much of the mathematics now taught to engineers and physicists requires it.This well-known and highly regarded text makes the subject accessible to undergraduates with little mathematical experience. Written mainly for students in physics, engineering, economics, and other fields outside mathematics, the book gives the theory of matrices and applications to systems of linear equations, as well as many related t
Universality of Covariance Matrices
Pillai, Natesh S
2011-01-01
We prove the universality of covariance matrices of the form $H_{N \\times N} = {1 \\over N} \\tp{X}X$ where $[X]_{M \\times N}$ is a rectangular matrix with independent real valued entries $[x_{ij}]$ satisfying $\\E \\,x_{ij} = 0$ and $\\E \\,x^2_{ij} = {1 \\over M}$, $N, M\\to \\infty$. Furthermore it is assumed that these entries have sub-exponential tails. We will study the asymptotics in the regime $N/M = d_N \\in (0,\\infty), \\lim_{N\\to \\infty}d_N \
M Wedderburn, J H
1934-01-01
It is the organization and presentation of the material, however, which make the peculiar appeal of the book. This is no mere compendium of results-the subject has been completely reworked and the proofs recast with the skill and elegance which come only from years of devotion. -Bulletin of the American Mathematical Society The very clear and simple presentation gives the reader easy access to the more difficult parts of the theory. -Jahrbuch über die Fortschritte der Mathematik In 1937, the theory of matrices was seventy-five years old. However, many results had only recently evolved from sp
Initial Probabilistic Evaluation of Reactor Pressure Vessel Fracture with Grizzly and Raven
Spencer, Benjamin [Idaho National Lab. (INL), Idaho Falls, ID (United States); Hoffman, William [Univ. of Idaho, Moscow, ID (United States); Sen, Sonat [Idaho National Lab. (INL), Idaho Falls, ID (United States); Rabiti, Cristian [Idaho National Lab. (INL), Idaho Falls, ID (United States); Dickson, Terry [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Bass, Richard [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2015-10-01
The Grizzly code is being developed with the goal of creating a general tool that can be applied to study a variety of degradation mechanisms in nuclear power plant components. The first application of Grizzly has been to study fracture in embrittled reactor pressure vessels (RPVs). Grizzly can be used to model the thermal/mechanical response of an RPV under transient conditions that would be observed in a pressurized thermal shock (PTS) scenario. The global response of the vessel provides boundary conditions for local models of the material in the vicinity of a flaw. Fracture domain integrals are computed to obtain stress intensity factors, which can in turn be used to assess whether a fracture would initiate at a pre-existing flaw. These capabilities have been demonstrated previously. A typical RPV is likely to contain a large population of pre-existing flaws introduced during the manufacturing process. This flaw population is characterized stastistically through probability density functions of the flaw distributions. The use of probabilistic techniques is necessary to assess the likelihood of crack initiation during a transient event. This report documents initial work to perform probabilistic analysis of RPV fracture during a PTS event using a combination of the RAVEN risk analysis code and Grizzly. This work is limited in scope, considering only a single flaw with deterministic geometry, but with uncertainty introduced in the parameters that influence fracture toughness. These results are benchmarked against equivalent models run in the FAVOR code. When fully developed, the RAVEN/Grizzly methodology for modeling probabilistic fracture in RPVs will provide a general capability that can be used to consider a wider variety of vessel and flaw conditions that are difficult to consider with current tools. In addition, this will provide access to advanced probabilistic techniques provided by RAVEN, including adaptive sampling and parallelism, which can dramatically
On rules of induction and the raven paradox in Bayesian confirmation theory
Afshar, H. M.; Sunehag, P.
2014-12-01
Confirmation theory is studying how one can confirm a universal statement like "All ravens are black". Early authors discussed how one's degree of belief in such a statement should change with new evidence and suggested various rules of induction. Nicod's Condition (NC) says that the claim that all F are G is supported by observing a previously unseen object that is both F and G. Hempel pointed out that NC implies the paradoxical conclusion that observing a white sock supports that all ravens are black. In our time, confirmation is studied by using subjective conditional probability as degrees of belief with Kolmogorov's axioms as the main rules of induction. The old rules and problems of induction are, however, still studied within the probabilistic framework. We consider a setting where the number of individuals having a particular property is given and find that NC can contradict a simpler principle, namely projectability (PJ) which says that if we observe an object with property ψ then other objects are also more likely to have property ψ. We find that intuition can side with either one depending on the situation. We suggest that a more appropriate formalization of the intuition behind NC is the weaker principle of reasoning by analogy (RA). RA says that if we see an object that is F and G and we know that another object is F, then it is more likely to also be G. Projectability might still be considered valid for relatively uninformed a priori beliefs. If one decides that a principle like projectability is valid for confirmation in an uninformed situation, it provides a test that an a priori distribution must satisfy. Hence, decreasing the arbitrariness of the choice of measure. Further, by considering background knowledge saying only how many ravens there are in the world we conclude that if someone accepts the projectability principle, an agent will not increment the belief that all ravens are black when having observed a white sock. Most Bayesian
Truncations of random unitary matrices
Zyczkowski, K; Zyczkowski, Karol; Sommers, Hans-Juergen
1999-01-01
We analyze properties of non-hermitian matrices of size M constructed as square submatrices of unitary (orthogonal) random matrices of size N>M, distributed according to the Haar measure. In this way we define ensembles of random matrices and study the statistical properties of the spectrum located inside the unit circle. In the limit of large matrices, this ensemble is characterized by the ratio M/N. For the truncated CUE we derive analytically the joint density of eigenvalues from which easily all correlation functions are obtained. For N-M fixed and N--> infinity the universal resonance-width distribution with N-M open channels is recovered.
Criteria of the Nonsingular H-Matrices
GAO jian; LIU Futi; HUANG Tingzhu
2004-01-01
The nonsingular H-matrices play an important role in the study of the matrix theory and the iterative method of systems of linear equations,etc.It has always been searched how to verify nonsingular H-matrices.In this paper,nonsingular H-matrices is studies by applying diagonally dominant matrices,irreducible diagonally dominant matrices and comparison matrices and several practical criteria for identifying nonsingular H-matrices are obtained.
Generalisations of Fisher Matrices
Alan Heavens
2016-06-01
Full Text Available Fisher matrices play an important role in experimental design and in data analysis. Their primary role is to make predictions for the inference of model parameters—both their errors and covariances. In this short review, I outline a number of extensions to the simple Fisher matrix formalism, covering a number of recent developments in the field. These are: (a situations where the data (in the form of ( x , y pairs have errors in both x and y; (b modifications to parameter inference in the presence of systematic errors, or through fixing the values of some model parameters; (c Derivative Approximation for LIkelihoods (DALI - higher-order expansions of the likelihood surface, going beyond the Gaussian shape approximation; (d extensions of the Fisher-like formalism, to treat model selection problems with Bayesian evidence.
Generalisations of Fisher Matrices
Heavens, Alan
2016-01-01
Fisher matrices play an important role in experimental design and in data analysis. Their primary role is to make predictions for the inference of model parameters - both their errors and covariances. In this short review, I outline a number of extensions to the simple Fisher matrix formalism, covering a number of recent developments in the field. These are: (a) situations where the data (in the form of (x,y) pairs) have errors in both x and y; (b) modifications to parameter inference in the presence of systematic errors, or through fixing the values of some model parameters; (c) Derivative Approximation for LIkelihoods (DALI) - higher-order expansions of the likelihood surface, going beyond the Gaussian shape approximation; (d) extensions of the Fisher-like formalism, to treat model selection problems with Bayesian evidence.
VanderLaan Circulant Type Matrices
Hongyan Pan
2015-01-01
Full Text Available Circulant matrices have become a satisfactory tools in control methods for modern complex systems. In the paper, VanderLaan circulant type matrices are presented, which include VanderLaan circulant, left circulant, and g-circulant matrices. The nonsingularity of these special matrices is discussed by the surprising properties of VanderLaan numbers. The exact determinants of VanderLaan circulant type matrices are given by structuring transformation matrices, determinants of well-known tridiagonal matrices, and tridiagonal-like matrices. The explicit inverse matrices of these special matrices are obtained by structuring transformation matrices, inverses of known tridiagonal matrices, and quasi-tridiagonal matrices. Three kinds of norms and lower bound for the spread of VanderLaan circulant and left circulant matrix are given separately. And we gain the spectral norm of VanderLaan g-circulant matrix.
Ode to Ehrlich and Raven or how herbivorous insects might drive plant speciation.
Marquis, Robert J; Salazar, Diego; Baer, Christina; Reinhardt, Jason; Priest, Galen; Barnett, Kirk
2016-11-01
Fifty years ago, Ehrlich and Raven proposed that insect herbivores have driven much of plant speciation, particularly at tropical latitudes. There have been no explicit tests of their hypotheses. Indeed there were no proposed mechanisms either at the time or since by which herbivores might generate new plant species. Here we outline two main classes of mechanisms, prezygotic and postzygotic, with a number of scenarios in each by which herbivore-driven changes in host plant secondary chemistry might lead to new plant lineage production. The former apply mainly to a sympatric model of speciation while the latter apply to a parapatric or allopatric model. Our review suggests that the steps of each mechanism are known to occur individually in many different systems, but no scenario has been thoroughly investigated in any one system. Nevertheless, studies of Dalechampia and its herbivores and pollinators, and patterns of defense tradeoffs in trees on different soil types in the Peruvian Amazon provide evidence consistent with the original hypotheses of Ehrlich and Raven. For herbivores to drive sympatric speciation, our findings suggest that interactions with both their herbivores and their pollinators should be considered. In contrast, herbivores may drive speciation allopatrically without any influence by pollinators. Finally, there is evidence that these mechanisms are more likely to occur at low latitudes and thus more likely to produce new species in the tropics. The mechanisms we outline provide a predictive framework for further study of the general role that herbivores play in diversification of their host plants.
Polynomial Fibonacci-Hessenberg matrices
Esmaeili, Morteza [Dept. of Mathematical Sciences, Isfahan University of Technology, 84156-83111 Isfahan (Iran, Islamic Republic of)], E-mail: emorteza@cc.iut.ac.ir; Esmaeili, Mostafa [Dept. of Electrical and Computer Engineering, Isfahan University of Technology, 84156-83111 Isfahan (Iran, Islamic Republic of)
2009-09-15
A Fibonacci-Hessenberg matrix with Fibonacci polynomial determinant is referred to as a polynomial Fibonacci-Hessenberg matrix. Several classes of polynomial Fibonacci-Hessenberg matrices are introduced. The notion of two-dimensional Fibonacci polynomial array is introduced and three classes of polynomial Fibonacci-Hessenberg matrices satisfying this property are given.
Enhancing Understanding of Transformation Matrices
Dick, Jonathan; Childrey, Maria
2012-01-01
With the Common Core State Standards' emphasis on transformations, teachers need a variety of approaches to increase student understanding. Teaching matrix transformations by focusing on row vectors gives students tools to create matrices to perform transformations. This empowerment opens many doors: Students are able to create the matrices for…
Enhancing Understanding of Transformation Matrices
Dick, Jonathan; Childrey, Maria
2012-01-01
With the Common Core State Standards' emphasis on transformations, teachers need a variety of approaches to increase student understanding. Teaching matrix transformations by focusing on row vectors gives students tools to create matrices to perform transformations. This empowerment opens many doors: Students are able to create the matrices for…
Hierarchical matrices algorithms and analysis
Hackbusch, Wolfgang
2015-01-01
This self-contained monograph presents matrix algorithms and their analysis. The new technique enables not only the solution of linear systems but also the approximation of matrix functions, e.g., the matrix exponential. Other applications include the solution of matrix equations, e.g., the Lyapunov or Riccati equation. The required mathematical background can be found in the appendix. The numerical treatment of fully populated large-scale matrices is usually rather costly. However, the technique of hierarchical matrices makes it possible to store matrices and to perform matrix operations approximately with almost linear cost and a controllable degree of approximation error. For important classes of matrices, the computational cost increases only logarithmically with the approximation error. The operations provided include the matrix inversion and LU decomposition. Since large-scale linear algebra problems are standard in scientific computing, the subject of hierarchical matrices is of interest to scientists ...
In recent years, multiple cases of aggressive behaviour of Common ravens (Corvus corax) have been reported by farmers in Catalonia (NE Spain), including attacking of newborn animals and consumption of dead foetuses. In the present study, seroprevalence of Toxoplasma gondii and Neospora caninum was d...
Robischon, Marcel
2015-01-01
Genetic drift is a concept of population genetics that is central to understanding evolutionary processes and aspects of conservation biology. It is frequently taught using rather abstract representations. I introduce three real-life zoological examples, based on historical and recent color morphs of tigers, tapirs, and ravens, that can complement…
Cole, Peter
2012-01-01
First Nations tricksters, Coyote and Raven, work to indigenize Environmental Education but run up against mainstream languages, technologies, and educational practices. They try to do an end-run around the cognitive backfield, then portage through marginal spaces, but find that working between Indigenous languages and mainstream ones can work best…
Coates, Peter S.; Howe, Kristy B.; Casazza, Michael L.; Delehanty, David J.
2014-01-01
A goal in avian ecology is to understand factors that influence differences in nesting habitat and distribution among species, especially within changing landscapes. Over the past 2 decades, humans have altered sagebrush ecosystems as a result of expansion in energy production and transmission. Our primary study objective was to identify differences in the use of landscape characteristics and natural and anthropogenic features by nesting Common Ravens (Corvus corax) and 3 species of buteo (Swainson's Hawk [Buteo swainsoni], Red-tailed Hawk [B. jamaicensis], and Ferruginous Hawk [B. regalis]) within a sagebrush ecosystem in southeastern Idaho. During 2007–2009, we measured multiple environmental factors associated with 212 nest sites using data collected remotely and in the field. We then developed multinomial models to predict nesting probabilities by each species and predictive response curves based on model-averaged estimates. We found differences among species related to nesting substrate (natural vs. anthropogenic), agriculture, native grassland, and edge (interface of 2 cover types). Most important, ravens had a higher probability of nesting on anthropogenic features (0.80) than the other 3 species (Artemisia spp.), favoring increased numbers of nesting ravens and fewer nesting Ferruginous Hawks. Our results indicate that habitat alterations, fragmentation, and forthcoming disturbances anticipated with continued energy development in sagebrush steppe ecosystems can lead to predictable changes in raptor and raven communities.
Estimating sparse precision matrices
Padmanabhan, Nikhil; White, Martin; Zhou, Harrison H.; O'Connell, Ross
2016-08-01
We apply a method recently introduced to the statistical literature to directly estimate the precision matrix from an ensemble of samples drawn from a corresponding Gaussian distribution. Motivated by the observation that cosmological precision matrices are often approximately sparse, the method allows one to exploit this sparsity of the precision matrix to more quickly converge to an asymptotic 1/sqrt{N_sim} rate while simultaneously providing an error model for all of the terms. Such an estimate can be used as the starting point for further regularization efforts which can improve upon the 1/sqrt{N_sim} limit above, and incorporating such additional steps is straightforward within this framework. We demonstrate the technique with toy models and with an example motivated by large-scale structure two-point analysis, showing significant improvements in the rate of convergence. For the large-scale structure example, we find errors on the precision matrix which are factors of 5 smaller than for the sample precision matrix for thousands of simulations or, alternatively, convergence to the same error level with more than an order of magnitude fewer simulations.
Generating random density matrices
Zyczkowski, Karol; Nechita, Ion; Collins, Benoit
2010-01-01
We study various methods to generate ensembles of quantum density matrices of a fixed size N and analyze the corresponding probability distributions P(x), where x denotes the rescaled eigenvalue, x=N\\lambda. Taking a random pure state of a two-partite system and performing the partial trace over one subsystem one obtains a mixed state represented by a Wishart--like matrix W=GG^{\\dagger}, distributed according to the induced measure and characterized asymptotically, as N -> \\infty, by the Marchenko-Pastur distribution. Superposition of k random maximally entangled states leads to another family of explicitly derived distributions, describing singular values of the sum of k independent random unitaries. Taking a larger system composed of 2s particles, constructing $s$ random bi-partite states, performing the measurement into a product of s-1 maximally entangled states and performing the partial trace over the remaining subsystem we arrive at a random state characterized by the Fuss-Catalan distribution of order...
Graph-theoretical matrices in chemistry
Janezic, Dusanka; Nikolic, Sonja; Trinajstic, Nenad
2015-01-01
Graph-Theoretical Matrices in Chemistry presents a systematic survey of graph-theoretical matrices and highlights their potential uses. This comprehensive volume is an updated, extended version of a former bestseller featuring a series of mathematical chemistry monographs. In this edition, nearly 200 graph-theoretical matrices are included.This second edition is organized like the previous one-after an introduction, graph-theoretical matrices are presented in five chapters: The Adjacency Matrix and Related Matrices, Incidence Matrices, The Distance Matrix and Related Matrices, Special Matrices
Hadamard Matrices and Their Applications
Horadam, K J
2011-01-01
In Hadamard Matrices and Their Applications, K. J. Horadam provides the first unified account of cocyclic Hadamard matrices and their applications in signal and data processing. This original work is based on the development of an algebraic link between Hadamard matrices and the cohomology of finite groups that was discovered fifteen years ago. The book translates physical applications into terms a pure mathematician will appreciate, and theoretical structures into ones an applied mathematician, computer scientist, or communications engineer can adapt and use. The first half of the book expl
Tivey, Maurice A.; Johnson, H. Paul; Salmi, Marie S.; Hutnak, Michael
2014-10-01
High-resolution, near-bottom vector magnetic data were collected by remotely operated vehicle Jason over the Raven hydrothermal vent field (47°57.3'N 129°5.75'W) located north of Main Endeavour vent field on the Endeavour segment of the Juan de Fuca Ridge. The survey was part of a comprehensive heat flow study of the Raven site using innovative thermal blanket technology to map the heat flux and crustal fluid pathways around a solitary hydrothermal vent field. Raven hydrothermal activity is presently located along the western axial valley wall, while additional inactive hydrothermal deposits are found to the NW on the upper rift valley wall. Magnetic inversion results show discrete areas of reduced magnetization associated with both active and inactive hydrothermal vent deposits that also show high conductive heat flow. Higher spatial variability in the heat flow patterns compared to the magnetization is consistent with the heat flow reflecting the currently active but ephemeral thermal environment of fluid flow, while crustal magnetization is representative of the static time-averaged effect of hydrothermal alteration. A general NW to SE trend in reduced magnetization across the Raven area correlates closely with the distribution of hydrothermal deposits and heat flux patterns and suggests that the fluid circulation system at depth is likely controlled by local crustal structure and magma chamber geometry. Magnetic gradient tensor components computed from vector magnetic data improve the resolution of the magnetic anomaly source and indicate that the hydrothermally altered zone directly beneath the Raven site is approximately 15 × 106 m3 in volume.
Ravens parallel great apes in flexible planning for tool-use and bartering.
Kabadayi, Can; Osvath, Mathias
2017-07-14
The ability to flexibly plan for events outside of the current sensory scope is at the core of being human and is crucial to our everyday lives and society. Studies on apes have shaped a belief that this ability evolved within the hominid lineage. Corvids, however, have shown evidence of planning their food hoarding, although this has been suggested to reflect a specific caching adaptation rather than domain-general planning. Here, we show that ravens plan for events unrelated to caching-tool-use and bartering-with delays of up to 17 hours, exert self-control, and consider temporal distance to future events. Their performance parallels that seen in apes and suggests that planning evolved independently in corvids, which opens new avenues for the study of cognitive evolution. Copyright © 2017, American Association for the Advancement of Science.
Galante, Joseph M.; Van Eepoel, John; D'Souza, Chris; Patrick, Bryan
2016-01-01
The Raven ISS Hosted Payload will feature several pose measurement sensors on a pan/tilt gimbal which will be used to autonomously track resupply vehicles as they approach and depart the International Space Station. This paper discusses the derivation of a Relative Navigation Filter (RNF) to fuse measurements from the different pose measurement sensors to produce relative position and attitude estimates. The RNF relies on relative translation and orientation kinematics and careful pose sensor modeling to eliminate dependence on orbital position information and associated orbital dynamics models. The filter state is augmented with sensor biases to provide a mechanism for the filter to estimate and mitigate the offset between the measurements from different pose sensors
Bayes linear adjustment for variance matrices
Wilkinson, Darren J
2008-01-01
We examine the problem of covariance belief revision using a geometric approach. We exhibit an inner-product space where covariance matrices live naturally --- a space of random real symmetric matrices. The inner-product on this space captures aspects of our beliefs about the relationship between covariance matrices of interest to us, providing a structure rich enough for us to adjust beliefs about unknown matrices in the light of data such as sample covariance matrices, exploiting second-order exchangeability specifications.
A Workshop on Algebraic Design Theory and Hadamard Matrices
2015-01-01
This volume develops the depth and breadth of the mathematics underlying the construction and analysis of Hadamard matrices and their use in the construction of combinatorial designs. At the same time, it pursues current research in their numerous applications in security and cryptography, quantum information, and communications. Bridges among diverse mathematical threads and extensive applications make this an invaluable source for understanding both the current state of the art and future directions. The existence of Hadamard matrices remains one of the most challenging open questions in combinatorics. Substantial progress on their existence has resulted from advances in algebraic design theory using deep connections with linear algebra, abstract algebra, finite geometry, number theory, and combinatorics. Hadamard matrices arise in a very diverse set of applications. Starting with applications in experimental design theory and the theory of error-correcting codes, they have found unexpected and important ap...
Multiplicative equations over commuting matrices
Babai, L. [Univ. of Chicago, IL (United States)]|[Eotvos Univ., Budapest (Hungary); Beals, R. [Rutgers Univ., Piscataway, NJ (United States); Cai, Jin-Yi [SUNY, Buffalo, NY (United States)] [and others
1996-12-31
We consider the solvability of the equation and generalizations, where the A{sub i} and B are given commuting matrices over an algebraic number field F. In the semigroup membership problem, the variables x{sub i} are constrained to be nonnegative integers. While this problem is NP-complete for variable k, we give a polynomial time algorithm if k is fixed. In the group membership problem, the matrices are assumed to be invertible, and the variables x{sub i} may take on negative values. In this case we give a polynomial time algorithm for variable k and give an explicit description of the set of all solutions (as an affine lattice). The special case of 1 x 1 matrices was recently solved by Guoqiang Ge; we heavily rely on his results.
Improving Limit Surface Search Algorithms in RAVEN Using Acceleration Schemes: Level II Milestone
Alfonsi, Andrea [Idaho National Laboratory (INL), Idaho Falls, ID (United States); Rabiti, Cristian [Idaho National Laboratory (INL), Idaho Falls, ID (United States); Mandelli, Diego [Idaho National Laboratory (INL), Idaho Falls, ID (United States); Cogliati, Joshua Joseph [Idaho National Laboratory (INL), Idaho Falls, ID (United States); Sen, Ramazan Sonat [Idaho National Laboratory (INL), Idaho Falls, ID (United States); Smith, Curtis Lee [Idaho National Laboratory (INL), Idaho Falls, ID (United States)
2015-07-01
The RAVEN code is becoming a comprehensive tool to perform Probabilistic Risk Assessment (PRA); Uncertainty Quantification (UQ) and Propagation; and Verification and Validation (V&V). The RAVEN code is being developed to support the Risk-Informed Safety Margin Characterization (RISMC) pathway by developing an advanced set of methodologies and algorithms for use in advanced risk analysis. The RISMC approach uses system simulator codes applied to stochastic analysis tools. The fundamental idea behind this coupling approach to perturb (by employing sampling strategies) timing and sequencing of events, internal parameters of the system codes (i.e., uncertain parameters of the physics model) and initial conditions to estimate values ranges and associated probabilities of figures of merit of interest for engineering and safety (e.g. core damage probability, etc.). This approach applied to complex systems such as nuclear power plants requires performing a series of computationally expensive simulation runs. The large computational burden is caused by the large set of (uncertain) parameters characterizing those systems. Consequently, exploring the uncertain/parametric domain, with a good level of confidence, is generally not affordable, considering the limited computational resources that are currently available. In addition, the recent tendency to develop newer tools, characterized by higher accuracy and larger computational resources (if compared with the presently used legacy codes, that have been developed decades ago), has made this issue even more compelling. In order to overcome to these limitations, the strategy for the exploration of the uncertain/parametric space needs to use at best the computational resources focusing the computational effort in those regions of the uncertain/parametric space that are “interesting” (e.g., risk-significant regions of the input space) with respect the targeted Figures Of Merit (FOM): for example, the failure of the system
RAVEN - High-resolution Mapping of Venus within a Discovery Mission Budget
Sharpton, V. L.; Herrick, R. R.; Rogers, F.; Waterman, S.
2009-12-01
It has been more than 15 years since the Magellan mission mapped Venus with S-band synthetic aperture radar (SAR) images at ~100-m resolution. Advances in radar technology are such that current Earth-orbiting SAR instruments are capable of providing images at meter-scale resolution. RAVEN (RAdar at VENus) is a mission concept that utilizes the instrument developed for the RADARSAT Constellation Mission (RCM) to map Venus in an economical, highly capable, and reliable way. RCM relies on a C-band SAR that can be tuned to generate images at a wide variety of resolutions and swath widths, ranging from ScanSAR mode (broad swaths at 30-m resolution) to strip-map mode (resolutions as fine as 3 m), as well as a spotlight mode that can image patches at 1-m resolution. In particular, the high-resolution modes allow the landing sites of previous missions to be pinpointed and characterized. Repeat-pass interferometric SAR (InSAR) and stereo radargrammetry provide options for constraining topography to better than 100-m horizontal and 10-m vertical resolution. InSAR also provides the potential for detecting surface deformation at centimeter precision. Performing InSAR requires precise knowledge and control of the orbital geometry, and for this reason a 600-km circular polar orbit is favored. This configuration causes the equatorial nadir point to move ~9 km per orbit. Considering both ascending and descending passes, the spacecraft will pass over every point on the planet in half a Venus day (~4 Earth months). The ability to transmit data back to Earth via the Deep Space Network is the primary limiting factor on the volume of data that can be collected. Our current estimates indicate that within an imaging cycle of one Venus day we can image 20-30 percent of the planet at 20-30-m resolution and several percent at 3-5 m resolution. These figures compare favorably to the coverage provided by recent imaging systems orbiting Mars. Our strategy calls for the first cycle of coverage
Immanant Conversion on Symmetric Matrices
Purificação Coelho M.
2014-01-01
Full Text Available Letr Σn(C denote the space of all n χ n symmetric matrices over the complex field C. The main objective of this paper is to prove that the maps Φ : Σn(C -> Σn (C satisfying for any fixed irre- ducible characters X, X' -SC the condition dx(A +aB = dχ·(Φ(Α + αΦ(Β for all matrices A,В ε Σ„(С and all scalars a ε C are automatically linear and bijective. As a corollary of the above result we characterize all such maps Φ acting on ΣИ(С.
Iterative methods for Toeplitz-like matrices
Huckle, T. [Universitaet Wurzburg (Germany)
1994-12-31
In this paper the author will give a survey on iterative methods for solving linear equations with Toeplitz matrices, Block Toeplitz matrices, Toeplitz plus Hankel matrices, and matrices with low displacement rank. He will treat the following subjects: (1) optimal (w)-circulant preconditioners is a generalization of circulant preconditioners; (2) Optimal implementation of circulant-like preconditioners in the complex and real case; (3) preconditioning of near-singular matrices; what kind of preconditioners can be used in this case; (4) circulant preconditioning for more general classes of Toeplitz matrices; what can be said about matrices with coefficients that are not l{sub 1}-sequences; (5) preconditioners for Toeplitz least squares problems, for block Toeplitz matrices, and for Toeplitz plus Hankel matrices.
Sign pattern matrices that admit M-, N-, P- or inverse M-matrices
Araújo, C. Mendes; Torregrosa, Juan R.
2009-01-01
In this paper we identify the sign pattern matrices that occur among the N–matrices, the P–matrices and the M–matrices. We also address to the class of inverse M–matrices and the related admissibility of sign pattern matrices problem. Fundação para a Ciência e a Tecnologia (FCT) Spanish DGI grant number MTM2007-64477
Hamiltonian formalism and symplectic matrices; Formalisme Hamiltonien et Matrices symplectiques
Bertrand, P. [Project SPIRAL, Grand Accelerateur National d`Ions Lourds, BP 5027, Bd. H. Becquerel, 14076 Caen cedex 5 (France)
1997-12-31
This work consists of five sections. The first one introduces the Lagrangian formalism starting from the fundamental equation of the dynamics. The sections 2 to 4 are devoted to the Hamiltonian formalism and to symplectic matrices. Lie algebra and groups were avoided, although these notions are very useful if higher order effects have to be investigated. The paper is dealing with the properties of the transfer matrices describing different electromagnetic objects like, for instance: dipoles, quadrupoles, cyclotrons, electrostatic deflectors, spiral inflectors, etc. A remarkable property of the first order exact transfer matrices, is the symplecticity which in case of a 3-D object, described in 6-D phase space, provides 15 non-linear equations relating the matrix coefficients. The symplectic matrix ensemble forms an multiplication non-commuting group, consequently the product of n symplectic matrices is still a symplectic matrix. This permits the global description of a system of n objects. Thus, the notion symplecticity is fundamental for the selection of a given electromagnetic object, for its optimization and insertion in a line of beam transfer. The symplectic relations indicate actually that if a given beam characteristic is modified, then another characteristic will be affected and as a result the spurious effects can be limited when a line is to be adjusted. The last section is devoted to the application of the elaborated procedure to describe the drift of non-relativistic and relativistic particles, the dipole and the Muller inflector. Hopefully, this elementary Hamiltonian formalism will help in the familiarization with the symplectic matrices extensively utilized at GANIL 10 refs.
Reliability and Validity of Performance Measures in Microworlds.
Rigas, Georgios; Carling, Eva; Brehmer, Berndt
2002-01-01
Studied the relationships between two real time dynamic decision making tasks (microworlds) and one intelligence test with 100 Swedish adults. Raven's Progressive Matrices scores were a predictor of success in the two microworlds. Discusses methodological problems with microworlds. (SLD)
Shepard, Lorrie, And Others
1981-01-01
Sixteen approaches for detecting item bias were compared on samples of Black, White, and Chicano elementary school pupils using the Lorge-Thorndike and Raven's Coloured Progressive Matrices tests. Recommendations for practical use are made. (JKS)
Fractal Structure of Random Matrices
Hussein, M S
2000-01-01
A multifractal analysis is performed on the universality classes of random matrices and the transition ones.Our results indicate that the eigenvector probability distribution is a linear sum of two chi-squared distribution throughout the transition between the universality ensembles of random matrix theory and Poisson .
Open string fields as matrices
Kishimoto, Isao; Masuda, Toru; Takahashi, Tomohiko; Takemoto, Shoko
2015-03-01
We show that the action expanded around Erler-Maccaferri's N D-brane solution describes the N+1 D-brane system where one D-brane disappears due to tachyon condensation. String fields on multi-branes can be regarded as block matrices of a string field on a single D-brane in the same way as matrix theories.
Open String Fields as Matrices
Kishimoto, Isao; Takahashi, Tomohiko; Takemoto, Shoko
2014-01-01
We show that the action expanded around Erler-Maccaferri's N D-branes solution describes the N+1 D-branes system where one D-brane disappears due to tachyon condensation. String fields on the multi-branes can be regarded as block matrices of a string field on a single D-brane in the same way as matrix theories.
Arnold's Projective Plane and -Matrices
K. Uchino
2010-01-01
Full Text Available We will explain Arnold's 2-dimensional (shortly, 2D projective geometry (Arnold, 2005 by means of lattice theory. It will be shown that the projection of the set of nontrivial triangular -matrices is the pencil of tangent lines of a quadratic curve on Arnold's projective plane.
Fibonacci Identities, Matrices, and Graphs
Huang, Danrun
2005-01-01
General strategies used to help discover, prove, and generalize identities for Fibonacci numbers are described along with some properties about the determinants of square matrices. A matrix proof for identity (2) that has received immense attention from many branches of mathematics, like linear algebra, dynamical systems, graph theory and others…
Scattering matrices with block symmetries
Życzkowski, Karol
1997-01-01
Scattering matrices with block symmetry, which corresponds to scattering process on cavities with geometrical symmetry, are analyzed. The distribution of transmission coefficient is computed for different number of channels in the case of a system with or without the time reversal invariance. An interpolating formula for the case of gradual time reversal symmetry breaking is proposed.
Making almost commuting matrices commute
Hastings, Matthew B [Los Alamos National Laboratory
2008-01-01
Suppose two Hermitian matrices A, B almost commute ({parallel}[A,B]{parallel} {<=} {delta}). Are they close to a commuting pair of Hermitian matrices, A', B', with {parallel}A-A'{parallel},{parallel}B-B'{parallel} {<=} {epsilon}? A theorem of H. Lin shows that this is uniformly true, in that for every {epsilon} > 0 there exists a {delta} > 0, independent of the size N of the matrices, for which almost commuting implies being close to a commuting pair. However, this theorem does not specifiy how {delta} depends on {epsilon}. We give uniform bounds relating {delta} and {epsilon}. The proof is constructive, giving an explicit algorithm to construct A' and B'. We provide tighter bounds in the case of block tridiagonal and tridiagnonal matrices. Within the context of quantum measurement, this implies an algorithm to construct a basis in which we can make a projective measurement that approximately measures two approximately commuting operators simultaneously. Finally, we comment briefly on the case of approximately measuring three or more approximately commuting operators using POVMs (positive operator-valued measures) instead of projective measurements.
The diagonalization of cubic matrices
Cocolicchio, D.; Viggiano, M.
2000-08-01
This paper is devoted to analysing the problem of the diagonalization of cubic matrices. We extend the familiar algebraic approach which is based on the Cardano formulae. We rewrite the complex roots of the associated resolvent secular equation in terms of transcendental functions and we derive the diagonalizing matrix.
Spectral problems for operator matrices
Bátkai, A.; Binding, P.; Dijksma, A.; Hryniv, R.; Langer, H.
2005-01-01
We study spectral properties of 2 × 2 block operator matrices whose entries are unbounded operators between Banach spaces and with domains consisting of vectors satisfying certain relations between their components. We investigate closability in the product space, essential spectra and generation of
Wicherts, J.M.; Dolan, C.V.; Carlson, J.S.; van der Maas, H.L.J.
2010-01-01
This paper presents a systematic review of published data on the performance of sub-Saharan Africans on Raven's Progressive Matrices. The specific goals were to estimate the average level of performance, to study the Flynn Effect in African samples, and to examine the psychometric meaning of Raven's
Sub-adult Ravens Synchronize their Play: A Case of Emotional Contagion?
Mathias Osvath
2014-05-01
Full Text Available Emotional contagion – the alignment of emotions between individuals through behavioral synchronization – is proposed as a key, basic component of human social cognition and empathy. In the field of cognitive zoology, contagious behaviors have also received attention. Several such behaviors have been documented in various species. Nevertheless, emotional and behavioral contagion differ. Emotional contagion – a term predominantly used in human psychology – requires that the contagious behavior leads to converging emotional states. In non-linguistic animals, it is difficult to determine whether a behavior “caught” from someone else results in a similar affective state or remains a purely behavioral response. Some studies suggest the latter as a possibility. To disentangle the problem, we explored instances of contagious behaviors within the play domain. In several species, play involves a variety of behaviors falling into different categories: social, object and locomotor play. If a category of play in one individual induces a different category of play in another, this suggests the spread of a generally playful mood rather than a species-specific motor response. Although some studies suggest emotional contagion in mammals, it is not known whether it occurs in birds. We investigated play contagion in a group of ravens, well known for their complex social skills. The results indicate emotional contagion: the birds engaged in all categories of play on a higher level under the condition where contagion was likely to occur.
Statistics of turbulence parameters at Maunakea using the multiple wavefront sensor data of RAVEN
Ono, Yoshito H.; Correia, Carlos M.; Andersen, Dave R.; Lardière, Olivier; Oya, Shin; Akiyama, Masayuki; Jackson, Kate; Bradley, Colin
2017-03-01
Prior statistical knowledge of atmospheric turbulence is essential for designing, optimizing and evaluating tomographic adaptive optics systems. We present the statistics of the vertical profiles of C_N^2 and the outer scale at Maunakea estimated using a SLOpe Detection And Ranging (SLODAR) method from on-sky telemetry taken by a multi-object adaptive optics (MOAO) demonstrator, called RAVEN, on the Subaru telescope. In our SLODAR method, the profiles are estimated by fitting the theoretical autocorrelations and cross-correlations of measurements from multiple Shack-Haltmann wavefront sensors to the observed correlations via the non-linear Levenberg-Marquardt Algorithm (LMA). The analytical derivatives of the spatial phase structure function with respect to its parameters for the LMA are also developed. From a total of 12 nights in the summer season, a large ground C_N^2 fraction of 54.3 per cent is found, with median estimated seeing of 0.460 arcsec. This median seeing value is below the results for Maunakea from the literature (0.6-0.7 arcsec). The average C_N^2 profile is in good agreement with results from the literature, except for the ground layer. The median value of the outer scale is 25.5 m and the outer scale is larger at higher altitudes; these trends of the outer scale are consistent with findings in the literature.
Statistics of Turbulence Parameters at Maunakea using multiple wave-front sensor data of RAVEN
Ono, Yoshito H; Andersen, Dave R; Lardiere, Olivier; Oya, Shin; Akiyama, Masayuki; Jackson, Kate; Bradley, Colin
2016-01-01
Prior statistical knowledge of the atmospheric turbulence is essential for designing, optimizing and evaluating tomographic adaptive optics systems. We present the statistics of the vertical profiles of $C_N^2$ and the outer scale at Maunakea estimated using a Slope Detection And Ranging (SLODAR) method from on-sky telemetry taken by RAVEN, which is a MOAO demonstrator in the Subaru telescope. In our SLODAR method, the profiles are estimated by a fit of the theoretical auto- and cross-correlation of measurements from multiple Shack-Haltmann wavefront sensors to the observed correlations via the non-linear Levenberg-Marquardt Algorithm (LMA), and the analytic derivatives of the spatial phase structure function with respect to its parameters for the LMA are also developed. The estimated profile has the median total seeing of 0.460$^{\\prime\\prime}$ and large $C_N^2$ fraction of the ground layer of 54.3%. The $C_N^2$ profile has a good agreement with the result from literatures, except for the ground layer. The m...
张晓东; 杨尚骏
2001-01-01
本文探讨矩阵的一个重要子类（F-矩阵）的性质.F-矩阵包含以下在理论及应用中都很重要的三个矩阵类：对称正半定矩阵，M-矩阵和完全非负矩阵.我们首先证明F-矩阵的一些有趣性，特别是给出n-阶F-矩阵A满足detA=an…ann的充分必要条件.接着研究逆F-矩阵的性质，特别是证明逆M-矩阵和逆完全非负矩阵都是F-矩阵，从而满足Fischer不等式.最后我们引入F-矩阵一个子类:W-矩阵并证明逆W-矩阵也是F-矩阵.%We investigate a class of P0-matrices, called F-matrices, whichcontains well known three important classes of matrices satisfying Hadamard's inequality and Fischer's inequality-positive semidefinite symmetric matrices, M-matrices and totally nonnegative matrices. Firstly we prove some interesting properties of F-matrices and give the necessary and sufficient condition for an n×n F-matrix to satisfy det A=a11…ann. Then we investigate inverse F-matrices and prove both inverse M-matrices and inverse totally nonnegative matrices are F-matrices. Finally we introduce a new class of F-matrices, i.e. W-matrices and prove both W-matrices and inverse W-matrices are also F-matrices.
STABILITY FOR SEVERAL TYPES OF INTERVAL MATRICES
NianXiaohong; GaoJintai
1999-01-01
The robust stability for some types of tlme-varying interval raatrices and nonlineartime-varying interval matrices is considered and some sufficient conditions for robust stability of such interval matrices are given, The main results of this paper are only related to the verticesset of a interval matrices, and therefore, can be easily applied to test robust stability of interval matrices. Finally, some examples are given to illustrate the results.
Eigenvalue variance bounds for covariance matrices
Dallaporta, Sandrine
2013-01-01
This work is concerned with finite range bounds on the variance of individual eigenvalues of random covariance matrices, both in the bulk and at the edge of the spectrum. In a preceding paper, the author established analogous results for Wigner matrices and stated the results for covariance matrices. They are proved in the present paper. Relying on the LUE example, which needs to be investigated first, the main bounds are extended to complex covariance matrices by means of the Tao, Vu and Wan...
The Bessel Numbers and Bessel Matrices
Sheng Liang YANG; Zhan Ke QIAO
2011-01-01
In this paper,using exponential Riordan arrays,we investigate the Bessel numbers and Bessel matrices.By exploring links between the Bessel matrices,the Stirling matrices and the degenerate Stirling matrices,we show that the Bessel numbers are special case of the degenerate Stirling numbers,and derive explicit formulas for the Bessel numbers in terms of the Stirling numbers and binomial coefficients.
Quantum Hilbert matrices and orthogonal polynomials
Andersen, Jørgen Ellegaard; Berg, Christian
2009-01-01
Using the notion of quantum integers associated with a complex number q≠0 , we define the quantum Hilbert matrix and various extensions. They are Hankel matrices corresponding to certain little q -Jacobi polynomials when |q|matrices...... of reciprocal Fibonacci numbers called Filbert matrices. We find a formula for the entries of the inverse quantum Hilbert matrix....
Simultaneous diagonalization of two quaternion matrices
ZhouJianhua
2003-01-01
The simultaneous diagonalization by congruence of pairs of Hermitian quatemion matrices is discussed. The problem is reduced to a parallel one on complex matrices by using the complex adjoint matrix related to each quatemion matrix. It is proved that any two semi-positive definite Hermitian quatemion matrices can be simultaneously diagonalized by congruence.
Bombardelli, Diego
2016-08-01
In these notes we review the S-matrix theory in (1+1)-dimensional integrable models, focusing mainly on the relativistic case. Once the main definitions and physical properties are introduced, we discuss the factorization of scattering processes due to integrability. We then focus on the analytic properties of the two-particle scattering amplitude and illustrate the derivation of the S-matrices for all the possible bound states using the so-called bootstrap principle. General algebraic structures underlying the S-matrix theory and its relation with the form factors axioms are briefly mentioned. Finally, we discuss the S-matrices of sine-Gordon and SU(2), SU(3) chiral Gross-Neveu models. In loving memory of Lilia Grandi.
Effects of spider Macrothele raven venom on cell proliferation and cytotoxicity in HeLa cells
Li GAO; Bao-en SHAN; Jing CHEN; Jiang-hui LIU; Da-xiang SONG; Bao-cheng ZHU
2005-01-01
Aim: To examine the effect of venom from the spider Macrothele raven on cell proliferation and cytotoxicity in human cervical carcinoma, HeLa cells. Methods:Morphological and biochemical signs of apoptosis appeared using acridine orange-ethidium bromide (AO/EB) staining. Marked morphological changes in HeLa cells after treatment with spider venom were observed using scanning electron microscopy (SEM) and transmission electron microscopy (TEM). Cell proliferation and cytotoxicity were determined by [methyl-3H] thymidine assay ([3H]TdR) and lactate dehydrogenase (LDH) release, respectively. DNA fragmentation and cell cycle distribution were monitored using flow cytometry. In addition, Western blot analysis was used to evaluate the level of caspase-3 expression. In vivo examination of the inhibition of the size of tumors in nude mice treated with spider venom was measured. Results: Marked morphological changes were observed using AO/EB staining, SEM and TEM assay. Spider venom at concentrations of 10-40 mg/L caused dose- and time-dependent inhibition of HeLa cell proliferation.The ratio of apoptosis and necrosis increased. The activity of caspase-3 was upregulated after spider venom treatment. In vivo study of tumor size revealed that tumors significantly decreased in size from controls to tumors treated for 3 weeks with spider venom (P＜0.05). Conclusion: The inhibition of HeLa cells by the venom of the spider Macrothele raveni was carried out in three ways: induction of apoptosis, necrosis of toxicity damage and direct lysis. Spider venom is a novel anti-tumor material both in vitro and in vivo.
Rotationally invariant ensembles of integrable matrices.
Yuzbashyan, Emil A; Shastry, B Sriram; Scaramazza, Jasen A
2016-05-01
We construct ensembles of random integrable matrices with any prescribed number of nontrivial integrals and formulate integrable matrix theory (IMT)-a counterpart of random matrix theory (RMT) for quantum integrable models. A type-M family of integrable matrices consists of exactly N-M independent commuting N×N matrices linear in a real parameter. We first develop a rotationally invariant parametrization of such matrices, previously only constructed in a preferred basis. For example, an arbitrary choice of a vector and two commuting Hermitian matrices defines a type-1 family and vice versa. Higher types similarly involve a random vector and two matrices. The basis-independent formulation allows us to derive the joint probability density for integrable matrices, similar to the construction of Gaussian ensembles in the RMT.
Rotationally invariant ensembles of integrable matrices
Yuzbashyan, Emil A.; Shastry, B. Sriram; Scaramazza, Jasen A.
2016-05-01
We construct ensembles of random integrable matrices with any prescribed number of nontrivial integrals and formulate integrable matrix theory (IMT)—a counterpart of random matrix theory (RMT) for quantum integrable models. A type-M family of integrable matrices consists of exactly N -M independent commuting N ×N matrices linear in a real parameter. We first develop a rotationally invariant parametrization of such matrices, previously only constructed in a preferred basis. For example, an arbitrary choice of a vector and two commuting Hermitian matrices defines a type-1 family and vice versa. Higher types similarly involve a random vector and two matrices. The basis-independent formulation allows us to derive the joint probability density for integrable matrices, similar to the construction of Gaussian ensembles in the RMT.
Projection Matrices, Generalized Inverse Matrices, and Singular Value Decomposition
Yanai, Haruo; Takane, Yoshio
2011-01-01
Aside from distribution theory, projections and the singular value decomposition (SVD) are the two most important concepts for understanding the basic mechanism of multivariate analysis. The former underlies the least squares estimation in regression analysis, which is essentially a projection of one subspace onto another, and the latter underlies principal component analysis, which seeks to find a subspace that captures the largest variability in the original space. This book is about projections and SVD. A thorough discussion of generalized inverse (g-inverse) matrices is also given because
UAV-UGV collaboration with a PackBot UGV and Raven SUAV for pursuit and tracking of a dynamic target
Cheung, Carol; Grocholsky, Benjamin
2008-04-01
Fielded military unmanned systems are currently extending the reach of the U.S. forces in surveillance and reconnaissance missions. Providing long-range eyes on enemy operations, unmanned aerial vehicles (UAVs), such as the AeroVironment Raven, have proven themselves indispensable without risking soldiers' lives. Meanwhile, unmanned ground vehicles (UGVs), such as the iRobot PackBot, are quickly joining ranks in Explosive Ordnance Disposal (EOD) missions to identify and dispose of ordnance or to clear roads and buildings. UAV-UGV collaboration and the benefit of force multiplication is increasingly more tangible. iRobot Corporation and CMU Robotics Institute are developing the capability to simultaneously control the Raven small UAV (SUAV) and PackBot UGV from a single operator control unit (OCU) via waypoint navigation. Techniques to support autonomous collaboration for pursuing and tracking a dismounted soldier will be developed and integrated on a Raven-PackBot team. The Raven will survey an area and geolocate an operator-selected target. The Raven will share this target location with the PackBot and together they will collaboratively pursue the target intelligently to maintain track on the target. We will accomplish this goal by implementing a decentralized control and data fusion software architecture. The PackBot will be equipped with on-board waypoint navigation algorithms, a Navigator Payload containing a stereo-vision system, GPS, and a high-accuracy IMU. The Raven will have two on-board cameras, a side-looking and a forward-looking optical camera. The Supervisor OCU will act as the central mission planner, allowing the operator to monitor mission events and override vehicle tasks.
Hoshiba, Takashi; Tanaka, Masaru
2013-09-20
Extracellular matrix (ECM) has been focused to understand tumor progression in addition to the genetic mutation of cancer cells. Here, we prepared "staged tumorigenesis-mimicking matrices" which mimic in vivo ECM in tumor tissue at each malignant stage to understand the roles of ECM in tumor progression. Breast tumor cells, MDA-MB-231 (invasive), MCF-7 (non-invasive), and MCF-10A (benign) cells, were cultured to form their own ECM beneath the cells and formed ECM was prepared as staged tumorigenesis-mimicking matrices by decellularization treatment. Cells showed weak attachment on the matrices derived from MDA-MB-231 cancer cells. The proliferations of MDA-MB-231 and MCF-7 was promoted on the matrices derived from MDA-MB-231 cancer cells whereas MCF-10A cell proliferation was not promoted. MCF-10A cell proliferation was promoted on the matrices derived from MCF-10A cells. Chemoresistance of MDA-MB-231 cells against 5-fluorouracil increased on only matrices derived from MDA-MB-231 cells. Our results showed that the cells showed different behaviors on staged tumorigenesis-mimicking matrices according to the malignancy of cell sources for ECM preparation. Therefore, staged tumorigenesis-mimicking matrices might be a useful in vitro ECM models to investigate the roles of ECM in tumor progression.
Random matrices and Riemann hypothesis
Pierre, Christian
2011-01-01
The curious connection between the spacings of the eigenvalues of random matrices and the corresponding spacings of the non trivial zeros of the Riemann zeta function is analyzed on the basis of the geometric dynamical global program of Langlands whose fundamental structures are shifted quantized conjugacy class representatives of bilinear algebraic semigroups.The considered symmetry behind this phenomenology is the differential bilinear Galois semigroup shifting the product,right by left,of automorphism semigroups of cofunctions and functions on compact transcendental quanta.
Sparse Matrices in Frame Theory
Lemvig, Jakob; Krahmer, Felix; Kutyniok, Gitta
2014-01-01
Frame theory is closely intertwined with signal processing through a canon of methodologies for the analysis of signals using (redundant) linear measurements. The canonical dual frame associated with a frame provides a means for reconstruction by a least squares approach, but other dual frames...... yield alternative reconstruction procedures. The novel paradigm of sparsity has recently entered the area of frame theory in various ways. Of those different sparsity perspectives, we will focus on the situations where frames and (not necessarily canonical) dual frames can be written as sparse matrices...
Cosmetic crossings and Seifert matrices
Balm, Cheryl; Kalfagianni, Efstratia; Powell, Mark
2011-01-01
We study cosmetic crossings in knots of genus one and obtain obstructions to such crossings in terms of knot invariants determined by Seifert matrices. In particular, we prove that for genus one knots the Alexander polynomial and the homology of the double cover branching over the knot provide obstructions to cosmetic crossings. As an application we prove the nugatory crossing conjecture for twisted Whitehead doubles of non-cable knots. We also verify the conjecture for several families of pretzel knots and all genus one knots with up to 12 crossings.
Superalgebraic representation of Dirac matrices
Monakhov, V. V.
2016-01-01
We consider a Clifford extension of the Grassmann algebra in which operators are constructed from products of Grassmann variables and derivatives with respect to them. We show that this algebra contains a subalgebra isomorphic to a matrix algebra and that it additionally contains operators of a generalized matrix algebra that mix states with different numbers of Grassmann variables. We show that these operators are extensions of spin-tensors to the case of superspace. We construct a representation of Dirac matrices in the form of operators of a generalized matrix algebra.
Orthogonal polynomials and random matrices
Deift, Percy
2000-01-01
This volume expands on a set of lectures held at the Courant Institute on Riemann-Hilbert problems, orthogonal polynomials, and random matrix theory. The goal of the course was to prove universality for a variety of statistical quantities arising in the theory of random matrix models. The central question was the following: Why do very general ensembles of random n {\\times} n matrices exhibit universal behavior as n {\\rightarrow} {\\infty}? The main ingredient in the proof is the steepest descent method for oscillatory Riemann-Hilbert problems.
Agren, Rasmus; Liu, Liming; Shoaie, Saeed; Vongsangnak, Wanwipa; Nookaew, Intawat; Nielsen, Jens
2013-01-01
We present the RAVEN (Reconstruction, Analysis and Visualization of Metabolic Networks) Toolbox: a software suite that allows for semi-automated reconstruction of genome-scale models. It makes use of published models and/or the KEGG database, coupled with extensive gap-filling and quality control features. The software suite also contains methods for visualizing simulation results and omics data, as well as a range of methods for performing simulations and analyzing the results. The software is a useful tool for system-wide data analysis in a metabolic context and for streamlined reconstruction of metabolic networks based on protein homology. The RAVEN Toolbox workflow was applied in order to reconstruct a genome-scale metabolic model for the important microbial cell factory Penicillium chrysogenum Wisconsin54-1255. The model was validated in a bibliomic study of in total 440 references, and it comprises 1471 unique biochemical reactions and 1006 ORFs. It was then used to study the roles of ATP and NADPH in the biosynthesis of penicillin, and to identify potential metabolic engineering targets for maximization of penicillin production.
Davidge, T J; Lardiere, O; Bradley, C; Blain, C; Oya, S; Terada, H; Hayano, Y; Lamb, M; Akiyama, M; Ono, Y H; Suzuki, G
2016-01-01
We discuss images of the star clusters GLIMPSE C01 (GC01) and GLIMPSE C02 (GC02) that were recorded with the Subaru IRCS. Distortions in the wavefront were corrected with the RAVEN adaptive optics (AO) science demonstrator, allowing individual stars in the central regions of both clusters -- where the fractional contamination from non-cluster objects is lowest -- to be imaged. In addition to J, H, and K' images, both clusters were observed through a narrow-band filter centered near 3.05um; GC01 was also observed through two other narrow-band filters that sample longer wavelengths. Stars in the narrow-band images have a FWHM that is close to the telescope diffraction limit, demonstrating that open loop AO systems like RAVEN can deliver exceptional image quality. The near-infrared color magnitude diagram of GC01 is smeared by non-uniform extinction with a dispersion +/- 0.13 magnitudes in A_K. The Red Clump is identified in the K luminosity function (LF) of GC01, and a distance modulus of 13.6 is found. The K L...
Rasmus Agren
Full Text Available We present the RAVEN (Reconstruction, Analysis and Visualization of Metabolic Networks Toolbox: a software suite that allows for semi-automated reconstruction of genome-scale models. It makes use of published models and/or the KEGG database, coupled with extensive gap-filling and quality control features. The software suite also contains methods for visualizing simulation results and omics data, as well as a range of methods for performing simulations and analyzing the results. The software is a useful tool for system-wide data analysis in a metabolic context and for streamlined reconstruction of metabolic networks based on protein homology. The RAVEN Toolbox workflow was applied in order to reconstruct a genome-scale metabolic model for the important microbial cell factory Penicillium chrysogenum Wisconsin54-1255. The model was validated in a bibliomic study of in total 440 references, and it comprises 1471 unique biochemical reactions and 1006 ORFs. It was then used to study the roles of ATP and NADPH in the biosynthesis of penicillin, and to identify potential metabolic engineering targets for maximization of penicillin production.
Searching for partial Hadamard matrices
Álvarez, Víctor; Frau, María-Dolores; Gudiel, Félix; Güemes, María-Belén; Martín, Elena; Osuna, Amparo
2012-01-01
Three algorithms looking for pretty large partial Hadamard matrices are described. Here "large" means that hopefully about a third of a Hadamard matrix (which is the best asymptotic result known so far, [dLa00]) is achieved. The first one performs some kind of local exhaustive search, and consequently is expensive from the time consuming point of view. The second one comes from the adaptation of the best genetic algorithm known so far searching for cliques in a graph, due to Singh and Gupta [SG06]. The last one consists in another heuristic search, which prioritizes the required processing time better than the final size of the partial Hadamard matrix to be obtained. In all cases, the key idea is characterizing the adjacency properties of vertices in a particular subgraph G_t of Ito's Hadamard Graph Delta (4t) [Ito85], since cliques of order m in G_t can be seen as (m+3)*4t partial Hadamard matrices.
A concise guide to complex Hadamard matrices
Tadej, W; Tadej, Wojciech; Zyczkowski, Karol
2005-01-01
Complex Hadamard matrices, consisting of unimodular entries with arbitrary phases, play an important role in the theory of quantum information. We review basic properties of complex Hadamard matrices and present a catalogue of inequivalent cases known for dimension N=2,...,16. In particular, we explicitly write down some families of complex Hadamard matrices for N=12,14 and 16, which we could not find in the existing literature.
Lambda-matrices and vibrating systems
Lancaster, Peter; Stark, M; Kahane, J P
1966-01-01
Lambda-Matrices and Vibrating Systems presents aspects and solutions to problems concerned with linear vibrating systems with a finite degrees of freedom and the theory of matrices. The book discusses some parts of the theory of matrices that will account for the solutions of the problems. The text starts with an outline of matrix theory, and some theorems are proved. The Jordan canonical form is also applied to understand the structure of square matrices. Classical theorems are discussed further by applying the Jordan canonical form, the Rayleigh quotient, and simple matrix pencils with late
Matrices with totally positive powers and their generalizations
Kushel, Olga Y.
2013-01-01
In this paper, eventually totally positive matrices (i.e. matrices all whose powers starting with some point are totally positive) are studied. We present a new approach to eventual total positivity which is based on the theory of eventually positive matrices. We mainly focus on the spectral properties of such matrices. We also study eventually J-sign-symmetric matrices and matrices, whose powers are P-matrices.
A NOTE ON THE STOCHASTIC ROOTS OF STOCHASTIC MATRICES
Qi-Ming HE; Eldon GUNN
2003-01-01
In this paper, we study the stochastic root matrices of stochastic matrices. All stochastic roots of 2×2 stochastic matrices are found explicitly. A method based on characteristic polynomial of matrix is developed to find all real root matrices that are functions of the original 3×3 matrix, including all possible (function) stochastic root matrices. In addition, we comment on some numerical methods for computing stochastic root matrices of stochastic matrices.
YANG Lizhen; CHEN Kefei
2004-01-01
In this paper, we analyze the structure of the orders of matrices (mod n), and present the relation between the orders of matrices over finite fields and their Jordan normal forms. Then we generalize 2-dimensional Arnold transformation matrix to two types of n-dimensional Arnold transformation matrices: A-type Arnold transformation matrix and B-type transformation matrix, and analyze their orders and other properties based on our earlier results about the orders of matrices.
The lower bounds for the rank of matrices and some sufficient conditions for nonsingular matrices.
Wang, Dafei; Zhang, Xumei
2017-01-01
The paper mainly discusses the lower bounds for the rank of matrices and sufficient conditions for nonsingular matrices. We first present a new estimation for [Formula: see text] ([Formula: see text] is an eigenvalue of a matrix) by using the partitioned matrices. By using this estimation and inequality theory, the new and more accurate estimations for the lower bounds for the rank are deduced. Furthermore, based on the estimation for the rank, some sufficient conditions for nonsingular matrices are obtained.
A note on "Block H-matrices and spectrum of block matrices"
LIU Jian-zhou; HUANG Ze-jun
2008-01-01
In this paper, we make further discussions and improvements on the results presented in the previously published work "Block H-matrices and spectrum of block matrices". Furthermore, a new bound for eigenvalues of block matrices is given with examples to show advantages of the new result.
A partial classification of primes in the positive matrices and in the doubly stochastic matrices
G. Picci; J.M. van den Hof; J.H. van Schuppen (Jan)
1995-01-01
textabstractThe algebraic structure of the set of square positive matrices is that of a semi-ring. The concept of a prime in the positive matrices has been introduced. A few examples of primes in the positive matrices are known but there is no general classification. In this paper a partial
Pathological rate matrices: from primates to pathogens
Knight Rob
2008-12-01
Full Text Available Abstract Background Continuous-time Markov models allow flexible, parametrically succinct descriptions of sequence divergence. Non-reversible forms of these models are more biologically realistic but are challenging to develop. The instantaneous rate matrices defined for these models are typically transformed into substitution probability matrices using a matrix exponentiation algorithm that employs eigendecomposition, but this algorithm has characteristic vulnerabilities that lead to significant errors when a rate matrix possesses certain 'pathological' properties. Here we tested whether pathological rate matrices exist in nature, and consider the suitability of different algorithms to their computation. Results We used concatenated protein coding gene alignments from microbial genomes, primate genomes and independent intron alignments from primate genomes. The Taylor series expansion and eigendecomposition matrix exponentiation algorithms were compared to the less widely employed, but more robust, Padé with scaling and squaring algorithm for nucleotide, dinucleotide, codon and trinucleotide rate matrices. Pathological dinucleotide and trinucleotide matrices were evident in the microbial data set, affecting the eigendecomposition and Taylor algorithms respectively. Even using a conservative estimate of matrix error (occurrence of an invalid probability, both Taylor and eigendecomposition algorithms exhibited substantial error rates: ~100% of all exonic trinucleotide matrices were pathological to the Taylor algorithm while ~10% of codon positions 1 and 2 dinucleotide matrices and intronic trinucleotide matrices, and ~30% of codon matrices were pathological to eigendecomposition. The majority of Taylor algorithm errors derived from occurrence of multiple unobserved states. A small number of negative probabilities were detected from the Pad�� algorithm on trinucleotide matrices that were attributable to machine precision. Although the Pad
Dynamical invariance for random matrices
Unterberger, Jeremie
2016-01-01
We consider a general Langevin dynamics for the one-dimensional N-particle Coulomb gas with confining potential $V$ at temperature $\\beta$. These dynamics describe for $\\beta=2$ the time evolution of the eigenvalues of $N\\times N$ random Hermitian matrices. The equilibrium partition function -- equal to the normalization constant of the Laughlin wave function in fractional quantum Hall effect -- is known to satisfy an infinite number of constraints called Virasoro or loop constraints. We introduce here a dynamical generating function on the space of random trajectories which satisfies a large class of constraints of geometric origin. We focus in this article on a subclass induced by the invariance under the Schr\\"odinger-Virasoro algebra.
Tensor Products of Random Unitary Matrices
Tkocz, Tomasz; Kus, Marek; Zeitouni, Ofer; Zyczkowski, Karol
2012-01-01
Tensor products of M random unitary matrices of size N from the circular unitary ensemble are investigated. We show that the spectral statistics of the tensor product of random matrices becomes Poissonian if M=2, N become large or M become large and N=2.
Products of Generalized Stochastic Sarymsakov Matrices
Xia, Weiguo; Liu, Ji; Cao, Ming; Johansson, Karl; Basar, Tamer
2015-01-01
In the set of stochastic, indecomposable, aperiodic (SIA) matrices, the class of stochastic Sarymsakov matrices is the largest known subset (i) that is closed under matrix multiplication and (ii) the inﬁnitely long left-product of the elements from a compact subset converges to a rank-one matrix. In
Abel-Grassmann's Groupoids of Modulo Matrices
Muhammad Rashad
2016-01-01
Full Text Available The binary operation of usual addition is associative in all matrices over R. However, a binary operation of addition in matrices over Z n of a nonassociative structures of AG-groupoids and AG-groups are defined and investigated here. It is shown that both these structures exist for every integer n > 3. Various properties of these structures are explored like: (i Every AG-groupoid of matrices over Z n is transitively commutative AG-groupoid and is a cancellative AG-groupoid ifn is prime. (ii Every AG-groupoid of matrices over Z n of Type-II is a T3-AG-groupoid. (iii An AG-groupoid of matrices over Z n ; G nAG(t,u, is an AG-band, ift+ u=1(mod n.
Relations between performance on the advance matrices and the EPI in high-intelligence subjects.
Gibson, H B
1975-11-01
This study continues the investigation of the relationship between performance on tests of intelligence, and the personality parameters of the Eysenckian theoretical framework. Candidates for admission to an honours degree course (n = 281) were given the Advanced Progressive Matrices as a screening device. Those admitted to the course were on later occasions given both forms of the Eysenck Personality Inventory (EPI). In view of problems of test-retest on the EPI, scores were analysed in a novel fashion to give three groups: 'introverts', 'extraverts' and 'ambiverts'. The 'introverts' scored significantly highest on the Matrices, but the scores of the 'ambiverts' were lowest. Neuroticism showed little interaction with other variables. These results are discussed in terms of the theory of reactive inhibition. New data on the Advanced Progressive Matrices are given which are significantly higher than the published university norms.
On Decompositions of Matrices over Distributive Lattices
Yizhi Chen
2014-01-01
Full Text Available Let L be a distributive lattice and Mn,q (L(Mn(L, resp. the semigroup (semiring, resp. of n × q (n × n, resp. matrices over L. In this paper, we show that if there is a subdirect embedding from distributive lattice L to the direct product ∏i=1mLi of distributive lattices L1,L2, …,Lm, then there will be a corresponding subdirect embedding from the matrix semigroup Mn,q(L (semiring Mn(L, resp. to semigroup ∏i=1mMn,q(Li (semiring ∏i=1mMn(Li, resp.. Further, it is proved that a matrix over a distributive lattice can be decomposed into the sum of matrices over some of its special subchains. This generalizes and extends the decomposition theorems of matrices over finite distributive lattices, chain semirings, fuzzy semirings, and so forth. Finally, as some applications, we present a method to calculate the indices and periods of the matrices over a distributive lattice and characterize the structures of idempotent and nilpotent matrices over it. We translate the characterizations of idempotent and nilpotent matrices over a distributive lattice into the corresponding ones of the binary Boolean cases, which also generalize the corresponding structures of idempotent and nilpotent matrices over general Boolean algebras, chain semirings, fuzzy semirings, and so forth.
Compressed Adjacency Matrices: Untangling Gene Regulatory Networks.
Dinkla, K; Westenberg, M A; van Wijk, J J
2012-12-01
We present a novel technique-Compressed Adjacency Matrices-for visualizing gene regulatory networks. These directed networks have strong structural characteristics: out-degrees with a scale-free distribution, in-degrees bound by a low maximum, and few and small cycles. Standard visualization techniques, such as node-link diagrams and adjacency matrices, are impeded by these network characteristics. The scale-free distribution of out-degrees causes a high number of intersecting edges in node-link diagrams. Adjacency matrices become space-inefficient due to the low in-degrees and the resulting sparse network. Compressed adjacency matrices, however, exploit these structural characteristics. By cutting open and rearranging an adjacency matrix, we achieve a compact and neatly-arranged visualization. Compressed adjacency matrices allow for easy detection of subnetworks with a specific structure, so-called motifs, which provide important knowledge about gene regulatory networks to domain experts. We summarize motifs commonly referred to in the literature, and relate them to network analysis tasks common to the visualization domain. We show that a user can easily find the important motifs in compressed adjacency matrices, and that this is hard in standard adjacency matrix and node-link diagrams. We also demonstrate that interaction techniques for standard adjacency matrices can be used for our compressed variant. These techniques include rearrangement clustering, highlighting, and filtering.
Marina Arav
2009-01-01
Full Text Available Let H be an m×n real matrix and let Zi be the set of column indices of the zero entries of row i of H. Then the conditions |Zk∩(∪i=1k−1Zi|≤1 for all k (2≤k≤m are called the (row Zero Position Conditions (ZPCs. If H satisfies the ZPC, then H is said to be a (row ZPC matrix. If HT satisfies the ZPC, then H is said to be a column ZPC matrix. The real matrix H is said to have a zero cycle if H has a sequence of at least four zero entries of the form hi1j1,hi1j2,hi2j2,hi2j3,…,hikjk,hikj1 in which the consecutive entries alternatively share the same row or column index (but not both, and the last entry has one common index with the first entry. Several connections between the ZPC and the nonexistence of zero cycles are established. In particular, it is proved that a matrix H has no zero cycle if and only if there are permutation matrices P and Q such that PHQ is a row ZPC matrix and a column ZPC matrix.
Random Matrices and Lyapunov Coefficients Regularity
Gallavotti, Giovanni
2017-02-01
Analyticity and other properties of the largest or smallest Lyapunov exponent of a product of real matrices with a "cone property" are studied as functions of the matrices entries, as long as they vary without destroying the cone property. The result is applied to stability directions, Lyapunov coefficients and Lyapunov exponents of a class of products of random matrices and to dynamical systems. The results are not new and the method is the main point of this work: it is is based on the classical theory of the Mayer series in Statistical Mechanics of rarefied gases.
Statistical properties of random density matrices
Sommers, H J; Sommers, Hans-Juergen; Zyczkowski, Karol
2004-01-01
Statistical properties of ensembles of random density matrices are investigated. We compute traces and von Neumann entropies averaged over ensembles of random density matrices distributed according to the Bures measure. The eigenvalues of the random density matrices are analyzed: we derive the eigenvalue distribution for the Bures ensemble which is shown to be broader then the quarter--circle distribution characteristic of the Hilbert--Schmidt ensemble. For measures induced by partial tracing over the environment we compute exactly the two-point eigenvalue correlation function.
Statistical properties of random density matrices
Sommers, Hans-Juergen [Fachbereich Physik, Universitaet Duisburg-Essen, Campus Essen, 45117 Essen (Germany); Zyczkowski, Karol [Instytut Fizyki im. Smoluchowskiego, Uniwersytet Jagiellonski, ul. Reymonta 4, 30-059 Cracow (Poland)
2004-09-03
Statistical properties of ensembles of random density matrices are investigated. We compute traces and von Neumann entropies averaged over ensembles of random density matrices distributed according to the Bures measure. The eigenvalues of the random density matrices are analysed: we derive the eigenvalue distribution for the Bures ensemble which is shown to be broader then the quarter-circle distribution characteristic of the Hilbert-Schmidt ensemble. For measures induced by partial tracing over the environment we compute exactly the two-point eigenvalue correlation function.
Direct dialling of Haar random unitary matrices
Russell, Nicholas J.; Chakhmakhchyan, Levon; O’Brien, Jeremy L.; Laing, Anthony
2017-03-01
Random unitary matrices find a number of applications in quantum information science, and are central to the recently defined boson sampling algorithm for photons in linear optics. We describe an operationally simple method to directly implement Haar random unitary matrices in optical circuits, with no requirement for prior or explicit matrix calculations. Our physically motivated and compact representation directly maps independent probability density functions for parameters in Haar random unitary matrices, to optical circuit components. We go on to extend the results to the case of random unitaries for qubits.
A method for generating realistic correlation matrices
Garcia, Stephan Ramon
2011-01-01
Simulating sample correlation matrices is important in many areas of statistics. Approaches such as generating normal data and finding their sample correlation matrix or generating random uniform $[-1,1]$ deviates as pairwise correlations both have drawbacks. We develop an algorithm for adding noise, in a highly controlled manner, to general correlation matrices. In many instances, our method yields results which are superior to those obtained by simply simulating normal data. Moreover, we demonstrate how our general algorithm can be tailored to a number of different correlation models. Finally, using our results with an existing clustering algorithm, we show that simulating correlation matrices can help assess statistical methodology.
The Antitriangular Factorization of Saddle Point Matrices
Pestana, J.
2014-01-01
Mastronardi and Van Dooren [SIAM J. Matrix Anal. Appl., 34 (2013), pp. 173-196] recently introduced the block antitriangular ("Batman") decomposition for symmetric indefinite matrices. Here we show the simplification of this factorization for saddle point matrices and demonstrate how it represents the common nullspace method. We show that rank-1 updates to the saddle point matrix can be easily incorporated into the factorization and give bounds on the eigenvalues of matrices important in saddle point theory. We show the relation of this factorization to constraint preconditioning and how it transforms but preserves the structure of block diagonal and block triangular preconditioners. © 2014 Society for Industrial and Applied Mathematics.
Synchronous correlation matrices and Connes’ embedding conjecture
Dykema, Kenneth J., E-mail: kdykema@math.tamu.edu [Department of Mathematics, Texas A& M University, College Station, Texas 77843-3368 (United States); Paulsen, Vern, E-mail: vern@math.uh.edu [Department of Mathematics, University of Houston, Houston, Texas 77204 (United States)
2016-01-15
In the work of Paulsen et al. [J. Funct. Anal. (in press); preprint arXiv:1407.6918], the concept of synchronous quantum correlation matrices was introduced and these were shown to correspond to traces on certain C*-algebras. In particular, synchronous correlation matrices arose in their study of various versions of quantum chromatic numbers of graphs and other quantum versions of graph theoretic parameters. In this paper, we develop these ideas further, focusing on the relations between synchronous correlation matrices and microstates. We prove that Connes’ embedding conjecture is equivalent to the equality of two families of synchronous quantum correlation matrices. We prove that if Connes’ embedding conjecture has a positive answer, then the tracial rank and projective rank are equal for every graph. We then apply these results to more general non-local games.
THE EIGENVALUE PERTURBATION BOUND FOR ARBITRARY MATRICES
Wen Li; Jian-xin Chen
2006-01-01
In this paper we present some new absolute and relative perturbation bounds for the eigenvalue for arbitrary matrices, which improves some recent results. The eigenvalue inclusion region is also discussed.
Sufficient Conditions of Nonsingular H-matrices
王广彬; 洪振杰; 高中喜
2004-01-01
From the concept of a diagonally dominant matrix, two sufficient conditions of nonsingular H-matrices were obtained in this paper. An example was given to show that these results improve the known results.
Optimizing the Evaluation of Finite Element Matrices
Kirby, Robert C; Logg, Anders; Scott, L Ridgway; 10.1137/040607824
2012-01-01
Assembling stiffness matrices represents a significant cost in many finite element computations. We address the question of optimizing the evaluation of these matrices. By finding redundant computations, we are able to significantly reduce the cost of building local stiffness matrices for the Laplace operator and for the trilinear form for Navier-Stokes. For the Laplace operator in two space dimensions, we have developed a heuristic graph algorithm that searches for such redundancies and generates code for computing the local stiffness matrices. Up to cubics, we are able to build the stiffness matrix on any triangle in less than one multiply-add pair per entry. Up to sixth degree, we can do it in less than about two. Preliminary low-degree results for Poisson and Navier-Stokes operators in three dimensions are also promising.
Orthogonal Polynomials from Hermitian Matrices II
Odake, Satoru
2016-01-01
This is the second part of the project `unified theory of classical orthogonal polynomials of a discrete variable derived from the eigenvalue problems of hermitian matrices.' In a previous paper, orthogonal polynomials having Jackson integral measures were not included, since such measures cannot be obtained from single infinite dimensional hermitian matrices. Here we show that Jackson integral measures for the polynomials of the big $q$-Jacobi family are the consequence of the recovery of self-adjointness of the unbounded Jacobi matrices governing the difference equations of these polynomials. The recovery of self-adjointness is achieved in an extended $\\ell^2$ Hilbert space on which a direct sum of two unbounded Jacobi matrices acts as a Hamiltonian or a difference Schr\\"odinger operator for an infinite dimensional eigenvalue problem. The polynomial appearing in the upper/lower end of Jackson integral constitutes the eigenvector of each of the two unbounded Jacobi matrix of the direct sum. We also point out...
A Few Applications of Imprecise Matrices
Sahalad Borgoyary
2015-07-01
Full Text Available This article introduces generalized form of extension definition of the Fuzzy set and its complement in the sense of reference function namely in imprecise set and its complement. Discuss Partial presence of element, Membership value of an imprecise number in the normal and subnormal imprecise numbers. Further on the basis of reference function define usual matrix into imprecise form with new notation. And with the help of maximum and minimum operators, obtain some new matrices like reducing imprecise matrices, complement of reducing imprecise matrix etc. Along with discuss some of the classical matrix properties which are hold good in the imprecise matrix also. Further bring out examples of application of the addition of imprecise matrices, subtraction of imprecise matrices etc. in the field of transportation problems.
Balanced random Toeplitz and Hankel Matrices
Basak, Anirban
2010-01-01
Except the Toeplitz and Hankel matrices, the common patterned matrices for which the limiting spectral distribution (LSD) are known to exist, share a common property--the number of times each random variable appears in the matrix is (more or less) same across the variables. Thus it seems natural to ask what happens to the spectrum of the Toeplitz and Hankel matrices when each entry is scaled by the square root of the number of times that entry appears in the matrix instead of the uniform scaling by $n^{-1/2}$. We show that the LSD of these balanced matrices exist and derive integral formulae for the moments of the limit distribution. Curiously, it is not clear if these moments define a unique distribution.
Synthesis and characterization of CaO-loaded electrospun matrices for bone tissue engineering.
Münchow, Eliseu A; Pankajakshan, Divya; Albuquerque, Maria T P; Kamocki, Krzysztof; Piva, Evandro; Gregory, Richard L; Bottino, Marco C
2016-11-01
This study aims to synthesize and characterize biodegradable polymer-based matrices loaded with CaO nanoparticles for osteomyelitis treatment and bone tissue engineering. Poly(ε-caprolactone) (PCL) and PCL/gelatin (1:1, w/w) solutions containing CaO nanoparticles were electrospun into fibrous matrices. Scanning (SEM) and transmission (TEM) electron microscopy, Fourier transformed infrared (FTIR), energy dispersive X-ray spectroscopy (EDS), contact angle (CA), tensile testing, and antibacterial activity (agar diffusion assay) against Staphylococcus aureus were performed. Osteoprecursor cell (MC3T3-E1) response (i.e., viability and alkaline phosphatase expression/ALP) and infiltration into the matrices were evaluated. CaO nanoparticles were successfully incorporated into the fibers, with the median fiber diameter decreasing after CaO incorporation. The CA decreased with the addition of CaO, and the presence of gelatin made the matrix very hydrophilic (CA = 0°). Increasing CaO concentrations progressively reduced the mechanical properties (p ≤ 0.030). CaO-loaded matrices did not display consistent antibacterial activity. MC3T3-E1 cell viability demonstrated the highest levels for CaO-loaded matrices containing gelatin after 7 days in culture. An increased ALP expression was consistently seen for PCL/CaO matrices when compared to PCL and gelatin-containing counterparts. Despite inconsistent antibacterial activity, CaO nanoparticles can be effectively loaded into PCL or PCL/gelatin fibers without negatively affecting the overall performance of the matrices. More importantly, CaO incorporation enhanced cell viability as well as differentiation capacity, as demonstrated by an increased ALP expression. CaO-loaded electrospun matrices show potential for applications in bone tissue engineering.
Boolean Inner product Spaces and Boolean Matrices
Gudder, Stan; Latremoliere, Frederic
2009-01-01
This article discusses the concept of Boolean spaces endowed with a Boolean valued inner product and their matrices. A natural inner product structure for the space of Boolean n-tuples is introduced. Stochastic boolean vectors and stochastic and unitary Boolean matrices are studied. A dimension theorem for orthonormal bases of a Boolean space is proven. We characterize the invariant stochastic Boolean vectors for a Boolean stochastic matrix and show that they can be used to reduce a unitary m...
Generalized Inverses of Matrices over Rings
韩瑞珠; 陈建龙
1992-01-01
Let R be a ring,*be an involutory function of the set of all finite matrices over R. In this pa-per,necessary and sufficient conditions are given for a matrix to have a (1,3)-inverse,(1,4)-inverse,or Morre-Penrose inverse,relative to *.Some results about generalized inverses of matrices over division rings are generalized and improved.
A Euclidean algorithm for integer matrices
Lauritzen, Niels; Thomsen, Jesper Funch
2015-01-01
We present a Euclidean algorithm for computing a greatest common right divisor of two integer matrices. The algorithm is derived from elementary properties of finitely generated modules over the ring of integers.......We present a Euclidean algorithm for computing a greatest common right divisor of two integer matrices. The algorithm is derived from elementary properties of finitely generated modules over the ring of integers....
Infinite Products of Random Isotropically Distributed Matrices
Il'yn, A S; Zybin, K P
2016-01-01
Statistical properties of infinite products of random isotropically distributed matrices are investigated. Both for continuous processes with finite correlation time and discrete sequences of independent matrices, a formalism that allows to calculate easily the Lyapunov spectrum and generalized Lyapunov exponents is developed. This problem is of interest to probability theory, statistical characteristics of matrix T-exponentials are also needed for turbulent transport problems, dynamical chaos and other parts of statistical physics.
A Wegner estimate for Wigner matrices
Maltsev, Anna
2011-01-01
In the first part of these notes, we review some of the recent developments in the study of the spectral properties of Wigner matrices. In the second part, we present a new proof of a Wegner estimate for the eigenvalues of a large class of Wigner matrices. The Wegner estimate gives an upper bound for the probability to find an eigenvalue in an interval $I$, proportional to the size $|I|$ of the interval.
Matrices related to some Fock space operators
Krzysztof Rudol
2011-01-01
Full Text Available Matrices of operators with respect to frames are sometimes more natural and easier to compute than the ones related to bases. The present work investigates such operators on the Segal-Bargmann space, known also as the Fock space. We consider in particular some properties of matrices related to Toeplitz and Hankel operators. The underlying frame is provided by normalised reproducing kernel functions at some lattice points.
Linear algebra for skew-polynomial matrices
Abramov, Sergei; Bronstein, Manuel
2002-01-01
We describe an algorithm for transforming skew-polynomial matrices over an Ore domain in row-reduced form, and show that this algorithm can be used to perform the standard calculations of linear algebra on such matrices (ranks, kernels, linear dependences, inhomogeneous solving). The main application of our algorithm is to desingularize recurrences and to compute the rational solutions of a large class of linear functional systems. It also turns out to be efficient when applied to ordinary co...
Moment matrices, border bases and radical computation
Mourrain, B.; J. B. Lasserre; Laurent, Monique; Rostalski, P.; Trebuchet, Philippe
2013-01-01
In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is nte. The aim is to combine approaches for solving a system of polynomial equations with dual methods which involve moment matrices and semi-denite programming. While the border basis algorithms of [17] are ecient and numerically stable for computing complex roots, algorithms based on moment matrices [12] allow the incorporation of additional polynomials, ...
Infinite Products of Random Isotropically Distributed Matrices
Il'yn, A. S.; Sirota, V. A.; Zybin, K. P.
2017-01-01
Statistical properties of infinite products of random isotropically distributed matrices are investigated. Both for continuous processes with finite correlation time and discrete sequences of independent matrices, a formalism that allows to calculate easily the Lyapunov spectrum and generalized Lyapunov exponents is developed. This problem is of interest to probability theory, statistical characteristics of matrix T-exponentials are also needed for turbulent transport problems, dynamical chaos and other parts of statistical physics.
MERSENNE AND HADAMARD MATRICES CALCULATION BY SCARPIS METHOD
N. A. Balonin
2014-05-01
Full Text Available Purpose. The paper deals with the problem of basic generalizations of Hadamard matrices associated with maximum determinant matrices or not optimal by determinant matrices with orthogonal columns (weighing matrices, Mersenne and Euler matrices, ets.; calculation methods for the quasi-orthogonal local maximum determinant Mersenne matrices are not studied enough sufficiently. The goal of this paper is to develop the theory of Mersenne and Hadamard matrices on the base of generalized Scarpis method research. Methods. Extreme solutions are found in general by minimization of maximum for absolute values of the elements of studied matrices followed by their subsequent classification according to the quantity of levels and their values depending on orders. Less universal but more effective methods are based on structural invariants of quasi-orthogonal matrices (Silvester, Paley, Scarpis methods, ets.. Results. Generalizations of Hadamard and Belevitch matrices as a family of quasi-orthogonal matrices of odd orders are observed; they include, in particular, two-level Mersenne matrices. Definitions of section and layer on the set of generalized matrices are proposed. Calculation algorithms for matrices of adjacent layers and sections by matrices of lower orders are described. Approximation examples of the Belevitch matrix structures up to 22-nd critical order by Mersenne matrix of the third order are given. New formulation of the modified Scarpis method to approximate Hadamard matrices of high orders by lower order Mersenne matrices is proposed. Williamson method is described by example of one modular level matrices approximation by matrices with a small number of levels. Practical relevance. The efficiency of developing direction for the band-pass filters creation is justified. Algorithms for Mersenne matrices design by Scarpis method are used in developing software of the research program complex. Mersenne filters are based on the suboptimal by
2010-09-01
2010]. [28] U. Malm,” Modelling and degradation characteristics of thin-film CIGS solar cells,” Ph.D. dissertation, Upp - sala Universitet, Uppsala...Switzerland demonstrated the possibility of launching a solar-powered plane after they successfully launched their Solar Impulse with a pilot on- board...source selection process, AeroVironment Inc. in Simi Valley, California, was chosen by the U.S. Army for their upgraded Raven, the B model . A
A Brief Historical Introduction to Matrices and Their Applications
Debnath, L.
2014-01-01
This paper deals with the ancient origin of matrices, and the system of linear equations. Included are algebraic properties of matrices, determinants, linear transformations, and Cramer's Rule for solving the system of algebraic equations. Special attention is given to some special matrices, including matrices in graph theory and electrical…
A Brief Historical Introduction to Matrices and Their Applications
Debnath, L.
2014-01-01
This paper deals with the ancient origin of matrices, and the system of linear equations. Included are algebraic properties of matrices, determinants, linear transformations, and Cramer's Rule for solving the system of algebraic equations. Special attention is given to some special matrices, including matrices in graph theory and electrical…
Representation-independent manipulations with Dirac matrices and spinors
2007-01-01
Dirac matrices, also known as gamma matrices, are defined only up to a similarity transformation. Usually, some explicit representation of these matrices is assumed in order to deal with them. In this article, we show how it is possible to proceed without any such assumption. Various important identities involving Dirac matrices and spinors have been derived without assuming any representation at any stage.
Condition number estimation of preconditioned matrices.
Kushida, Noriyuki
2015-01-01
The present paper introduces a condition number estimation method for preconditioned matrices. The newly developed method provides reasonable results, while the conventional method which is based on the Lanczos connection gives meaningless results. The Lanczos connection based method provides the condition numbers of coefficient matrices of systems of linear equations with information obtained through the preconditioned conjugate gradient method. Estimating the condition number of preconditioned matrices is sometimes important when describing the effectiveness of new preconditionerers or selecting adequate preconditioners. Operating a preconditioner on a coefficient matrix is the simplest method of estimation. However, this is not possible for large-scale computing, especially if computation is performed on distributed memory parallel computers. This is because, the preconditioned matrices become dense, even if the original matrices are sparse. Although the Lanczos connection method can be used to calculate the condition number of preconditioned matrices, it is not considered to be applicable to large-scale problems because of its weakness with respect to numerical errors. Therefore, we have developed a robust and parallelizable method based on Hager's method. The feasibility studies are curried out for the diagonal scaling preconditioner and the SSOR preconditioner with a diagonal matrix, a tri-daigonal matrix and Pei's matrix. As a result, the Lanczos connection method contains around 10% error in the results even with a simple problem. On the other hand, the new method contains negligible errors. In addition, the newly developed method returns reasonable solutions when the Lanczos connection method fails with Pei's matrix, and matrices generated with the finite element method.
Condition number estimation of preconditioned matrices.
Noriyuki Kushida
Full Text Available The present paper introduces a condition number estimation method for preconditioned matrices. The newly developed method provides reasonable results, while the conventional method which is based on the Lanczos connection gives meaningless results. The Lanczos connection based method provides the condition numbers of coefficient matrices of systems of linear equations with information obtained through the preconditioned conjugate gradient method. Estimating the condition number of preconditioned matrices is sometimes important when describing the effectiveness of new preconditionerers or selecting adequate preconditioners. Operating a preconditioner on a coefficient matrix is the simplest method of estimation. However, this is not possible for large-scale computing, especially if computation is performed on distributed memory parallel computers. This is because, the preconditioned matrices become dense, even if the original matrices are sparse. Although the Lanczos connection method can be used to calculate the condition number of preconditioned matrices, it is not considered to be applicable to large-scale problems because of its weakness with respect to numerical errors. Therefore, we have developed a robust and parallelizable method based on Hager's method. The feasibility studies are curried out for the diagonal scaling preconditioner and the SSOR preconditioner with a diagonal matrix, a tri-daigonal matrix and Pei's matrix. As a result, the Lanczos connection method contains around 10% error in the results even with a simple problem. On the other hand, the new method contains negligible errors. In addition, the newly developed method returns reasonable solutions when the Lanczos connection method fails with Pei's matrix, and matrices generated with the finite element method.
Bayesian Nonparametric Clustering for Positive Definite Matrices.
Cherian, Anoop; Morellas, Vassilios; Papanikolopoulos, Nikolaos
2016-05-01
Symmetric Positive Definite (SPD) matrices emerge as data descriptors in several applications of computer vision such as object tracking, texture recognition, and diffusion tensor imaging. Clustering these data matrices forms an integral part of these applications, for which soft-clustering algorithms (K-Means, expectation maximization, etc.) are generally used. As is well-known, these algorithms need the number of clusters to be specified, which is difficult when the dataset scales. To address this issue, we resort to the classical nonparametric Bayesian framework by modeling the data as a mixture model using the Dirichlet process (DP) prior. Since these matrices do not conform to the Euclidean geometry, rather belongs to a curved Riemannian manifold,existing DP models cannot be directly applied. Thus, in this paper, we propose a novel DP mixture model framework for SPD matrices. Using the log-determinant divergence as the underlying dissimilarity measure to compare these matrices, and further using the connection between this measure and the Wishart distribution, we derive a novel DPM model based on the Wishart-Inverse-Wishart conjugate pair. We apply this model to several applications in computer vision. Our experiments demonstrate that our model is scalable to the dataset size and at the same time achieves superior accuracy compared to several state-of-the-art parametric and nonparametric clustering algorithms.
Using Elimination Theory to construct Rigid Matrices
Kumar, Abhinav; Patankar, Vijay M; N, Jayalal Sarma M
2009-01-01
The rigidity of a matrix A for target rank r is the minimum number of entries of A that must be changed to ensure that the rank of the altered matrix is at most r. Since its introduction by Valiant (1977), rigidity and similar rank-robustness functions of matrices have found numerous applications in circuit complexity, communication complexity, and learning complexity. Almost all nxn matrices over an infinite field have a rigidity of (n-r)^2. It is a long-standing open question to construct infinite families of explicit matrices even with superlinear rigidity when r=Omega(n). In this paper, we construct an infinite family of complex matrices with the largest possible, i.e., (n-r)^2, rigidity. The entries of an nxn matrix in this family are distinct primitive roots of unity of orders roughly exp(n^4 log n). To the best of our knowledge, this is the first family of concrete (but not entirely explicit) matrices having maximal rigidity and a succinct algebraic description. Our construction is based on elimination...
Mirror-Symmetric Matrices and Their Application
李国林; 冯正和
2002-01-01
The well-known centrosymmetric matrices correctly reflect mirror-symmetry with no component or only one component on the mirror plane. Mirror-symmetric matrices defined in this paper can represent mirror-symmetric structures with various components on the mirror plane. Some basic properties of mirror-symmetric matrices were studied and applied to interconnection analysis. A generalized odd/even-mode decomposition scheme was developed based on the mirror reflection relationship for mirror-symmetric multiconductor transmission lines (MTLs). The per-unit-length (PUL) impedance matrix Z and admittance matrix Y can be divided into odd-mode and even-mode PUL matrices. Thus the order of the MTL system is reduced from n to k and k+p, where p(≥0)is the conductor number on the mirror plane. The analysis of mirror-symmetric matrices is related to the theory of symmetric group, which is the most effective tool for the study of symmetry.
Carlson, Jerry S.; Wiedl, Karl Heinz
1976-01-01
Measures of concrete operational thought and the Raven's Coloured Progressive Matrices were factor analyzed for a sample of primary students. Results indicated that primarily perceptual abilities are required for solution of the Piagetian tests, although abstract reasoning is involved in the solution of matrices and in conservation of substance…
Miller, Rachael; Schwab, Christine; Bugnyar, Thomas
2016-11-01
Innovation and social information use are influenced by individual characteristics, and are important for the creation and transmission of novel behavioral patterns. Here, we investigated which individual factors predict innovation rates and social transmission of information in a comparative study with identically reared common ravens (Corvus corax) and carrion crows (Corvus corone corone; Corvus corone cornix). In the innovation experiment (1), we presented the birds with a novel problem-solving task while alone, to determine which individuals would quickly solve ("innovators") or not solve ("noninnovators") this task. We then related these findings to sex, object exploration (frequency of novel item manipulation), object neophobia (latency to novel item interaction), and social rank position. We found that innovators were more explorative than noninnovators, although they did not differ significantly in social rank, object neophobia or sex. In the social information use experiments (2 & 3), subjects first observed a model (Exp. 2: conspecific, heterospecific; Exp. 3: conspecific innovator & noninnovator) demonstrate a specific color selection in a 2-choice cup task, before being allowed to make their own cup selection. Innovator and noninnovator observers did not significantly differ in their tendency to use social information, that is, to select the demonstrated cup first, from a conspecific or heterospecific model. Furthermore, observers did not preferentially use social information from an innovator over a noninnovator model. We discuss our findings in relation to the likely benefits of flexible information use, and the role of other model characteristics, such as relationships, on the use of social information. (PsycINFO Database Record
Kabadayi, Can; Taylor, Lucy A; von Bayern, Auguste M P; Osvath, Mathias
2016-04-01
Overriding motor impulses instigated by salient perceptual stimuli represent a fundamental inhibitory skill. Such motor self-regulation facilitates more rational behaviour, as it brings economy into the bodily interaction with the physical and social world. It also underlies certain complex cognitive processes including decision making. Recently, MacLean et al. (MacLean et al. 2014 Proc. Natl Acad. Sci. USA 111, 2140-2148. (doi:10.1073/pnas.1323533111)) conducted a large-scale study involving 36 species, comparing motor self-regulation across taxa. They concluded that absolute brain size predicts level of performance. The great apes were most successful. Only a few of the species tested were birds. Given birds' small brain size-in absolute terms-yet flexible behaviour, their motor self-regulation calls for closer study. Corvids exhibit some of the largest relative avian brain sizes-although small in absolute measure-as well as the most flexible cognition in the animal kingdom. We therefore tested ravens, New Caledonian crows and jackdaws in the so-called cylinder task. We found performance indistinguishable from that of great apes despite the much smaller brains. We found both absolute and relative brain volume to be a reliable predictor of performance within Aves. The complex cognition of corvids is often likened to that of great apes; our results show further that they share similar fundamental cognitive mechanisms.
Geometry of 2×2 hermitian matrices
HUANG; Liping(黄礼平); WAN; Zhexian(万哲先)
2002-01-01
Let D be a division ring which possesses an involution a→ā. Assume that F = {a∈D|a=ā} is a proper subfield of D and is contained in the center of D. It is pointed out that if D is of characteristic not two, D is either a separable quadratic extension of F or a division ring of generalized quaternions over F and that if D is of characteristic two, D is a separable quadratic extension of F. Thus the trace map Tr: D→F,hermitian matrices over D when n≥3 and now can be deleted. When D is a field, the fundamental theorem of 2×2 hermitian matrices over D has already been proved. This paper proves the fundamental theorem of 2×2 hermitian matrices over any division ring of generalized quaternions of characteristic not two.
INERTIA SETS OF SYMMETRIC SIGN PATTERN MATRICES
无
2001-01-01
A sign pattern matrix is a matrixwhose entries are from the set {+ ,- ,0}. The symmetric sign pattern matrices that require unique inertia have recently been characterized. The purpose of this paper is to more generally investigate the inertia sets of symmetric sign pattern matrices. In particular, nonnegative fri-diagonal sign patterns and the square sign pattern with all + entries are examined. An algorithm is given for generating nonnegative real symmetric Toeplitz matrices with zero diagonal of orders n≥3 which have exactly two negative eigenvalues. The inertia set of the square pattern with all + off-diagonal entries and zero diagonal entries is then analyzed. The types of inertias which can be in the inertia set of any sign pattern are also obtained in the paper. Specifically, certain compatibility and consecutiveness properties are established.
Generalized Inverse Eigenvalue Problem for Centrohermitian Matrices
刘仲云; 谭艳祥; 田兆录
2004-01-01
In this paper we first consider the existence and the general form of solution to the following generalized inverse eigenvalue problem(GIEP) : given a set of n-dimension complex vectors { xj }jm = 1 and a set of complex numbers { λj} jm = 1, find two n × n centrohermitian matrices A, B such that { xj }jm = 1 and { λj }jm= 1 are the generalized eigenvectors and generalized eigenvalues of Ax = λBx, respectively. We then discuss the optimal approximation problem for the GIEP. More concretely, given two arbitrary matrices, A-, B- ∈Cn×n , we find two matrices A* and B* such that the matrix (A* ,B* ) is closest to (A- ,B-) in the Frobenius norm, where the matrix (A*, B* ) is the solution to the GIEP. We show that the expression of the solution of the optimal approximation is unique and derive the expression for it.
PRM: A database of planetary reflection matrices
Stam, D. M.; Batista, S. F. A.
2014-04-01
We present the PRM database with reflection matrices of various types of planets. With the matrices, users can calculate the total, and the linearly and circularly polarized fluxes of incident unpolarized light that is reflected by a planet for arbitrary illumination and viewing geometries. To allow for flexibility in these geometries, the database does not contain the elements of reflection matrices, but the coefficients of their Fourier series expansion. We describe how to sum these coefficients for given illumination and viewing geometries to obtain the local reflection matrix. The coefficients in the database can also be used to calculate flux and polarization signals of exoplanets, by integrating, for a given planetary phase angle, locally reflected fluxes across the visible part of the planetary disk. Algorithms for evaluating the summation for locally reflected fluxes, as applicable to spatially resolved observations of planets, and the subsequent integration for the disk-integrated fluxes, as applicable to spatially unresolved exoplanets are also in the database
On classification of dynamical r-matrices
Schiffmann, O
1997-01-01
Using recent results of P. Etingof and A. Varchenko on the Classical Dynamical Yang-Baxter equation, we reduce the classification of dynamical r-matrices on a commutative subalgebra l of a Lie algebra g to a purely algebraic problem when l admits a g^l-invariant complement, where g^l is the centralizer of l in g. Using this, we then classify all non skew-symmetric dynamical r-matrices when g is a simple Lie algebra and l a commutative subalgebra containing a regular semisimple element. This partially answers an open problem in [EV] q-alg/9703040, and generalizes the Belavin-Drinfled classification of constant r-matrices. This classification is similar and in some sense simpler than the Belavin-Drinfled classification.
Octonion generalization of Pauli and Dirac matrices
Chanyal, B. C.
2015-10-01
Starting with octonion algebra and its 4 × 4 matrix representation, we have made an attempt to write the extension of Pauli's matrices in terms of division algebra (octonion). The octonion generalization of Pauli's matrices shows the counterpart of Pauli's spin and isospin matrices. In this paper, we also have obtained the relationship between Clifford algebras and the division algebras, i.e. a relation between octonion basis elements with Dirac (gamma), Weyl and Majorana representations. The division algebra structure leads to nice representations of the corresponding Clifford algebras. We have made an attempt to investigate the octonion formulation of Dirac wave equations, conserved current and weak isospin in simple, compact, consistent and manifestly covariant manner.
A Multipath Connection Model for Traffic Matrices
Mr. M. V. Prabhakaran
2015-02-01
Full Text Available Peer-to-Peer (P2P applications have witnessed an increasing popularity in recent years, which brings new challenges to network management and traffic engineering (TE. As basic input information, P2P traffic matrices are of significant importance for TE. Because of the excessively high cost of direct measurement. In this paper,A multipath connection model for traffic matrices in operational networks. Media files can share the peer to peer, the localization ratio of peer to peer traffic. This evaluates its performance using traffic traces collected from both the real peer to peer video-on-demand and file-sharing applications. The estimation of the general traffic matrices (TM then used for sending the media file without traffic. Share the media file, source to destination traffic is not occur. So it give high performance and short time process.
Block TERM factorization of block matrices
SHE Yiyuan; HAO Pengwei
2004-01-01
Reversible integer mapping (or integer transform) is a useful way to realize Iossless coding, and this technique has been used for multi-component image compression in the new international image compression standard JPEG 2000. For any nonsingular linear transform of finite dimension, its integer transform can be implemented by factorizing the transform matrix into 3 triangular elementary reversible matrices (TERMs) or a series of single-row elementary reversible matrices (SERMs). To speed up and parallelize integer transforms, we study block TERM and SERM factorizations in this paper. First, to guarantee flexible scaling manners, the classical determinant (det) is generalized to a matrix function, DET, which is shown to have many important properties analogous to those of det. Then based on DET, a generic block TERM factorization,BLUS, is presented for any nonsingular block matrix. Our conclusions can cover the early optimal point factorizations and provide an efficient way to implement integer transforms for large matrices.
Advanced incomplete factorization algorithms for Stiltijes matrices
Il`in, V.P. [Siberian Division RAS, Novosibirsk (Russian Federation)
1996-12-31
The modern numerical methods for solving the linear algebraic systems Au = f with high order sparse matrices A, which arise in grid approximations of multidimensional boundary value problems, are based mainly on accelerated iterative processes with easily invertible preconditioning matrices presented in the form of approximate (incomplete) factorization of the original matrix A. We consider some recent algorithmic approaches, theoretical foundations, experimental data and open questions for incomplete factorization of Stiltijes matrices which are {open_quotes}the best{close_quotes} ones in the sense that they have the most advanced results. Special attention is given to solving the elliptic differential equations with strongly variable coefficients, singular perturbated diffusion-convection and parabolic equations.
Infinite matrices and their recent applications
Shivakumar, P N; Zhang, Yang
2016-01-01
This monograph covers the theory of finite and infinite matrices over the fields of real numbers, complex numbers and over quaternions. Emphasizing topics such as sections or truncations and their relationship to the linear operator theory on certain specific separable and sequence spaces, the authors explore techniques like conformal mapping, iterations and truncations that are used to derive precise estimates in some cases and explicit lower and upper bounds for solutions in the other cases. Most of the matrices considered in this monograph have typically special structures like being diagonally dominated or tridiagonal, possess certain sign distributions and are frequently nonsingular. Such matrices arise, for instance, from solution methods for elliptic partial differential equations. The authors focus on both theoretical and computational aspects concerning infinite linear algebraic equations, differential systems and infinite linear programming, among others. Additionally, the authors cover topics such ...
Edge fluctuations of eigenvalues of Wigner matrices
Döring, Hanna
2012-01-01
We establish a moderate deviation principle (MDP) for the number of eigenvalues of a Wigner matrix in an interval close to the edge of the spectrum. Moreover we prove a MDP for the $i$th largest eigenvalue close to the edge. The proof relies on fine asymptotics of the variance of the eigenvalue counting function of GUE matrices due to Gustavsson. The extension to large families of Wigner matrices is based on the Tao and Vu Four Moment Theorem. Possible extensions to other random matrix ensembles are commented.
Forecasting Covariance Matrices: A Mixed Frequency Approach
Halbleib, Roxana; Voev, Valeri
This paper proposes a new method for forecasting covariance matrices of financial returns. The model mixes volatility forecasts from a dynamic model of daily realized volatilities estimated with high-frequency data with correlation forecasts based on daily data. This new approach allows...... for flexible dependence patterns for volatilities and correlations, and can be applied to covariance matrices of large dimensions. The separate modeling of volatility and correlation forecasts considerably reduces the estimation and measurement error implied by the joint estimation and modeling of covariance...... matrix dynamics. Our empirical results show that the new mixing approach provides superior forecasts compared to multivariate volatility specifications using single sources of information....
Almost Hadamard matrices: general theory and examples
Banica, Teodor; Zyczkowski, Karol
2012-01-01
We develop a general theory of "almost Hadamard matrices". These are by definition the matrices $H\\in M_N(\\mathbb R)$ having the property that $U=H/\\sqrt{N}$ is orthogonal, and is a local maximum of the 1-norm on O(N). Our study includes a detailed discussion of the circulant case ($H_{ij}=\\gamma_{j-i}$) and of the two-entry case ($H_{ij}\\in\\{x,y\\}$), with the construction of several families of examples, and some 1-norm computations.
Extremal spacings of random unitary matrices
Smaczynski, Marek; Kus, Marek; Zyczkowski, Karol
2012-01-01
Extremal spacings between unimodular eigenvalues of random unitary matrices of size N pertaining to circular ensembles are investigated. Probability distributions for the minimal spacing for various ensembles are derived for N=4. We show that for large matrices the average minimal spacing s_min of a random unitary matrix behaves as N^(-1/(1+B)) for B equal to 0,1 and 2 for circular Poisson, orthogonal and unitary ensembles, respectively. For these ensembles also asymptotic probability distributions P(s_min) are obtained and the statistics of the largest spacing s_max are investigated.
Super Special Codes using Super Matrices
Kandasamy, W B Vasantha; Ilanthenral, K
2010-01-01
The new classes of super special codes are constructed in this book using the specially constructed super special vector spaces. These codes mainly use the super matrices. These codes can be realized as a special type of concatenated codes. This book has four chapters. In chapter one basic properties of codes and super matrices are given. A new type of super special vector space is constructed in chapter two of this book. Three new classes of super special codes namely, super special row code, super special column code and super special codes are introduced in chapter three. Applications of these codes are given in the final chapter.
Tello, Marta; Spenlé, Caroline; Hemmerlé, Joseph; Mercier, Luc; Fabre, Roxane; Allio, Guillaume; Simon-Assmann, Patricia; Goetz, Jacky G
2016-02-01
Mechanical interaction between cells and their surrounding extracellular matrix (ECM) controls key processes such as proliferation, differentiation and motility. For many years, two-dimensional (2D) models were used to better understand the interactions between cells and their surrounding ECM. More recently, variation of the mechanical properties of tissues has been reported to play a major role in physiological and pathological scenarios such as cancer progression. The 3D architecture of the ECM finely tunes cellular behavior to perform physiologically relevant tasks. Technical limitations prevented scientists from obtaining accurate assessment of the mechanical properties of physiologically realistic matrices. There is therefore a need for combining the production of high-quality cell-derived 3D matrices (CDMs) and the characterization of their topographical and mechanical properties. Here, we describe methods that allow to accurately measure the young modulus of matrices produced by various cellular types. In the first part, we will describe and review several protocols for generating CDMs matrices from endothelial, epithelial, fibroblastic, muscle and mesenchymal stem cells. We will discuss tools allowing the characterization of the topographical details as well as of the protein content of such CDMs. In a second part, we will report the methodologies that can be used, based on atomic force microscopy, to accurately evaluate the stiffness properties of the CDMs through the quantification of their young modulus. Altogether, such methodologies allow characterizing the stiffness and topography of matrices deposited by the cells, which is key for the understanding of cellular behavior in physiological conditions.
Determinación y propiedades de H-matrices
SCOTT GUILLEARD, JOSÉ ANTONIO
2015-01-01
[EN] The essential topic of this memory is the study of H-matrices as they were introduced by Ostrowski and hereinafter extended and developed by different authors. In this study three slopes are outlined: 1) the iterative or automatic determination of H-matrices, 2) the properties inherent in the H-matrices and 3) the matrices related to H-matrices. H-matrices acquire every time major relevancy due to the fact that they arise in numerous applications so much in Mathematics,...
Universal portfolios generated by Toeplitz matrices
Tan, Choon Peng; Chu, Sin Yen; Pan, Wei Yeing
2014-06-01
Performance of universal portfolios generated by Toeplitz matrices is studied in this paper. The general structure of the companion matrix of the generating Toeplitz matrix is determined. Empirical performance of the threeband and nine-band Toeplitz universal portfolios on real stock data is presented. Pseudo Toeplitz universal portfolios are studied with promising empirical achievement of wealth demonstrated.
Parametrizations of Positive Matrices With Applications
Tseng, M C; Ramakrishna, V; Zhou, Hong
2006-01-01
This paper reviews some characterizations of positive matrices and discusses which lead to useful parametrizations. It is argued that one of them, which we dub the Schur-Constantinescu parametrization is particularly useful. Two new applications of it are given. One shows all block-Toeplitz states are PPT. The other application is to relaxation rates.
Deconvolution and Regularization with Toeplitz Matrices
Hansen, Per Christian
2002-01-01
of these discretized deconvolution problems, with emphasis on methods that take the special structure of the matrix into account. Wherever possible, analogies to classical DFT-based deconvolution problems are drawn. Among other things, we present direct methods for regularization with Toeplitz matrices, and we show...
Extremal norms of graphs and matrices
Nikiforov, Vladimir
2010-01-01
In the recent years, the trace norm of graphs has been extensively studied under the name of graph energy. In this paper some of this research is extended to more general matrix norms, like the Schatten p-norms and the Ky Fan k-norms. Whenever possible the results are given both for graphs and general matrices.
Numerical Methods for Structured Matrices and Applications
Bini, Dario A; Olshevsky, Vadim; Tyrtsyhnikov, Eugene; van Barel, Marc
2010-01-01
This cross-disciplinary volume brings together theoretical mathematicians, engineers and numerical analysts and publishes surveys and research articles related to the topics where Georg Heinig had made outstanding achievements. In particular, this includes contributions from the fields of structured matrices, fast algorithms, operator theory, and applications to system theory and signal processing.
Positivity of Matrices with Generalized Matrix Functions
Fuzhen ZHANG
2012-01-01
Using an elementary fact on matrices we show by a unified approach the positivity of a partitioned positive semidefinite matrix with each square block replaced by a compound matrix,an elementary symmetric function or a generalized matrix function.In addition,we present a refined version of the Thompson determinant compression theorem.
Robust stability of interval parameter matrices
无
2000-01-01
This note is devoted to the problem of robust stability of interval parameter matrices. Based on some basic facts relating the H∞ norm of a transfer function to the Riccati matrix inequality and Hamilton matrix, several test conditions with parameter perturbation bounds are obtained.
Constructing random matrices to represent real ecosystems.
James, Alex; Plank, Michael J; Rossberg, Axel G; Beecham, Jonathan; Emmerson, Mark; Pitchford, Jonathan W
2015-05-01
Models of complex systems with n components typically have order n(2) parameters because each component can potentially interact with every other. When it is impractical to measure these parameters, one may choose random parameter values and study the emergent statistical properties at the system level. Many influential results in theoretical ecology have been derived from two key assumptions: that species interact with random partners at random intensities and that intraspecific competition is comparable between species. Under these assumptions, community dynamics can be described by a community matrix that is often amenable to mathematical analysis. We combine empirical data with mathematical theory to show that both of these assumptions lead to results that must be interpreted with caution. We examine 21 empirically derived community matrices constructed using three established, independent methods. The empirically derived systems are more stable by orders of magnitude than results from random matrices. This consistent disparity is not explained by existing results on predator-prey interactions. We investigate the key properties of empirical community matrices that distinguish them from random matrices. We show that network topology is less important than the relationship between a species' trophic position within the food web and its interaction strengths. We identify key features of empirical networks that must be preserved if random matrix models are to capture the features of real ecosystems.
Spectral averaging techniques for Jacobi matrices
del Rio, Rafael; Schulz-Baldes, Hermann
2008-01-01
Spectral averaging techniques for one-dimensional discrete Schroedinger operators are revisited and extended. In particular, simultaneous averaging over several parameters is discussed. Special focus is put on proving lower bounds on the density of the averaged spectral measures. These Wegner type estimates are used to analyze stability properties for the spectral types of Jacobi matrices under local perturbations.
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-11-30
We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.
Correspondence Analysis of Archeological Abundance Matrices
de Leeuw, Jan
2007-01-01
In this chapter we discuss the Correspondence Analysis (CA) techniques used in other chapters of this book. CA is presented as a multivariate exploratory technique, as a proximity analysis technique based on Benzecri distances, as a technique to decompose the total chi-square of frequency matrices, and as a least squares method to ﬁt association or ordination models.
Moment matrices, border bases and radical computation
Mourrain, B.; Lasserre, J.B.; Laurent, M.; Rostalski, P.; Trebuchet, P.
2011-01-01
In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is nte. The aim is to combine approaches for solving a system of polynomial equations with dual methods which involve moment matrices and semi-denite programming.
Moment matrices, border bases and radical computation
Mourrain, B.; Lasserre, J.B.; Laurent, M.; Rostalski, P.; Trebuchet, P.
2013-01-01
In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is nte. The aim is to combine approaches for solving a system of polynomial equations with dual methods which involve moment matrices and semi-denite programming.
Spectral properties of random triangular matrices
Basu, Riddhipratim; Ganguly, Shirshendu; Hazra, Rajat Subhra
2011-01-01
We provide a relatively elementary proof of the existence of the limiting spectral distribution (LSD) of symmetric triangular patterned matrices and also show their joint convergence. We also derive the expressions for the moments of the LSD of the symmetric triangular Wigner matrix using properties of Catalan words.
Affine processes on positive semidefinite matrices
Cuchiero, Christa; Mayerhofer, Eberhard; Teichmann, Josef
2009-01-01
This paper provides the mathematical foundation for stochastically continuous affine processes on the cone of positive semidefinite symmetric matrices. These matrix-valued affine processes have arisen from a large and growing range of useful applications in finance, including multi-asset option pricing with stochastic volatility and correlation structures, and fixed-income models with stochastically correlated risk factors and default intensities.
Malware Analysis Using Visualized Image Matrices
KyoungSoo Han
2014-01-01
Full Text Available This paper proposes a novel malware visual analysis method that contains not only a visualization method to convert binary files into images, but also a similarity calculation method between these images. The proposed method generates RGB-colored pixels on image matrices using the opcode sequences extracted from malware samples and calculates the similarities for the image matrices. Particularly, our proposed methods are available for packed malware samples by applying them to the execution traces extracted through dynamic analysis. When the images are generated, we can reduce the overheads by extracting the opcode sequences only from the blocks that include the instructions related to staple behaviors such as functions and application programming interface (API calls. In addition, we propose a technique that generates a representative image for each malware family in order to reduce the number of comparisons for the classification of unknown samples and the colored pixel information in the image matrices is used to calculate the similarities between the images. Our experimental results show that the image matrices of malware can effectively be used to classify malware families both statically and dynamically with accuracy of 0.9896 and 0.9732, respectively.
Hoshiba, Takashi; Tanaka, Masaru
2016-11-01
Chemoresistance is a major barrier for tumor chemotherapy. It is well-known that chemoresistance increases with tumor progression. Chemoresistance is altered by both genetic mutations and the alteration of extracellular microenvironment. Particularly, the extracellular matrix (ECM) is remodeled during tumor progression. Therefore, ECM remodeling is expected to cause the acquisition of chemoresistance in highly malignant tumor tissue. Here, we prepared cultured cell-derived decellularized matrices that mimic native ECM in tumor tissues at different stages of malignancy, and 5-fluorouracil (5-FU) resistance was compared among these matrices. 5-FU resistance of colorectal tumor cells increased on the matrices derived from highly malignant tumor HT-29 cells, although the resistance did not increase on the matrices derived from low malignant tumor SW480 cells and normal CCD-841-CoN cells. The resistance on HT-29 cell-derived matrices increased through the activation of Akt and the upregulation of ABCB1 and ABCC1 without cell growth promotion, suggesting that ECM remodeling plays important roles in the acquisition of chemoresistance during tumor progression. It is expected that our decellularized matrices, or "staged tumorigenesis-mimicking matrices", will become preferred cell culture substrates for in vitro analysis of comprehensive ECM roles in chemoresistance and the screening and pharmacokinetic analysis of anti-cancer drugs.
Karoui, Noureddine El
2009-01-01
We place ourselves in the setting of high-dimensional statistical inference, where the number of variables $p$ in a data set of interest is of the same order of magnitude as the number of observations $n$. More formally, we study the asymptotic properties of correlation and covariance matrices, in the setting where $p/n\\to\\rho\\in(0,\\infty),$ for general population covariance. We show that, for a large class of models studied in random matrix theory, spectral properties of large-dimensional correlation matrices are similar to those of large-dimensional covarance matrices. We also derive a Mar\\u{c}enko--Pastur-type system of equations for the limiting spectral distribution of covariance matrices computed from data with elliptical distributions and generalizations of this family. The motivation for this study comes partly from the possible relevance of such distributional assumptions to problems in econometrics and portfolio optimization, as well as robustness questions for certain classical random matrix result...
The primitive matrices of sandwich semigroups of generalized circulant Boolean matrices
LIU Jian-ping; CHEN Jin-song
2013-01-01
Let Gn(C) be the sandwich semigroup of generalized circulant Boolean matrices with the sandwich matrix C and GC (Jn) the set of all primitive matrices in Gn(C). In this paper, some necessary and suﬃ cient conditions for A in the semigroup Gn(C) to be primitive are given. We also show that GC (Jn) is a subsemigroup of Gn(C).
Detailed assessment of homology detection using different substitution matrices
LI Jing; WANG Wei
2006-01-01
Homology detection plays a key role in bioinformatics, whereas substitution matrix is one of the most important components in homology detection. Thus, besides the improvement of alignment algorithms, another effective way to enhance the accuracy of homology detection is to use proper substitution matrices or even construct new matrices.A study on the features of various matrices and on the comparison of the performances between different matrices in homology detection enable us to choose the most proper or optimal matrix for some specific applications. In this paper, by taking BLOSUM matrices as an example, some detailed features of matrices in homology detection are studied by calculating the distributions of numbers of recognized proteins over different sequence identities and sequence lengths. Our results clearly showed that different matrices have different preferences and abilities to the recognition of remote homologous proteins. Furthermore, detailed features of the various matrices can be used to improve the accuracy of homology detection.
Electrospun human keratin matrices as templates for tissue regeneration.
Sow, Wan Ting; Lui, Yuan Siang; Ng, Kee Woei
2013-04-01
The aim of this work was to study the feasibility of fabricating human hair keratin matrices through electrospinning and to evaluate the potential of these matrices for tissue regeneration. Keratin was extracted from human hair using Na2S and blended with poly(ethylene oxide) in the weight ratio of 60:1 for electrospinning. Physical morphology and chemical properties of the matrices were characterized using scanning electron microscopy and Fourier transform infrared spectroscopy, respectively. Cell viability and morphology of murine and human fibroblasts cultured on the matrices were evaluated through the Live/Dead(®) assay and scanning electron microscopy. Electrospun keratin matrices were successfully produced without affecting the chemical conformation of keratin. Fibroblasts cultured on keratin matrices showed healthy morphology and penetration into matrices at day 7. Electrospun human hair keratin matrices provide a bioinductive and structural environment for cell growth and are thus attractive as alternative templates for tissue regeneration.
Higher-Order Singular Systems and Polynomial Matrices
2005-01-01
There is a one-to-one correspondence between the set of quadruples of matrices defining singular linear time-invariant dynamical systems and a subset of the set of polynomial matrices. This correspondence preserves the equivalence relations introduced in both sets (feedback-similarity and strict equivalence): two quadruples of matrices are feedback-equivalent if, and only if, the polynomial matrices associated to them are also strictly equivalent. Los sistemas lineales singulares...
A new thought about the reduction method for tridiagonalizing symmetric indefinite matrices
SU Er
2013-12-01
Full Text Available The key problem of achievingPAPT=LTLT for tridiagonalizing symmetric indefinite matrices is how to design the recurrence calculations from Tk-1 to Tk. Direct calculations would lead to a heavy workload. With construction and proof, this paper studies the progressive reduction. Using the multiplication property of the Gauss transform, we can easily determine the recursion of unit lower triangular matrices. Thus, we establish a temporary matrix Hk-1 which is closely related to Tk-1. Element relations reflect the operation process and pending elements will provide the result. Then, with Tk-1, the progressive process is determined, and gradual reductions lead to the resultant tridiagonal matrix T. Thus, heavy and tedious matrix correction calculations are avoided.
原型解读艾德加·爱伦·坡诗作《乌鸦》%Archetypal Criticism on The Raven by Edgar Allan Poe
杨南翎; 曾融
2009-01-01
艾德加·爱伦·坡(Edgar Allan Poe)是19世纪美国文坛上著名的评论家、诗人、小说家及哲学家,(The Raven)是他的经典诗歌代表作.本文试图从原型批评的角度,简析诗作中的主要意象及影响爱伦·坡诗歌创作主题的因素,赏析该作品.
Decision Matrices: Tools to Enhance Middle School Engineering Instruction
Gonczi, Amanda L.; Bergman, Brenda G.; Huntoon, Jackie; Allen, Robin; McIntyre, Barb; Turner, Sheri; Davis, Jen; Handler, Rob
2017-01-01
Decision matrices are valuable engineering tools. They allow engineers to objectively examine solution options. Decision matrices can be incorporated in K-12 classrooms to support authentic engineering instruction. In this article we provide examples of how decision matrices have been incorporated into 6th and 7th grade classrooms as part of an…
19 CFR 10.90 - Master records and metal matrices.
2010-04-01
... 19 Customs Duties 1 2010-04-01 2010-04-01 false Master records and metal matrices. 10.90 Section... Master Records, and Metal Matrices § 10.90 Master records and metal matrices. (a) Consumption entries... made, of each master record or metal matrix covered thereby. (c) A bond on Customs Form 301,...
Decision Matrices: Tools to Enhance Middle School Engineering Instruction
Gonczi, Amanda L.; Bergman, Brenda G.; Huntoon, Jackie; Allen, Robin; McIntyre, Barb; Turner, Sheri; Davis, Jen; Handler, Rob
2017-01-01
Decision matrices are valuable engineering tools. They allow engineers to objectively examine solution options. Decision matrices can be incorporated in K-12 classrooms to support authentic engineering instruction. In this article we provide examples of how decision matrices have been incorporated into 6th and 7th grade classrooms as part of an…
On Skew Circulant Type Matrices Involving Any Continuous Fibonacci Numbers
Zhaolin Jiang
2014-01-01
inverse matrices of them by constructing the transformation matrices. Furthermore, the maximum column sum matrix norm, the spectral norm, the Euclidean (or Frobenius norm, and the maximum row sum matrix norm and bounds for the spread of these matrices are given, respectively.
Waller, Niels G
2016-01-01
For a fixed set of standardized regression coefficients and a fixed coefficient of determination (R-squared), an infinite number of predictor correlation matrices will satisfy the implied quadratic form. I call such matrices fungible correlation matrices. In this article, I describe an algorithm for generating positive definite (PD), positive semidefinite (PSD), or indefinite (ID) fungible correlation matrices that have a random or fixed smallest eigenvalue. The underlying equations of this algorithm are reviewed from both algebraic and geometric perspectives. Two simulation studies illustrate that fungible correlation matrices can be profitably used in Monte Carlo research. The first study uses PD fungible correlation matrices to compare penalized regression algorithms. The second study uses ID fungible correlation matrices to compare matrix-smoothing algorithms. R code for generating fungible correlation matrices is presented in the supplemental materials.
Wang, Fei; Reid, Greg; Wolkowicz, Henry
2016-01-01
Recent breakthroughs have been made in the use of semidefinite programming and its application to real polynomial solving. For example, the real radical of a zero dimensional ideal, can be determined by such approaches as shown by Lasserre and collaborators. Some progress has been made on the determination of the real radical in positive dimension by Ma, Wang and Zhi. Such work involves the determination of maximal rank semidefinite moment matrices. Existing methods are computationally expens...
Comments on "Human Capital Accumulation in Post Green Revolution Rural Pakistan: a Progress Report".
Von Urff, W
1992-01-01
Comments are provided on Professor Sabot's paper on human capital accumulation in Pakistan. The findings on gender gaps in school attendance and the acquisition of cognitive skills, and the impact of the quality of rural schooling on cognitive skills and labor productivity, reflected a shortage of schools (supply problem); variation in quality determined variations in cognitive skills. There have been general assumptions that gender differences in education in developing countries are related to the prevalence of Islam, but this decomposition model says otherwise. Inadequate supply clearly in this study is the reason for educational differences by gender. The reasons that the gender gap persists in spite of new school construction in rural villages is not adequately explained. A question is raised about whether supply is strictly separate from demand, and whether parents who want schooling for their daughters press government into building in their village. When the gender gap in preschool ability is eliminated, girls outperform boys, but not enough attention, for those not educators, was devoted to explaining the measurement tool (Raven's Colored Progressive Matrices) and methodology. Quality of school issues, which were found to be related to cognitive skill acquisition, were not defined in such a way as to specify important factors. Cognitive skill of teachers, access to electricity, availability of desks, chairs, blackboards, and chalk, and provision of books and other educational material are plausible causative factors determining quality. A constraint analysis is required to determine the most severe constraints. A good guess would be that teachers are a major link to quality; quality might be improved with careful recruitment and adequate training. The methods used to calculate the cost benefit of improving quality of primary schools over increasing the number of middle schools is questioned as to whether the equation covers all the differences in costs
Lectures on S-matrices and Integrability
Bombardelli, Diego
2016-01-01
In these notes we review the S-matrix theory in (1+1)-dimensional integrable models, focusing mainly on the relativistic case. Once the main definitions and physical properties are introduced, we discuss the factorization of scattering processes due to integrability. We then focus on the analytic properties of the 2-particle scattering amplitude and illustrate the derivation of the S-matrices for all the possible bound states using the so-called bootstrap principle. General algebraic structures underlying the S-matrix theory and its relation with the form factors axioms are briefly mentioned. Finally, we discuss the S-matrices of sine-Gordon and SU(2), SU(3) chiral Gross-Neveu models. This is part of a collection of lecture notes for the Young Researchers Integrability School, organised by the GATIS network at Durham University on 6-10 July 2015.
Inferring Passenger Type from Commuter Eigentravel Matrices
Legara, Erika Fille
2015-01-01
A sufficient knowledge of the demographics of a commuting public is essential in formulating and implementing more targeted transportation policies, as commuters exhibit different ways of traveling. With the advent of the Automated Fare Collection system (AFC), probing the travel patterns of commuters has become less invasive and more accessible. Consequently, numerous transport studies related to human mobility have shown that these observed patterns allow one to pair individuals with locations and/or activities at certain times of the day. However, classifying commuters using their travel signatures is yet to be thoroughly examined. Here, we contribute to the literature by demonstrating a procedure to characterize passenger types (Adult, Child/Student, and Senior Citizen) based on their three-month travel patterns taken from a smart fare card system. We first establish a method to construct distinct commuter matrices, which we refer to as eigentravel matrices, that capture the characteristic travel routines...
Astronomical Receiver Modelling Using Scattering Matrices
King, O G; Copley, C; Davis, R J; Leahy, J P; Leech, J; Muchovej, S J C; Pearson, T J; Taylor, Angela C
2014-01-01
Proper modelling of astronomical receivers is vital: it describes the systematic errors in the raw data, guides the receiver design process, and assists data calibration. In this paper we describe a method of analytically modelling the full signal and noise behaviour of arbitrarily complex radio receivers. We use electrical scattering matrices to describe the signal behaviour of individual components in the receiver, and noise correlation matrices to describe their noise behaviour. These are combined to produce the full receiver model. We apply this approach to a specified receiver architecture: a hybrid of a continous comparison radiometer and correlation polarimeter designed for the C-Band All-Sky Survey. We produce analytic descriptions of the receiver Mueller matrix and noise temperature, and discuss how imperfections in crucial components affect the raw data. Many of the conclusions drawn are generally applicable to correlation polarimeters and continuous comparison radiometers.
Approximate inverse preconditioners for general sparse matrices
Chow, E.; Saad, Y. [Univ. of Minnesota, Minneapolis, MN (United States)
1994-12-31
Preconditioned Krylov subspace methods are often very efficient in solving sparse linear matrices that arise from the discretization of elliptic partial differential equations. However, for general sparse indifinite matrices, the usual ILU preconditioners fail, often because of the fact that the resulting factors L and U give rise to unstable forward and backward sweeps. In such cases, alternative preconditioners based on approximate inverses may be attractive. We are currently developing a number of such preconditioners based on iterating on each column to get the approximate inverse. For this approach to be efficient, the iteration must be done in sparse mode, i.e., we must use sparse-matrix by sparse-vector type operatoins. We will discuss a few options and compare their performance on standard problems from the Harwell-Boeing collection.
Asymptotic properties of random matrices and pseudomatrices
Lenczewski, Romuald
2010-01-01
We study the asymptotics of sums of matricially free random variables called random pseudomatrices, and we compare it with that of random matrices with block-identical variances. For objects of both types we find the limit joint distributions of blocks and give their Hilbert space realizations, using operators called `matricially free Gaussian operators'. In particular, if the variance matrices are symmetric, the asymptotics of symmetric blocks of random pseudomatrices agrees with that of symmetric random blocks. We also show that blocks of random pseudomatrices are `asymptotically matricially free' whereas the corresponding symmetric random blocks are `asymptotically symmetrically matricially free', where symmetric matricial freeness is obtained from matricial freeness by an operation of symmetrization. Finally, we show that row blocks of square, lower-block-triangular and block-diagonal pseudomatrices are asymptotically free, monotone independent and boolean independent, respectively.
Non-Hermitean Wishart random matrices (I)
Kanzieper, Eugene
2010-01-01
A non-Hermitean extension of paradigmatic Wishart random matrices is introduced to set up a theoretical framework for statistical analysis of (real, complex and real quaternion) stochastic time series representing two "remote" complex systems. The first paper in a series provides a detailed spectral theory of non-Hermitean Wishart random matrices composed of complex valued entries. The great emphasis is placed on an asymptotic analysis of the mean eigenvalue density for which we derive, among other results, a complex-plane analogue of the Marchenko-Pastur law. A surprising connection with a class of matrix models previously invented in the context of quantum chromodynamics is pointed out. This provides one more evidence of the ubiquity of Random Matrix Theory.
Determinants of adjacency matrices of graphs
Alireza Abdollahi
2012-12-01
Full Text Available We study the set of all determinants of adjacency matrices of graphs with a given number of vertices. Using Brendan McKay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so that the number of non-isomorphic graphs with given vertices whose determinants are all equal to a number is exhibited in a table. Using an idea of M. Newman, it is proved that if $G$ is a graph with $n$ vertices and ${d_1,dots,d_n}$ is the set of vertex degrees of $G$, then $gcd(2m,d^2$ divides the determinant of the adjacency matrix of $G$, where $d=gcd(d_1,dots,d_n$. Possible determinants of adjacency matrices of graphs with exactly two cycles are obtained.
MULTIFRACTAL STRUCTURE AND PRODUCT OF MATRICES
Lau Ka-sing
2003-01-01
There is a well established multifractal theory for self-similar measures generated by non-overlapping contractive similutudes.Our report here concerns those with overlaps.In particular we restrict our attention to the important classes of self-similar measures that have matrix representations.The dimension spectra and the Lq-spectra are analyzed through the product of matrices.There are abnormal behaviors on the multifrac-tal structure and they will be discussed in detail.
Ferrers Matrices Characterized by the Rook Polynomials
MAHai-cheng; HUSheng-biao
2003-01-01
In this paper,we show that there exist precisely W(A) Ferrers matrices F(C1,C2,…,cm)such that the rook polynomials is equal to the rook polynomial of Ferrers matrix F(b1,b2,…,bm), where A={b1,b2-1,…,bm-m+1} is a repeated set,W(A) is weight of A.
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-01-07
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(n log n). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and optimal design
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-01-05
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(nlogn). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and op- timal design.
Connection matrices for ultradiscrete linear problems
Ormerod, Chris [School of Mathematics and Statistics F07, The University of Sydney, Sydney (Australia)
2007-10-19
We present theory outlining associated linear problems for ultradiscrete equations. The appropriate domain for these problems is the max-plus semiring. Our main result is that despite the restrictive nature of the max-plus semiring, it is still possible to define a theory of connection matrices analogous to that of Birkhoff and his school for systems of linear difference equations. We use such theory to provide evidence for the integrability of an ultradiscrete difference equation.
Functional CLT for sample covariance matrices
Bai, Zhidong; Zhou, Wang; 10.3150/10-BEJ250
2010-01-01
Using Bernstein polynomial approximations, we prove the central limit theorem for linear spectral statistics of sample covariance matrices, indexed by a set of functions with continuous fourth order derivatives on an open interval including $[(1-\\sqrt{y})^2,(1+\\sqrt{y})^2]$, the support of the Mar\\u{c}enko--Pastur law. We also derive the explicit expressions for asymptotic mean and covariance functions.
Index matrices towards an augmented matrix calculus
Atanassov, Krassimir T
2014-01-01
This book presents the very concept of an index matrix and its related augmented matrix calculus in a comprehensive form. It mostly illustrates the exposition with examples related to the generalized nets and intuitionistic fuzzy sets which are examples of an extremely wide array of possible application areas. The present book contains the basic results of the author over index matrices and some of its open problems with the aim to stimulating more researchers to start working in this area.
On the exponentials of some structured matrices
Ramakrishna, Viswanath; Costa, F [Department of Mathematical Sciences and Center for Signals, Systems and Communications, University of Texas at Dallas, PO Box 830688, Richardson, TX 75083 (United States)
2004-12-03
This paper provides explicit techniques to compute the exponentials of a variety of structured 4 x 4 matrices. The procedures are fully algorithmic and can be used to find the desired exponentials in closed form. With one exception, they require no spectral information about the matrix being exponentiated. They rely on a mixture of Lie theory and one particular Clifford algebra isomorphism. These can be extended, in some cases, to higher dimensions when combined with techniques such as Givens rotations.
The spectrum of kernel random matrices
Karoui, Noureddine El
2010-01-01
We place ourselves in the setting of high-dimensional statistical inference where the number of variables $p$ in a dataset of interest is of the same order of magnitude as the number of observations $n$. We consider the spectrum of certain kernel random matrices, in particular $n\\times n$ matrices whose $(i,j)$th entry is $f(X_i'X_j/p)$ or $f(\\Vert X_i-X_j\\Vert^2/p)$ where $p$ is the dimension of the data, and $X_i$ are independent data vectors. Here $f$ is assumed to be a locally smooth function. The study is motivated by questions arising in statistics and computer science where these matrices are used to perform, among other things, nonlinear versions of principal component analysis. Surprisingly, we show that in high-dimensions, and for the models we analyze, the problem becomes essentially linear--which is at odds with heuristics sometimes used to justify the usage of these methods. The analysis also highlights certain peculiarities of models widely studied in random matrix theory and raises some questio...
Quark flavor mixings from hierarchical mass matrices
Verma, Rohit [Chinese Academy of Sciences, Institute of High Energy Physics, Beijing (China); Rayat Institute of Engineering and Information Technology, Ropar (India); Zhou, Shun [Chinese Academy of Sciences, Institute of High Energy Physics, Beijing (China); Peking University, Center for High Energy Physics, Beijing (China)
2016-05-15
In this paper, we extend the Fritzsch ansatz of quark mass matrices while retaining their hierarchical structures and show that the main features of the Cabibbo-Kobayashi-Maskawa (CKM) matrix V, including vertical stroke V{sub us} vertical stroke ≅ vertical stroke V{sub cd} vertical stroke, vertical stroke V{sub cb} vertical stroke ≅ vertical stroke V{sub ts} vertical stroke and vertical stroke V{sub ub} vertical stroke / vertical stroke V{sub cb} vertical stroke < vertical stroke V{sub td} vertical stroke / vertical stroke V{sub ts} vertical stroke can be well understood. This agreement is observed especially when the mass matrices have non-vanishing (1, 3) and (3, 1) off-diagonal elements. The phenomenological consequences of these for the allowed texture content and gross structural features of 'hierarchical' quark mass matrices are addressed from a model-independent prospective under the assumption of factorizable phases in these. The approximate and analytical expressions of the CKM matrix elements are derived and a detailed analysis reveals that such structures are in good agreement with the observed quark flavor mixing angles and the CP-violating phase at the 1σ level and call upon a further investigation of the realization of these structures from a top-down prospective. (orig.)
Scattering Matrices and Conductances of Leaky Tori
Pnueli, A.
1994-04-01
Leaky tori are two-dimensional surfaces that extend to infinity but which have finite area. It is a tempting idea to regard them as models of mesoscopic systems connected to very long leads. Because of this analogy-scattering matrices on leaky tori are potentially interesting, and indeed-the scattering matrix on one such object-"the" leaky torus-was studied by M. Gutzwiller, who showed that it has chaotic behavior. M. Antoine, A. Comtet and S. Ouvry generalized Gutzwiller‧s result by calculating the scattering matrix in the presence of a constant magnetic field B perpendicular to the surface. Motivated by these results-we generalize them further. We define scattering matrices for spinless electrons on a general leaky torus in the presence of a constant magnetic field "perpendicular" to the surface. From the properties of these matrices we show the following: (a) For integer values of B, Tij (the transition probability from cusp i to cusp j), and hence also the Büttiker conductances of the surfaces, are B-independent (this cannot be interpreted as a kind of Aharonov-Bohm effect since a magnetic force is acting on the electrons). (b) The Wigner time-delay is a monotonically increasing function of B.
On the Construction of Jointly Superregular Lower Triangular Toeplitz Matrices
Hansen, Jonas; Østergaard, Jan; Kudahl, Johnny
2016-01-01
superregular and product preserving jointly superregular matrices, and extend our explicit constructions of superregular matrices to these cases. Jointly superregular matrices are necessary to achieve optimal decoding capabilities for the case of codes with a rate lower than 1/2, and the product preserving......Superregular matrices have the property that all of their submatrices, which can be full rank are so. Lower triangular superregular matrices are useful for e.g., maximum distance separable convolutional codes as well as for (sequential) network codes. In this work, we provide an explicit design...
The modern origin of matrices and their applications
Debnath, L.
2014-05-01
This paper deals with the modern development of matrices, linear transformations, quadratic forms and their applications to geometry and mechanics, eigenvalues, eigenvectors and characteristic equations with applications. Included are the representations of real and complex numbers, and quaternions by matrices, and isomorphism in order to show that matrices form a ring in abstract algebra. Some special matrices, including Hilbert's matrix, Toeplitz's matrix, Pauli's and Dirac's matrices in quantum mechanics, and Einstein's Pythagorean formula are discussed to illustrate diverse applications of matrix algebra. Included also is a modern piece of information that puts mathematics, science and mathematics education professionals at the forefront of advanced study and research on linear algebra and its applications.
Deterministic sensing matrices in compressive sensing: a survey.
Nguyen, Thu L N; Shin, Yoan
2013-01-01
Compressive sensing is a sampling method which provides a new approach to efficient signal compression and recovery by exploiting the fact that a sparse signal can be suitably reconstructed from very few measurements. One of the most concerns in compressive sensing is the construction of the sensing matrices. While random sensing matrices have been widely studied, only a few deterministic sensing matrices have been considered. These matrices are highly desirable on structure which allows fast implementation with reduced storage requirements. In this paper, a survey of deterministic sensing matrices for compressive sensing is presented. We introduce a basic problem in compressive sensing and some disadvantage of the random sensing matrices. Some recent results on construction of the deterministic sensing matrices are discussed.
Matrices with restricted entries and q-analogues of permutations
Lewis, Joel Brewster; Morales, Alejandro H; Panova, Greta; Sam, Steven V; Zhang, Yan
2010-01-01
We study the functions that count matrices of given rank over a finite field with specified positions equal to zero. We show that these matrices are $q$-analogues of permutations with certain restricted values. We obtain a simple closed formula for the number of invertible matrices with zero diagonal, a $q$-analogue of derangements, and a curious relationship between invertible skew-symmetric matrices and invertible symmetric matrices with zero diagonal. In addition, we provide recursions to enumerate matrices and symmetric matrices with zero diagonal by rank, and we frame some of our results in the context of Lie theory. Finally, we provide a brief exposition of polynomiality results for enumeration questions related to those mentioned, and give several open questions.
Bickel, Peter J
2010-01-01
In the first part of this paper we give an elementary proof of the fact that if an infinite matrix $A$, which is invertible as a bounded operator on $\\ell^2$, can be uniformly approximated by banded matrices then so can the inverse of $A$. We give explicit formulas for the banded approximations of $A^{-1}$ as well as bounds on their accuracy and speed of convergence in terms of their band-width. In the second part we apply these results to covariance matrices $\\Sigma$ of Gaussian processes and study mixing and beta mixing of processes in terms of properties of $\\Sigma$. Finally, we note some applications of our results to statistics.
Jonaitis, Aldona
1987-01-01
Reviews: a volume of 11 essays on the history of Sheldon Jackson Museum and its Eskimo, Aleut, Athabaskan, Tlingit, and Haida collections; and a book analyzing the geometric design, technique, and imagery of 15 "raven's tail robes," early Northwest Coast textiles predating the more familiar Chilkat blankets. (SV)
Generalized Jones matrices for anisotropic media.
Ortega-Quijano, Noé; Arce-Diego, José Luis
2013-03-25
The interaction of arbitrary three-dimensional light beams with optical elements is described by the generalized Jones calculus, which has been formally proposed recently [Azzam, J. Opt. Soc. Am. A 28, 2279 (2011)]. In this work we obtain the parametric expression of the 3×3 differential generalized Jones matrix (dGJM) for arbitrary optical media assuming transverse light waves. The dGJM is intimately connected to the Gell-Mann matrices, and we show that it provides a versatile method for obtaining the macroscopic GJM of media with either sequential or simultaneous anisotropic effects. Explicit parametric expressions of the GJM for some relevant optical elements are provided.
Jones matrices of perfectly conducting metallic polarizers
Boyer, Philippe
2014-01-01
We deduce from Monomode Modal Method the analytical expressions of transmission and reflexion Jones matrices of an infinitely conducting metallic screen periodically pierced by subwavelength holes. The study is restricted to normal incidence and to the case of neglected evanescent fields (far-field) which covers many common cases. When only one non-degenerate mode propagates in cavities, they take identical forms to those of a polarizer, with Fabry-Perot-like spectral resonant factors depending on bigrating parameters. The isotropic or birefringent properties are then obtained when holes support two orthogonal polarization modes. This basic formalism is finally applied to design compact and efficient metallic half-wave plates.
Algebraic Graph Theory Morphisms, Monoids and Matrices
Knauer, Ulrich
2011-01-01
This is a highly self-contained book about algebraic graph theory which iswritten with a view to keep the lively and unconventional atmosphere of a spoken text to communicate the enthusiasm the author feels about this subject. The focus is on homomorphisms and endomorphisms, matrices and eigenvalues. Graph models are extremely useful for almost all applications and applicators as they play an important role as structuring tools. They allow to model net structures -like roads, computers, telephones -instances of abstract data structures -likelists, stacks, trees -and functional or object orient
Deborah Bird Rose
2011-09-01
Full Text Available ‘We were driving through Death Valley, an American-Australian and two Aussies, taking the scenic route from Las Vegas to Santa Cruz.’ This multi-voiced account of multispecies encounters along a highway takes up the challenge of playful and humorous writing that is as well deeply serious and theoretically provocative. Our travels brought us into what Donna Haraway calls the contact zone: a region of recognition and response. The contact zone is a place of significant questions: ‘Who are you, and so who are we? Here we are, and so what are we to become?’ Events were everything in this ecology of play, in which the movements of all the actors involved the material field in its entirety. We were brought into dances of approach and withdrawal, dances emerging directly, to paraphrase Brian Massumi, from the dynamic relation between a myriad of charged particles.
Wagner, C.
1996-12-31
In 1992, Wittum introduced the frequency filtering decompositions (FFD), which yield a fast method for the iterative solution of large systems of linear equations. Based on this method, the tangential frequency filtering decompositions (TFFD) have been developed. The TFFD allow the robust and efficient treatment of matrices with strongly varying coefficients. The existence and the convergence of the TFFD can be shown for symmetric and positive definite matrices. For a large class of matrices, it is possible to prove that the convergence rate of the TFFD and of the FFD is independent of the number of unknowns. For both methods, schemes for the construction of frequency filtering decompositions for unsymmetric matrices have been developed. Since, in contrast to Wittums`s FFD, the TFFD needs only one test vector, an adaptive test vector can be used. The TFFD with respect to the adaptive test vector can be combined with other iterative methods, e.g. multi-grid methods, in order to improve the robustness of these methods. The frequency filtering decompositions have been successfully applied to the problem of the decontamination of a heterogeneous porous medium by flushing.
APPLICATIONS OF STAIR MATRICES AND THEIR GENERALIZATIONS TO ITERATIVE METHODS
SHAO Xin-hui; SHEN Hai-long; LI Chang-jun
2006-01-01
Stair matrices and their generalizations are introduced. The definitions and some properties of the matrices were first given by Lu Hao. This class of matrices provide bases of matrix splittings for iterative methods. The remarkable feature of iterative methods based on the new class of matrices is that the methods are easily implemented for parallel computation. In particular, a generalization of the accelerated overrelaxation method (GAOR) is introduced. Some theories of the AOR method are extended to the generalized method to include a wide class of matrices. The convergence of the new method is derived for Hermitian positive definite matrices. Finally, some examples are given in order to show the superiority of the new method.
A CLASS OF DETERMINISTIC CONSTRUCTION OF BINARY COMPRESSED SENSING MATRICES
Li Dandan; Liu Xinji; Xia Shutao; Jiang Yong
2012-01-01
Compressed Sensing (CS) is an emerging technology in the field of signal processing,which can recover a sparse signal by taking very few samples and solving a linear programming problem.In this paper,we study the application of Low-Density Parity-Check (LDPC) Codes in CS.Firstly,we find a sufficient condition for a binary matrix to satisfy the Restricted Isometric Property (RIP).Then,by employing the LDPC codes based on Berlekamp-Justesen (B-J) codes,we construct two classes of binary structured matrices and show that these matrices satisfy RIP.Thus,the proposed matrices could be used as sensing matrices for CS.Finally,simulation results show that the performance of the Droposed matrices can be comparable with the widely used random sensing matrices.
Asymmetric random matrices: What do we need them for?
Drozdz, Stanislaw; Ioannides, Andreas A; 10.5506/APhysPolB.42.987
2011-01-01
Complex systems are typically represented by large ensembles of observations. Correlation matrices provide an efficient formal framework to extract information from such multivariate ensembles and identify in a quantifiable way patterns of activity that are reproducible with statistically significant frequency compared to a reference chance probability, usually provided by random matrices as fundamental reference. The character of the problem and especially the symmetries involved must guide the choice of random matrices to be used for the definition of a baseline reference. For standard correlation matrices this is the Wishart ensemble of symmetric random matrices. The real world complexity however often shows asymmetric information flows and therefore more general correlation matrices are required to adequately capture the asymmetry. Here we first summarize the relevant theoretical concepts. We then present some examples of human brain activity where asymmetric time-lagged correlations are evident and hence...
Tensor Dictionary Learning for Positive Definite Matrices.
Sivalingam, Ravishankar; Boley, Daniel; Morellas, Vassilios; Papanikolopoulos, Nikolaos
2015-11-01
Sparse models have proven to be extremely successful in image processing and computer vision. However, a majority of the effort has been focused on sparse representation of vectors and low-rank models for general matrices. The success of sparse modeling, along with popularity of region covariances, has inspired the development of sparse coding approaches for these positive definite descriptors. While in earlier work, the dictionary was formed from all, or a random subset of, the training signals, it is clearly advantageous to learn a concise dictionary from the entire training set. In this paper, we propose a novel approach for dictionary learning over positive definite matrices. The dictionary is learned by alternating minimization between sparse coding and dictionary update stages, and different atom update methods are described. A discriminative version of the dictionary learning approach is also proposed, which simultaneously learns dictionaries for different classes in classification or clustering. Experimental results demonstrate the advantage of learning dictionaries from data both from reconstruction and classification viewpoints. Finally, a software library is presented comprising C++ binaries for all the positive definite sparse coding and dictionary learning approaches presented here.
Bromination of selected pharmaceuticals in water matrices.
Benitez, F Javier; Acero, Juan L; Real, Francisco J; Roldan, Gloria; Casas, Francisco
2011-11-01
The bromination of five selected pharmaceuticals (metoprolol, naproxen, amoxicillin, phenacetin, and hydrochlorothiazide) was studied with these compounds individually dissolved in ultra-pure water. The apparent rate constants for the bromination reaction were determined as a function of the pH, obtaining the sequence amoxicillin>naproxen>hydrochlorothiazide≈phenacetin≈metoprolol. A kinetic mechanism specifying the dissociation reactions and the species formed for each compound according to its pK(a) value and the pH allowed the intrinsic rate constants to be determined for each elementary reaction. There was fairly good agreement between the experimental and calculated values of the apparent rate constants, confirming the goodness of the proposed reaction mechanism. In a second stage, the bromination of the selected pharmaceuticals simultaneously dissolved in three water matrices (a groundwater, a surface water from a public reservoir, and a secondary effluent from a WWTP) was investigated. The pharmaceutical elimination trend agreed with the previously determined rate constants. The influence of the main operating conditions (pH, initial bromine dose, and characteristics of the water matrix) on the degradation of the pharmaceuticals was established. An elimination concentration profile for each pharmaceutical in the water matrices was proposed based on the use of the previously evaluated apparent rate constants, and the theoretical results agreed satisfactorily with experiment. Finally, chlorination experiments performed in the presence of bromide showed that low bromide concentrations slightly accelerate the oxidation of the selected pharmaceuticals during chlorine disinfection.
Moderate deviations for the eigenvalue counting function of Wigner matrices
Doering, Hanna
2011-01-01
We establish a moderate deviation principle (MDP) for the number of eigenvalues of a Wigner matrix in an interval. The proof relies on fine asymptotics of the variance of the eigenvalue counting function of GUE matrices due to Gustavsson. The extension to large families of Wigner matrices is based on the Tao and Vu Four Moment Theorem and applies localization results by Erd\\"os, Yau and Yin. Moreover we investigate families of covariance matrices as well.
Symmetric texture-zero mass matrices and its eigenvalues
Criollo, A
2012-01-01
Within the texture-zeros mechanism, first we provide necessary and sufficient conditions on the characteristic polynomial coefficients so that it has real, simple and positive roots, we traduce these conditions in terms to the invariants of the congruent matrices. Next all symmetric texture-zero mass matrices are counted and classified. Finally we apply in a systematic way the result from the first part to analyze the six, four and two zeros texture matrices presented in the second part.
Wick's theorem and reconstruction schemes for reduced density matrices
CHEN Feiwu
2006-01-01
We first obtained a closed form of the Wick's theorem expressed in Grassman wedge product, which is similar to a binomial expansion. With this new expansion, new reconstruction schemes for reduced density matrices are derived rigorously. The higher order reduced density matrices are systematically decomposed into a sum of the lower order reduced density matrices which could be used to solve the contracted Schr(o)dinger equation.
Racah matrices and hidden integrability in evolution of knots
Mironov, A.; Morozov, A.; Morozov, An.; Sleptsov, A.
2016-09-01
We construct a general procedure to extract the exclusive Racah matrices S and S bar from the inclusive 3-strand mixing matrices by the evolution method and apply it to the first simple representations R = [ 1 ], [2], [3] and [ 2 , 2 ]. The matrices S and S bar relate respectively the maps (R ⊗ R) ⊗ R bar ⟶ R with R ⊗ (R ⊗ R bar) ⟶ R and (R ⊗ R bar) ⊗ R ⟶ R with R ⊗ (R bar ⊗ R) ⟶ R. They are building blocks for the colored HOMFLY polynomials of arbitrary arborescent (double fat) knots. Remarkably, the calculation realizes an unexpected integrability property underlying the evolution matrices.
Inverse Eigenvalue Problems for Two Special Acyclic Matrices
Debashish Sharma
2016-03-01
Full Text Available In this paper, we study two inverse eigenvalue problems (IEPs of constructing two special acyclic matrices. The first problem involves the reconstruction of matrices whose graph is a path, from given information on one eigenvector of the required matrix and one eigenvalue of each of its leading principal submatrices. The second problem involves reconstruction of matrices whose graph is a broom, the eigen data being the maximum and minimum eigenvalues of each of the leading principal submatrices of the required matrix. In order to solve the problems, we use the recurrence relations among leading principal minors and the property of simplicity of the extremal eigenvalues of acyclic matrices.
Self-dual interval orders and row-Fishburn matrices
Yan, Sherry H F
2011-01-01
Recently, Jel\\'{i}nek derived that the number of self-dual interval orders of reduced size $n$ is twice the number of row-Fishburn matrices of size $n$ by using generating functions. In this paper, we present a bijective proof of this relation by establishing a bijection between two variations of upper-triangular matrices of nonnegative integers. Using the bijection, we provide a combinatorial proof of the refined relations between self-dual Fishburn matrices and row-Fishburn matrices in answer to a problem proposed by Jel\\'{i}nek.
Applications of combinatorial matrix theory to Laplacian matrices of graphs
Molitierno, Jason J
2012-01-01
On the surface, matrix theory and graph theory seem like very different branches of mathematics. However, adjacency, Laplacian, and incidence matrices are commonly used to represent graphs, and many properties of matrices can give us useful information about the structure of graphs. Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs is a compilation of many of the exciting results concerning Laplacian matrices developed since the mid 1970s by well-known mathematicians such as Fallat, Fiedler, Grone, Kirkland, Merris, Mohar, Neumann, Shader, Sunder, and more. The text i
Matrices generadas por adición de díadas (matrices de rango 1): propiedades y aplicaciones
Ortigueira, Manuel D.
1996-01-01
Se estudian las matrices elementales de rango 1 (díadas). Para estas matrices se presentan fórmulas para su factorización, inversión, descomposición en valores propios y valores singulares. Estos resultados son aplicados en análisis recursivo a cualquier matriz, siempre que se descomponga en una suma de matrices de rango 1. Peer Reviewed
Matrices generadas por adición de díadas (matrices de rango 1): propiedades y aplicaciones
Ortigueira, Manuel D.
1996-01-01
Se estudian las matrices elementales de rango 1 (díadas). Para estas matrices se presentan fórmulas para su factorización, inversión, descomposición en valores propios y valores singulares. Estos resultados son aplicados en análisis recursivo a cualquier matriz, siempre que se descomponga en una suma de matrices de rango 1. Peer Reviewed
Diego Mandelli; Curtis Smith; Thomas Riley; John Schroeder; Cristian Rabiti; Aldrea Alfonsi; Joe Nielsen; Dan Maljovec; Bie Wang; Valerio Pascucci
2013-09-01
The existing fleet of nuclear power plants is in the process of extending its lifetime and increasing the power generated. In order to evaluate the impact of these two factors on the safety of the plant, the Risk Informed Safety Margin Characterization (RISMC) project aims to provide insight to decision makers through a series of simulations of the plant dynamics for different initial conditions (e.g., probabilistic analysis and uncertainty quantification). This report focuses, in particular, on the impact of power uprate on the safety of a boiled water reactor system. The case study considered is a loss of off-site power followed by the loss of diesel generators, i.e., a station black out (SBO) event. Analysis is performed by using a thermo-hydraulic code, i.e. RELAP-5, and a stochastic analysis tool currently under development at INL, i.e. RAVEN. Starting from the event tree models contained in SAPHIRE, we built the input file for RELAP-5 that models in great detail system dynamics under SBO conditions. We also interfaced RAVEN with RELAP-5 so that it would be possible to run multiple RELAP-5 simulation runs by changing specific keywords of the input file. We both employed classical statistical tools, i.e. Monte-Carlo, and more advanced machine learning based algorithms to perform uncertainty quantification in order to quantify changes in system performance and limitations as a consequence of power uprate. We also employed advanced data analysis and visualization tools that helped us to correlate simulation outcome such as maximum core temperature with a set of input uncertain parameters. Results obtained gave a detailed overview of the issues associated to power uprate for a SBO accident scenario. We were able to quantify how timing of safety related events were impacted by a higher reactor core power. Such insights can provide useful material to the decision makers to perform risk-infomed safety margins management.
Investigation of degradation mechanisms in composite matrices
Giori, C.; Yamauchi, T.
1982-01-01
Degradation mechanisms were investigated for graphite/polysulfone and graphite/epoxy laminates exposed to ultraviolet and high-energy electron radiations in vacuum up to 960 equivalent sun hours and 10 to the ninth power rads respectively. Based on GC and combined GC/MS analysis of volatile by-products evolved during irradiation, several free radical mechanisms of composite degradation were identified. The radiation resistance of different matrices was compared in terms of G values and quantum yields for gas formation. All the composite materials evaluated show high electron radiation stability and relatively low ultraviolet stability as indicated by low G values and high quantum for gas formation. Mechanical property measurements of irradiated samples did not reveal significant changes, with the possible exception of UV exposed polysulfone laminates. Hydrogen and methane were identified as the main by-products of irradiation, along with unexpectedly high levels of CO and CO2.
Diameter Preserving Surjection on Alternate Matrices
Li Ping HUANG
2009-01-01
Let F be a field with |F| ≥ 3, Km be the set of all m × m (m ≥ 4) alternate matrices over F. The arithmetic distance of A, B ∈ Km is d(A, B) := rank(A- B). If d(A, B) = 2, then A and B are said to be adjacent. The diameter of Km is max{d(A, B) : A, B ∈ Km}. Assume that ψ : Km→ Km is a map. We prove the following are equivalent: (a) ψ is a diameter preserving surjection in both directions, (b) ψ is both an adjacency preserving surjection and a diameter preserving map, (c) ψ is a bijective map which preserves the arithmetic distance.
Spirooxazine Photoisomerization and Relaxation in Polymer Matrices
Maria Larkowska
2011-01-01
Full Text Available 9′-Hydroxy-1,3,3-trimethylspiro[indoline-2,3′[3H]naphtha[2,1-b]-1,4oxazine] (SPO-7OH was used in studies of photochromic transformations in polymer matrices. Illumination with UV lamp caused opening the spirostructure of the oxazine with formation of open merocyanine species absorbing at ca. 610 nm. The kinetic studies of thermal relaxation of the open form showed that this process can be described with a biexponential function including both photochemical reaction and rheological behaviour of the polymeric environment. Basing on Arrhenius plot of the rate constant ascribed to the photochemical reaction, the activation energy was determined, which was 66.1 and 84.7 kJ/mole for poly(methyl methacrylate-co-butyl methacrylate and poly(vinylpyrrolidone matrix, respectively.
Carbon nanomaterials in silica aerogel matrices
Hamilton, Christopher E [Los Alamos National Laboratory; Chavez, Manuel E [Los Alamos National Laboratory; Duque, Juan G [Los Alamos National Laboratory; Gupta, Gautam [Los Alamos National Laboratory; Doorn, Stephen K [Los Alamos National Laboratory; Dattelbaum, Andrew M [Los Alamos National Laboratory; Obrey, Kimberly A D [Los Alamos National Laboratory
2010-01-01
Silica aerogels are ultra low-density, high surface area materials that are extremely good thermal insulators and have numerous technical applications. However, their mechanical properties are not ideal, as they are brittle and prone to shattering. Conversely, single-walled carbon nanotubes (SWCNTs) and graphene-based materials, such as graphene oxide, have extremely high tensile strength and possess novel electronic properties. By introducing SWCNTs or graphene-based materials into aerogel matrices, it is possible to produce composites with the desirable properties of both constituents. We have successfully dispersed SWCNTs and graphene-based materials into silica gels. Subsequent supercritical drying results in monolithic low-density composites having improved mechanical properties. These nanocomposite aerogels have great potential for use in a wide range of applications.
Momentum representation for equilibrium reduced density matrices
Golovko, V A
2011-01-01
The hierarchy of equations for reduced density matrices that describes a thermodynamically equilibrium quantum system obtained earlier by the author is investigated in the momentum representation. In the paper it is shown that the use of the momentum representation opens up new opportunities in studies of macroscopic quantum systems both nonsuperfluid and superfluid. It is found that the distribution over momenta in a quantum fluid is not a Bose or Fermi distribution even in the limit of practically noninteracting particles. The distribution looks like a Maxwellian one although, strictly speaking, it is not Maxwellian. The momentum distribution in a quantum crystal depends upon the interaction potential and the crystalline structure. The momentum distribution in a superfluid contains a delta function. The momentum distribution for the condensate in a superfluid crystal consists of delta peaks that are arranged periodically in momentum space. The periodical structure remains if the condensate crystal is not su...
Statistical properties of random scattering matrices
Seba, P; Zakrzewski, J A; Seba, Petr; Zyczkowski, Karol; Zakrzewski, Jakub
1996-01-01
We discuss the properties of eigenphases of S--matrices in random models simulating classically chaotic scattering. The energy dependence of the eigenphases is investigated and the corresponding velocity and curvature distributions are obtained both theoretically and numerically. A simple formula describing the velocity distribution (and hence the distribution of the Wigner time delay) is derived, which is capable to explain the algebraic tail of the time delay distribution observed recently in microwave experiments. A dependence of the eigenphases on other external parameters is also discussed. We show that in the semiclassical limit (large number of channels) the curvature distribution of S--matrix eigenphases is the same as that corresponding to the curvature distribution of the underlying Hamiltonian and is given by the generalized Cauchy distribution.
Matrices over runtime systems at exascale
Agullo, Emmanuel
2012-11-01
The goal of Matrices Over Runtime Systems at Exascale (MORSE) project is to design dense and sparse linear algebra methods that achieve the fastest possible time to an accurate solution on large-scale multicore systems with GPU accelerators, using all the processing power that future high end systems can make available. In this poster, we propose a framework for describing linear algebra algorithms at a high level of abstraction and delegating the actual execution to a runtime system in order to design software whose performance is portable accross architectures. We illustrate our methodology on three classes of problems: dense linear algebra, sparse direct methods and fast multipole methods. The resulting codes have been incorporated into Magma, Pastix and ScalFMM solvers, respectively. © 2012 IEEE.
Unbiased community detection for correlation matrices
MacMahon, Mel
2013-01-01
A challenging problem in the study of large complex systems is that of resolving, without prior information, the emergent mesoscopic organization determined by groups of units whose dynamical activity is more strongly correlated internally than with the rest of the system. The existing techniques to filter correlations are not explicitly oriented at identifying such modules and suffer from an unavoidable information loss. A promising alternative is that of employing community detection techniques developed in network theory. Unfortunately, the attempts made so far have merely replaced network data with correlation matrices, a procedure that we show to be fundamentally biased due to its inconsistency with the null hypotheses underlying the existing algorithms. Here we introduce, via a consistent redefinition of null models based on Random Matrix Theory, the unbiased correlation-based counterparts of the most popular community detection techniques. After successfully benchmarking our methods, we apply them to s...
A convergence analysis of SOR iterative methods for linear systems with weak H-matrices
Zhang Cheng-yi
2016-01-01
Full Text Available It is well known that SOR iterative methods are convergent for linear systems, whose coefficient matrices are strictly or irreducibly diagonally dominant matrices and strong H-matrices (whose comparison matrices are nonsingular M-matrices. However, the same can not be true in case of those iterative methods for linear systems with weak H-matrices (whose comparison matrices are singular M-matrices. This paper proposes some necessary and sufficient conditions such that SOR iterative methods are convergent for linear systems with weak H-matrices. Furthermore, some numerical examples are given to demonstrate the convergence results obtained in this paper.
Dirac matrices for Chern-Simons gravity
Izaurieta, Fernando; Ramírez, Ricardo; Rodríguez, Eduardo
2012-10-01
A genuine gauge theory for the Poincaré, de Sitter or anti-de Sitter algebras can be constructed in (2n - 1)-dimensional spacetime by means of the Chern-Simons form, yielding a gravitational theory that differs from General Relativity but shares many of its properties, such as second order field equations for the metric. The particular form of the Lagrangian is determined by a rank n, symmetric tensor invariant under the relevant algebra. In practice, the calculation of this invariant tensor can be reduced to the computation of the trace of the symmetrized product of n Dirac Gamma matrices Γab in 2n-dimensional spacetime. While straightforward in principle, this calculation can become extremely cumbersome in practice. For large enough n, existing computer algebra packages take an inordinate long time to produce the answer or plainly fail having used up all available memory. In this talk we show that the general formula for the trace of the symmetrized product of 2n Gamma matrices Γab can be written as a certain sum over the integer partitions s of n, with every term being multiplied by a numerical cofficient αs. We then give a general algorithm that computes the α-coefficients as the solution of a linear system of equations generated by evaluating the general formula for different sets of tensors Bab with random numerical entries. A recurrence relation between different coefficients is shown to hold and is used in a second, "minimal" algorithm to greatly speed up the computations. Runtime of the minimal algorithm stays below 1 min on a typical desktop computer for up to n = 25, which easily covers all foreseeable applications of the trace formula.
Dirac matrices for Chern-Simons gravity
Izaurieta, Fernando; Ramirez, Ricardo; Rodriguez, Eduardo [Departamento de Matematica y Fisica Aplicadas, Universidad Catolica de la Santisima Concepcion, Alonso de Ribera 2850, 4090541 Concepcion (Chile)
2012-10-06
A genuine gauge theory for the Poincare, de Sitter or anti-de Sitter algebras can be constructed in (2n- 1)-dimensional spacetime by means of the Chern-Simons form, yielding a gravitational theory that differs from General Relativity but shares many of its properties, such as second order field equations for the metric. The particular form of the Lagrangian is determined by a rank n, symmetric tensor invariant under the relevant algebra. In practice, the calculation of this invariant tensor can be reduced to the computation of the trace of the symmetrized product of n Dirac Gamma matrices {Gamma}{sub ab} in 2n-dimensional spacetime. While straightforward in principle, this calculation can become extremely cumbersome in practice. For large enough n, existing computer algebra packages take an inordinate long time to produce the answer or plainly fail having used up all available memory. In this talk we show that the general formula for the trace of the symmetrized product of 2n Gamma matrices {Gamma}{sub ab} can be written as a certain sum over the integer partitions s of n, with every term being multiplied by a numerical cofficient {alpha}{sub s}. We then give a general algorithm that computes the {alpha}-coefficients as the solution of a linear system of equations generated by evaluating the general formula for different sets of tensors B{sup ab} with random numerical entries. A recurrence relation between different coefficients is shown to hold and is used in a second, 'minimal' algorithm to greatly speed up the computations. Runtime of the minimal algorithm stays below 1 min on a typical desktop computer for up to n = 25, which easily covers all foreseeable applications of the trace formula.
Robust Generalized Low Rank Approximations of Matrices.
Jiarong Shi
Full Text Available In recent years, the intrinsic low rank structure of some datasets has been extensively exploited to reduce dimensionality, remove noise and complete the missing entries. As a well-known technique for dimensionality reduction and data compression, Generalized Low Rank Approximations of Matrices (GLRAM claims its superiority on computation time and compression ratio over the SVD. However, GLRAM is very sensitive to sparse large noise or outliers and its robust version does not have been explored or solved yet. To address this problem, this paper proposes a robust method for GLRAM, named Robust GLRAM (RGLRAM. We first formulate RGLRAM as an l1-norm optimization problem which minimizes the l1-norm of the approximation errors. Secondly, we apply the technique of Augmented Lagrange Multipliers (ALM to solve this l1-norm minimization problem and derive a corresponding iterative scheme. Then the weak convergence of the proposed algorithm is discussed under mild conditions. Next, we investigate a special case of RGLRAM and extend RGLRAM to a general tensor case. Finally, the extensive experiments on synthetic data show that it is possible for RGLRAM to exactly recover both the low rank and the sparse components while it may be difficult for previous state-of-the-art algorithms. We also discuss three issues on RGLRAM: the sensitivity to initialization, the generalization ability and the relationship between the running time and the size/number of matrices. Moreover, the experimental results on images of faces with large corruptions illustrate that RGLRAM obtains the best denoising and compression performance than other methods.
Robust Generalized Low Rank Approximations of Matrices.
Shi, Jiarong; Yang, Wei; Zheng, Xiuyun
2015-01-01
In recent years, the intrinsic low rank structure of some datasets has been extensively exploited to reduce dimensionality, remove noise and complete the missing entries. As a well-known technique for dimensionality reduction and data compression, Generalized Low Rank Approximations of Matrices (GLRAM) claims its superiority on computation time and compression ratio over the SVD. However, GLRAM is very sensitive to sparse large noise or outliers and its robust version does not have been explored or solved yet. To address this problem, this paper proposes a robust method for GLRAM, named Robust GLRAM (RGLRAM). We first formulate RGLRAM as an l1-norm optimization problem which minimizes the l1-norm of the approximation errors. Secondly, we apply the technique of Augmented Lagrange Multipliers (ALM) to solve this l1-norm minimization problem and derive a corresponding iterative scheme. Then the weak convergence of the proposed algorithm is discussed under mild conditions. Next, we investigate a special case of RGLRAM and extend RGLRAM to a general tensor case. Finally, the extensive experiments on synthetic data show that it is possible for RGLRAM to exactly recover both the low rank and the sparse components while it may be difficult for previous state-of-the-art algorithms. We also discuss three issues on RGLRAM: the sensitivity to initialization, the generalization ability and the relationship between the running time and the size/number of matrices. Moreover, the experimental results on images of faces with large corruptions illustrate that RGLRAM obtains the best denoising and compression performance than other methods.
A Lex-BFS-based recognition algorithm for Robinsonian matrices
Laurent, M.; Seminaroti, M.; Paschos, V.; Widmayer, P.
2015-01-01
Robinsonian matrices arise in the classical seriation problem and play an important role in many applications where unsorted similarity (or dissimilarity) information must be re- ordered. We present a new polynomial time algorithm to recognize Robinsonian matrices based on a new characterization of
A Lex-BFS-based recognition algorithm for Robinsonian matrices
M. Laurent (Monique); M. Seminaroti (Matteo); V. Paschos; P. Widmayer
2015-01-01
htmlabstractRobinsonian matrices arise in the classical seriation problem and play an important role in many applications where unsorted similarity (or dissimilarity) information must be re- ordered. We present a new polynomial time algorithm to recognize Robinsonian matrices based on a new characte
Mutation classes of skew-symmetrizable 3x3 matrices
Seven, Ahmet
2010-01-01
In this paper, we determine representatives for the mutation classes of skew-symmetrizable 3x3 matrices and associated graphs using a natural minimality condition, generalizing and strengthening results of Beineke-Brustle-Hille and Felikson-Shapiro-Tumarkin. Furthermore, we obtain a new numerical invariant for the mutation operation on skew-symmetrizable matrices of arbitrary size.
The Exponent Set of Central Symmetric Primitive Matrices
陈佘喜; 胡亚辉
2004-01-01
This paper first establishes a distance inequality of the associated diagraph of a central symmetric primitive matrix, then characters the exponent set of central symmetric primitive matrices, and proves that the exponent set of central symmetric primitive matrices of order n is {1, 2,… ,n-1}. There is no gap in it.
The Modern Origin of Matrices and Their Applications
Debnath, L.
2014-01-01
This paper deals with the modern development of matrices, linear transformations, quadratic forms and their applications to geometry and mechanics, eigenvalues, eigenvectors and characteristic equations with applications. Included are the representations of real and complex numbers, and quaternions by matrices, and isomorphism in order to show…
A Lex-BFS-based recognition algorithm for Robinsonian matrices
M. Laurent (Monique); M. Seminaroti (Matteo); V. Paschos; P. Widmayer
2015-01-01
htmlabstractRobinsonian matrices arise in the classical seriation problem and play an important role in many applications where unsorted similarity (or dissimilarity) information must be re- ordered. We present a new polynomial time algorithm to recognize Robinsonian matrices based on a new
The determinants of some multilevel Vandermonde and Toeplitz matrices
Cervellino, A [Laboratory for Neutron Scattering, PSI Villigen and ETH Zuerich, CH-5232 Villigen PSI (Switzerland); Ciccariello, S [Dipartimento di Fisica ' G. Galilei' and Unita INFM, Universita di Padova, Via Marzolo 8, I-35131 Padova (Italy)
2005-11-11
The closed algebraic expressions of the determinants of some multivariate (multilevel) Vandermonde matrices and the associated Toeplitz/Karle-Hauptman matrices are worked out. The formula can usefully be applied to evaluate the determinant of the Karle-Hauptman matrix generated by a principal basic set of reflections, the knowledge of which determines the full diffraction pattern of an ideal crystal.
Fusion for AdS/CFT boundary S-matrices
Nepomechie, Rafael I. [Physics Department, University of Miami,P.O. Box 248046, Coral Gables, FL 33124 (United States); Pimenta, Rodrigo A. [Physics Department, University of Miami,P.O. Box 248046, Coral Gables, FL 33124 (United States); Departamento de Física, Universidade Federal de São Carlos,Caixa Postal 676, CEP 13569-905, São Carlos (Brazil)
2015-11-24
We propose a fusion formula for AdS/CFT worldsheet boundary S-matrices. We show that, starting from the fundamental Y=0 boundary S-matrix, this formula correctly reproduces the two-particle bound-state boundary S-matrices.
Revisiting amino acid substitution matrices for identifying distantly related proteins.
Yamada, Kazunori; Tomii, Kentaro
2014-02-01
Although many amino acid substitution matrices have been developed, it has not been well understood which is the best for similarity searches, especially for remote homology detection. Therefore, we collected information related to existing matrices, condensed it and derived a novel matrix that can detect more remote homology than ever. Using principal component analysis with existing matrices and benchmarks, we developed a novel matrix, which we designate as MIQS. The detection performance of MIQS is validated and compared with that of existing general purpose matrices using SSEARCH with optimized gap penalties for each matrix. Results show that MIQS is able to detect more remote homology than the existing matrices on an independent dataset. In addition, the performance of our developed matrix was superior to that of CS-BLAST, which was a novel similarity search method with no amino acid matrix. We also evaluated the alignment quality of matrices and methods, which revealed that MIQS shows higher alignment sensitivity than that with the existing matrix series and CS-BLAST. Fundamentally, these results are expected to constitute good proof of the availability and/or importance of amino acid matrices in sequence analysis. Moreover, with our developed matrix, sophisticated similarity search methods such as sequence-profile and profile-profile comparison methods can be improved further. Newly developed matrices and datasets used for this study are available at http://csas.cbrc.jp/Ssearch/.
The Modern Origin of Matrices and Their Applications
Debnath, L.
2014-01-01
This paper deals with the modern development of matrices, linear transformations, quadratic forms and their applications to geometry and mechanics, eigenvalues, eigenvectors and characteristic equations with applications. Included are the representations of real and complex numbers, and quaternions by matrices, and isomorphism in order to show…
Reprint of Testing scattering matrices: a compendium of recipes
Hovenier, J.W.; van der Mee, C.V.M.
2010-01-01
Scattering matrices describe the transformation of the Stokes parameters of a beam of radiation upon scattering of that beam. The problems of testing scattering matrices for scattering by one particle and for single scattering by an assembly of particles are addressed. The treatment concerns
Sarymsakov matrices and coordination tasks for multi-agent systems
Xia, Weiguo; Cao, Ming
2012-01-01
The convergence of products of stochastic matrices has proven to be critical in establishing the effectiveness of distributed coordination algorithms for multi-agent systems. After reviewing some classic and recent results on infinite backward products of stochastic matrices, we provide a new
Random Matrices, Combinatorics, Numerical Linear Algebra and Complex Networks
2012-02-16
Littlewood-Offord theorems and the condition number of random discrete matrices, Annals of Mathematics , to appear. [29] T. Tao and V. Vu, The condition...Wigner. On the distribution of the roots of certain symmetric matrices. Annals of Mathematics , 67(2):325327, 1958. Department of Mathematics, Yale, New Haven, CT 06520 E-mail address: van.vu@yale.edu
On Factorization of Coupled Channel Scattering S Matrices
无
2007-01-01
We investigate the problem on how to factorize a coupled channel scattering S matrix into a product of simple S matrices. Simple S matrix solutions are found, respecting unitarity, analyticity and being real analytic. The phase shift and its physical meaning produced by these simple S matrices are discussed.
Topological algebras of rapidly decreasing matrices and generalizations
Glockner, Helge
2010-01-01
It is a folklore fact that the rapidly decreasing matrices of countable size form an associative topological algebra whose set of quasi-invertible elements is open, and such that the quasi-inversion map is continuous. We provide a direct proof, which applies more generally to a large class of algebras of weighted matrices with entries in a Banach algebra.
Pavel Etingof
2007-03-01
Full Text Available Following the works by Wiegmann-Zabrodin, Elbau-Felder, Hedenmalm-Makarov, and others, we consider the normal matrix model with an arbitrary potential function, and explain how the problem of finding the support domain for the asymptotic eigenvalue density of such matrices (when the size of the matrices goes to infinity is related to the problem of Hele-Shaw flows on curved surfaces, considered by Entov and the first author in 1990-s. In the case when the potential function is the sum of a rotationally invariant function and the real part of a polynomial of the complex coordinate, we use this relation and the conformal mapping method developed by Entov and the first author to find the shape of the support domain explicitly (up to finitely many undetermined parameters, which are to be found from a finite system of equations. In the case when the rotationally invariant function is βz^2, this is done by Wiegmann-Zabrodin and Elbau-Felder. We apply our results to the generalized normal matrix model, which deals with random block matrices that give rise to *-representations of the deformed preprojective algebra of the affine quiver of type Â_{m-1}. We show that this model is equivalent to the usual normal matrix model in the large N limit. Thus the conformal mapping method can be applied to find explicitly the support domain for the generalized normal matrix model.
BMP-silk composite matrices heal critically sized femoral defects.
Kirker-Head, C; Karageorgiou, V; Hofmann, S; Fajardo, R; Betz, O; Merkle, H P; Hilbe, M; von Rechenberg, B; McCool, J; Abrahamsen, L; Nazarian, A; Cory, E; Curtis, M; Kaplan, D; Meinel, L
2007-08-01
Clinical drawbacks of bone grafting prompt the search for alternative bone augmentation technologies such as use of growth and differentiation factors, gene therapy, and cell therapy. Osteopromotive matrices are frequently employed for the local delivery and controlled release of these augmentation agents. Some matrices also provide an osteoconductive scaffold to support new bone growth. In this study, silkworm-derived silk fibroin was evaluated as an osteoconductive matrix for healing critical sized mid-femoral segmental defects in nude rats. Four treatment groups were assessed over eight weeks: silk scaffolds (SS) with recombinant human BMP-2 (rhBMP-2) and human mesenchymal stem cells (HMSC) that had been pre-differentiated along an osteoblastic lineage ex vivo (Group I; pdHMSC/rhBMP-2/SS); SS with rhBMP-2 and undifferentiated HMSCs (Group II; udHMSC/rhBMP-2/SS); SS and rhBMP-2 alone (Group III; rhBMP-2/SS); and empty defects (Group IV). Bi-weekly radiographs revealed a progressive and similar increase in Group I-III mean defect mineralization through post-operative week (POW) 8. Radiographs, dual energy x-ray absorptiometry, and micro-computed tomography confirmed that Groups I-III exhibited similar substantial and significantly (pwoven and lamellar bone bridging islands of silk matrix in Groups I and III. Group II defects possessed comparatively less new bone which was most abundant adjacent to the parent bone margins. Elsewhere the silk matrix was more often enveloped by poorly differentiated loose fibrous connective tissue. Group IV defects showed minimal new bone formation. None of the treatment groups attained the mean mineralization or the mean biomechanical strength of identical defects implanted with SS and pdHMSCs alone in a previous study. However, addition of rhBMP-2 to SS prompted more bone than was previously generated using udHMSC/SS or SS alone. These data imply the clinical potential of silk scaffolds and rhBMP-2 as composite osteopromotive
3D Computational Simulation of Calcium Leaching in Cement Matrices
Gaitero, J. J.
2014-12-01
Full Text Available Calcium leaching is a degradation process consisting in progressive dissolution of the cement paste by migration of calcium atoms to the aggressive solution. It is therefore, a complex phenomenon involving several phases and dissolution and diffusion processes simultaneously. Along this work, a new computational scheme for the simulation of the degradation process in three dimensions was developed and tested. The toolkit was used to simulate accelerated calcium leaching by a 6M ammonium nitrate solution in cement matrices. The obtained outputs were the three dimensional representation of the matrix and the physicochemical properties of individual phases as a consequence of the degradation process. This not only makes it possible to study the evolution of such properties as a function of time but also as a function of the position within the matrix. The obtained results are in good agreement with experimental values of the elastic modulus in degraded and undegraded samples.El lixiviado de calcio es un proceso de degradación consistente en la disolución progresiva de la pasta de cemento por la migración de los átomos de calcio a la disolución agresiva. Se trata por tanto de un fenómeno complejo que involucra simultáneamente diferentes fases y procesos de disolución y difusión. En este trabajo se desarrolló y probó una nueva herramienta computacional para la simulación del proceso de degradación en tres dimensiones. Para ello se simuló el lixiviado de calcio acelerado provocado por una disolución de nitrato amónico 6M en matrices de cemento. Como resultado se obtuvieron la representación tridimensional de la matriz y las propiedades físico-químicas sus fases a lo largo del tiempo. Esto permitió estudiar la evolución de dichas propiedades a lo largo del proceso de degradación así como en función de su posición dentro de la matriz. Los resultados obtenidos coinciden con los valores experimentales del módulo elástico tanto
Time series, correlation matrices and random matrix models
Vinayak [Instituto de Ciencias Físicas, Universidad Nacional Autónoma de México, C.P. 62210 Cuernavaca (Mexico); Seligman, Thomas H. [Instituto de Ciencias Físicas, Universidad Nacional Autónoma de México, C.P. 62210 Cuernavaca, México and Centro Internacional de Ciencias, C.P. 62210 Cuernavaca (Mexico)
2014-01-08
In this set of five lectures the authors have presented techniques to analyze open classical and quantum systems using correlation matrices. For diverse reasons we shall see that random matrices play an important role to describe a null hypothesis or a minimum information hypothesis for the description of a quantum system or subsystem. In the former case various forms of correlation matrices of time series associated with the classical observables of some system. The fact that such series are necessarily finite, inevitably introduces noise and this finite time influence lead to a random or stochastic component in these time series. By consequence random correlation matrices have a random component, and corresponding ensembles are used. In the latter we use random matrices to describe high temperature environment or uncontrolled perturbations, ensembles of differing chaotic systems etc. The common theme of the lectures is thus the importance of random matrix theory in a wide range of fields in and around physics.
The semi-dynamical reflection equation: solutions and structure matrices
Avan, J; Zambon, C [Laboratoire de Physique Theorique et Modelisation, Universite de Cergy-Pontoise (CNRS UMR 8089), Saint-Martin 2 avenue Adolphe Chauvin, 95302 Cergy-Pontoise Cedex (France)], E-mail: avan@u-cergy.fr, E-mail: cristina.zambon@u-cergy.fr
2008-05-16
Explicit solutions of the non-constant semi-dynamical reflection equation are constructed, together with suitable parametrizations of their structure matrices. Considering the semi-dynamical reflection equation with rational non-constant Arutyunov-Chekhov-Frolov structure matrices, and a specific meromorphic ansatz, it is found that only two sets of the previously found constant solutions are extendible to the non-constant case. In order to simplify future constructions of spin-chain Hamiltonians, a parametrization procedure is applied explicitly to all elements of the semi-dynamical reflection equation available. Interesting expressions for 'twists' and R-matrices entering the parametrization procedure are found. In particular, some expressions for the R-matrices seem to appear here for the first time. In addition, a new set of consistent structure matrices for the semi-dynamical reflection equation is obtained.
H-MATRICES AND S-DOUBLY DIAGONALLY DOMINANT MATRICES%H-矩阵和S-双对角占优矩阵
杨月婷; 徐成贤
2004-01-01
In this paper, the concept of the s-doubly diagonally dominant matrices is introduced and the properties of these matrices are discussed. With the properties of the s-doubly diagonally dominant matrices and the properties of comparison matrices, some equivalent conditions for H-matrices are presented. These conditions generalize and improve existing results about the equivalent conditions for H-matrices. Applications and examples using these new equivalent conditions are also presented, and a new inclusion region of k-multiple eigenvalues of matrices is obtained.
Kunschmann, Tom; Puder, Stefanie; Fischer, Tony; Perez, Jeremy; Wilharm, Nils; Mierke, Claudia Tanja
2017-03-01
The motility of cells plays an important role for many processes such as wound healing and malignant progression of cancer. The efficiency of cell motility is affected by the microenvironment. The connection between the cell and its microenvironment is facilitated by cell-matrix adhesion receptors and upon their activation focal adhesion proteins such as integrin-linked kinase (ILK) are recruited to sites of focal adhesion formation. In particular, ILK connects cell-matrix receptors to the actomyosin cytoskeleton. However, ILK's role in cell mechanics regulating cellular motility in 3D collagen matrices is still not well understood. We suggest that ILK facilitates 3D motility by regulating cellular mechanical properties such as stiffness and force transmission. Thus, ILK wild-type and knock-out cells are analyzed for their ability to migrate on 2D substrates serving as control and in dense 3D extracellular matrices. Indeed, ILK wild-type cells migrated faster on 2D substrates and migrated more numerous and deeper in 3D matrices. Hence, we analyzed cellular deformability, Young's modulus (stiffness) and adhesion forces. We found that ILK wild-type cells are less deformable (stiffer) and produce higher cell-matrix adhesion forces compared to ILK knock-out cells. Finally, ILK is essential for providing cellular mechanical stiffness regulating 3D motility.
Mechanically implementable accommodation matrices for passive force control
Goswami, A. [Univ. of Pennsylvania, Philadelphia, PA (United States). Center for Human Modeling and Simulation; Peshkin, M. [Northwestern Univ., Evanston, IL (United States). Dept. of Mechanical Engineering
1999-08-01
Robot force control implemented by means of passive mechanical devices has inherent advantages over active implementations with regard to stability, response rapidity, and physical robustness. The class of devices considered in this paper consists of a Stewart platform-type mechanism interconnected with a network of adjustable mechanical elements such as springs and dampers. The control law repertoire of such a device, imagined as a robot wrist, is given by the range of admittance matrices that it may be programmed to possess. This paper focuses on wrists incorporating damper networks for which the admittance matrices reduce to accommodation or inverse-damping matrices. The authors show that a hydraulic network of fully adjustable damper elements may attain any diagonally dominant accommodation matrix. They describe the technique of selecting the individual damping coefficients to design a desired matrix. They identify the set of dominant matrices as a polyhedral convex cone in the space of matrix entries, and show that each dominant matrix can be composed of a positive linear combination of a fixed set of basis matrices. The overall wrist-accommodation matrix is obtained by projecting the accommodation matrix of the damper network through the wrist kinematics. The linear combination of the dominant basis matrices projected through the wrist kinematics generates the entire space of mechanically implementable force-control laws. The authors quantify the versatility of mechanically implementable force-control laws by comparing this space to the space of all matrices.
V.S. Revathy
2015-01-01
Full Text Available Observations were made on the biology and bionomics of the three Western Ghats Endemics, the Malabar Raven (Papilio dravidarum Wood-Mason, Malabar Rose (Atrophaneura pandiyana Moore and Crimson Rose (A. hector Linnaeus. The size of the caterpillar (length and breadth, mode of feeding, pupation and emergence were recorded. The biology took 36-40 days for completion in Malabar Raven, 35-37 days in A. pandiyana and A. hector. Butterflies found in different habitats tend to show marked differences in their general appearance and biology as evidenced by the "Ecological races" reported in several species of butterflies. Thorough understanding of the life history and their behavioural patterns of immature stages will help in recognizing geographical and ecological races.
Limits of spiked random matrices II
Bloemendal, Alex
2011-01-01
The top eigenvalues of rank r spiked real Wishart matrices and additively perturbed Gaussian orthogonal ensembles are known to exhibit a phase transition in the large size limit. We show that they have limiting distributions for near-critical perturbations, fully resolving the conjecture of Baik, Ben Arous and P\\'ech\\'e (2005). The starting point is a new (2r+1)-diagonal form that is algebraically natural to the problem; for both models it converges to a certain random Schr\\"odinger operator on the half-line with r x r matrix-valued potential. The perturbation determines the boundary condition, and the low-lying eigenvalues describe the limit jointly over all perturbations in a fixed subspace. We treat the real, complex and quaternion (beta = 1,2,4) cases simultaneously. We also characterize the limit laws in terms of a diffusion related to Dyson's Brownian motion, and further in terms of a linear parabolic PDE; here beta is simply a parameter. At beta = 2 the PDE appears to reconcile with known Painlev\\'e fo...
NOTE ON REGULAR D-OPTIMAL MATRICES
李乔良
2003-01-01
Let A be aj ×d (0,1) matrix. It is known that ifj = 2k-1is odd, then det(AAT) ≤(j+1)((j+1)d/4j)j; ifj is even, then det(AAT) ≤ (j+1)((j+2)d/4(j+1))j. A is called a regularD-optimal matrix if it satisfies the equality of the above bounds. In this note, it is proved thatifj = 2k - 1 is odd, then A is a regular D-optimal matrix if and only if A is the adjacent matrixof a (2k - 1, k, (j + 1)d/4j)-BIBD; if j ＝ 2k is even, then A is a regular D-optimal matrix ifand only if A can be obtained from the adjacent matrix B of a (2k + 1, k + 1, (j + 2)d/4(j + 1))-BIBD by deleting any one row from B. Three 21 × 42 regular D-optimal matrices, which wereunknown in [11], are also provided.
Generalized graph states based on Hadamard matrices
Cui, Shawn X. [Department of Mathematics, University of California, Santa Barbara, California 93106 (United States); Yu, Nengkun [Institute for Quantum Computing, University of Waterloo, Waterloo, Ontario N2L 3G1 (Canada); Department of Mathematics and Statistics, University of Guelph, Guelph, Ontario N1G 2W1 (Canada); UTS-AMSS Joint Research Laboratory for Quantum Computation and Quantum Information Processing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China); Zeng, Bei [Institute for Quantum Computing, University of Waterloo, Waterloo, Ontario N2L 3G1 (Canada); Department of Mathematics and Statistics, University of Guelph, Guelph, Ontario N1G 2W1 (Canada); Canadian Institute for Advanced Research, Toronto, Ontario M5G 1Z8 (Canada)
2015-07-15
Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study the entanglement structures of these generalized graph states and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli (X, Z) pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.
Striations in PageRank-Ordered Matrices
Pennycuff, Corey
2016-01-01
Patterns often appear in a variety of large, real-world networks, and interesting physical phenomena are often explained by network topology as in the case of the bow-tie structure of the World Wide Web, or the small world phenomenon in social networks. The discovery and modelling of such regular patterns has a wide application from disease propagation to financial markets. In this work we describe a newly discovered regularly occurring striation pattern found in the PageRank ordering of adjacency matrices that encode real-world networks. We demonstrate that these striations are the result of well-known graph generation processes resulting in regularities that are manifest in the typical neighborhood distribution. The spectral view explored in this paper encodes a tremendous amount about the explicit and implicit topology of a given network, so we also discuss the interesting network properties, outliers and anomalies that a viewer can determine from a brief look at the re-ordered matrix.
On some Toeplitz matrices and their inversions
S. Dutta
2014-10-01
Full Text Available In this article, using the difference operator B(a[m], we introduce a lower triangular Toeplitz matrix T which includes several difference matrices such as Δ(1,Δ(m,B(r,s,B(r,s,t, and B(r̃,s̃,t̃,ũ in different special cases. For any x ∈ w and m∈N0={0,1,2,…}, the difference operator B(a[m] is defined by (B(a[m]xk=ak(0xk+ak-1(1xk-1+ak-2(2xk-2+⋯+ak-m(mxk-m,(k∈N0 where a[m] = {a(0, a(1, …, a(m} and a(i = (ak(i for 0 ⩽ i ⩽ m are convergent sequences of real numbers. We use the convention that any term with negative subscript is equal to zero. The main results of this article relate to the determination and applications of the inverse of the Toeplitz matrix T.
Visualizing complex (hydrological) systems with correlation matrices
Haas, J. C.
2016-12-01
When trying to understand or visualize the connections of different aspects of a complex system, this often requires deeper understanding to start with, or - in the case of geo data - complicated GIS software. To our knowledge, correlation matrices have rarely been used in hydrology (e.g. Stoll et al., 2011; van Loon and Laaha, 2015), yet they do provide an interesting option for data visualization and analysis. We present a simple, python based way - using a river catchment as an example - to visualize correlations and similarities in an easy and colorful way. We apply existing and easy to use python packages from various disciplines not necessarily linked to the Earth sciences and can thus quickly show how different aquifers work or react, and identify outliers, enabling this system to also be used for quality control of large datasets. Going beyond earlier work, we add a temporal and spatial element, enabling us to visualize how a system reacts to local phenomena such as for example a river, or changes over time, by visualizing the passing of time in an animated movie. References: van Loon, A.F., Laaha, G.: Hydrological drought severity explained by climate and catchment characteristics, Journal of Hydrology 526, 3-14, 2015, Drought processes, modeling, and mitigation Stoll, S., Hendricks Franssen, H. J., Barthel, R., Kinzelbach, W.: What can we learn from long-term groundwater data to improve climate change impact studies?, Hydrology and Earth System Sciences 15(12), 3861-3875, 2011
Random matrices as models for the statistics of quantum mechanics
Casati, Giulio; Guarneri, Italo; Mantica, Giorgio
1986-05-01
Random matrices from the Gaussian unitary ensemble generate in a natural way unitary groups of evolution in finite-dimensional spaces. The statistical properties of this time evolution can be investigated by studying the time autocorrelation functions of dynamical variables. We prove general results on the decay properties of such autocorrelation functions in the limit of infinite-dimensional matrices. We discuss the relevance of random matrices as models for the dynamics of quantum systems that are chaotic in the classical limit. Permanent address: Dipartimento di Fisica, Via Celoria 16, 20133 Milano, Italy.
On the asymptotic distribution of block-modified random matrices
Arizmendi, Octavio, E-mail: octavius@cimat.mx [Department of Probability and Statistics, CIMAT, Guanajuato (Mexico); Nechita, Ion, E-mail: nechita@irsamc.ups-tlse.fr [Zentrum Mathematik, M5, Technische Universität München, Boltzmannstrasse 3, 85748 Garching, Germany and CNRS, Laboratoire de Physique Théorique, IRSAMC, Université de Toulouse, UPS, F-31062 Toulouse (France); Vargas, Carlos, E-mail: obieta@math.tugraz.at [Department of Mathematical Structure Theory, Technische Universität Graz, Steyrergasse 30/III, 8010 Graz (Austria)
2016-01-15
We study random matrices acting on tensor product spaces which have been transformed by a linear block operation. Using operator-valued free probability theory, under some mild assumptions on the linear map acting on the blocks, we compute the asymptotic eigenvalue distribution of the modified matrices in terms of the initial asymptotic distribution. Moreover, using recent results on operator-valued subordination, we present an algorithm that computes, numerically but in full generality, the limiting eigenvalue distribution of the modified matrices. Our analytical results cover many cases of interest in quantum information theory: we unify some known results and we obtain new distributions and various generalizations.
Kerov's interlacing sequences and random matrices
Bufetov, Alexey, E-mail: alexey.bufetov@gmail.com [Institute for Information Transmission Problems, Independent University of Moscow and Higher School of Economics, Moscow (Russian Federation)
2013-11-15
To a N × N real symmetric matrix Kerov assigns a piecewise linear function whose local minima are the eigenvalues of this matrix and whose local maxima are the eigenvalues of its (N − 1) × (N − 1) submatrix. We study the scaling limit of Kerov's piecewise linear functions for Wigner and Wishart matrices. For Wigner matrices the scaling limit is given by the Verhik-Kerov-Logan-Shepp curve which is known from asymptotic representation theory. For Wishart matrices the scaling limit is also explicitly found, and we explain its relation to the Marchenko-Pastur limit spectral law.
ANOVA like analysis for structured families of stochastic matrices
Dias, Cristina; Santos, Carla; Varadinov, Maria; Mexia, João T.
2016-12-01
Symmetric stochastic matrices width a width a dominant eigenvalue λ and the corresponding eigenvector α appears in many applications. Such matrices can be written as M =λ α αt+E¯. Thus β = λ α will be the structure vector. When the matrices in such families correspond to the treatments of a base design we can carry out a ANOVA like analysis of the action of the treatments in the model on the structured vectors. This analysis can be transversal-when we worked width homologous components and - longitudinal when we consider contrast on the components of each structure vector. The analysis will be briefly considered at the end of our presentation.
Lipschitz correspondence between metric measure spaces and random distance matrices
Gadgil, Siddhartha
2011-01-01
Given a metric space with a Borel probability measure, for each integer $N$ we obtain a probability distribution on $N\\times N$ distance matrices by considering the distances between pairs of points in a sample consisting of $N$ points chosen indepenedently from the metric space with respect to the given measure. We show that this gives an asymptotically bi-Lipschitz relation between metric measure spaces and the corresponding distance matrices. This is an effective version of a result of Vershik that metric measure spaces are determined by associated distributions on infinite random matrices.
侯素梅
2002-01-01
实矩阵A称为是almostP-矩阵,如果A的行列式是正的,而所有真主子式是负的.本文给出了almostP-矩阵的一些性质以及almostP-矩阵与弱almostP-矩阵之间的关系.%An almost P-matrix A is one with real entries whose determinant is negative and all proper minors are positive. Obtain some properties for almost P-matrices, and the relationship between almost P-matrices and weak almost P-matrices.
User-Friendly Tools for Random Matrices: An Introduction
2012-12-03
The set of positive-semidefinite matrices with size d forms a closed, convex cone in the real- linear space of Hermitian matrices of dimension d...valued function h on matrices that is concave or convex. The expectation of a random matrix can be viewed as a convex combination, and the cone of...hope shatters when we subject it to interrogation. It is not hard to find the reason that (3.3.2) fails. Note that the identity (3.3.1) depends on the
Pishghadam, Reza; Khajavy, Gholam Hassan
2013-01-01
This study examined the role of metacognition and intelligence in foreign language achievement on a sample of 143 Iranian English as a Foreign Language (EFL) learners. Participants completed Raven's Advanced Progressive Matrices as a measure of intelligence, and Metacognitive Awareness Inventory as a measure of metacognition. Learners' scores at…
IQ Tests Are Not Culturally Biased for Blacks & Whites
Jensen, Arthur R.
1976-01-01
Concludes that these standardized tests of intelligence--the Peabody Picture Vocabulary, Raven's Progressive Matrices, Stanford-Binet, Wechsler Intelligence Scale for Children, Wonderlic Personnel Test, and most likely many other similar tests--show practically no evidence of differential culture bias for blacks and whites. (Author)
Ren, Xuezhu; Goldhammer, Frank; Moosbrugger, Helfried; Schweizer, Karl
2012-01-01
The aim of the present study was to clarify the nature of the ability-specific and position-specific components of Raven's Advanced Progressive Matrices (APM) by relating them to a number of types of attention. The ability-specific component represents the constant part of cognitive performance whereas the position-specific component reflects the…
Nadler, Dustin R.; Komarraju, Meera
2016-01-01
Using a 2 × 2 factorial design, we examined the effects of stereotype threat and autonomy support on the test performance of 190 African American college students. Participants completed a set of 7 easy and 7 difficult problems from Raven's Progressive Matrices and a survey including measures of Academic Self-Concept, Learning Climate, and…
Another failure to replicate Lynn’s estimate of the average IQ of sub-Saharan Africans
Wicherts, J.M.; Dolan, C.V.; Carlson, J.S.; van der Maas, H.L.J.
2010-01-01
In his comment on our literature review of data on the performance of sub-Saharan Africans on Raven's Progressive Matrices, Lynn (this issue) criticized our selection of samples of primary and secondary school students. On the basis of the samples he deemed representative, Lynn concluded that the av
Problems with IQ Gains: The Huge Vocabulary Gap
Flynn, James R.
2010-01-01
Despite Kaufman, Raven's Progressive Matrices and the Wechsler subtest Similarities are tests whose gains call for special explanation. The spread of "scientific spectacles" is the key, but its explanatory potential has been exhausted. Three trends force us to look elsewhere: (a) gains on Wechsler subtests such as Picture Arrangement,…
Another Failure to Replicate Lynn's Estimate of the Average IQ of Sub-Saharan Africans
Wicherts, Jelte M.; Dolan, Conor V.; Carlson, Jerry S.; van der Maas, Han L. J.
2010-01-01
In his comment on our literature review of data on the performance of sub-Saharan Africans on Raven's Progressive Matrices, Lynn (this issue) criticized our selection of samples of primary and secondary school students. On the basis of the samples he deemed representative, Lynn concluded that the average IQ of sub-Saharan Africans stands at 67…
Brief Report: The Level and Nature of Autistic Intelligence Revisited
Bolte, Sven; Dziobek, Isabel; Poustka, Fritz
2009-01-01
Owing to higher performance on the Raven's Progressive Matrices (RPM) than on the Wechsler Intelligence Scales (WIS), it has recently been argued that intelligence is underestimated in autism. This study examined RPM and WIS IQs in 48 individuals with autism, a mixed clinical (n = 28) and a neurotypical (n = 25) control group. Average RPM IQ was…
The Effect of Knowledge about the L1 on Foreign Language Skills and Grammar.
Lasagabaster, David
2001-01-01
Examines the effect of knowledge about language on the learning of foreign language skills and grammar. Students (n=252) completed a questionnaire, metalinguistic awareness test, Raven's Progressive Matrices Test, a linguistic creativity test, and English tests. Hypothesized that students' knowledge about language would have a significant effect…
Cerebral Lateralization and General Intelligence: Gender Differences in a Transcranial Doppler Study
Njemanze, P.C.
2005-01-01
The present study evaluated cerebral lateralization during Raven's progressive matrices (RPM) paradigm in female and male subjects. Bilateral simultaneous transcranial Doppler (TCD) ultrasound was used to measure mean blood flow velocities (MBFV) in the right and left middle cerebral arteries (MCAs) in 24 (15 females and 9 males) right-handed…
Superior Nonverbal Intelligence in Children with High-Functioning Autism or Asperger's Syndrome
Chen, Fei; Planche, Pascale; Lemonnier, Eric
2010-01-01
Some early studies showed discordance in cognitive strengths and weaknesses in individuals with high-functioning autism (HFA) or Asperger's syndrome (AS). The present study administered the French version of Colored Raven's Progressive Matrices in 14 children with HFA/AS and in 26 chronological age matched peers with typical development. We found…
IQ Gains in Argentina between 1964 and 1998
Flynn, James R.; Rossi-Case, Lilia
2012-01-01
The literature on IQ gains in Latin America is sparse. We estimate gains on Raven's Progressive Matrices in the city of La Plata (Argentina) between 1964 and 1998. The gains are robust at the top of the curve as well as at the bottom. Therefore, they are contrary to the hypothesis that nutrition played a major role in recent Argentine IQ gains.…
Furnham, Adrian; Crump, John
2013-01-01
In all 794 young people aged around 30 yrs completed three intelligence (Raven's Progressive matrices: GMA Numerical and GMA Verbal) and one personality inventory (16PF). They were all graduates and 173 were identified clearly as Arts graduates and 518 as Science students. There were various sex differences on all measures. All seven hypotheses…
Fluctuating Asymmetry and Intelligence
Bates, Timothy C.
2007-01-01
The general factor of mental ability ("g") may reflect general biological fitness. If so, "g"-loaded measures such as Raven's progressive matrices should be related to morphological measures of fitness such as fluctuating asymmetry (FA: left-right asymmetry of a set of typically left-right symmetrical body traits such as finger…
De Pascalis, V.; Varriale, V.; Matteoli, A.
2008-01-01
The relationship between fluid intelligence (indexed by scores on Raven Progressive Matrices) and auditory discrimination ability was examined by recording event-related potentials from 48 women during the performance of an auditory oddball task with backward masking. High ability (HA) subjects exhibited shorter response times, greater response…
Working Memory Training Does Not Improve Intelligence in Healthy Young Adults
Chooi, Weng-Tink; Thompson, Lee A.
2012-01-01
Jaeggi and her colleagues claimed that they were able to improve fluid intelligence by training working memory. Subjects who trained their working memory on a dual n-back task for a period of time showed significant improvements in working memory span tasks and fluid intelligence tests such as the Raven's Progressive Matrices and the Bochumer…
Mental Speed, Response Time, and Intelligence.
Hoosain, Rumjahn
1980-01-01
In this study with bilingual Chinese college students, faster subjects in a word-judging task had lower Raven's Progressive Matrices scores. The distinction between test response time and actual mental speed as a correlate of intelligence is discussed. (Author/SJL)
Sex differences in intelligence: a rejoinder to Mackintosh.
Lynn, R
1998-10-01
The author's theory that among adults men have a higher mean IQ than women has been critized by Mackintosh. His criticisms are examined and found wanting. New evidence is adduced that men obtain higher means than women on Raven's Progressive Matrices.
Macrae, Kristina S.
The aim of this study was to investigate the strategies leading to test item responses in 60 young (20-25 years) and 60 middle-aged (35-40 years) adults, whose highest level of education had been either secondary, technical or university. Subjects were individually administered a 12 item test similar to Raven's Progressive Matrices, and were…
Cognitive Training Using Self-Discovery Methods.
Anderson, Joan W.; And Others
1986-01-01
Attempted cognitive training of Raven's Progressive Matrices using guided self-discovery, but without directly providing strategies. Thirty-six older and 36 younger adults were pretested, underwent training, and were posttested. Found no significant difference in improvement between younger and older adults. Failed to find evidence for successful…
EEG Alpha Rhythm Frequency and Intelligence in Normal Adults.
Anokhin, Andrey; Vogel, Friedrich
1996-01-01
Scores on Raven's Progressive Matrices correlated positively with electroencephalogram-recorded alpha rhythm frequency (AF) in 101 healthy male adults, as did one test of verbal ability and one of mental performance. However, AF did not show significant relationships with general intelligence or spatial and arithmetic abilities. (SLD)
Sambo, Aminu
2015-01-01
This paper examines students' performance in Non-verbal Intelligence tests relative academic achievement of some selected secondary school students. Two hypotheses were formulated with a view to generating data for the ease of analyses. Two non-verbal intelligent tests viz: Raven's Standard Progressive Matrices (SPM) and AH[subscript 4] Part II…
Cognitive Processes and Math Performance: A Study with Children at Third Grade of Basic Education
Campos, Isabel S.; Almeida, Leandro S.; Ferreira, Aristides I.; Martinez, Luis F.; Ramalho, Gloria
2013-01-01
The present study aims to examine the relationship between cognitive factors and mathematical achievement in primary education. Participants were 103 Portuguese third grade students, aged 8 and 9. All participants completed a battery for working memory (WMTB-C), a test of general intelligence (Raven's Progressive Color Matrices), a selective…
Problems with IQ Gains: The Huge Vocabulary Gap
Flynn, James R.
2010-01-01
Despite Kaufman, Raven's Progressive Matrices and the Wechsler subtest Similarities are tests whose gains call for special explanation. The spread of "scientific spectacles" is the key, but its explanatory potential has been exhausted. Three trends force us to look elsewhere: (a) gains on Wechsler subtests such as Picture Arrangement, (b) gains in…
Ren, Xuezhu; Goldhammer, Frank; Moosbrugger, Helfried; Schweizer, Karl
2012-01-01
The aim of the present study was to clarify the nature of the ability-specific and position-specific components of Raven's Advanced Progressive Matrices (APM) by relating them to a number of types of attention. The ability-specific component represents the constant part of cognitive performance whereas the position-specific component reflects the…
Nadler, Dustin R.; Komarraju, Meera
2016-01-01
Using a 2 × 2 factorial design, we examined the effects of stereotype threat and autonomy support on the test performance of 190 African American college students. Participants completed a set of 7 easy and 7 difficult problems from Raven's Progressive Matrices and a survey including measures of Academic Self-Concept, Learning Climate, and…
Pishghadam, Reza; Khajavy, Gholam Hassan
2013-01-01
This study examined the role of metacognition and intelligence in foreign language achievement on a sample of 143 Iranian English as a Foreign Language (EFL) learners. Participants completed Raven's Advanced Progressive Matrices as a measure of intelligence, and Metacognitive Awareness Inventory as a measure of metacognition. Learners' scores at…
Macrae, Kristina S.
The aim of this study was to investigate the strategies leading to test item responses in 60 young (20-25 years) and 60 middle-aged (35-40 years) adults, whose highest level of education had been either secondary, technical or university. Subjects were individually administered a 12 item test similar to Raven's Progressive Matrices, and were…
A Study of English Vocabulary Comparing Eskimo and Caucasian Children. Final Report.
Orvik, James M.
The purpose of this study is to assess the English vocabulary of Eskimo pupils entering a bilingual education program by establishing a normative criterion based on the vocabulary levels of children whose first language is English. The tests used, "Raven's Coloured Progressive Matrices" and "English Receptive Vocabulary," bear out the anticipated…
Intellectual Estimates of Hearing-Impaired Children: A Comparison of Three Measures
Ritter, David R.
1976-01-01
The Arthur Adaptation of the Leiter International Performance Scale, Raven's Coloured Progressive Matrices, and Wechsler Intelligence Scale for Children-Performance Section were administered to 31 children with mild to moderate hearing impairments. A comparison of test results indicated moderate convergent validity among the measures. (Author)
Young, Aaron Ross, Jr.
This study attempted to prove a dichotomy between cognitive processes as measured by Piagetian reasoning tasks and those measured by traditional intelligence tests. A battery of tests (Slosson Intelligence Test, Durrell's Silent Reading and Listening Comprehension Test, Raven's Coloured Progressive Matrices, and the Piagetian Measure of Cognitive…
Hagood, Maralynn M.
2002-01-01
Investigates the use of three art-based instruments using imagery that measure children's cognitive development. Suggests that Raven's Coloured Progressive Matrices, the British Picture Vocabulary Scale, and the Naglieri Draw-A-Person Test would be useful tools for art therapists to more systematically view children's drawings from a developmental…
From Exploratory Talk to Abstract Reasoning: A Case for Far Transfer?
Webb, Paul; Whitlow, J. W., Jr.; Venter, Danie
2017-01-01
Research has shown improvements in science, mathematics, and language scores when classroom discussion is employed in school-level science and mathematics classes. Studies have also shown statistically and practically significant gains in children's reasoning abilities as measured by the Raven's Standard Progressive Matrices test when employing…
Eye-Movement Analysis Demonstrates Strategic Influences on Intelligence
Vigneau, Francois; Caissie, Andre F.; Bors, Douglas A.
2006-01-01
Taking into account various models and findings pertaining to the nature of analogical reasoning, this study explored quantitative and qualitative individual differences in intelligence using latency and eye-movement data. Fifty-five university students were administered 14 selected items of the Raven's Advanced Progressive Matrices test. Results…
Colonia-Willner, R
1998-03-01
A study was conducted to determine which better predicts performance among bank managers: tacit practical knowledge as assessed by the Tacit Knowledge Inventory for Managers (TKIM) or 2 psychometric measures of reasoning, the Raven's Advanced Progressive Matrices (Raven's) and the Verbal Reasoning subtest of the Differential Aptitude Test (DAT). Two hundred bank managers (43 experts and 157 nonexperts), ages 24-59 years old, participated. Increased age was associated with lower performance in Raven's and the DAT but less so in the TKIM; best performing older managers on average had high levels of tacit knowledge, although they scored lower on psychometric reasoning measures; TKIM predicted managerial skill; DAT and Raven's did not. These results suggest that stabilization of some aspects of intelligence may occur in old age. Implications of the findings for the study of practical intelligence, expertise, and compensatory abilities are discussed.
Flach, Joost; van der Waal, Mark B; van den Nieuwboer, Maurits; Claassen, Eric; Larsen, Olaf F A
2017-06-13
Probiotic microorganisms are increasingly incorporated into food matrices in order to confer proposed health benefits on the consumer. It is important that the health benefits, sensory properties, shelf-life and probiotic gastrointestinal tract (GIT) survival of these products are carefully balanced as they determine functionality and drive consumer acceptance. The strain-specific effects of probiotic species are imperative in this process but carrier matrices may play a pivotal role as well. This study therefore recapitulates the wealth of knowledge on carrier matrices and their interaction with probiotic strains. The most substantiated carrier matrices, factors that influence probiotic functionality and matrix effects on shelf-life, GIT survival and clinical efficacy are reviewed. Results indicate that carrier matrices have a significant impact on the quality of probiotic products. Matrix components, such as proteins, carbohydrates and flavoring agents are shown to alter probiotic efficacy and viability. In vivo studies furthermore revealed strain-dependent matrix effects on the GIT survival of probiotic bacteria. However, only a limited number of studies have specifically addressed the effects of carrier matrices on the aforementioned product-parameters; most studies seem to focus solely on the strain-specific effects of probiotic microorganisms. This hampers the innovation of probiotic products. More human studies, comparing not only different probiotic strains but different carrier matrices as well, are needed to drive the innovation cycle.
ON THE STIFFNESS OF DEMINERALIZED DENTIN MATRICES
Ryou, Heonjune; Turco, Gianluca; Breschi, Lorenzo; Tay, Franklin R.; Pashley, David H.; Arola, Dwayne
2015-01-01
Resin bonding to dentin requires the use of self-etching primers or acid etching to decalcify the surface and expose a layer of collagen fibrils of the dentin matrix. Acid-etching reduces the stiffness of demineralized dentin from approximately 19 GPa to 1 MPa, requiring that it floats in water to prevent it from collapsing during bonding procedures. Several publications show that crosslinking agents like gluteraladehyde, carbodiimide or grape seed extract can stiffen collagen and improve resin-dentin bond strength. Objective The objective was to assess a new approach for evaluating the changes in stiffness of decalcified dentin by polar solvents and a collagen cross-linker. Methods Fully demineralized dentin beams and sections of etched coronal dentin were subjected to indentation loading using a cylindrical flat indenter in water, and after treatment with ethanol or ethyl-3-(3-dimethylaminopropyl) carbodiimide (EDC). The stiffness was measured as a function of strain and as a function of loading rate from 1 to 50 µm/sec. Results At a strain of 0.25% the elastic modulus of the fully demineralized dentin was approximately 0.20 MPa. It increased to over 0.90 MPa at strains of 1%. Exposure to ethanol caused an increase in elastic modulus of up to four times. Increasing the loading rate from 1 to 50 µm/sec caused an increase in the apparent modulus of up to three times in both water and ethanol. EDC treatment caused increases in the stiffness in fully demineralized samples and in acid-etched demineralized dentin surfaces in situ. Significance Changes in the mechanical behavior of demineralized collagen matrices can be measured effectively under hydration via indentation with cylindrical flat indenters. This approach can be used for quantifying the effects of bonding treatments on the properties of decalcified dentin after acid etching, as well as to follow the loss of stiffness over time due to enzymatic degradation. PMID:26747822
Super Fuzzy Matrices and Super Fuzzy Models for Social Scientists
Kandasamy, W B Vasantha; Amal, K
2008-01-01
This book introduces the concept of fuzzy super matrices and operations on them. This book will be highly useful to social scientists who wish to work with multi-expert models. Super fuzzy models using Fuzzy Cognitive Maps, Fuzzy Relational Maps, Bidirectional Associative Memories and Fuzzy Associative Memories are defined here. The authors introduce 13 multi-expert models using the notion of fuzzy supermatrices. These models are described with illustrative examples. This book has three chapters. In the first chaper, the basic concepts about super matrices and fuzzy super matrices are recalled. Chapter two introduces the notion of fuzzy super matrices adn their properties. The final chapter introduces many super fuzzy multi expert models.
Transfer matrices of dipoles with bending radius variation
无
2011-01-01
With the increasing demand of high brightness in light source, the uniform dipole can not meet the needs of low emittance, and thus the dipole with bending radius variation is introduced in this paper. The transfer matrix of a non-uniform dipole whose bending radius is linearly changed is chosen as an example and a very simple calculation formula of non-uniform dipole transfer matrices is given. The transfer matrices of some common profile non-uniform dipoles are also listed. The comparison of these transfer matrices and the matrices calculated with slices method verifies the numerical accuracy of this formula. This method can make the non-uniform beam dynamic problem simpler, very helpful for emittance research and lattice design with non-uniform dipoles.
Systems of Differential Equations with Skew-Symmetric, Orthogonal Matrices
Glaister, P.
2008-01-01
The solution of a system of linear, inhomogeneous differential equations is discussed. The particular class considered is where the coefficient matrix is skew-symmetric and orthogonal, and where the forcing terms are sinusoidal. More general matrices are also considered.
Hopf monoids from class functions on unitriangular matrices
Aguiar, Marcelo; Thiem, Nathaniel
2012-01-01
We build, from the collection of all groups of unitriangular matrices, Hopf monoids in Joyal's category of species. Such structure is carried by the collection of class function spaces on those groups, and also by the collection of superclass function spaces, in the sense of Diaconis and Isaacs. Superclasses of unitriangular matrices admit a simple description from which we deduce a combinatorial model for the Hopf monoid of superclass functions, in terms of the Hadamard product of the Hopf monoids of linear orders and of set partitions. This implies a recent result relating the Hopf algebra of superclass functions on unitriangular matrices to symmetric functions in noncommuting variables. We determine the algebraic structure of the Hopf monoid: it is a free monoid in species, with the canonical Hopf structure. As an application, we derive certain estimates on the number of conjugacy classes of unitriangular matrices.
矩阵逆半群%Inverse Semigroups of Matrices
朱用文
2008-01-01
We discuss some fundamental properties of inverse semigroups of matrices, and prove that the idempotents of such a semigroup constitute a subsemilattice of a finite Boolean lattice,and that the inverse semigroups of some matrices with the same rank are groups. At last, we determine completely the construction of the inverse semigroups of some 2 x 2 matrices: such a semigroup is isomorphic to a linear group of dimension 2 or a null-adjoined group, or is afinite semilattice of Abelian linear groups of finite dimension, or satisfies some other properties.The necessary and sufficient conditions are given that the sets consisting of some 2 × 2 matrices become inverse semigroups.
Large deviations of the maximal eigenvalue of random matrices
Borot, Gaëtan; Majumdar, Satya; Nadal, Céline
2011-01-01
We present detailed computations of the 'at least finite' terms (three dominant orders) of the free energy in a one-cut matrix model with a hard edge a, in beta-ensembles, with any polynomial potential. beta is a positive number, so not restricted to the standard values beta = 1 (hermitian matrices), beta = 1/2 (symmetric matrices), beta = 2 (quaternionic self-dual matrices). This model allows to study the statistic of the maximum eigenvalue of random matrices. We compute the large deviation function to the left of the expected maximum. We specialize our results to the gaussian beta-ensembles and check them numerically. Our method is based on general results and procedures already developed in the literature to solve the Pastur equations (also called "loop equations"). It allows to compute the left tail of the analog of Tracy-Widom laws for any beta, including the constant term.
Systems of Differential Equations with Skew-Symmetric, Orthogonal Matrices
Glaister, P.
2008-01-01
The solution of a system of linear, inhomogeneous differential equations is discussed. The particular class considered is where the coefficient matrix is skew-symmetric and orthogonal, and where the forcing terms are sinusoidal. More general matrices are also considered.
Racah matrices and hidden integrability in evolution of knots
Mironov, A; Morozov, An; Sleptsov, A
2016-01-01
We construct a general procedure to extract the exclusive Racah matrices S and \\bar S from the inclusive 3-strand mixing matrices by the evolution method and apply it to the first simple representations R =[1], [2], [3] and [2,2]. The matrices S and \\bar S relate respectively the maps (R\\otimes R)\\otimes \\bar R\\longrightarrow R with R\\otimes (R \\otimes \\bar R) \\longrightarrow R and (R\\otimes \\bar R) \\otimes R \\longrightarrow R with R\\otimes (\\bar R \\otimes R) \\longrightarrow R. They are building blocks for the colored HOMFLY polynomials of arbitrary arborescent (double fat) knots. Remarkably, the calculation realizes an unexpected integrability property underlying the evolution matrices.
Determinant and inverse of join matrices on two sets
Mattila, Mika
2011-01-01
Let $(P,\\preceq)$ be a lattice and $f$ a complex-valued function on $P$. We define meet and join matrices on two arbitrary subsets $X$ and $Y$ of $P$ by $(X,Y)_f=(f(x_i\\wedge y_j))$ and $[X,Y]_f=(f(x_i\\vee x_j))$ respectively. Here we present expressions for the determinant and the inverse of $[X,Y]_f$. Our main goal is to cover the case when $f$ is not semimultiplicative since the formulas presented earlier for $[X,Y]_f$ cannot be applied in this situation. In cases when $f$ is semimultiplicative we obtain several new and known formulas for the determinant and inverse of $(X,Y)_f$ and the usual meet and join matrices $(S)_f$ and $[S]_f$. We also apply these formulas to LCM, MAX, GCD and MIN matrices, which are special cases of join and meet matrices.
Automorphisms of sl(2) and dynamical r-matrices
Tsiganov, A V
1996-01-01
Two outer automorphisms of infinite-dimensional representations of $sl(2)$ algebra are considered. The similar constructions for the loop algebras and yangians are presented. The corresponding linear and quadratic $R$-brackets include the dynamical $r$-matrices.